Cryptographers' World
 

CRYPTO 2001


[Sort by page number] [Sort by citations count]

 
Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings. Springer, 2001. ISBN 3-540-42456-3.
[Papers]

Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia.



Boaz Barak,  Oded Goldreich,  Russell Impagliazzo,  Steven Rudich,  Amit Sahai,  Salil P. Vadhan,  Ke Yang,  On the (Im)possibility of Obfuscating Programs, pp. 1 - 18, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 441 times Red StarRed StarRed Star]

Ran Canetti,  Marc Fischlin,  Universally Composable Commitments, pp. 19 - 40, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 254 times Red StarRed StarRed Star]

Dalit Naor,  Moni Naor,  Jeffery Lotspiech,  Revocation and Tracing Schemes for Stateless Receivers, pp. 41 - 62, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 488 times Red StarRed StarRed Star]

Aggelos Kiayias,  Moti Yung,  Self Protecting Pirates and Black-Box Traitor Tracing, pp. 63 - 79, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 49 times ]

Matthias Fitzi,  Juan A. Garay,  Ueli M. Maurer,  Rafail Ostrovsky,  Minimal Complete Primitives for Secure Multi-party Computation, pp. 80 - 100, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 20 times ]

Martin Hirt,  Ueli M. Maurer,  Robustness for Free in Unconditional Multi-party Computation, pp. 101 - 118, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 57 times Red Star]

Ronald Cramer,  Ivan Damgard,  Secure Distributed Linear Algebra in a Constant Number of Rounds, pp. 119 - 136, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 46 times ]

Philip D. MacKenzie,  Michael K. Reiter,  Two-Party Generation of DSA Signatures, pp. 137 - 154, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 53 times Red Star]

Yan Zong Ding,  Oblivious Transfer in the Bounded Storage Model, pp. 155 - 170, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 34 times ]

Yehuda Lindell,  Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation, pp. 171 - 189, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 100 times Red StarRed Star]

Robert P. Gallant,  Robert J. Lambert,  Scott A. Vanstone,  Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms, pp. 190 - 200, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 124 times Red StarRed Star]

Dan Boneh,  Igor Shparlinski,  On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme, pp. 201 - 212, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 30 times ]

Dan Boneh,  Matthew K. Franklin,  Identity-Based Encryption from the Weil Pairing, pp. 213 - 229, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 2977 times Red StarRed StarRed StarRed StarRed StarRed Star]

James Manger,  A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0, pp. 230 - 238, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 80 times Red Star]

Victor Shoup,  OAEP Reconsidered, pp. 239 - 259, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 376 times Red StarRed StarRed Star]

Eiichiro Fujisaki,  Tatsuaki Okamoto,  David Pointcheval,  Jacques Stern,  RSA-OAEP Is Secure under the RSA Assumption, pp. 260 - 274, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 277 times Red StarRed StarRed Star]

Dan Boneh,  Simplified OAEP for the RSA and Rabin Functions, pp. 275 - 291, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 102 times Red StarRed Star]

Mihir Bellare,  Alexandra Boldyreva,  Lars R. Knudsen,  Chanathip Namprempre,  Online Ciphers and the Hash-CBC Construction, pp. 292 - 309, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 21 times ]

Hugo Krawczyk,  The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?), pp. 310 - 331, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 195 times Red StarRed Star]

Gene Itkis,  Leonid Reyzin,  Forward-Secure Signatures with Optimal Signing and Verifying, pp. 332 - 354, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 177 times Red StarRed Star]

Adi Shamir,  Yael Tauman,  Improved Online/Offline Signature Schemes, pp. 355 - 367, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 168 times Red StarRed Star]

Jun Furukawa,  Kazue Sako,  An Efficient Scheme for Proving a Shuffle, pp. 368 - 387, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 180 times Red StarRed Star]

Jan Camenisch,  Anna Lysyanskaya,  An Identity Escrow Scheme with Appointed Verifiers, pp. 388 - 407, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 39 times ]

Oded Goldreich,  Yehuda Lindell,  Session-Key Generation Using Human Passwords Only, pp. 408 - 432, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 154 times Red StarRed Star]

Eric Brier,  Christophe Clavier,  Jean-Sébastien Coron,  David Naccache,  Cryptanalysis of RSA Signatures with Fixed-Pattern Padding, pp. 433 - 439, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 16 times ]

Jovan Dj. Golic,  Correlation Analysis of the Shrinking Generator, pp. 440 - 457, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 32 times ]

Jung Hee Cheon,  Nonlinear Vector Resilient Functions, pp. 458 - 469, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 32 times ]

Seong-Hun Paeng,  Kil-Chan Ha,  Jae Heon Kim,  Seongtaek Chee,  Choonsik Park,  New Public Key Cryptosystem Using Finite Non Abelian Groups, pp. 470 - 485, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 33 times ]

Eonkyung Lee,  Sangjin Lee,  Sang Geun Hahn,  Pseudorandomness from Braid Groups, pp. 486 - 502, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 25 times ]

Ronald Cramer,  Ivan Damgard,  Serge Fehr,  On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase, pp. 503 - 523, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 14 times ]

Christian Cachin,  Klaus Kursawe,  Frank Petzold,  Victor Shoup,  Secure and Efficient Asynchronous Broadcast Protocols, pp. 524 - 541, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 101 times Red StarRed Star]

Silvio Micali,  Leonid Reyzin,  Soundness in the Public-Key Model, pp. 542 - 565, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 55 times Red Star]

Alfredo De Santis,  Giovanni Di Crescenzo,  Rafail Ostrovsky,  Giuseppe Persiano,  Amit Sahai,  Robust Non-interactive Zero Knowledge, pp. 566 - 598, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 111 times Red StarRed Star]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...