default search action
39th CRYPTO 2019: Santa Barbara, CA, USA - Part I
- Alexandra Boldyreva, Daniele Micciancio:
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I. Lecture Notes in Computer Science 11692, Springer 2019, ISBN 978-3-030-26947-0
Award Papers
- Akiko Inoue, Tetsu Iwata, Kazuhiko Minematsu, Bertram Poettering:
Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality. 3-31 - Samuel Jaques, John M. Schanck:
Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE. 32-61 - Rotem Tsabary:
Fully Secure Attribute-Based Encryption for t-CNF from LWE. 62-85
Lattice-Based ZK
- Chris Peikert, Sina Shiehian:
Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors. 89-114 - Muhammed F. Esgin, Ron Steinfeld, Joseph K. Liu, Dongxi Liu:
Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications. 115-146 - Rupeng Yang, Man Ho Au, Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, William Whyte:
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications. 147-175 - Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler:
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. 176-202
Symmetric Cryptography
- Sandro Coretti, Yevgeniy Dodis, Harish Karthikeyan, Stefano Tessaro:
Seedless Fruit Is the Sweetest: Random Number Generation, Revisited. 205-234 - Mihir Bellare, Ruth Ng, Björn Tackmann:
Nonces Are Noticed: AEAD Revisited. 235-265 - Yu Long Chen, Eran Lambooij, Bart Mennink:
How to Build Pseudorandom Functions from Public Random Permutations. 266-293
Mathematical Cryptanalysis
- Jun Xu, Santanu Sarkar, Lei Hu, Huaxiong Wang, Yanbin Pan:
New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator. 297-321 - Léo Ducas, Maxime Plançon, Benjamin Wesolowski:
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm. 322-351
Proofs of Storage
- Ivan Damgård, Chaya Ganesh, Claudio Orlandi:
Proofs of Replicated Storage Without Timing Assumptions. 355-380 - Tal Moran, Ilan Orlov:
Simple Proofs of Space-Time and Rational Proofs of Storage. 381-409
Non-Malleable Codes
- Marshall Ball, Siyao Guo, Daniel Wichs:
Non-malleable Codes for Decision Trees. 413-434 - Divya Gupta, Hemanta K. Maji, Mingyuan Wang:
Explicit Rate-1 Non-malleable Codes for Local Tampering. 435-466 - Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee:
Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space. 467-495
SNARKs and Blockchains
- Yue Guo, Rafael Pass, Elaine Shi:
Synchronous, with a Chance of Partition Tolerance. 499-529 - Russell W. F. Lai, Giulio Malavolta:
Subvector Commitments with Application to Succinct Arguments. 530-560 - Dan Boneh, Benedikt Bünz, Ben Fisch:
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains. 561-586
Homomorphic Cryptography
- Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs:
On the Plausibility of Fully Homomorphic Encryption for RAMs. 589-619 - Giulio Malavolta, Sri Aravinda Krishnan Thyagarajan:
Homomorphic Time-Lock Puzzles and Applications. 620-649 - Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Symmetric Primitives with Structured Secrets. 650-679
Leakage Models and Key Reuse
- Thomas Prest, Dahmun Goudarzi, Ange Martinelli, Alain Passelègue:
Unifying Leakage Models on a Rényi Day. 683-712 - Olivier Bronchain, Julien M. Hendrickx, Clément Massart, Alex Olshevsky, François-Xavier Standaert:
Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations. 713-737 - Christopher Patton, Thomas Shrimpton:
Security in the Presence of Key Reuse: Context-Separable Interfaces and Their Applications. 738-768
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.