Table of Contents

• An Enciphering Scheme Based on a Card ShuffleViet Tung Hoang, Ben Morris, Phillip Rogaway. 1-13 [doi]
• Tweakable Blockciphers with Beyond Birthday-Bound SecurityWill Landecker, Thomas Shrimpton, R. Seth Terashima. 14-30 [doi]
• Breaking and Repairing GCM Security ProofsTetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu. 31-49 [doi]
• On the Distribution of Linear Biases: Three Instructive ExamplesMohamed Ahmed Abdelraheem, Martin Ågren, Peter Beelen, Gregor Leander. 50-67 [doi]
• Substitution-Permutation Networks, Pseudorandom Functions, and Natural ProofsEric Miles, Emanuele Viola. 68-85 [doi]
• The End of CryptoJonathan Zittrain. 86 [doi]
• Must You Know the Code of f to Securely Compute f?Mike Rosulek. 87-104 [doi]
• Adaptively Secure Multi-Party Computation with Dishonest MajoritySanjam Garg, Amit Sahai. 105-123 [doi]
• Collusion-Preserving ComputationJoël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas. 124-143 [doi]
• Secret Sharing Schemes for Very Dense GraphsAmos Beimel, Oriol Farràs, Yuval Mintz. 144-161 [doi]
• Functional Encryption with Bounded Collusions via Multi-party ComputationSergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee. 162-179 [doi]
• New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective TechniquesAllison B. Lewko, Brent Waters. 180-198 [doi]
• Dynamic Credentials and Ciphertext Delegation for Attribute-Based EncryptionAmit Sahai, Hakan Seyalioglu, Brent Waters. 199-217 [doi]
• Functional Encryption for Regular LanguagesBrent Waters. 218-235 [doi]
• Secure Database Commitments and Universal Arguments of Quasi KnowledgeMelissa Chase, Ivan Visconti. 236-254 [doi]
• Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency BenefitsNir Bitansky, Alessandro Chiesa. 255-272 [doi]
• On the Security of TLS-DHE in the Standard ModelTibor Jager, Florian Kohlar, Sven Schäge, Jörg Schwenk. 273-293 [doi]
• Semantic Security for the Wiretap ChannelMihir Bellare, Stefano Tessaro, Alexander Vardy. 294-311 [doi]
• Multi-instance Security and Its Application to Password-Based CryptographyMihir Bellare, Thomas Ristenpart, Stefano Tessaro. 312-329 [doi]
• Hash Functions Based on Three Permutations: A Generic Security AnalysisBart Mennink, Bart Preneel. 330-347 [doi]
• To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMACYevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro. 348-366 [doi]
• New Preimage Attacks against Reduced SHA-1Simon Knellwolf, Dmitry Khovratovich. 367-383 [doi]
• Stam's Conjecture and Threshold Phenomena in Collision ResistanceJohn P. Steinberger, Xiaoming Sun, Zhe Yang. 384-405 [doi]
• Universal Composability from Essentially Any Trusted SetupMike Rosulek. 406-423 [doi]
• Impossibility Results for Static Input Secure ComputationSanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti. 424-442 [doi]
• New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure ComputationShweta Agrawal, Vipul Goyal, Abhishek Jain 0002, Manoj Prabhakaran, Amit Sahai. 443-460 [doi]
• Black-Box Constructions of Composable Protocols without Set-UpHuijia Lin, Rafael Pass. 461-478 [doi]
• Crowd-Blending PrivacyJohannes Gehrke, Michael Hay, Edward Lui, Rafael Pass. 479-496 [doi]
• Differential Privacy with Imperfect RandomnessYevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan. 497-516 [doi]
• Tamper and Leakage Resilience in the Split-State ModelFeng-Hao Liu, Anna Lysyanskaya. 517-532 [doi]
• Securing Circuits against Constant-Rate TamperingDana Dachman-Soled, Yael Tauman Kalai. 533-551 [doi]
• How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure HardwareGuy N. Rothblum. 552-569 [doi]
• Recent Advances and Existing Research Questions in Platform SecurityErnie Brickell. 570 [doi]
• Group Signatures with Almost-for-Free RevocationBenoît Libert, Thomas Peters, Moti Yung. 571-589 [doi]
• Tightly Secure Signatures and Public-Key EncryptionDennis Hofheinz, Tibor Jager. 590-607 [doi]
• Efficient Padding Oracle Attacks on Cryptographic HardwareRomain Bardou, Riccardo Focardi, Yusuke Kawamoto, Lorenzo Simionato, Graham Steel, Joe-Kai Tsay. 608-625 [doi]
• Public KeysArjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter. 626-642 [doi]
• Multiparty Computation from Somewhat Homomorphic EncryptionIvan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias. 643-662 [doi]
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest MinorityEli Ben-Sasson, Serge Fehr, Rafail Ostrovsky. 663-680 [doi]
• A New Approach to Practical Active-Secure Two-Party ComputationJesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra. 681-700 [doi]
• The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of PrimitivesMohammad Mahmoody, Rafael Pass. 701-718 [doi]
• Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search ProblemsItai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir. 719-740 [doi]
• Resistance against Iterated Attacks by Decorrelation Revisited, Asli Bay, Atefeh Mashatan, Serge Vaudenay. 741-757 [doi]
• Secure Identity-Based Encryption in the Quantum Random Oracle ModelMark Zhandry. 758-775 [doi]
• Quantum to Classical Randomness ExtractorsMario Berta, Omar Fawzi, Stephanie Wehner. 776-793 [doi]
• Actively Secure Two-Party Evaluation of Any Quantum OperationFrédéric Dupuis, Jesper Buus Nielsen, Louis Salvail. 794-811 [doi]
• On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order GroupsGoichiro Hanaoka, Takahiro Matsuda 0002, Jacob C. N. Schuldt. 812-831 [doi]
• Hardness of Computing Individual Bits for One-Way Functions on Elliptic CurvesAlexandre Duc, Dimitar Jetchev. 832-849 [doi]
• Homomorphic Evaluation of the AES CircuitCraig Gentry, Shai Halevi, Nigel P. Smart. 850-867 [doi]
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVPZvika Brakerski. 868-886 [doi]