Abstract is missing.
- Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation MechanismsShengli Liu, Kenneth G. Paterson. 3-26 [doi]
- On the Selective Opening Security of Practical Public-Key Encryption SchemesFelix Heuer, Tibor Jager, Eike Kiltz, Sven Schäge. 27-51 [doi]
- How Secure is Deterministic Encryption?Mihir Bellare, Rafael Dowsley, Sriram Keelveedhi. 52-73 [doi]
- Divisible E-Cash Made PracticalSébastien Canard, David Pointcheval, Olivier Sanders, Jacques Traoré. 77-100 [doi]
- Anonymous Transferable E-CashFoteini Baldimtsi, Melissa Chase, Georg Fuchsbauer, Markulf Kohlweiss. 101-124 [doi]
- Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm ProblemShuji Kijima, Ravi Montenegro. 127-149 [doi]
- A Polynomial-Time Key-Recovery Attack on MQQ CryptosystemsJean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Simona Samardjiska, Enrico Thomae. 150-174 [doi]
- A Polynomial-Time Attack on the BBCRS SchemeAlain Couvreur, Ayoub Otmani, Jean-Pierre Tillich, Valérie Gauthier-Umaña. 175-193 [doi]
- Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free CaseMarta Conde Pena, Jean-Charles Faugère, Ludovic Perret. 194-213 [doi]
- Digital Signatures from Strong RSA without Prime GenerationDavid Cash, Rafael Dowsley, Eike Kiltz. 217-235 [doi]
- Short Signatures with Short Public Keys from Homomorphic Trapdoor FunctionsJacob Alperin-Sheriff. 236-255 [doi]
- Tightly-Secure Signatures from Chameleon Hash FunctionsOlivier Blazy, Saqib A. Kakvi, Eike Kiltz, Jiaxin Pan. 256-279 [doi]
- Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient CorruptionsJan Camenisch, Robert R. Enderlein, Gregory Neven. 283-307 [doi]
- Adaptive Witness Encryption and Asymmetric Password-Based CryptographyMihir Bellare, Viet Tung Hoang. 308-331 [doi]
- Public-Key Encryption Indistinguishable Under Plaintext-Checkable AttacksMichel Abdalla, Fabrice Benhamouda, David Pointcheval. 332-352 [doi]
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower BoundsGilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi. 355-376 [doi]
- A Profitable Sub-prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear GroupsAllison B. Lewko, Sarah Meiklejohn. 377-398 [doi]
- Simpler Efficient Group Signatures from LatticesPhong Q. Nguyen, Jiang Zhang, Zhenfeng Zhang. 401-426 [doi]
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-BasedSan Ling, Khoa Nguyen, Huaxiong Wang. 427-449 [doi]
- Secure Efficient History-Hiding Append-Only Signatures in the Standard ModelBenoît Libert, Marc Joye, Moti Yung, Thomas Peters. 450-473 [doi]
- One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard ModelFlorian Bergsma, Tibor Jager, Jörg Schwenk. 477-494 [doi]
- Additively Homomorphic UC Commitments with Optimal Amortized OverheadIgnacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti. 495-515 [doi]
- Interactive Message-Locked Encryption and Secure DeduplicationMihir Bellare, Sriram Keelveedhi. 516-538 [doi]
- Faster ECC over \mathbb F_2^521-1Robert Granger, Michael Scott. 539-553 [doi]
- Continuous Non-malleable Key Derivation and Its Application to Related-Key SecurityBaodong Qin, Shengli Liu, Tsz Hon Yuen, Robert H. Deng, Kefei Chen. 557-578 [doi]
- A Tamper and Leakage Resilient von Neumann ArchitectureSebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi. 579-603 [doi]
- Low Noise LPN: KDM Secure Public Key Encryption and Sample AmplificationNico Döttling. 604-626 [doi]
- Adaptive Proofs of Knowledge in the Random Oracle ModelDavid Bernhard, Marc Fischlin, Bogdan Warinschi. 629-649 [doi]
- Making Sigma-Protocols Non-interactive Without Random OraclesPyrros Chaidos, Jens Groth. 650-670 [doi]
- Bootstrapping BGV Ciphertexts with a Wider Choice of p and qEmmanuela Orsini, Joop van de Pol, Nigel P. Smart. 673-698 [doi]
- Packing Messages and Optimizing Bootstrapping in GSW-FHERyo Hiromasa, Masayuki Abe, Tatsuaki Okamoto. 699-715 [doi]
- Simple Lattice Trapdoor Sampling from a Broad Class of DistributionsVadim Lyubashevsky, Daniel Wichs. 716-730 [doi]
- Simple Functional Encryption Schemes for Inner ProductsMichel Abdalla, Florian Bourse, Angelo De Caro, David Pointcheval. 733-751 [doi]
- Predicate Encryption for Multi-dimensional Range Queries from LatticesRomain Gay, Pierrick Méaux, Hoeteck Wee. 752-776 [doi]
- On the Practical Security of Inner Product Functional EncryptionShashank Agrawal, Shweta Agrawal, Saikrishna Badrinarayanan, Abishek Kumarasubramanian, Manoj Prabhakaran, Amit Sahai. 777-798 [doi]
- Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext SettingDennis Hofheinz, Jessica Koch, Christoph Striecks. 799-822 [doi]