EUROCRYPT A*

34 papers

YearTitle / Authors
2011A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices.
Mathieu Renauld, François-Xavier Standaert, Nicolas Veyrat-Charvillon, Dina Kamel, Denis Flandre
2011Adaptive Pseudo-free Groups and Applications.
Dario Catalano, Dario Fiore, Bogdan Warinschi
2011Advances in Cryptology - EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19, 2011. Proceedings
Kenneth G. Paterson
2011Almost Optimum
Satoshi Obana
2011Careful with Composition: Limitations of the Indifferentiability Framework.
Thomas Ristenpart, Hovav Shacham, Thomas Shrimpton
2011Commuting Signatures and Verifiable Encryption.
Georg Fuchsbauer
2011Concurrent Composition in the Bounded Quantum Storage Model.
Dominique Unruh
2011Decentralizing Attribute-Based Encryption.
Allison B. Lewko, Brent Waters
2011Deniable Encryption with Negligible Detection Probability: An Interactive Construction.
Markus Dürmuth, David Mandell Freeman
2011Domain Extension for MACs Beyond the Birthday Barrier.
Yevgeniy Dodis, John P. Steinberger
2011Efficient Authentication from Hard Learning Problems.
Eike Kiltz, Krzysztof Pietrzak, David Cash, Abhishek Jain, Daniele Venturi
2011Efficient Circuit-Size Independent Public Key Encryption with KDM Security.
Tal Malkin, Isamu Teranishi, Moti Yung
2011Efficient Non-interactive Secure Computation.
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai
2011Faster Explicit Formulas for Computing Pairings over Ordinary Curves.
Diego F. Aranha, Koray Karabina, Patrick Longa, Catherine H. Gebotys, Julio López
2011Fully Leakage-Resilient Signatures.
Elette Boyle, Gil Segev, Daniel Wichs
2011Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption.
Yehuda Lindell
2011Homomorphic Signatures for Polynomial Functions.
Dan Boneh, David Mandell Freeman
2011Implementing Gentry's Fully-Homomorphic Encryption Scheme.
Craig Gentry, Shai Halevi
2011Improved Generic Algorithms for Hard Knapsacks.
Anja Becker, Jean-Sébastien Coron, Antoine Joux
2011Key-Dependent Message Security: Generic Amplification and Completeness.
Benny Applebaum
2011Lattice Reduction Algorithms: Theory and Practice.
Phong Q. Nguyen
2011Making NTRU as Secure as Worst-Case Problems over Ideal Lattices.
Damien Stehlé, Ron Steinfeld
2011On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN.
Gregor Leander
2011Pushing the Limits: A Very Compact and a Threshold Implementation of AES.
Amir Moradi, Axel Poschmann, San Ling, Christof Paar, Huaxiong Wang
2011Secret Keys from Channel Noise.
Hadi Ahmadi, Reihaneh Safavi-Naini
2011Secure Authentication from a Weak Key, without Leaking Information.
Niek J. Bouman, Serge Fehr
2011Semi-homomorphic Encryption and Multiparty Computation.
Rikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias
2011Statistical Attack on RC4 - Distinguishing WPA.
Pouyan Sepehrdad, Serge Vaudenay, Martin Vuagnoux
2011The Arithmetic Codex: Theory and Applications.
Ronald Cramer
2011Threshold and Revocation Cryptosystems via Extractable Hash Proofs.
Hoeteck Wee
2011Tight Proofs for Signature Schemes without Random Oracles.
Sven Schäge
2011Towards a Game Theoretic View of Secure Computation.
Gilad Asharov, Ran Canetti, Carmit Hazay
2011Two-Output Secure Computation with Malicious Adversaries.
Abhi Shelat, Chih-Hao Shen
2011Unbounded HIBE and Attribute-Based Encryption.
Allison B. Lewko, Brent Waters