Abstract is missing.
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space EfficiencyPaul Valiant. 1-18 [doi]
- On Seed-Incompressible FunctionsShai Halevi, Steven Myers, Charles Rackoff. 19-36 [doi]
- Asymptotically Efficient Lattice-Based Digital SignaturesVadim Lyubashevsky, Daniele Micciancio. 37-54 [doi]
- Basing Weak Public-Key Cryptography on Strong One-Way FunctionsEli Biham, Yaron J. Goren, Yuval Ishai. 55-72 [doi]
- Which Languages Have 4-Round Zero-Knowledge Proofs?Jonathan Katz. 73-88 [doi]
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-KnowledgeLior Malka. 89-106 [doi]
- General Properties of Quantum Zero-Knowledge ProofsHirotada Kobayashi. 107-124 [doi]
- The Layered Games Framework for Specifications and Analysis of Security ProtocolsAmir Herzberg, Igal Yoffe. 125-141 [doi]
- Universally Composable Multi-party Computation with an Unreliable Common Reference StringVipul Goyal, Jonathan Katz. 142-154 [doi]
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert AdversariesCarmit Hazay, Yehuda Lindell. 155-175 [doi]
- Fast Private Norm Estimation and Heavy HittersJoe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng. 176-193 [doi]
- Matroids Can Be Far from Ideal Secret SharingAmos Beimel, Noam Livne, Carles Padró. 194-212 [doi]
- Perfectly-Secure MPC with Linear Communication ComplexityZuzana Beerliová-Trubíniová, Martin Hirt. 213-230 [doi]
- MPC vs. SFE: Perfect Security in a Unified Corruption ModelZuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli M. Maurer, Vassilis Zikas. 231-250 [doi]
- Bridging Game Theory and Cryptography: Recent Results and Future DirectionsJonathan Katz. 251-272 [doi]
- Verifiably Secure DevicesSergei Izmalkov, Matt Lepinski, Silvio Micali. 273-301 [doi]
- Lower Bounds on Implementing Robust and Resilient MediatorsIttai Abraham, Danny Dolev, Joseph Y. Halpern. 302-319 [doi]
- Cryptography and Game Theory: Designing Protocols for Exchanging InformationGillat Kol, Moni Naor. 320-339 [doi]
- Equivocal Blind Signatures and Adaptive UC-SecurityAggelos Kiayias, Hong-Sheng Zhou. 340-355 [doi]
- P-signatures and Noninteractive Anonymous CredentialsMira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya. 356-374 [doi]
- Multi-property Preserving Combiners for Hash FunctionsMarc Fischlin, Anja Lehmann. 375-392 [doi]
- OT-Combiners via Secure ComputationDanny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen. 393-411 [doi]
- Semi-honest to Malicious Oblivious Transfer - The Black-Box WayIftach Haitner. 412-426 [doi]
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure OneSeung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee. 427-444 [doi]
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information RetrievalIftach Haitner, Jonathan J. Hoch, Gil Segev. 445-464 [doi]
- Randomness Extraction Via ::::delta:::: -Biased Masking in the Presence of a Quantum AttackerSerge Fehr, Christian Schaffner. 465-481 [doi]
- An Equivalence Between Zero Knowledge and CommitmentsShien Jin Ong, Salil P. Vadhan. 482-500 [doi]
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help ModelAndré Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan. 501-534 [doi]
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial CharacterizationDaniele Micciancio, Scott Yilek. 535-552 [doi]
- On Constant-Round Concurrent Zero-KnowledgeRafael Pass, Muthuramakrishnan Venkitasubramaniam. 553-570 [doi]
- Concurrent Non-malleable Commitments from Any One-Way FunctionHuijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam. 571-588 [doi]
- Faster and Shorter Password-Authenticated Key ExchangeRosario Gennaro. 589-606 [doi]
- Saving Private Randomness in One-Way Functions and Pseudorandom GeneratorsNenad Dedic, Danny Harnik, Leonid Reyzin. 607-625 [doi]
- Degradation and Amplification of Computational HardnessShai Halevi, Tal Rabin. 626-643 [doi]