Cryptographers' World
 

CRYPTO 2000


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

 
Mihir Bellare, editor, Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings. Springer, 2000. ISBN 3-540-67907-3.
[Papers]

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



Arjen K. Lenstra,  Eric R. Verheul,  The XTR Public Key System, pp. 1 - 19, CRYPTO 2000.

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

Éliane Jaulmes,  Antoine Joux,  A Chosen-Ciphertext Attack against NTRU, pp. 20 - 35, CRYPTO 2000.

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

Yehuda Lindell,  Benny Pinkas,  Privacy Preserving Data Mining, pp. 36 - 54, CRYPTO 2000.

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

Amos Beimel,  Yuval Ishai,  Tal Malkin,  Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing, pp. 55 - 73, CRYPTO 2000.

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

Yevgeniy Dodis,  Silvio Micali,  Parallel Reducibility for Information-Theoretically Secure Computation, pp. 74 - 92, CRYPTO 2000.

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

Christian Cachin,  Jan Camenisch,  Optimistic Fair Secure Computation, pp. 93 - 111, CRYPTO 2000.

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

Yevgeniy Dodis,  Shai Halevi,  Tal Rabin,  A Cryptographic Solution to a Game Theoretic Problem, pp. 112 - 130, CRYPTO 2000.

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

Ingrid Biehl,  Bernd Meyer,  Volker Müller,  Differential Fault Attacks on Elliptic Curve Cryptosystems, pp. 131 - 146, CRYPTO 2000.

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

Tatsuaki Okamoto,  Keisuke Tanaka,  Shigenori Uchiyama,  Quantum Public-Key Cryptosystems, pp. 147 - 165, CRYPTO 2000.

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

Ki Hyoung Ko,  Sangjin Lee,  Jung Hee Cheon,  Jae Woo Han,  Ju-Sung Kang,  Choonsik Park,  New Public-Key Cryptosystem Using Braid Groups, pp. 166 - 183, CRYPTO 2000.

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

Don Coppersmith,  Lars R. Knudsen,  Chris J. Mitchell,  Key Recovery and Forgery Attacks on the MacDES MAC Algorithm, pp. 184 - 196, CRYPTO 2000.

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

John Black,  Phillip Rogaway,  CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions, pp. 197 - 215, CRYPTO 2000.

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

Michael Semanko,  L-collision Attacks against Randomized MACs, pp. 216 - 228, CRYPTO 2000.

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

Jean-Sébastien Coron,  On the Exact Security of Full Domain Hash, pp. 229 - 235, CRYPTO 2000.

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

Dan Boneh,  Moni Naor,  Timed Commitments, pp. 236 - 254, CRYPTO 2000.

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

Giuseppe Ateniese,  Jan Camenisch,  Marc Joye,  Gene Tsudik,  A Practical and Provably Secure Coalition-Resistant Group Signature Scheme, pp. 255 - 270, CRYPTO 2000.

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

Masayuki Abe,  Tatsuaki Okamoto,  Provably Secure Partially Blind Signatures, pp. 271 - 286, CRYPTO 2000.

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

Rainer Steinwandt,  Markus Grassl,  Willi Geiselmann,  Thomas Beth,  Weaknesses in the SL2(F2n) Hashing Scheme , pp. 287 - 299, CRYPTO 2000.

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

Thomas Johansson,  Fredrik Jönsson,  Fast Correlation Attacks through Reconstruction of Linear Polynomials, pp. 300 - 315, CRYPTO 2000.

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

Reihaneh Safavi-Naini,  Yejing Wang,  Sequential Traitor Tracing, pp. 316 - 332, CRYPTO 2000.

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

Juan A. Garay,  Jessica Staddon,  Avishai Wool,  Long-Lived Broadcast Encryption, pp. 333 - 352, CRYPTO 2000.

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

Martín Abadi,  Taming the Adversary, pp. 353 - 358, CRYPTO 2000.

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

Anand Desai,  The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search, pp. 359 - 375, CRYPTO 2000.

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

Zulfikar Ramzan,  Leonid Reyzin,  On the Round Security of Symmetric-Key Cryptographic Primitives, pp. 376 - 393, CRYPTO 2000.

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

Anand Desai,  New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack, pp. 394 - 412, CRYPTO 2000.

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

Marc Fischlin,  Roger Fischlin,  Efficient Non-malleable Commitment Schemes, pp. 413 - 431, CRYPTO 2000.

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

Ivan Damgard,  Jesper Buus Nielsen,  Improved Non-committing Encryption Schemes Based on a General Complexity Assumption, pp. 432 - 450, CRYPTO 2000.

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

Alon Rosen,  A Note on the Round-Complexity of Concurrent Zero-Knowledge, pp. 451 - 468, CRYPTO 2000.

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

Rosario Gennaro,  An Improved Pseudo-random Generator Based on Discrete Log, pp. 469 - 481, CRYPTO 2000.

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

Nicolas Gisin,  Stefan Wolf,  Linking Classical and Quantum Key Agreement: Is There ``Bound Information''?, pp. 482 - 500, CRYPTO 2000.

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

Muxiang Zhang,  Agnes Hui Chan,  Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers, pp. 501 - 514, CRYPTO 2000.

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

Palash Sarkar,  Subhamoy Maitra,  Nonlinearity Bounds and Constructions of Resilient Boolean Functions, pp. 515 - 532, CRYPTO 2000.

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

Jürgen Bierbrauer,  Holger Schellwat,  Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications, pp. 533 - 544, CRYPTO 2000.

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



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