default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROCRYPT 2011: Tallinn, Estonia
- Kenneth G. Paterson:
Advances in Cryptology - EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19, 2011. Proceedings. Lecture Notes in Computer Science 6632, Springer 2011, ISBN 978-3-642-20464-7
Invited Talks
- Ronald Cramer:
The Arithmetic Codex: Theory and Applications. 1 - Phong Q. Nguyen:
Lattice Reduction Algorithms: Theory and Practice. 2-6
Lattice-Based Cryptography
- Eike Kiltz
, Krzysztof Pietrzak, David Cash, Abhishek Jain, Daniele Venturi:
Efficient Authentication from Hard Learning Problems. 7-26 - Damien Stehlé, Ron Steinfeld:
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. 27-47
Implementation and Side Channels
- Diego F. Aranha, Koray Karabina, Patrick Longa, Catherine H. Gebotys, Julio López:
Faster Explicit Formulas for Computing Pairings over Ordinary Curves. 48-68 - Amir Moradi, Axel Poschmann, San Ling, Christof Paar, Huaxiong Wang:
Pushing the Limits: A Very Compact and a Threshold Implementation of AES. 69-88 - Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. 89-108 - Mathieu Renauld, François-Xavier Standaert, Nicolas Veyrat-Charvillon, Dina Kamel, Denis Flandre:
A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices. 109-128
Homomorphic Cryptography
- Craig Gentry, Shai Halevi:
Implementing Gentry's Fully-Homomorphic Encryption Scheme. 129-148 - Dan Boneh, David Mandell Freeman:
Homomorphic Signatures for Polynomial Functions. 149-168 - Rikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias:
Semi-homomorphic Encryption and Multiparty Computation. 169-188
Signature Schemes
- Sven Schäge:
Tight Proofs for Signature Schemes without Random Oracles. 189-206 - Dario Catalano, Dario Fiore, Bogdan Warinschi:
Adaptive Pseudo-free Groups and Applications. 207-223 - Georg Fuchsbauer:
Commuting Signatures and Verifiable Encryption. 224-245
Information-Theoretic Cryptography
- Niek J. Bouman, Serge Fehr:
Secure Authentication from a Weak Key, without Leaking Information. 246-265 - Hadi Ahmadi, Reihaneh Safavi-Naini:
Secret Keys from Channel Noise. 266-283 - Satoshi Obana:
Almost Optimum t-Cheater Identifiable Secret Sharing Schemes. 284-302
Symmetric Key Cryptography
- Gregor Leander:
On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN. 303-322 - Yevgeniy Dodis, John P. Steinberger:
Domain Extension for MACs Beyond the Birthday Barrier. 323-342
Attacks and Algorithms
- Pouyan Sepehrdad, Serge Vaudenay, Martin Vuagnoux:
Statistical Attack on RC4 - Distinguishing WPA. 343-363 - Anja Becker, Jean-Sébastien Coron, Antoine Joux:
Improved Generic Algorithms for Hard Knapsacks. 364-385
Secure Computation
- Abhi Shelat, Chih-Hao Shen:
Two-Output Secure Computation with Malicious Adversaries. 386-405 - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai:
Efficient Non-interactive Secure Computation. 406-425 - Gilad Asharov, Ran Canetti, Carmit Hazay:
Towards a Game Theoretic View of Secure Computation. 426-445 - Yehuda Lindell:
Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption. 446-466
Composability
- Dominique Unruh:
Concurrent Composition in the Bounded Quantum Storage Model. 467-486 - Thomas Ristenpart, Hovav Shacham, Thomas Shrimpton:
Careful with Composition: Limitations of the Indifferentiability Framework. 487-506
Key Dependent Message Security
- Tal Malkin, Isamu Teranishi, Moti Yung:
Efficient Circuit-Size Independent Public Key Encryption with KDM Security. 507-526 - Benny Applebaum:
Key-Dependent Message Security: Generic Amplification and Completeness. 527-546
Public Key Encryption
- Allison B. Lewko, Brent Waters:
Unbounded HIBE and Attribute-Based Encryption. 547-567 - Allison B. Lewko, Brent Waters:
Decentralizing Attribute-Based Encryption. 568-588 - Hoeteck Wee:
Threshold and Revocation Cryptosystems via Extractable Hash Proofs. 589-609 - Markus Dürmuth, David Mandell Freeman:
Deniable Encryption with Negligible Detection Probability: An Interactive Construction. 610-626
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 2024-11-28 20:16 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:
