default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd EUROCRYPT 2023: Lyon, France - Part V
- Carmit Hazay
, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part V. Lecture Notes in Computer Science 14008, Springer 2023, ISBN 978-3-031-30588-7
Cryptographic Protocols
- Paul Rösler, Daniel Slamanig, Christoph Striecks:
Unique-Path Identity Based Encryption with Applications to Strongly Secure Messaging. 3-34 - James Bartusek, Sanjam Garg, Abhishek Jain, Guru-Vamsi Policharla:
End-to-End Secure Messaging with Traceability Only for Illegal Content. 35-66 - Junzuo Lai, Gongxian Zeng, Zhengan Huang, Siu Ming Yiu, Xin Mu, Jian Weng:
Asymmetric Group Message Franking: Definitions and Constructions. 67-97 - Julia Hesse, Stanislaw Jarecki, Hugo Krawczyk, Christopher Wood:
Password-Authenticated TLS via OPAQUE and Post-Handshake Authentication. 98-127 - Bruno Freitas Dos Santos, Yanqi Gu, Stanislaw Jarecki:
Randomized Half-Ideal Cipher on Groups with Applications to UC (a)PAKE. 128-156 - Yevgeniy Dodis, Daniel Jost, Balachandar Kesavan, Antonio Marcedone:
End-to-End Encrypted Zoom Meetings: Proving Security and Strengthening Liveness. 157-189 - Martin R. Albrecht, Miro Haller, Lenka Mareková, Kenneth G. Paterson:
Caveat Implementor! Key Recovery Attacks on MEGA. 190-218
Public-Key Cryptanalysis
- Xavier Bonnetain, André Chailloux, André Schrottenloher, Yixin Shen:
Finding Many Collisions via Reusable Quantum Walks - Application to Lattice Sieving. 221-251 - Huck Bennett, Atul Ganju, Pura Peetathawatchai, Noah Stephens-Davidowitz:
Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice. 252-281 - Tako Boris Fouotsa, Tomoki Moriya, Christophe Petit:
M-SIDH and MD-SIDH: Countering SIDH Attacks by Masking Information. 282-309 - Gustavo Banegas, Juliane Krämer, Tanja Lange, Michael Meyer, Lorenz Panny, Krijn Reijnders, Jana Sotáková, Monika Trimoska:
Disorientation Faults in CSIDH. 310-342 - Dipayan Das, Antoine Joux:
On the Hardness of the Finite Field Isomorphism Problem. 343-359 - Andre Esser, Floyd Zweydinger:
New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice. 360-390 - Pierre Briaud, Morten Øygarden:
A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions. 391-422 - Wouter Castryck, Thomas Decru:
An Efficient Key Recovery Attack on SIDH. 423-447 - Luciano Maino, Chloe Martindale, Lorenz Panny, Giacomo Pope, Benjamin Wesolowski:
A Direct Key Recovery Attack on SIDH. 448-471 - Damien Robert:
Breaking SIDH in Polynomial Time. 472-503
Signature Schemes
- Dan Boneh, Jiaxin Guan, Mark Zhandry:
A Lower Bound on the Length of Signatures Based on Group Actions and Generic Isogenies. 507-531 - Eliana Carozza, Geoffroy Couteau, Antoine Joux:
Short Signatures from Regular Syndrome Decoding in the Head. 532-563 - Carlos Aguilar Melchor, Nicolas Gama, James Howe, Andreas Hülsing, David Joseph, Dongze Yue:
The Return of the SDitH. 564-596 - Jiaxin Pan, Benedikt Wagner:
Chopsticks: Fork-Free Two-Round Multi-signatures from Non-interactive Assumptions. 597-627 - Stefano Tessaro, Chenzhi Zhu:
Threshold and Multi-signature Schemes from Linear Hash Functions. 628-658 - Luca De Feo, Antonin Leroux, Patrick Longa, Benjamin Wesolowski:
New Algorithms for the Deuring Correspondence - Towards Practical and Secure SQISign Signatures. 659-690 - Stefano Tessaro, Chenzhi Zhu:
Revisiting BBS Signatures. 691-721 - Lucjan Hanzlik:
Non-interactive Blind Signatures for Random Messages. 722-752 - Lucjan Hanzlik, Julian Loss, Benedikt Wagner:
Rai-Choo! Evolving Blind Signatures to the Next Level. 753-783
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.
last updated on 2025-04-25 17:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
