Abstract is missing.
- Leftover Hash Lemma, RevisitedBoaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert, Yu Yu. 1-20 [doi]
- Random Oracle ReducibilityPaul Baecher, Marc Fischlin. 21-38 [doi]
- Time-Lock Puzzles in the Random Oracle ModelMohammad Mahmoody, Tal Moran, Salil P. Vadhan. 39-50 [doi]
- Physically Uncloneable Functions in the Universal Composition FrameworkChristina Brzuska, Marc Fischlin, Heike Schröder, Stefan Katzenbeisser. 51-70 [doi]
- Computer-Aided Security Proofs for the Working CryptographerGilles Barthe, Benjamin Grégoire, Sylvain Heraud, Santiago Zanella Béguelin. 71-90 [doi]
- Optimal Verification of Operations on Dynamic SetsCharalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos. 91-110 [doi]
- Verifiable Delegation of Computation over Large DatasetsSiavosh Benabbas, Rosario Gennaro, Yevgeniy Vahlis. 111-131 [doi]
- Secure Computation on the Web: Computing without Simultaneous InteractionShai Halevi, Yehuda Lindell, Benny Pinkas. 132-150 [doi]
- Memory DelegationKai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz. 151-168 [doi]
- Automatic Search of Attacks on Round-Reduced AES and ApplicationsCharles Bouillaguet, Patrick Derbez, Pierre-Alain Fouque. 169-187 [doi]
- How to Improve Rebound AttacksMaría Naya-Plasencia. 188-205 [doi]
- A Cryptanalysis of PRINTcipher: The Invariant Subspace AttackGregor Leander, Mohamed Ahmed Abdelraheem, Hoda AlKhzaimi, Erik Zenner. 206-221 [doi]
- The PHOTON Family of Lightweight Hash FunctionsJian Guo, Thomas Peyrin, Axel Poschmann. 222-239 [doi]
- Perfectly-Secure Multiplication for Any ::::t < n::::/3Gilad Asharov, Yehuda Lindell, Tal Rabin. 240-258 [doi]
- The IPS Compiler: Optimizations, Variants and Concrete EfficiencyYehuda Lindell, Eli Oxman, Benny Pinkas. 259-276 [doi]
- 1/::::p::::-Secure Multiparty Computation without Honest Majority and the Best of Both WorldsAmos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov. 277-296 [doi]
- Leakage-Resilient Zero KnowledgeSanjam Garg, Abhishek Jain 0002, Amit Sahai. 297-315 [doi]
- A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation FrameworkCarolyn Whitnall, Elisabeth Oswald. 316-334 [doi]
- Key-Evolution Schemes Resilient to Space-Bounded LeakageStefan Dziembowski, Tomasz Kazana, Daniel Wichs. 335-353 [doi]
- Generic Side-Channel Distinguishers: Improvements and LimitationsNicolas Veyrat-Charvillon, François-Xavier Standaert. 354-372 [doi]
- Cryptography with Tamperable and Leaky MemoryYael Tauman Kalai, Bhavana Kanukurthi, Amit Sahai. 373-390 [doi]
- Merkle Puzzles in a Quantum WorldGilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail. 391-410 [doi]
- Classical Cryptographic Protocols in a Quantum WorldSean Hallgren, Adam Smith, Fang Song. 411-428 [doi]
- Position-Based Quantum Cryptography: Impossibility and ConstructionsHarry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner. 429-446 [doi]
- Analyzing Blockwise Lattice Algorithms Using Dynamical SystemsGuillaume Hanrot, Xavier Pujol, Damien Stehlé. 447-464 [doi]
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision ReductionsDaniele Micciancio, Petros Mol. 465-484 [doi]
- Tor and Circumvention: Lessons Learned - (Abstract to Go with Invited Talk)Roger Dingledine. 485-486 [doi]
- Fully Homomorphic Encryption over the Integers with Shorter Public KeysJean-Sébastien Coron, Avradip Mandal, David Naccache, Mehdi Tibouchi. 487-504 [doi]
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent MessagesZvika Brakerski, Vinod Vaikuntanathan. 505-524 [doi]
- Bi-Deniable Public-Key EncryptionAdam O Neill, Chris Peikert, Brent Waters. 525-542 [doi]
- Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input SettingZvika Brakerski, Gil Segev. 543-560 [doi]
- The Collision Security of Tandem-DM in the Ideal Cipher ModelJooyoung Lee, Martijn Stam, John P. Steinberger. 561-577 [doi]
- Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative SolutionsAlexandra Boldyreva, Nathan Chenette, Adam O Neill. 578-595 [doi]
- A New Variant of PMAC: Beyond the Birthday BoundKan Yasuda. 596-609 [doi]
- Authenticated and Misuse-Resistant Encryption of Key-Dependent DataMihir Bellare, Sriram Keelveedhi. 610-629 [doi]
- Round Optimal Blind SignaturesSanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schröder, Dominique Unruh. 630-648 [doi]
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear GroupsMasayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo. 649-666 [doi]
- Constant-Rate Oblivious Transfer from Noisy ChannelsYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger. 667-684 [doi]
- The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret SharingIgnacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing. 685-705 [doi]
- Public-Key Identification Schemes Based on Multivariate Quadratic PolynomialsKoichi Sakumoto, Taizo Shirai, Harunaga Hiwatari. 706-723 [doi]
- Inverting HFE Systems Is Quasi-Polynomial for All FieldsJintai Ding, Timothy J. Hodges. 724-742 [doi]
- Smaller Decoding Exponents: Ball-Collision DecodingDaniel J. Bernstein, Tanja Lange, Christiane Peters. 743-760 [doi]
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling AttacksHang Dinh, Cristopher Moore, Alexander Russell. 761-779 [doi]