Cryptographers' World
 

CRYPTO 2002


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

 
Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings. Springer, 2002. ISBN 3-540-44050-X.
[Papers]

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



Sean Murphy,  Matthew J. B. Robshaw,  Essential Algebraic Structure within the AES, pp. 1 - 16, CRYPTO 2002.

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

Antoine Joux,  Gwenaëlle Martinet,  Frédéric Valette,  Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Models: CBC, GEM, IACBC, pp. 17 - 30, CRYPTO 2002.

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

Moses Liskov,  Ronald L. Rivest,  David Wagner,  Tweakable Block Ciphers, pp. 31 - 46, CRYPTO 2002.

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

Dani Halevy,  Adi Shamir,  The LSD Broadcast Encryption Scheme, pp. 47 - 60, CRYPTO 2002.

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

Jan Camenisch,  Anna Lysyanskaya,  Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials, pp. 61 - 76, CRYPTO 2002.

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

Nicholas J. Hopper,  John Langford,  Luis von Ahn,  Provably Secure Steganography, pp. 77 - 92, CRYPTO 2002.

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

Jacques Stern,  David Pointcheval,  John Malone-Lee,  Nigel P. Smart,  Flaws in Applying Proof Methodologies to Signature Schemes, pp. 93 - 110, CRYPTO 2002.

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

Jesper Buus Nielsen,  Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case, pp. 111 - 126, CRYPTO 2002.

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

Jakob Jonsson,  Burton S. Kaliski Jr.,  On the Security of RSA Encryption in TLS, pp. 127 - 142, CRYPTO 2002.

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

Ran Canetti,  Hugo Krawczyk,  Security Analysis of IKE's Signature-Based Key-Exchange Protocol, pp. 143 - 161, CRYPTO 2002.

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

Mihir Bellare,  Adriana Palacio,  GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks, pp. 162 - 177, CRYPTO 2002.

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

Rosario Gennaro,  Yuval Ishai,  Eyal Kushilevitz,  Tal Rabin,  On 2-Round Secure Multiparty Computation, pp. 178 - 193, CRYPTO 2002.

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

Markus Bläser,  Andreas Jakoby,  Maciej Liskiewicz,  Bodo Siebert,  Private Computation - k-Connected versus 1-Connected Networks, pp. 194 - 209, CRYPTO 2002.

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

Phong Q. Nguyen,  David Pointcheval,  Analysis and Improvements of NTRU Encryption Paddings, pp. 210 - 225, CRYPTO 2002.

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

Jean-Sébastien Coron,  Marc Joye,  David Naccache,  Pascal Paillier,  Universal Padding Schemes for RSA, pp. 226 - 241, CRYPTO 2002.

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

Alexander May,  Cryptanalysis of Unbalanced RSA with Small CRT-Exponent, pp. 242 - 256, CRYPTO 2002.

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

Chi-Jen Lu,  Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors, pp. 257 - 271, CRYPTO 2002.

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

Ronald Cramer,  Serge Fehr,  Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups, pp. 272 - 287, CRYPTO 2002.

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

David Wagner,  A Generalized Birthday Problem, pp. 288 - 303, CRYPTO 2002.

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

Ilya Mironov,  (Not So) Random Shuffles of RC4, pp. 304 - 319, CRYPTO 2002.

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

John Black,  Phillip Rogaway,  Thomas Shrimpton,  Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV, pp. 320 - 335, CRYPTO 2002.

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

Karl Rubin,  Alice Silverberg,  Supersingular Abelian Varieties in Cryptology, pp. 336 - 353, CRYPTO 2002.

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

Paulo S. L. M. Barreto,  Hae Yong Kim,  Ben Lynn,  Michael Scott,  Efficient Algorithms for Pairing-Based Cryptosystems, pp. 354 - 368, CRYPTO 2002.

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

Frederik Vercauteren,  Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2, pp. 369 - 384, CRYPTO 2002.

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

Philip D. MacKenzie,  Thomas Shrimpton,  Markus Jakobsson,  Threshold Password-Authenticated Key Exchange, pp. 385 - 400, CRYPTO 2002.

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

Jesper Buus Nielsen,  A Threshold Pseudorandom Function Construction and Its Applications, pp. 401 - 416, CRYPTO 2002.

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

Joy Algesheimer,  Jan Camenisch,  Victor Shoup,  Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products, pp. 417 - 432, CRYPTO 2002.

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

Wen-Ching W. Li,  Mats Näslund,  Igor Shparlinski,  Hidden Number Problem with the Trace and Bit Security of XTR and LUC, pp. 433 - 448, CRYPTO 2002.

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

Ivan Damgard,  Jesper Buus Nielsen,  Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security, pp. 449 - 464, CRYPTO 2002.

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

Emmanuel Bresson,  Jacques Stern,  Michael Szydlo,  Threshold Ring Signatures and Applications to Ad-hoc Groups, pp. 465 - 480, CRYPTO 2002.

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

Moni Naor,  Deniable Ring Authentication, pp. 481 - 498, CRYPTO 2002.

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

Gene Itkis,  Leonid Reyzin,  SiBIR: Signer-Base Intrusion-Resilient Signatures, pp. 499 - 514, CRYPTO 2002.

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

Don Coppersmith,  Shai Halevi,  Charanjit S. Jutla,  Cryptanalysis of Stream Ciphers with Linear Masking, pp. 515 - 532, CRYPTO 2002.

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

Palash Sarkar,  The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers, pp. 533 - 548, CRYPTO 2002.

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

Claude Carlet,  A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction, pp. 549 - 564, CRYPTO 2002.

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

Serge Fehr,  Ueli M. Maurer,  Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks, pp. 565 - 580, CRYPTO 2002.

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

Ivan Damgard,  Jesper Buus Nielsen,  Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor, pp. 581 - 596, CRYPTO 2002.

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

Anna Lysyanskaya,  Unique Signatures and Verifiable Random Functions from the DH-DDH Separation, pp. 597 - 612, CRYPTO 2002.

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

Jean-Sébastien Coron,  Security Proof for Partial-Domain Hash Signature Schemes, pp. 613 - 626, CRYPTO 2002.

[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...