Table of Contents

• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small CharacteristicRazvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. 1-16 [doi]
• Polynomial Time Attack on Wild McEliece over Quadratic ExtensionsAlain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. 17-39 [doi]
• Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index CalculusJean-Charles Faugère, Louise Huot, Antoine Joux, Guénaël Renault, Vanessa Vitse. 40-57 [doi]
• Why Proving HIBE Systems Secure Is DifficultAllison B. Lewko, Brent Waters. 58-76 [doi]
• Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext AttackJunzuo Lai, Robert H. Deng, Shengli Liu, Jian Weng, Yunlei Zhao. 77-92 [doi]
• Key Derivation without Entropy WasteYevgeniy Dodis, Krzysztof Pietrzak, Daniel Wichs. 93-110 [doi]
• Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering CircuitsSebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs. 111-128 [doi]
• Revocable Quantum Timed-Release EncryptionDominique Unruh. 129-146 [doi]
• Generic Universal Forgery Attack on Iterative Hash-Based MACsThomas Peyrin, Lei Wang. 147-164 [doi]
• Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack ComplexitiesCéline Blondeau, Kaisa Nyberg. 165-182 [doi]
• Faster Compact Diffie-Hellman: Endomorphisms on the x-lineCraig Costello, Hüseyin Hisil, Benjamin Smith. 183-200 [doi]
• Replacing a Random Oracle: Full Domain Hash from Indistinguishability ObfuscationSusan Hohenberger, Amit Sahai, Brent Waters. 201-220 [doi]
• Protecting Obfuscation against Algebraic AttacksBoaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai. 221-238 [doi]
• GGHLite: More Efficient Multilinear Maps from Ideal LatticesAdeline Langlois, Damien Stehlé, Ron Steinfeld. 239-256 [doi]
• Reconsidering Generic CompositionChanathip Namprempre, Phillip Rogaway, Thomas Shrimpton. 257-274 [doi]
• Parallelizable Rate-1 Authenticated Encryption from Pseudorandom FunctionsKazuhiko Minematsu. 275-292 [doi]
• Honey Encryption: Security Beyond the Brute-Force BoundAri Juels, Thomas Ristenpart. 293-310 [doi]
• Sometimes-Recurse Shuffle - Almost-Random Permutations in Logarithmic Expected TimeBen Morris, Phillip Rogaway. 311-326 [doi]
• Tight Security Bounds for Key-Alternating CiphersShan Chen, John P. Steinberger. 327-350 [doi]
• The Locality of Searchable Symmetric EncryptionDavid Cash, Stefano Tessaro. 351-368 [doi]
• A Bound for Multiparty Secret Key Agreement and Implications for a Problem of Secure ComputingHimanshu Tyagi, Shun Watanabe. 369-386 [doi]
• Non-Interactive Secure Computation Based on Cut-and-ChooseArash Afshar, Payman Mohassel, Benny Pinkas, Ben Riva. 387-404 [doi]
• Garbled RAM RevisitedCraig Gentry, Shai Halevi, Steve Lu, Rafail Ostrovsky, Mariana Raykova 0001, Daniel Wichs. 405-422 [doi]
• Unifying Leakage Models: From Probing Attacks to Noisy LeakageAlexandre Duc, Stefan Dziembowski, Sebastian Faust. 423-440 [doi]
• Higher Order Masking of Look-Up TablesJean-Sébastien Coron. 441-458 [doi]
• How to Certify the Leakage of a Chip?François Durvaux, François-Xavier Standaert, Nicolas Veyrat-Charvillon. 459-476 [doi]
• Efficient Round Optimal Blind SignaturesSanjam Garg, Divya Gupta. 477-495 [doi]
• Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/SigMihir Bellare, Sarah Meiklejohn, Susan Thomson 0001. 496-513 [doi]
• Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic SignaturesBenoît Libert, Thomas Peters, Marc Joye, Moti Yung. 514-532 [doi]
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled CircuitsDan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy. 533-556 [doi]
• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and MoreNuttapong Attrapadung. 557-577 [doi]
• Multi-input Functional EncryptionShafi Goldwasser, S. Dov Gordon, Vipul Goyal, Abhishek Jain 0002, Jonathan Katz, Feng-Hao Liu, Amit Sahai, Elaine Shi, Hong-Sheng Zhou. 578-602 [doi]
• Salvaging Indifferentiability in a Multi-stage SettingArno Mittelbach. 603-621 [doi]
• Déjà Q: Using Dual Systems to Revisit q-Type AssumptionsMelissa Chase, Sarah Meiklejohn. 622-639 [doi]
• Distributed Point Functions and Their ApplicationsNiv Gilboa, Yuval Ishai. 640-658 [doi]
• A Full Characterization of Completeness for Two-Party Randomized Function EvaluationDaniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai. 659-676 [doi]
• On the Complexity of UC CommitmentsJuan A. Garay, Yuval Ishai, Ranjit Kumaresan, Hoeteck Wee. 677-694 [doi]
• Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic EncryptionMorten Dahl, Ivan Damgård. 695-712 [doi]