Abstract is missing.
- Input Locality and Hardness AmplificationAndrej Bogdanov, Alon Rosen. 1-18 [doi]
- General Hardness Amplification of Predicates and Puzzles - (Extended Abstract)Thomas Holenstein, Grant Schoenebeck. 19-36 [doi]
- Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore LemmaStefano Tessaro. 37-54 [doi]
- Dense Model Theorems and Their ApplicationsLuca Trevisan. 55-57 [doi]
- Parallel Repetition for Leakage Resilience Amplification RevisitedAbhishek Jain 0002, Krzysztof Pietrzak. 58-69 [doi]
- Achieving Leakage Resilience through Dual System EncryptionAllison B. Lewko, Yannis Rouselakis, Brent Waters. 70-88 [doi]
- Signatures Resilient to Continual Leakage on Memory and ComputationTal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung. 89-106 [doi]
- After-the-Fact Leakage in Public-Key EncryptionShai Halevi, Huijia Lin. 107-124 [doi]
- One-Time Computable Self-erasing FunctionsStefan Dziembowski, Tomasz Kazana, Daniel Wichs. 125-143 [doi]
- Perfectly Secure Oblivious RAM without Random OraclesIvan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen. 144-163 [doi]
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware TokenNico Döttling, Daniel Kraschewski, Jörn Müller-Quade. 164-181 [doi]
- Correlated-Input Secure Hash FunctionsVipul Goyal, Adam O Neill, Vanishree Rao. 182-200 [doi]
- Black-Box Circular-Secure Encryption beyond Affine FunctionsZvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai. 201-218 [doi]
- Homomorphic Encryption: From Private-Key to Public-KeyRon Rothblum. 219-234 [doi]
- Identity-Based Encryption Secure against Selective Opening AttackMihir Bellare, Brent Waters, Scott Yilek. 235-252 [doi]
- Functional Encryption: Definitions and ChallengesDan Boneh, Amit Sahai, Brent Waters. 253-273 [doi]
- Concurrent Non-Malleable Zero Knowledge with Adaptive InputsHuijia Lin, Rafael Pass. 274-292 [doi]
- Round-Optimal Password-Based Authenticated Key ExchangeJonathan Katz, Vinod Vaikuntanathan. 293-310 [doi]
- Bringing People of Different Beliefs Together to Do UCSanjam Garg, Vipul Goyal, Abhishek Jain 0002, Amit Sahai. 311-328 [doi]
- Secure Two-Party Computation via Cut-and-Choose Oblivious TransferYehuda Lindell, Benny Pinkas. 329-346 [doi]
- Practical Adaptive Oblivious Transfer from Simple AssumptionsMatthew Green, Susan Hohenberger. 347-363 [doi]
- Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party FunctionsDaniel Kraschewski, Jörn Müller-Quade. 364-381 [doi]
- A Zero-One Law for Secure Multi-party Computation with Ternary OutputsGunnar Kreitz. 382-399 [doi]
- PCPs and the Hardness of Generating Private Synthetic DataJonathan Ullman, Salil P. Vadhan. 400-416 [doi]
- Limits of Computational Differential Privacy in the Client/Server SettingAdam Groce, Jonathan Katz, Arkady Yerukhimovich. 417-431 [doi]
- Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of PrivacyJohannes Gehrke, Edward Lui, Rafael Pass. 432-449 [doi]
- On the Black-Box Complexity of Optimally-Fair Coin TossingDana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin. 450-467 [doi]
- Tight Bounds for Classical and Quantum Coin FlippingEsther Hänggi, Jürg Wullschleger. 468-485 [doi]
- Exploring the Limits of Common Coins Using Frontier Analysis of ProtocolsHemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek. 486-503 [doi]
- Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random GeneratorsJosh Bronson, Ali Juma, Periklis A. Papakonstantinou. 504-521 [doi]
- On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom GeneratorsEric Miles, Emanuele Viola. 522-539 [doi]
- Concurrent Security and Non-malleabilityRafael Pass. 540 [doi]
- (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening AttacksDavid Xiao. 541-558 [doi]
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic ConstructionsZvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich. 559-578 [doi]
- Towards Non-Black-Box Lower Bounds in CryptographyRafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam. 579-596 [doi]
- On Black-Box Separations among Injective One-Way FunctionsTakahiro Matsuda 0002, Kanta Matsuura. 597-614 [doi]
- Impossibility of Blind Signatures from One-Way PermutationsJonathan Katz, Dominique Schröder, Arkady Yerukhimovich. 615-629 [doi]