default search action
EUROCRYPT 2010: Monaco / French Riviera
- Henri Gilbert:
Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings. Lecture Notes in Computer Science 6110, Springer 2010, ISBN 978-3-642-13189-9
Cryptosystems I
- Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. 1-23 - Marten van Dijk, Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
Fully Homomorphic Encryption over the Integers. 24-43 - David Mandell Freeman:
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups. 44-61 - Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters:
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption. 62-91
Obfuscation and Side Channel Security
- Satoshi Hada:
Secure Obfuscation for Encrypted Signatures. 92-112 - Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs:
Public-Key Encryption in the Bounded-Retrieval Model. 113-134 - Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan:
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases. 135-156
2-Party Protocols
- S. Dov Gordon, Jonathan Katz:
Partial Fairness in Secure Two-Party Computation. 157-176 - Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission with Small Public Discussion. 177-196 - Marc Fischlin, Dominique Schröder:
On the Impossibility of Three-Move Blind Signature Schemes. 197-215 - Esther Hänggi, Renato Renner, Stefan Wolf:
Efficient Device-Independent Quantum Key Distribution. 216-234
Cryptanalysis
- Nick Howgrave-Graham, Antoine Joux:
New Generic Algorithms for Hard Knapsacks. 235-256 - Nicolas Gama, Phong Q. Nguyen, Oded Regev:
Lattice Enumeration Using Extreme Pruning. 257-278 - Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich:
Algebraic Cryptanalysis of McEliece Variants with Compact Keys. 279-298 - Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, Adi Shamir:
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds. 299-319
2010 IACR Distinguished Lecture
- Moti Yung:
Cryptography between Wonderland and Underland. 320-321
Automated Tools and Formal Methods
- Alex Biryukov, Ivica Nikolic:
Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others. 322-344 - Kenneth G. Paterson, Gaven J. Watson:
Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR. 345-361 - Daniele Micciancio:
Computational Soundness, Co-induction, and Encryption Cycles. 362-380
Models and Proofs
- Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee:
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks. 381-402 - Tolga Acar, Mira Belenkiy, Mihir Bellare, David Cash:
Cryptographic Agility and Its Relation to Circular Encryption. 403-422 - Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai:
Bounded Key-Dependent Message Security. 423-444
Multiparty Protocols
- Ivan Damgård, Yuval Ishai, Mikkel Krøigaard:
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. 445-465 - Martin Hirt, Vassilis Zikas:
Adaptively Secure Broadcast. 466-485 - Dominique Unruh:
Universally Composable Quantum Multi-party Computation. 486-505
Cryptosystems II
- Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
A Simple BGN-Type Cryptosystem from LWE. 506-522 - David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
Bonsai Trees, or How to Delegate a Lattice Basis. 523-552 - Shweta Agrawal, Dan Boneh, Xavier Boyen:
Efficient Lattice (H)IBE in the Standard Model. 553-572
Hash and MAC
- Jooyoung Lee, John P. Steinberger:
Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation. 573-596 - John P. Steinberger:
Stam's Collision Resistance Conjecture. 597-615 - Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. 616-637
Foundational Primitives
- Rafael Pass, Hoeteck Wee:
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. 638-655 - Susan Hohenberger, Brent Waters:
Constructing Verifiable Random Functions with Large Input Spaces. 656-672 - Eike Kiltz, Payman Mohassel, Adam O'Neill:
Adaptive Trapdoor Functions and Chosen-Ciphertext Security. 673-692
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.