


default search action
39th CRYPTO 2019: Santa Barbara, CA, USA - Part II
- Alexandra Boldyreva, Daniele Micciancio:

Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II. Lecture Notes in Computer Science 11693, Springer 2019, ISBN 978-3-030-26950-0
MPC Communication Complexity
- Satrajit Ghosh, Mark Simkin

:
The Communication Complexity of Threshold Private Set Intersection. 3-29 - Ran Cohen

, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. 30-60 - Ivan Damgård, Kasper Green Larsen

, Jesper Buus Nielsen:
Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. 61-84 - Vipul Goyal, Yanyi Liu, Yifan Song:

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. 85-114
Symmetric Cryptanalysis
- Fukang Liu, Christoph Dobraunig

, Florian Mendel
, Takanori Isobe, Gaoli Wang, Zhenfu Cao
:
Efficient Collision Attack Frameworks for RIPEMD-160. 117-149 - Aron Gohr:

Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning. 150-179 - Danping Shi, Siwei Sun, Yu Sasaki, Chaoyun Li

, Lei Hu:
Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full \mathsf MORUS. 180-209 - Gaëtan Leurent, Ferdinand Sibleyras:

Low-Memory Attacks Against Two-Round Even-Mansour Using the 3-XOR Problem. 210-235
(Post) Quantum Cryptography
- Mark Zhandry

:
How to Record Quantum Queries, and Applications to Quantum Indifferentiability. 239-268 - Andris Ambainis, Mike Hamburg, Dominique Unruh:

Quantum Security Proofs Using Semi-classical Oracles. 269-295 - Jan Czajkowski

, Andreas Hülsing
, Christian Schaffner
:
Quantum Indistinguishability of Random Sponges. 296-325 - Qipeng Liu, Mark Zhandry

:
Revisiting Post-quantum Fiat-Shamir. 326-355 - Jelle Don, Serge Fehr, Christian Majenz

, Christian Schaffner
:
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model. 356-383
Leakage Resilience
- Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:

Unconditionally Secure Computation Against Low-Complexity Leakage. 387-416 - Shuai Han, Shengli Liu, Lin Lyu

, Dawu Gu:
Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System. 417-447 - Antonio Faonio

, Daniele Venturi:
Non-malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate. 448-479 - Akshayaram Srinivasan, Prashant Nalini Vasudevan:

Leakage Resilient Secret Sharing and Applications. 480-509 - Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro

, Mark Simkin
:
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. 510-539
Memory Hard Functions and Privacy Amplification
- Binyi Chen, Stefano Tessaro:

Memory-Hard Functions from Cryptographic Primitives. 543-572 - Jeremiah Blocki

, Benjamin Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, Samson Zhou:
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. 573-607 - Vipul Goyal, Aayush Jain, Amit Sahai:

Simultaneous Amplification: The Case of Non-interactive Zero-Knowledge. 608-637 - Borja Balle, James Bell, Adrià Gascón, Kobbi Nissim

:
The Privacy Blanket of the Shuffle Model. 638-667
Attribute Based Encryption
- Venkata Koppula, Brent Waters:

Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption. 671-700 - Giuseppe Ateniese, Danilo Francati

, David Nuñez, Daniele Venturi:
Match Me if You Can: Matchmaking Encryption and Its Applications. 701-731 - Junqing Gong, Brent Waters, Hoeteck Wee:

ABE for DFA from k-Lin. 732-764 - Shweta Agrawal, Monosij Maitra, Shota Yamada:

Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE. 765-797
Foundations
- James Bartusek

, Fermi Ma, Mark Zhandry
:
The Distinction Between Fixed and Random Generators in Group-Based Assumptions. 801-830 - Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel

, Salil P. Vadhan:
Unifying Computational Entropies via Kullback-Leibler Divergence. 831-858

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














