default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd CRYPTO 2022, Santa Barbara, CA, USA - Part II
- Yevgeniy Dodis, Thomas Shrimpton:
Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part III. Lecture Notes in Computer Science 13509, Springer 2022, ISBN 978-3-031-15981-7
Signatures
- Rutchathon Chairattana-Apirom, Lucjan Hanzlik, Julian Loss, Anna Lysyanskaya, Benedikt Wagner:
PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More. 3-31
Idealized Models
- Mark Zhandry:
Augmented Random Oracles. 35-65 - Mark Zhandry:
To Label, or Not To Label (in Generic Groups). 66-96 - Iftach Haitner
, Daniel Nukrai, Eylon Yogev:
Lower Bound on SNARGs in the Random Oracle Model. 97-127
Lower Bounds
- Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski:
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. 131-160 - Ashrujit Ghoshal, Ilan Komargodski:
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. 161-191 - Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. 192-221 - Jeremiah Blocki, Blake Holman:
Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions. 222-251 - Shahar P. Cohen, Moni Naor:
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. 252-281
Cryptanalysis II
- Maria Corte-Real Santos, Craig Costello, Jia Shi:
Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection. 285-314 - Yusuke Naito, Yu Sasaki, Takeshi Sugawara:
Secret Can Be Public: Low-Memory AEAD Mode for High-Order Masking. 315-345 - Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen:
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. 346-375 - John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow. 376-405
Distributed Algorithms
- Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu:
log *-Round Game-Theoretically-Fair Leader Election. 409-438 - Georgios Tsimos, Julian Loss, Charalampos Papamanthou:
Gossiping for Communication-Efficient Broadcast. 439-469
Secure Hash Functions
- Justin Holmgren, Minghao Liu, LaKyah Tyner, Daniel Wichs:
Nearly Optimal Property Preserving Hashing. 473-502 - Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision-Resistance from Multi-Collision-Resistance. 503-529
Post-quantum Cryptography
- Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa:
Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. 533-563 - Shujiao Cao, Rui Xue:
The Gap Is Sensitive to Size of Preimages: Collapsing Property Doesn't Go Beyond Quantum Collision-Resistance for Preimages Bounded Hash Functions. 564-595 - Mark Zhandry:
New Constructions of Collapsing Hashes. 596-624 - Nir Bitansky, Sapir Freizeit:
Statistically Sender-Private OT from LPN and Derandomization. 625-653 - Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. 654-683
Symmetric Cryptanalysis
- Tim Beyne, Vincent Rijmen:
Differential Cryptanalysis in the Fixed-Key Model. 687-716 - André Schrottenloher, Marc Stevens:
Simplified MITM Modeling for Permutations: New (Quantum) Attacks. 717-747 - Christof Beierle, Tim Beyne, Patrick Felke, Gregor Leander:
Constructing and Deconstructing Intentional Weaknesses in Symmetric Ciphers. 748-778 - Federico Canale, Gregor Leander, Lukas Stennes:
Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications. 779-808
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 2024-11-20 21:05 CET 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:
