Abstract is missing.
- Secure Computation Based on Leaky Correlations: High Resilience SettingAlexander R. Block, Hemanta K. Maji, Hai H. Nguyen. 3-32 [doi]
- Laconic Oblivious Transfer and Its ApplicationsChongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta 0001, Peihan Miao, Antigoni Polychroniadou. 33-65 [doi]
- Black-Box Parallel Garbled RAMSteve Lu, Rafail Ostrovsky. 66-92 [doi]
- Non-Malleable Codes for Space-Bounded TamperingSebastian Faust, Kristina Hostáková, Pratyay Mukherjee, Daniele Venturi 0001. 95-126 [doi]
- Four-Round Concurrent Non-Malleable Commitments from One-Way FunctionsMichele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti. 127-157 [doi]
- Distinguisher-Dependent Simulation in Two Rounds and its ApplicationsAbhishek Jain 0002, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum. 158-189 [doi]
- Incremental Program ObfuscationSanjam Garg, Omkant Pandey. 193-223 [doi]
- From Obfuscation to the Security of Fiat-Shamir for ProofsYael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum. 224-251 [doi]
- Indistinguishability Obfuscation for Turing Machines: Constant Overhead and AmortizationPrabhanjan Ananth, Abhishek Jain 0002, Amit Sahai. 252-279 [doi]
- Quantum Security of NMAC and Related Constructions - PRF Domain Extension Against Quantum attacksFang Song 0001, Aaram Yun. 283-309 [doi]
- Quantum Non-malleability and AuthenticationGorjan Alagic, Christian Majenz. 310-341 [doi]
- New Security Notions and Feasibility Results for Authentication of Quantum DataSumegha Garg, Henry Yuen, Mark Zhandry. 342-371 [doi]
- Time-Memory Tradeoff Attacks on the MTP Proof-of-Work SchemeItai Dinur, Niv Nadler. 375-403 [doi]
- Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash CombinersZhenzhen Bao, Lei Wang 0031, Jian Guo 0001, Dawu Gu. 404-427 [doi]
- Non-full Sbox Linearization: Applications to Collision Attacks on Round-Reduced KeccakLing Song, Guohong Liao, Jian Guo 0001. 428-451 [doi]
- Gaussian Sampling over the Integers: Efficient, Generic, Constant-TimeDaniele Micciancio, Michael Walter 0001. 455-485 [doi]
- LPN DecodedAndre Esser, Robert Kübler, Alexander May. 486-514 [doi]
- Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a CounterexampleFuchun Guo, Rongmao Chen, Willy Susilo, Jianchang Lai, Guomin Yang, Yi Mu. 517-547 [doi]
- Compact Structure-Preserving Signatures with Almost Tight SecurityMasayuki Abe, Dennis Hofheinz, Ryo Nishimaki, Miyako Ohkubo, Jiaxin Pan. 548-580 [doi]
- Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKsJens Groth, Mary Maller. 581-612 [doi]
- Fast Secure Two-Party ECDSA SigningYehuda Lindell. 613-644 [doi]
- Proving Resistance Against Invariant Attacks: How to Choose the Round ConstantsChristof Beierle, Anne Canteaut, Gregor Leander, Yann Rotella. 647-678 [doi]
- Breaking the FF3 Format-Preserving Encryption Standard over Small DomainsF. Betül Durak, Serge Vaudenay. 679-707 [doi]
- Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher SecurityBart Mennink. 708-732 [doi]