The SCEAS System
Navigation Menu

Conferences in DBLP

EUROCRYPT (eurocrypt)
2001 (conf/eurocrypt/2001)

  1. Frederik Vercauteren, Bart Preneel, Joos Vandewalle
    A Memory Efficient Version of Satoh's Algorithm. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:1-13 [Conf]
  2. Mireille Fouquet, Pierrick Gaudry, Robert Harley
    Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:14-29 [Conf]
  3. Nigel P. Smart
    How Secure Are Elliptic Curves over Composite Extension Fields? [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:30-39 [Conf]
  4. Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Efficient and Non-interactive Non-malleable Commitment. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:40-59 [Conf]
  5. Claude Crépeau, Frédéric Légaré, Louis Salvail
    How to Convert the Flavor of a Quantum Bit Commitment. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:60-77 [Conf]
  6. Jonathan Katz, Steven Myers, Rafail Ostrovsky
    Cryptographic Counters and Applications to Electronic Voting. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:78-92 [Conf]
  7. Jan Camenisch, Anna Lysyanskaya
    An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:93-118 [Conf]
  8. William Aiello, Yuval Ishai, Omer Reingold
    Priced Oblivious Transfer: How to Sell Digital Goods. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:119-135 [Conf]
  9. Masayuki Abe
    A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:136-151 [Conf]
  10. Ivan Damgård, Maciej Koprowski
    Practical Threshold RSA Signatures without a Trusted Dealer. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:152-165 [Conf]
  11. Ilya Mironov
    Hash Functions: From Merkle-Damgård to Shoup. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:166-181 [Conf]
  12. Craig Gentry
    Key Recovery and Message Attacks on NTRU-Composite. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:182-194 [Conf]
  13. Eric R. Verheul
    Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:195-210 [Conf]
  14. Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
    NSS: An NTRU Lattice-Based Signature Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:211-228 [Conf]
  15. Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham
    The Bit Security of Paillier's Encryption Scheme and Its Applications. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:229-243 [Conf]
  16. Ahmad-Reza Sadeghi, Michael Steiner
    Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:244-261 [Conf]
  17. Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin
    On Adaptive vs. Non-adaptive Security of Multiparty Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:262-279 [Conf]
  18. Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen
    Multiparty Computation from Threshold Homomorphic Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:280-299 [Conf]
  19. Yevgeniy Dodis, Amit Sahai, Adam Smith
    On Perfect and Adaptive Security in Exposure-Resilient Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:301-324 [Conf]
  20. Ulrich Kühn
    Cryptanalysis of Reduced-Round MISTY. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:325-339 [Conf]
  21. Eli Biham, Orr Dunkelman, Nathan Keller
    The Rectangle Attack - Rectangling the Serpent. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:340-357 [Conf]
  22. Steven Myers
    Efficient Amplification of the Security of Weak Pseudo-random Function Generators. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:358-372 [Conf]
  23. Silvio Micali, Leonid Reyzin
    Min-round Resettable Zero-Knowledge in the Public-Key Model. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:373-393 [Conf]
  24. Alex Biryukov, Adi Shamir
    Structural Cryptanalysis of SASAS. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:394-405 [Conf]
  25. Amr M. Youssef, Guang Gong
    Hyper-bent Functions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:406-419 [Conf]
  26. Liam Keliher, Henk Meijer, Stafford E. Tavares
    New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:420-436 [Conf]
  27. Dan Boneh, Glenn Durfee, Matthew K. Franklin
    Lower Bounds for Multicast Message Authentication. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:437-452 [Conf]
  28. Ran Canetti, Hugo Krawczyk
    Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:453-474 [Conf]
  29. Jonathan Katz, Rafail Ostrovsky, Moti Yung
    Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:475-494 [Conf]
  30. Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali
    Identification Protocols Secure against Reset Attacks. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:495-511 [Conf]
  31. Jee Hea An, Mihir Bellare
    Does Encryption with Redundancy Provide Authenticity? [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:512-528 [Conf]
  32. Charanjit S. Jutla
    Encryption Modes with Almost Free Message Integrity. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:529-544 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002