Abstract is missing.
- Candidate Multilinear Maps from Ideal LatticesSanjam Garg, Craig Gentry, Shai Halevi. 1-17 [doi]
- Lossy Codes and a New Variant of the Learning-With-Errors ProblemNico Döttling, Jörn Müller-Quade. 18-34 [doi]
- A Toolkit for Ring-LWE CryptographyVadim Lyubashevsky, Chris Peikert, Oded Regev. 35-54 [doi]
- Regularity of Lossy RSA on Subdomains and Its ApplicationsMark Lewko, Adam O'Neill, Adam Smith. 55-75 [doi]
- k -th Power Residue SymbolsMarc Joye, Benoît Libert. 76-92 [doi]
- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext DistributionsAnanth Raghunathan, Gil Segev, Salil P. Vadhan. 93-110 [doi]
- How to Watermark Cryptographic FunctionsRyo Nishimaki. 111-125 [doi]
- Security Evaluations beyond Computing PowerNicolas Veyrat-Charvillon, Benoît Gérard, François-Xavier Standaert. 126-141 [doi]
- Masking against Side-Channel Attacks: A Formal Security ProofEmmanuel Prouff, Matthieu Rivain. 142-159 [doi]
- Leakage-Resilient Cryptography from Minimal AssumptionsCarmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs. 160-176 [doi]
- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite FieldsAntoine Joux. 177-193 [doi]
- Fast Cryptography in Genus 2Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin Lauter. 194-210 [doi]
- Graph-Theoretic Algorithms for the "Isomorphism of Polynomials" ProblemCharles Bouillaguet, Pierre-Alain Fouque, Amandine Véber. 211-227 [doi]
- Cryptanalysis of Full RIPEMD-128Franck Landelle, Thomas Peyrin. 228-244 [doi]
- New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision AnalysisMarc Stevens. 245-261 [doi]
- Improving Local Collisions: New Attacks on Reduced SHA-256Florian Mendel, Tomislav Nad, Martin Schläffer. 262-278 [doi]
- Dynamic Proofs of Retrievability via Oblivious RAMDavid Cash, Alptekin Küpçü, Daniel Wichs. 279-295 [doi]
- Message-Locked Encryption and Secure DeduplicationMihir Bellare, Sriram Keelveedhi, Thomas Ristenpart. 296-312 [doi]
- KeccakGuido Bertoni, Joan Daemen, Michael Peeters, Gilles Van Assche. 313-314 [doi]
- Batch Fully Homomorphic Encryption over the IntegersJung Hee Cheon, Jean-Sébastien Coron, Jinsu Kim, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi, Aaram Yun. 315-335 [doi]
- Practical Homomorphic MACs for Arithmetic CircuitsDario Catalano, Dario Fiore. 336-352 [doi]
- Streaming Authenticated Data StructuresCharalampos Papamanthou, Elaine Shi, Roberto Tamassia, Ke Yi. 353-370 [doi]
- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key SettingPatrick Derbez, Pierre-Alain Fouque, Jérémy Jean. 371-387 [doi]
- New Links between Differential and Linear CryptanalysisCéline Blondeau, Kaisa Nyberg. 388-404 [doi]
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade EncryptionJooyoung Lee. 405-425 [doi]
- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash FunctionsPaul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam. 426-443 [doi]
- Limitations of the Meta-reduction Technique: The Case of Schnorr SignaturesMarc Fischlin, Nils Fleischhacker. 444-460 [doi]
- Practical Signatures from Standard AssumptionsFlorian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Jae Hong Seo, Christoph Striecks. 461-485 [doi]
- Locally Computable UOWHF with Linear ShrinkageBenny Applebaum, Yoni Moses. 486-502 [doi]
- Amplification of Chosen-Ciphertext SecurityHuijia Lin, Stefano Tessaro. 503-519 [doi]
- Circular Chosen-Ciphertext Security with Compact CiphertextsDennis Hofheinz. 520-536 [doi]
- MiniLEGO: Efficient Secure Two-Party Computation from General AssumptionsTore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi. 537-556 [doi]
- How to Hide Circuits in MPC an Efficient Framework for Private Function EvaluationPayman Mohassel, Seyed Saeed Sadeghian. 557-574 [doi]
- Multi-party Computation of Polynomials and Branching Programs without Simultaneous InteractionS. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee. 575-591 [doi]
- Quantum-Secure Message Authentication CodesDan Boneh, Mark Zhandry. 592-608 [doi]
- One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy GamesMarco Tomamichel, Serge Fehr, Jedrzej Kaniewski, Stephanie Wehner. 609-625 [doi]
- Quadratic Span Programs and Succinct NIZKs without PCPsRosario Gennaro, Craig Gentry, Bryan Parno, Mariana Raykova 0001. 626-645 [doi]
- Zero-Knowledge Argument for Polynomial Evaluation with Application to BlacklistsStephanie Bayer, Jens Groth. 646-663 [doi]
- Resource-Restricted IndifferentiabilityGregory Demay, Peter Gazi, Martin Hirt, Ueli Maurer. 664-683 [doi]
- On Concurrently Secure Computation in the Multiple Ideal Query ModelVipul Goyal, Abhishek Jain 0002. 684-701 [doi]
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable FunctionsRafail Ostrovsky, Alessandra Scafuro, Ivan Visconti, Akshay Wadia. 702-718 [doi]
- How to Garble RAM ProgramsSteve Lu, Rafail Ostrovsky. 719-734 [doi]