Below is the full list of accepted papers for CT-RSA 2021 (in submission order).
1. FAN: A Lightweight Authenticated Cryptographic Algorithm
Lin Jiao; Dengguo Feng; Yonglin Hao; Xinxin Gong; Shaoyu Du
State Key Laboratory of Cryptology, Beijing
2. Mesh Messaging in Large-scale Protests: Breaking Bridgefy
Martin R. Albrecht; Jorge Blasco; Rikke Bjerg Jensen; Lenka Mareková
Royal Holloway, University of London
3. Cryptanalysis of a Dynamic Universal Accumulator over Bilinear Groups
Alex Biryukov; Aleksei Udovenko; Giuseppe Vitto
DCS and SnT, University of Luxembourg; CryptoExperts, Paris; SnT, University of Luxembourg
4. Secure Fast Evaluation of Iterative Methods: With an Application to Secure PageRank
Daniele Cozzo; Nigel P. Smart; Younes Talibi Alaoui
KU Leuven
5. Noisy Simon Period Finding
Lars Schlieper; Alexander May; Jonathan Schwinger
Ruhr University Bochum
6. A Framework to Optimize Implementations of Matrices
Da Lin; Zejun Xiang; Xiangyong Zeng; Shasha Zhang
Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University
7. Related-Key Analysis of Generalized Feistel Networks with Expanding Round Functions
Yuqing Zhao; Wenqi Yu; Chun Guo
School of Cyber Science and Technology, Shandong University, Qingdao, Shandong, China
8. EPID with Malicious Revocation
Olivier Sanders; Jacques Traoré,
Orange Labs
9. Compilation of Function Representations for Secure Computing Paradigms
Karim Baghery; Cyprien Delpech de Saint Guilhem; Emmanuela Orsini; Nigel Smart; Titouan Tanguy
KU Leuven
10. Inverse-Sybil Attacks in Automated Contact Tracing
Benedikt Auerbach; Suvradip Chakraborty; Karen Klein; Guillermo Pascual-Perez; Krzysztof Pietrzak; Michael Walter; Michelle Yeo
IST Austria
11. On the Hardness of Module-LWE with Binary Secret
Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen
Univ Rennes, CNRS, IRISA
12. Improvements to RSA key generation and CRT on embedded devices
Mike Hamburg; Mike Tunstall; Qinglai Xiao
Rambus Inc
13. The Key-Dependent Message Security of Key-Alternating Feistel Ciphers
Pooya Farshim; Louiza Khati; Yannick Seurin; Damien Vergnaud
University of York; ANSSI; ANSSI; Sorbonne Université
14. SoK: How (not) to Design and Implement Post-Quantum Cryptography
James Howe; Thomas Prest; Daniel Apon
PQShield; PQShield; NIST
15. A Bunch of Broken Schemes: A Simple yet Powerful Linear Approach to Analyzing Security of Attribute-Based Encryption
Marloes Venema; Greg Alpár,
Radboud University; Open University of the Netherlands and Radboud University
16. Multi-Party Revocation in Sovrin: Performance through Distributed Trust
Lukas Helminger; Daniel Kales; Sebastian Ramacher; Roman Walch
Graz University of Technology and Know-Center GmbH; Graz University of Technology; AIT Austrian Institute of Technology; Graz University of Technology and Know-Center GmbH
17. On The Cost of ASIC Hardware Crackers: A SHA-1 Case Study
Anupam Chattopadhyay; Mustafa Khairallah; Gaetan Leurent; Zakaria Najm; Thomas Peyrin; Vesselin Velichkov",
Nanyang Technological University; Nanyang Technological University; Inria, Paris; Nanyang Technological University; Nanyang Technological University; The University of Edinburgh
18. On the Effectiveness of Time Travel to Inject COVID-19 Alerts
Vincenzo Iovino; Serge Vaudenay; Martin Vuagnoux
University of Salerno; EPFL; base23
19. SoK: Game-based Security Models for Group Key Exchange
Bertram Poettering; Paul Rösler; Jürg Schwenk; Douglas Stebila
IBM Research Zurich; TU Darmstadt; Ruhr University Bochum; University of Waterloo
20. Zero-Correlation Linear Cryptanalysis with Equal Treatment for Plaintexts and Tweakeys
Chao Niu; Muzhou Li; Siwei Sun; Meiqin Wang
School of Cyber Science and Technology, Shandong University, Qingdao, China; Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Qingdao, China; School of Cyber Science and Technology, Shandong University, Qingdao, China; Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Qingdao, China; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, China;University of Chinese Academy of Sciences, China; School of Cyber Science and Technology, Shandong University, Qingdao, China; Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Qingdao, China
21. Dual lattice attacks for closest vector problems (with preprocessing)
Thijs Laarhoven; Michael Walter
Eindhoven University of Technology; Institute of Science and Technology Austria
22. Balancing Privacy and Accountability in Blockchain Identity Management
Ivan Damgård; Chaya Ganesh; Hamidreza Khoshakhlagh; Claudio Orlandi; Luisa Siniscalchi
Aarhus University; Indian Institute of Science, Bangalore; Aarhus University; Aarhus University; Aarhus University
23. Oblivious TLS via Multi-Party Computation
Damiano Abram; Ivan Damgård; Peter Scholl; Sven Trieflinger
Aarhus University; Aarhus University; Aarhus University; Robert Bosch GmbH
24. Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
Konstantinos Chalkias; Francois Garillot; Yashvanth Kondi; Valeria Nikolaenko
Novi and Facebook; Novi and Facebook; Northeastern University; Novi and Faceboook
25. More Efficient Shuffle Argument from Unique Factorization
Toomas Krips; Helger Lipmaa
University of Tartu; Simula UiB
26. Signed Diffie-Hellman Key Exchange with Tight Security
Jiaxin Pan; Chen Qian; Magnus Ringerud
Norwegian University of Science and Technology
27. Lattice-Based Proof of Shuffle and Applications to Electronic Voting
Diego F. Aranha; Carsten Baum; Kristian Gjösteen; Tjerand Silde; Thor Tunge
Aarhus University; Aarhus University; Norwegian University of Science and Technology; Norwegian University of Science and Technology; Norwegian University of Science and Technology