Abstract is missing.
- A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract)Antoine Joux. 1-7 [doi]
- Another Look at Provable SecurityAlfred Menezes. 8 [doi]
- Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $\mathbb{F}_{p^6}$Antoine Joux, Vanessa Vitse. 9-26 [doi]
- Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary FieldsJean-Charles Faugère, Ludovic Perret, Christophe Petit, Guénaël Renault. 27-44 [doi]
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract)Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, François-Xavier Standaert, John P. Steinberger, Elmar Tischhauser. 45-62 [doi]
- Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized CascadingPeter Gazi, Stefano Tessaro. 63-80 [doi]
- Fair Computation with Rational PlayersAdam Groce, Jonathan Katz. 81-98 [doi]
- Concurrently Secure Computation in Constant RoundsSanjam Garg, Vipul Goyal, Abhishek Jain 0002, Amit Sahai. 99-116 [doi]
- Identity-Based Encryption Resilient to Continual Auxiliary LeakageTsz Hon Yuen, Sherman S. M. Chow, Ye Zhang, Siu-Ming Yiu. 117-134 [doi]
- Quantum Proofs of KnowledgeDominique Unruh. 135-152 [doi]
- On Round-Optimal Zero Knowledge in the Bare Public-Key ModelAlessandra Scafuro, Ivan Visconti. 153-171 [doi]
- Robust Coin FlippingGene S. Kopp, John D. Wiltshire-Gordon. 172-194 [doi]
- Unconditionally-Secure Robust Secret Sharing with Compact SharesAlfonso Cevallos, Serge Fehr, Rafail Ostrovsky, Yuval Rabani. 195-208 [doi]
- All-But-Many Lossy Trapdoor FunctionsDennis Hofheinz. 209-227 [doi]
- Identity-Based (Lossy) Trapdoor Functions and ApplicationsMihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters. 228-245 [doi]
- Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and MoreHoeteck Wee. 246-262 [doi]
- Efficient Zero-Knowledge Argument for Correctness of a ShuffleStephanie Bayer, Jens Groth. 263-280 [doi]
- Malleable Proof Systems and ApplicationsMelissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn. 281-300 [doi]
- Group to Group Commitments Do Not ShrinkMasayuki Abe, Kristiyan Haralambiev, Miyako Ohkubo. 301-317 [doi]
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order SettingAllison B. Lewko. 318-335 [doi]
- Minimalism in Cryptography: The Even-Mansour Scheme RevisitedOrr Dunkelman, Nathan Keller, Adi Shamir. 336-354 [doi]
- Message Authentication, RevisitedYevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, Daniel Wichs. 355-374 [doi]
- Property Preserving Symmetric EncryptionOmkant Pandey, Yannis Rouselakis. 375-391 [doi]
- Narrow-Bicliques: Cryptanalysis of Full IDEADmitry Khovratovich, Gaëtan Leurent, Christian Rechberger. 392-410 [doi]
- Cryptanalyses on a Merkle-Damgård Based MAC - Almost Universal Forgery and Distinguishing-H AttacksYu Sasaki. 411-427 [doi]
- Statistical Tools Flavor Side-Channel Collision AttacksAmir Moradi. 428-445 [doi]
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the IntegersJean-Sébastien Coron, David Naccache, Mehdi Tibouchi. 446-464 [doi]
- Fully Homomorphic Encryption with Polylog OverheadCraig Gentry, Shai Halevi, Nigel P. Smart. 465-482 [doi]
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHEGilad Asharov, Abhishek Jain 0002, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs. 483-501 [doi]
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the IntegersYuanmi Chen, Phong Q. Nguyen. 502-519 [doi]
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set DecodingAnja Becker, Antoine Joux, Alexander May, Alexander Meurer. 520-536 [doi]
- Optimal Security Proofs for Full Domain Hash, RevisitedSaqib A. Kakvi, Eike Kiltz. 537-553 [doi]
- On the Exact Security of Schnorr-Type Signatures in the Random Oracle ModelYannick Seurin. 554-571 [doi]
- Tightly-Secure Signatures from Lossy Identification SchemesMichel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi. 572-590 [doi]
- Adaptively Attribute-Hiding (Hierarchical) Inner Product EncryptionTatsuaki Okamoto, Katsuyuki Takashima. 591-608 [doi]
- Scalable Group Signatures with RevocationBenoît Libert, Thomas Peters, Moti Yung. 609-627 [doi]
- Incremental Deterministic Public-Key EncryptionIlya Mironov, Omkant Pandey, Omer Reingold, Gil Segev. 628-644 [doi]
- Standard Security Does Not Imply Security against Selective-OpeningMihir Bellare, Rafael Dowsley, Brent Waters, Scott Yilek. 645-662 [doi]
- Detecting Dangerous Queries: A New Approach for Chosen Ciphertext SecuritySusan Hohenberger, Allison B. Lewko, Brent Waters. 663-681 [doi]
- Security of Symmetric Encryption in the Presence of Ciphertext FragmentationAlexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam. 682-699 [doi]
- Trapdoors for Lattices: Simpler, Tighter, Faster, SmallerDaniele Micciancio, Chris Peikert. 700-718 [doi]
- Pseudorandom Functions and LatticesAbhishek Banerjee 0001, Chris Peikert, Alon Rosen. 719-737 [doi]
- Lattice Signatures without TrapdoorsVadim Lyubashevsky. 738-755 [doi]