


default search action
43rd CRYPTO 2023, Santa Barbara, CA, USA - Part II
- Helena Handschuh, Anna Lysyanskaya:

Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part II. Lecture Notes in Computer Science 14082, Springer 2023, ISBN 978-3-031-38544-5
Succinctness
- Marta Bellés-Muñoz, Jorge Jiménez Urroz, Javier Silva:

Revisiting Cycles of Pairing-Friendly Elliptic Curves. 3-37 - Jeffrey Champion, David J. Wu:

Non-interactive Zero-Knowledge from Non-interactive Batch Arguments. 38-71 - Valerio Cini

, Russell W. F. Lai
, Giulio Malavolta
:
Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract). 72-105 - Ben Fisch, Zeyu Liu, Psi Vesely:

Orbweaver: Succinct Linear Functional Commitments from Lattices. 106-131 - Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon:

Non-interactive Universal Arguments. 132-158 - Yuval Ishai, Rafail Ostrovsky, Akash Shah:

Succinct Arguments for RAM Programs via Projection Codes. 159-192 - Alexander Golovnev, Jonathan Lee, Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:

Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS. 193-226 - Jonathan Bootle

, Alessandro Chiesa, Katerina Sotiraki:
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. 227-251 - Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:

SNARGs for Monotone Policy Batch NP. 252-283 - Arthur Lazzaretti, Charalampos Papamanthou:

TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDH. 284-314 - Quang Dao

, Yuval Ishai, Aayush Jain, Huijia Lin:
Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN. 315-348
Anonymous Credentials
- Corentin Jeudy

, Adeline Roux-Langlois, Olivier Sanders:
Lattice Signature with Efficient Protocols, Application to Anonymous Credentials. 351-383 - Jonathan Bootle

, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti:
A Framework for Practical Anonymous Credentials from Lattices. 384-417 - Melissa Chase, F. Betül Durak, Serge Vaudenay:

Anonymous Tokens with Stronger Metadata Bit Hiding from Algebraic MACs. 418-449
New Paradigms and Foundations
- Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:

Revisiting Time-Space Tradeoffs for Function Inversion. 453-481 - Ashrujit Ghoshal

, Stefano Tessaro
:
The Query-Complexity of Preprocessing Attacks. 482-513 - Yevgeniy Dodis, Niels Ferguson, Eli Goldin

, Peter Hall, Krzysztof Pietrzak:
Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance. 514-546 - Stefan Dziembowski

, Sebastian Faust
, Tomasz Lizurej
:
Individual Cryptography. 547-579 - Divesh Aggarwal

, Eldon Chung
, Maciej Obremski
:
Extractors: Low Entropy Requirements Colliding with Non-malleability. 580-610 - Hanshen Xiao, Srinivas Devadas:

PAC Privacy: Automatic Privacy Measurement and Control of Data Processing. 611-644 - Yanyi Liu, Rafael Pass:

One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. 645-673 - Brent Waters, Daniel Wichs:

Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM. 674-693 - Yu Long Chen, Wonseok Choi, Changmin Lee:

Improved Multi-user Security Using the Squared-Ratio Method. 694-724 - Dennis Hofheinz, Julia Kastner

, Karen Klein
:
The Power of Undirected Rewindings for Adaptive Security. 725-758 - Miroslaw Kutylowski, Giuseppe Persiano

, Duong Hieu Phan
, Moti Yung, Marcin Zawada
:
Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication! 759-790

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














