default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROCRYPT 2012: Cambridge, UK
- David Pointcheval
, Thomas Johansson:
Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings. Lecture Notes in Computer Science 7237, Springer 2012, ISBN 978-3-642-29010-7
Invited Talks
- Antoine Joux:
A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract). 1-7 - Alfred Menezes:
Another Look at Provable Security. 8
Index Calculus
- Antoine Joux, Vanessa Vitse:
Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $\mathbb{F}_{p^6}$. 9-26 - Jean-Charles Faugère, Ludovic Perret, Christophe Petit, Guénaël Renault:
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields. 27-44
Symmetric Constructions I
- Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, François-Xavier Standaert, John P. Steinberger, Elmar Tischhauser:
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract). 45-62 - Peter Gazi, Stefano Tessaro:
Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading. 63-80
Secure Computation
- Adam Groce, Jonathan Katz:
Fair Computation with Rational Players. 81-98 - Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai:
Concurrently Secure Computation in Constant Rounds. 99-116 - Tsz Hon Yuen, Sherman S. M. Chow, Ye Zhang, Siu-Ming Yiu:
Identity-Based Encryption Resilient to Continual Auxiliary Leakage. 117-134
Protocols
- Dominique Unruh:
Quantum Proofs of Knowledge. 135-152 - Alessandra Scafuro, Ivan Visconti:
On Round-Optimal Zero Knowledge in the Bare Public-Key Model. 153-171 - Gene S. Kopp, John D. Wiltshire-Gordon:
Robust Coin Flipping. 172-194 - Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, Yuval Rabani:
Unconditionally-Secure Robust Secret Sharing with Compact Shares. 195-208
Lossy Trapdoor Functions
- Dennis Hofheinz:
All-But-Many Lossy Trapdoor Functions. 209-227 - Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters:
Identity-Based (Lossy) Trapdoor Functions and Applications. 228-245 - Hoeteck Wee:
Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More. 246-262
Tools
- Stephanie Bayer, Jens Groth:
Efficient Zero-Knowledge Argument for Correctness of a Shuffle. 263-280 - Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Malleable Proof Systems and Applications. 281-300 - Masayuki Abe, Kristiyan Haralambiev, Miyako Ohkubo:
Group to Group Commitments Do Not Shrink. 301-317 - Allison B. Lewko:
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting. 318-335
Symmetric Constructions II
- Orr Dunkelman, Nathan Keller, Adi Shamir:
Minimalism in Cryptography: The Even-Mansour Scheme Revisited. 336-354 - Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, Daniel Wichs:
Message Authentication, Revisited. 355-374 - Omkant Pandey, Yannis Rouselakis:
Property Preserving Symmetric Encryption. 375-391
Symmetric Cryptanalysis
- Dmitry Khovratovich, Gaëtan Leurent, Christian Rechberger:
Narrow-Bicliques: Cryptanalysis of Full IDEA. 392-410 - Yu Sasaki:
Cryptanalyses on a Merkle-Damgård Based MAC - Almost Universal Forgery and Distinguishing-H Attacks. 411-427 - Amir Moradi:
Statistical Tools Flavor Side-Channel Collision Attacks. 428-445
Fully Homomorphic Encryption
- Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi:
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers. 446-464 - Craig Gentry, Shai Halevi, Nigel P. Smart:
Fully Homomorphic Encryption with Polylog Overhead. 465-482 - Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs:
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. 483-501
Asymmetric Cryptanalysis
- Yuanmi Chen, Phong Q. Nguyen:
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. 502-519 - Anja Becker, Antoine Joux, Alexander May, Alexander Meurer:
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. 520-536
Efficient Reductions
- Saqib A. Kakvi, Eike Kiltz:
Optimal Security Proofs for Full Domain Hash, Revisited. 537-553 - Yannick Seurin:
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model. 554-571 - Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi:
Tightly-Secure Signatures from Lossy Identification Schemes. 572-590
Public-Key Schemes
- Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption. 591-608 - Benoît Libert, Thomas Peters, Moti Yung:
Scalable Group Signatures with Revocation. 609-627 - Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. 628-644
Security Models
- Mihir Bellare, Rafael Dowsley, Brent Waters, Scott Yilek:
Standard Security Does Not Imply Security against Selective-Opening. 645-662 - Susan Hohenberger, Allison B. Lewko, Brent Waters:
Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security. 663-681 - Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam:
Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation. 682-699
Lattices
- Daniele Micciancio, Chris Peikert:
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. 700-718 - Abhishek Banerjee, Chris Peikert, Alon Rosen:
Pseudorandom Functions and Lattices. 719-737 - Vadim Lyubashevsky:
Lattice Signatures without Trapdoors. 738-755
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 2025-11-18 22:35 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:
