EUROCRYPT A*

33 papers

YearTitle / Authors
2001A Memory Efficient Version of Satoh's Algorithm.
Frederik Vercauteren, Bart Preneel, Joos Vandewalle
2001A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures.
Masayuki Abe
2001Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding
Birgit Pfitzmann
2001An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.
Jan Camenisch, Anna Lysyanskaya
2001Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels.
Ran Canetti, Hugo Krawczyk
2001Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference.
Ahmad-Reza Sadeghi, Michael Steiner
2001Cryptanalysis of Reduced-Round MISTY.
Ulrich Kühn
2001Cryptographic Counters and Applications to Electronic Voting.
Jonathan Katz, Steven A. Myers, Rafail Ostrovsky
2001Does Encryption with Redundancy Provide Authenticity?
Jee Hea An, Mihir Bellare
2001Efficient Amplification of the Security of Weak Pseudo-random Function Generators.
Steven A. Myers
2001Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords.
Jonathan Katz, Rafail Ostrovsky, Moti Yung
2001Efficient and Non-interactive Non-malleable Commitment.
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith
2001Encryption Modes with Almost Free Message Integrity.
Charanjit S. Jutla
2001Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems.
Eric R. Verheul
2001Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy.
Mireille Fouquet, Pierrick Gaudry, Robert Harley
2001Hash Functions: From Merkle-Damgård to Shoup.
Ilya Mironov
2001How Secure Are Elliptic Curves over Composite Extension Fields?
Nigel P. Smart
2001How to Convert the Flavor of a Quantum Bit Commitment.
Claude Crépeau, Frédéric Légaré, Louis Salvail
2001Hyper-bent Functions.
Amr M. Youssef, Guang Gong
2001Identification Protocols Secure against Reset Attacks.
Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali
2001Key Recovery and Message Attacks on NTRU-Composite.
Craig Gentry
2001Lower Bounds for Multicast Message Authentication.
Dan Boneh, Glenn Durfee, Matthew K. Franklin
2001Min-round Resettable Zero-Knowledge in the Public-Key Model.
Silvio Micali, Leonid Reyzin
2001Multiparty Computation from Threshold Homomorphic Encryption.
Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen
2001NSS: An NTRU Lattice-Based Signature Scheme.
Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
2001New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.
Liam Keliher, Henk Meijer, Stafford E. Tavares
2001On Adaptive vs. Non-adaptive Security of Multiparty Protocols.
Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin
2001On Perfect and Adaptive Security in Exposure-Resilient Cryptography.
Yevgeniy Dodis, Amit Sahai, Adam D. Smith
2001Practical Threshold RSA Signatures without a Trusted Dealer.
Ivan Damgård, Maciej Koprowski
2001Priced Oblivious Transfer: How to Sell Digital Goods.
William Aiello, Yuval Ishai, Omer Reingold
2001Structural Cryptanalysis of SASAS.
Alex Biryukov, Adi Shamir
2001The Bit Security of Paillier's Encryption Scheme and Its Applications.
Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham
2001The Rectangle Attack - Rectangling the Serpent.
Eli Biham, Orr Dunkelman, Nathan Keller