default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd EUROCRYPT 2023: Lyon, France - Part I
- 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 I. Lecture Notes in Computer Science 14004, Springer 2023, ISBN 978-3-031-30544-3
Invited Talk
- Guy N. Rothblum:
Indistinguishable Predictions and Multi-group Fair Learning. 3-21
Theoretical Foundations
- Akin Ünal:
Worst-Case Subexponential Attacks on PRGs of Constant Degree or Constant Locality. 25-54 - Abtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe Sadeghi:
Fine-Grained Non-interactive Key-Exchange: Constructions and Lower Bounds. 55-85 - Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited. 86-116 - Qipeng Liu:
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model. 117-143 - Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody:
Black-Box Separations for Non-interactive Classical Commitments in a Quantum World. 144-172 - Rachit Garg, Dakshita Khurana, George Lu, Brent Waters:
On Non-uniform Security for Black-Box Non-interactive CCA Commitments. 173-204 - Aayush Jain, Huijia Lin, Paul Lou, Amit Sahai:
Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-quantum i풪. 205-235
Oblivious Transfer and Data Access
- Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar:
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. 239-270 - Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Oblivious Transfer with Constant Computational Overhead. 271-302 - Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, Kui Ren:
Endemic Oblivious Transfer via Random Oracles, Revisited. 303-329 - Xiaojie Guo, Kang Yang, Xiao Wang, Wenhao Zhang, Xiang Xie, Jiang Zhang, Zheli Liu:
Half-Tree: Halving the Cost of Tree Expansion in COT and DPF. 330-362 - Amit Agarwal, James Bartusek, Dakshita Khurana, Nishant Kumar:
A New Framework for Quantum Oblivious Transfer. 363-394 - Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. 395-425 - Léonard Assouline, Brice Minaud:
Weighted Oblivious RAM, with Applications to Searchable Symmetric Encryption. 426-455 - Andrew Park, Wei-Kai Lin, Elaine Shi:
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. 456-486 - Giuseppe Persiano, Kevin Yeo:
Lower Bound Framework for Differentially Private and Oblivious Data Structures. 487-517 - Kevin Yeo:
Lower Bounds for (Batch) PIR with Private Preprocessing. 518-550 - Nils Fleischhacker, Kasper Green Larsen, Mark Simkin:
How to Compress Encrypted Data. 551-577
Quantum Cryptography
- Shweta Agrawal, Fuyuki Kitagawa, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa:
Public Key Encryption with Secure Key Leasing. 581-610 - Jiahui Liu, Hart Montgomery, Mark Zhandry:
Another Round of Breaking and Making Quantum Money: - How to Not Build It from Lattices, and More. 611-638 - Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. 639-667
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-01-18 00:48 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:
