default search action
43rd CRYPTO 2023, Santa Barbara, CA, USA - Part V
- 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 V. Lecture Notes in Computer Science 14085, Springer 2023, ISBN 978-3-031-38553-7
Quantum Cryptography
- Mark Zhandry
:
Tracing Quantum State Distinguishers via Backtracking. 3-36 - Zvika Brakerski:
Black-Hole Radiation Decoding Is Quantum Cryptography. 37-65 - Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. 66-98 - James Bartusek
Publicly-Verifiable Deletion via Target-Collapsing Functions. 99-128 - Vipul Goyal, Xiao Liang
On Concurrent Multi-party Quantum Computation. 129-161 - Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick:
Simple Tests of Quantumness Also Certify Qubits. 162-191 - James Bartusek
Cryptography with Certified Deletion. 192-223 - James Bartusek
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). 224-257 - André Schrottenloher
Quantum Linear Key-Recovery Attacks Using the QFT. 258-291 - Jiangxia Ge
Tighter QCCA-Secure Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model. 292-324
Post-quantum Cryptography
- Julien Devevey, Pouria Fallahpour, Alain Passelègue, Damien Stehlé:
A Detailed Analysis of Fiat-Shamir with Aborts. 327-357 - Manuel Barbosa
Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium. 358-389 - Yang Yu
Compact Lattice Gadget and Its Applications to Hash-and-Sign Signatures. 390-420 - Manuel Barbosa
Machine-Checked Security for rmXMSS as in RFC 8391 and $\mathrm {SPHINCS^{+}} $. 421-454 - Kaiyi Zhang
Revisiting the Constant-Sum Winternitz One-Time Signature with Applications to SPHINCS+ and XMSS. 455-483 - Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj:
Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs. 484-517 - Ward Beullens, Gregor Seiler:
LaBRADOR: Compact Proofs for R1CS from Module-SIS. 518-548 - Duhyeong Kim
Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWE. 549-580 - Carsten Baum
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. 581-615 - Jiaxin Pan
Lattice-Based Authenticated Key Exchange with Tight Security. 616-647 - Daniele Micciancio
Error Correction and Ciphertext Quantization in Lattice Cryptography. 648-681 - Shuai Han
Almost Tight Multi-user Security Under Adaptive Corruptions from LWE in the Standard Model. 682-715 - Yanbo Chen
sfDualMS: Efficient Lattice-Based Two-Round Multi-signature with Trapdoor-Free Simulation. 716-747 - Dana Dachman-Soled
Revisiting Security Estimation for LWE with Hints from a Geometric Perspective. 748-781 - Russell W. F. Lai
Lattice-Based Timed Cryptography. 782-804 - Parker Newton, Silas Richelson:
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. 805-835 - Gabrielle De Micheli, Daniele Micciancio
Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL. 836-865
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-07-21 01:05 CEST 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: