default search action
CT-RSA 2021: Virtual Event
- Kenneth G. Paterson:
Topics in Cryptology - CT-RSA 2021 - Cryptographers' Track at the RSA Conference 2021, Virtual Event, May 17-20, 2021, Proceedings. Lecture Notes in Computer Science 12704, Springer 2021, ISBN 978-3-030-75538-6 - Daniele Cozzo, Nigel P. Smart, Younes Talibi Alaoui:
Secure Fast Evaluation of Iterative Methods: With an Application to Secure PageRank. 1-25 - Karim Baghery, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy:
Compilation of Function Representations for Secure Computing Paradigms. 26-50 - Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger:
Oblivious TLS via Multi-party Computation. 51-74 - Alexander May, Lars Schlieper, Jonathan Schwinger:
Noisy Simon Period Finding. 75-99 - Marloes Venema, Greg Alpár:
A Bunch of Broken Schemes: A Simple yet Powerful Linear Approach to Analyzing Security of Attribute-Based Encryption. 100-125 - Chao Niu, Muzhou Li, Siwei Sun, Meiqin Wang:
Zero-Correlation Linear Cryptanalysis with Equal Treatment for Plaintexts and Tweakeys. 126-147 - Bertram Poettering, Paul Rösler, Jörg Schwenk, Douglas Stebila:
SoK: Game-Based Security Models for Group Key Exchange. 148-176 - Olivier Sanders, Jacques Traoré:
EPID with Malicious Revocation. 177-200 - Jiaxin Pan, Chen Qian, Magnus Ringerud:
Signed Diffie-Hellman Key Exchange with Tight Security. 201-226 - Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge:
Lattice-Based Proof of Shuffle and Applications to Electronic Voting. 227-251 - Toomas Krips, Helger Lipmaa:
More Efficient Shuffle Argument from Unique Factorization. 252-275 - Alex Biryukov, Aleksei Udovenko, Giuseppe Vitto:
Cryptanalysis of a Dynamic Universal Accumulator over Bilinear Groups. 276-298 - Lin Jiao, Dengguo Feng, Yonglin Hao, Xinxin Gong, Shaoyu Du:
FAN: A Lightweight Authenticated Cryptographic Algorithm. 299-325 - Yuqing Zhao, Wenqi Yu, Chun Guo:
Related-Key Analysis of Generalized Feistel Networks with Expanding Round Functions. 326-350 - Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud:
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. 351-374 - Martin R. Albrecht, Jorge Blasco, Rikke Bjerg Jensen, Lenka Mareková:
Mesh Messaging in Large-Scale Protests: Breaking Bridgefy. 375-398 - Benedikt Auerbach, Suvradip Chakraborty, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter, Michelle Yeo:
Inverse-Sybil Attacks in Automated Contact Tracing. 399-421 - Vincenzo Iovino, Serge Vaudenay, Martin Vuagnoux:
On the Effectiveness of Time Travel to Inject COVID-19 Alerts. 422-443 - James Howe, Thomas Prest, Daniel Apon:
SoK: How (not) to Design and Implement Post-quantum Cryptography. 444-477 - Thijs Laarhoven, Michael Walter:
Dual Lattice Attacks for Closest Vector Problems (with Preprocessing). 478-502 - Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module-LWE with Binary Secret. 503-526 - Lukas Helminger, Daniel Kales, Sebastian Ramacher, Roman Walch:
Multi-party Revocation in Sovrin: Performance through Distributed Trust. 527-551 - Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi:
Balancing Privacy and Accountability in Blockchain Identity Management. 552-576 - Konstantinos Chalkias, François Garillot, Yashvanth Kondi, Valeria Nikolaenko:
Non-interactive Half-Aggregation of EdDSA and Variants of Schnorr Signatures. 577-608 - Da Lin, Zejun Xiang, Xiangyong Zeng, Shasha Zhang:
A Framework to Optimize Implementations of Matrices. 609-632 - Mike Hamburg, Mike Tunstall, Qinglai Xiao:
Improvements to RSA Key Generation and CRT on Embedded Devices. 633-656 - Anupam Chattopadhyay, Mustafa Khairallah, Gaëtan Leurent, Zakaria Najm, Thomas Peyrin, Vesselin Velichkov:
On the Cost of ASIC Hardware Crackers: A SHA-1 Case Study. 657-681
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.