Abstract is missing.
- On Basing Size-Verifiable One-Way Functions on NP-HardnessAndrej Bogdanov, Christina Brzuska. 1-6 [doi]
- The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way FunctionsYu Yu, Dawu Gu, Xiangxue Li, Jian Weng. 7-35 [doi]
- The Power of Negations in CryptographySiyao Guo, Tal Malkin, Igor Carboni Oliveira, Alon Rosen. 36-65 [doi]
- From Weak to Strong Zero-Knowledge and ApplicationsKai-Min Chung, Edward Lui, Rafael Pass. 66-92 [doi]
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random OracleYehuda Lindell. 93-109 [doi]
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key DerivationChun Guo, Dongdai Lin. 110-133 [doi]
- A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty ComputationJuan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung. 134-158 [doi]
- Topology-Hiding ComputationTal Moran, Ilan Orlov, Silas Richelson. 159-181 [doi]
- Secure Physical Computation Using Disposable CircuitsBen A. Fisch, Daniel Freund, Moni Naor. 182-198 [doi]
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean FunctionsGilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri. 199-228 [doi]
- Richer Efficiency/Security Trade-offs in 2PCVladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek. 229-259 [doi]
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction LemmaVipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass, Amit Sahai. 260-289 [doi]
- An Alternative Approach to Non-black-box Simulation in Fully Concurrent SettingSusumu Kiyoshima. 290-318 [doi]
- General Statistically Secure Computation with Bounded-Resettable Hardware TokensNico Döttling, Daniel Kraschewski, Jörn Müller-Quade, Tobias Nilges. 319-344 [doi]
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box WayRafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam. 345-374 [doi]
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and PermutationsShashank Agrawal, Divya Gupta 0001, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran. 375-397 [doi]
- Leakage-Resilient Non-malleable CodesDivesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski. 398-426 [doi]
- Locally Decodable and Updatable Non-malleable Codes and Their ApplicationsDana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou. 427-450 [doi]
- Tamper Detection and Continuous Non-malleable CodesZahra Jafargholi, Daniel Wichs. 451-480 [doi]
- Optimal Algebraic Manipulation Detection Codes in the Constant-Error ModelRonald Cramer, Carles Padró, Chaoping Xing. 481-501 [doi]
- Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy AmplificationXin Li. 502-531 [doi]
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable CodesSandro Coretti, Ueli Maurer, Björn Tackmann, Daniele Venturi. 532-560 [doi]
- Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation MechanismsTakahiro Matsuda 0002, Goichiro Hanaoka. 561-590 [doi]
- Non-committing Encryption from Φ-hidingBrett Hemenway, Rafail Ostrovsky, Alon Rosen. 591-608 [doi]
- On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based EncryptionAdam Smith, Ye Zhang. 609-628 [doi]
- Tightly-Secure Authenticated Key ExchangeChristoph Bader, Dennis Hofheinz, Tibor Jager, Eike Kiltz, Yong Li. 629-658 [doi]