default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROCRYPT 2013: Athens, Greece
- Thomas Johansson, Phong Q. Nguyen:
Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings. Lecture Notes in Computer Science 7881, Springer 2013, ISBN 978-3-642-38347-2 - Sanjam Garg, Craig Gentry, Shai Halevi:
Candidate Multilinear Maps from Ideal Lattices. 1-17 - Nico Döttling, Jörn Müller-Quade:
Lossy Codes and a New Variant of the Learning-With-Errors Problem. 18-34 - Vadim Lyubashevsky, Chris Peikert, Oded Regev:
A Toolkit for Ring-LWE Cryptography. 35-54 - Mark Lewko, Adam O'Neill, Adam D. Smith:
Regularity of Lossy RSA on Subdomains and Its Applications. 55-75 - Marc Joye, Benoît Libert:
Efficient Cryptosystems from 2 k -th Power Residue Symbols. 76-92 - Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. 93-110 - Ryo Nishimaki:
How to Watermark Cryptographic Functions. 111-125 - Nicolas Veyrat-Charvillon, Benoît Gérard, François-Xavier Standaert
:
Security Evaluations beyond Computing Power. 126-141 - Emmanuel Prouff, Matthieu Rivain:
Masking against Side-Channel Attacks: A Formal Security Proof. 142-159 - Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. 160-176 - Antoine Joux:
Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields. 177-193 - Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin E. Lauter:
Fast Cryptography in Genus 2. 194-210 - Charles Bouillaguet, Pierre-Alain Fouque, Amandine Véber:
Graph-Theoretic Algorithms for the "Isomorphism of Polynomials" Problem. 211-227 - Franck Landelle, Thomas Peyrin:
Cryptanalysis of Full RIPEMD-128. 228-244 - Marc Stevens:
New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis. 245-261 - Florian Mendel, Tomislav Nad, Martin Schläffer:
Improving Local Collisions: New Attacks on Reduced SHA-256. 262-278 - David Cash, Alptekin Küpçü, Daniel Wichs:
Dynamic Proofs of Retrievability via Oblivious RAM. 279-295 - Mihir Bellare, Sriram Keelveedhi, Thomas Ristenpart:
Message-Locked Encryption and Secure Deduplication. 296-312 - Guido Bertoni, Joan Daemen, Michaël Peeters, Gilles Van Assche:
Keccak. 313-314 - Jung Hee Cheon, Jean-Sébastien Coron, Jinsu Kim, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi, Aaram Yun:
Batch Fully Homomorphic Encryption over the Integers. 315-335 - Dario Catalano, Dario Fiore:
Practical Homomorphic MACs for Arithmetic Circuits. 336-352 - Charalampos Papamanthou, Elaine Shi, Roberto Tamassia, Ke Yi:
Streaming Authenticated Data Structures. 353-370 - Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean:
Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting. 371-387 - Céline Blondeau, Kaisa Nyberg:
New Links between Differential and Linear Cryptanalysis. 388-404 - Jooyoung Lee:
Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption. 405-425 - Paul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam:
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions. 426-443 - Marc Fischlin, Nils Fleischhacker:
Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures. 444-460 - Florian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Jae Hong Seo, Christoph Striecks:
Practical Signatures from Standard Assumptions. 461-485 - Benny Applebaum, Yoni Moses:
Locally Computable UOWHF with Linear Shrinkage. 486-502 - Huijia Lin, Stefano Tessaro:
Amplification of Chosen-Ciphertext Security. 503-519 - Dennis Hofheinz:
Circular Chosen-Ciphertext Security with Compact Ciphertexts. 520-536 - Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi:
MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions. 537-556 - Payman Mohassel, Seyed Saeed Sadeghian:
How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation. 557-574 - S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee:
Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. 575-591 - Dan Boneh, Mark Zhandry:
Quantum-Secure Message Authentication Codes. 592-608 - Marco Tomamichel, Serge Fehr, Jedrzej Kaniewski, Stephanie Wehner:
One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games. 609-625 - Rosario Gennaro, Craig Gentry, Bryan Parno, Mariana Raykova:
Quadratic Span Programs and Succinct NIZKs without PCPs. 626-645 - Stephanie Bayer, Jens Groth:
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists. 646-663 - Grégory Demay, Peter Gazi, Martin Hirt, Ueli Maurer:
Resource-Restricted Indifferentiability. 664-683 - Vipul Goyal, Abhishek Jain:
On Concurrently Secure Computation in the Multiple Ideal Query Model. 684-701 - Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti, Akshay Wadia:
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions. 702-718 - Steve Lu, Rafail Ostrovsky:
How to Garble RAM Programs. 719-734
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-29 02:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
