Cryptographers' World
 

Highly Cited Conference Papers

 
1.   Taher El Gamal,  A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, pp. 10 - 18, CRYPTO 1984.

[Electronic Edition][Cited 3315 times Red StarRed StarRed StarRed StarRed StarRed Star]
2.   Ronald L. Rivest,  The MD4 Message Digest Algorithm, pp. 303 - 311, CRYPTO 1990.

[Electronic Edition][Cited 3030 times Red StarRed StarRed StarRed StarRed StarRed Star]
3.   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 2248 times Red StarRed StarRed StarRed StarRed Star]
4.   Adi Shamir,  Identity-Based Cryptosystems and Signature Schemes, pp. 47 - 53, CRYPTO 1984.

[Electronic Edition][Cited 1610 times Red StarRed StarRed StarRed StarRed Star]
5.   Paul C. Kocher,  Joshua Jaffe,  Benjamin Jun,  Differential Power Analysis, pp. 388 - 397, CRYPTO 1999.

[Electronic Edition][Cited 1508 times Red StarRed StarRed StarRed StarRed Star]
6.   Victor S. Miller,  Use of Elliptic Curves in Cryptography, pp. 417 - 426, CRYPTO 1985.

[Electronic Edition][Cited 1438 times Red StarRed StarRed StarRed StarRed Star]
7.   Amos Fiat,  Adi Shamir,  How to Prove Yourself: Practical Solutions to Identification and Signature Problems, pp. 186 - 194, CRYPTO 1986.

[Electronic Edition][Cited 1398 times Red StarRed StarRed StarRed StarRed Star]
8.   David Chaum,  Blind Signatures for Untraceable Payments, pp. 199 - 203, CRYPTO 1982.

[Electronic Edition][Cited 1272 times Red StarRed StarRed StarRed StarRed Star]
9.   Paul C. Kocher,  Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, pp. 104 - 113, CRYPTO 1996.

[Electronic Edition][Cited 1118 times Red StarRed StarRed StarRed StarRed Star]
10.   Mitsuru Matsui,  Linear Cryptanalysis Method for DES Cipher, pp. 386 - 397, EUROCRYPT 1993.

[Electronic Edition][Cited 1028 times Red StarRed StarRed StarRed StarRed Star]
11.   Dan Boneh,  Ben Lynn,  Hovav Shacham,  Short Signatures from the Weil Pairing, pp. 514 - 532, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 1011 times Red StarRed StarRed StarRed StarRed Star]
12.   Eli Biham,  Adi Shamir,  Differential Cryptanalysis of DES-like Cryptosystems, pp. 2 - 21, CRYPTO 1990.

[Electronic Edition][Cited 974 times Red StarRed StarRed StarRed Star]
13.   Yehuda Lindell,  Benny Pinkas,  Privacy Preserving Data Mining, pp. 36 - 54, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 963 times Red StarRed StarRed StarRed Star]
14.   David Chaum,  Amos Fiat,  Moni Naor,  Untraceable Electronic Cash, pp. 319 - 327, CRYPTO 1988.

[Electronic Edition][Cited 758 times Red StarRed StarRed StarRed Star]
15.   Pascal Paillier,  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, pp. 223 - 238, EUROCRYPT 1999.

[Electronic Edition][Cited 749 times Red StarRed StarRed StarRed Star]
16.   Mihir Bellare,  Phillip Rogaway,  Entity Authentication and Key Distribution, pp. 232 - 249, CRYPTO 1993.

[Electronic Edition][Cited 702 times Red StarRed StarRed StarRed Star]
17.   David Chaum,  Eugène van Heyst,  Group Signatures, pp. 257 - 265, EUROCRYPT 1991.

[Electronic Edition][Cited 702 times Red StarRed StarRed StarRed Star]
18.   Mihir Bellare,  Phillip Rogaway,  Optimal Asymmetric Encryption, pp. 92 - 111, EUROCRYPT 1994.

[Electronic Edition][Cited 677 times Red StarRed StarRed StarRed Star]
19.   Dan Boneh,  James Shaw,  Collusion-Secure Fingerprinting for Digital Data (Extended Abstract), pp. 452 - 465, CRYPTO 1995.

[Electronic Edition][Cited 672 times Red StarRed StarRed StarRed Star]
20.   Mihir Bellare,  Ran Canetti,  Hugo Krawczyk,  Keying Hash Functions for Message Authentication, pp. 1 - 15, CRYPTO 1996.

[Electronic Edition][Cited 664 times Red StarRed StarRed StarRed Star]
21.   Ronald Cramer,  Victor Shoup,  A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack, pp. 13 - 25, CRYPTO 1998.

[Electronic Edition][Cited 659 times Red StarRed StarRed StarRed Star]
22.   Scott R. Fluhrer,  Itsik Mantin,  Adi Shamir,  Weaknesses in the Key Scheduling Algorithm of RC4, pp. 1 - 24, SAC 2001.

[Electronic Edition][Cited 646 times Red StarRed StarRed StarRed Star]
23.   Yvo Desmedt,  Yair Frankel,  Threshold Cryptosystems, pp. 307 - 315, CRYPTO 1989.

[Electronic Edition][Cited 646 times Red StarRed StarRed StarRed Star]
24.   Shimon Even,  Oded Goldreich,  Abraham Lempel,  A Randomized Protocol for Signing Contracts, pp. 205 - 210, CRYPTO 1982.

[Electronic Edition][Cited 642 times Red StarRed StarRed StarRed Star]
25.   Torben P. Pedersen,  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, pp. 129 - 140, CRYPTO 1991.

[Electronic Edition][Cited 641 times Red StarRed StarRed StarRed Star]
26.   Claus-Peter Schnorr,  Efficient Identification and Signatures for Smart Cards, pp. 239 - 252, CRYPTO 1989.

[Electronic Edition][Cited 636 times Red StarRed StarRed StarRed Star]
27.   David Chaum,  Torben P. Pedersen,  Wallet Databases with Observers, pp. 89 - 105, CRYPTO 1992.

[Electronic Edition][Cited 601 times Red StarRed StarRed StarRed Star]
28.   Amos Fiat,  Moni Naor,  Broadcast Encryption, pp. 480 - 491, CRYPTO 1993.

[Electronic Edition][Cited 599 times Red StarRed StarRed StarRed Star]
29.   Fred Piper,  Stream Ciphers, pp. 181 - 188, EUROCRYPT 1982.

[Electronic Edition][Cited 590 times Red StarRed StarRed StarRed Star]
30.   Arjen K. Lenstra,  Eric R. Verheul,  Selecting Cryptographic Key Sizes, pp. 446 - 465, PKC 2000.

[Electronic Edition][Cited 586 times Red StarRed StarRed StarRed Star]
31.   Charles H. Bennett,  François Bessette,  Gilles Brassard,  Louis Salvail,  John A. Smolin,  Experimental Quantum Cryptography, pp. 253 - 265, EUROCRYPT 1990.

[Electronic Edition][Cited 569 times Red StarRed StarRed StarRed Star]
32.   Mihir Bellare,  Anand Desai,  David Pointcheval,  Phillip Rogaway,  Relations Among Notions of Security for Public-Key Encryption Schemes, pp. 26 - 45, CRYPTO 1998.

[Electronic Edition][Cited 566 times Red StarRed StarRed StarRed Star]
33.   Ronald L. Rivest,  The RC5 Encryption Algorithm, pp. 86 - 96, FSE 1994.

[Electronic Edition][Cited 545 times Red StarRed StarRed StarRed Star]
34.   Jan Camenisch,  Markus Stadler,  Efficient Group Signature Schemes for Large Groups (Extended Abstract), pp. 410 - 424, CRYPTO 1997.

[Electronic Edition][Cited 531 times Red StarRed StarRed StarRed Star]
35.   Ralph C. Merkle,  A Certified Digital Signature, pp. 218 - 238, CRYPTO 1989.

[Electronic Edition][Cited 523 times Red StarRed StarRed StarRed Star]
36.   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 516 times Red StarRed StarRed StarRed Star]
37.   Stefan Brands,  Untraceable Off-line Cash in Wallets with Observers (Extended Abstract), pp. 302 - 318, CRYPTO 1993.

[Electronic Edition][Cited 509 times Red StarRed StarRed StarRed Star]
38.   Carlo Blundo,  Alfredo De Santis,  Amir Herzberg,  Shay Kutten,  Ugo Vaccaro,  Moti Yung,  Perfectly-Secure Key Distribution for Dynamic Conferences, pp. 471 - 486, CRYPTO 1992.

[Electronic Edition][Cited 502 times Red StarRed StarRed StarRed Star]
39.   Charles Rackoff,  Daniel R. Simon,  Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack, pp. 433 - 444, CRYPTO 1991.

[Electronic Edition][Cited 495 times Red StarRed StarRed Star]
40.   MartĂ­n Abadi,  Michael Burrows,  Butler W. Lampson,  Gordon D. Plotkin,  A Calculus for Access Control in Distributed Systems, pp. 1 - 23, CRYPTO 1991.

[Electronic Edition][Cited 481 times Red StarRed StarRed Star]
41.   Xiaoyun Wang,  Yiqun Lisa Yin,  Hongbo Yu,  Finding Collisions in the Full SHA-1, pp. 17 - 36, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 476 times Red StarRed StarRed Star]
42.   Mike Burmester,  Yvo Desmedt,  A Secure and Efficient Conference Key Distribution System (Extended Abstract), pp. 275 - 286, EUROCRYPT 1994.

[Electronic Edition][Cited 476 times Red StarRed StarRed Star]
43.   Mihir Bellare,  Phillip Rogaway,  The Exact Security of Digital Signatures - How to Sign with RSA and Rabin, pp. 399 - 416, EUROCRYPT 1996.

[Electronic Edition][Cited 473 times Red StarRed StarRed Star]
44.   David Pointcheval,  Jacques Stern,  Security Proofs for Signature Schemes, pp. 387 - 398, EUROCRYPT 1996.

[Electronic Edition][Cited 470 times Red StarRed StarRed Star]
45.   Mihir Bellare,  David Pointcheval,  Phillip Rogaway,  Authenticated Key Exchange Secure against Dictionary Attacks, pp. 139 - 155, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 467 times Red StarRed StarRed Star]
46.   Dan Boneh,  Richard A. DeMillo,  Richard J. Lipton,  On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract), pp. 37 - 51, EUROCRYPT 1997.

[Electronic Edition][Cited 459 times Red StarRed StarRed Star]
47.   Ivan Damgard,  A Design Principle for Hash Functions, pp. 416 - 427, CRYPTO 1989.

[Electronic Edition][Cited 459 times Red StarRed StarRed Star]
48.   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 450 times Red StarRed StarRed Star]
49.   Moni Naor,  Adi Shamir,  Visual Cryptography, pp. 1 - 12, EUROCRYPT 1994.

[Electronic Edition][Cited 437 times Red StarRed StarRed Star]
50.   Ronald Cramer,  Ivan Damgard,  Berry Schoenmakers,  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, pp. 174 - 187, CRYPTO 1994.

[Electronic Edition][Cited 436 times Red StarRed StarRed Star]
51.   Atsushi Fujioka,  Tatsuaki Okamoto,  Kazuo Ohta,  A Practical Secret Voting Scheme for Large Scale Elections, pp. 244 - 251, ASIACRYPT 1992.

[Electronic Edition][Cited 428 times Red StarRed StarRed Star]
52.   N. Asokan,  Victor Shoup,  Michael Waidner,  Optimistic Fair Exchange of Digital Signatures (Extended Abstract), pp. 591 - 606, EUROCRYPT 1998.

[Electronic Edition][Cited 426 times Red StarRed StarRed Star]
53.   Victor Shoup,  Lower Bounds for Discrete Logarithms and Related Problems, pp. 256 - 266, EUROCRYPT 1997.

[Electronic Edition][Cited 426 times Red StarRed StarRed Star]
54.   Benny Chor,  Amos Fiat,  Moni Naor,  Tracing Traitors, pp. 257 - 270, CRYPTO 1994.

[Electronic Edition][Cited 422 times Red StarRed StarRed Star]
55.   Florian Hess,  Efficient Identity Based Signature Schemes Based on Pairings, pp. 310 - 324, SAC 2002.

[Electronic Edition][Cited 417 times Red StarRed StarRed Star]
56.   Ralph C. Merkle,  One Way Hash Functions and DES, pp. 428 - 446, CRYPTO 1989.

[Electronic Edition][Cited 417 times Red StarRed StarRed Star]
57.   Torben P. Pedersen,  A Threshold Cryptosystem without a Trusted Party (Extended Abstract), pp. 522 - 526, EUROCRYPT 1991.

[Electronic Edition][Cited 411 times Red StarRed StarRed Star]
58.   Rolf Blom,  An Optimal Class of Symmetric Key Generation Systems, pp. 335 - 338, EUROCRYPT 1984.

[Electronic Edition][Cited 410 times Red StarRed StarRed Star]
59.   Xiaoyun Wang,  Hongbo Yu,  How to Break MD5 and Other Hash Functions, pp. 19 - 35, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 404 times Red StarRed StarRed Star]
60.   David Chaum,  Hans Van Antwerpen,  Undeniable Signatures, pp. 212 - 216, CRYPTO 1989.

[Electronic Edition][Cited 398 times Red StarRed StarRed Star]
61.   Dan Boneh,  Xavier Boyen,  Secure Identity Based Encryption Without Random Oracles, pp. 443 - 459, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 385 times Red StarRed StarRed Star]
62.   Jae Choon Cha,  Jung Hee Cheon,  An Identity-Based Signature from Gap Diffie-Hellman Groups, pp. 18 - 30, PKC 2003.

[Electronic Edition][Cited 384 times Red StarRed StarRed Star]
63.   Jean-SĂ©bastien Coron,  Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems, pp. 292 - 302, CHES 1999.

[Electronic Edition][Cited 379 times Red StarRed StarRed Star]
64.   Eli Biham,  Adi Shamir,  Differential Fault Analysis of Secret Key Cryptosystems, pp. 513 - 525, CRYPTO 1997.

[Electronic Edition][Cited 379 times Red StarRed StarRed Star]
65.   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 378 times Red StarRed StarRed Star]
66.   Xuejia Lai,  James L. Massey,  Markov Ciphers and Differential Cryptanalysis, pp. 17 - 38, EUROCRYPT 1991.

[Electronic Edition][Cited 375 times Red StarRed StarRed Star]
67.   Ronald L. Rivest,  Adi Shamir,  Yael Tauman,  How to Leak a Secret, pp. 552 - 565, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 372 times Red StarRed StarRed Star]
68.   Gustavus J. Simmons,  The Prisoners' Problem and the Subliminal Channel, pp. 51 - 67, CRYPTO 1983.

[Electronic Edition][Cited 372 times Red StarRed StarRed Star]
69.   Louis C. Guillou,  Jean-Jacques Quisquater,  A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory, pp. 123 - 128, EUROCRYPT 1988.

[Electronic Edition][Cited 369 times Red StarRed StarRed Star]
70.   Victor Shoup,  Practical Threshold Signatures, pp. 207 - 220, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 368 times Red StarRed StarRed Star]
71.   Amir Herzberg,  Stanislaw Jarecki,  Hugo Krawczyk,  Moti Yung,  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage, pp. 339 - 352, CRYPTO 1995.

[Electronic Edition][Cited 367 times Red StarRed StarRed Star]
72.   Ronald Cramer,  Rosario Gennaro,  Berry Schoenmakers,  A Secure and Optimally Efficient Multi-Authority Election Scheme, pp. 103 - 118, EUROCRYPT 1997.

[Electronic Edition][Cited 364 times Red StarRed StarRed Star]
73.   Cynthia Dwork,  Moni Naor,  Pricing via Processing or Combatting Junk Mail, pp. 139 - 147, CRYPTO 1992.

[Electronic Edition][Cited 354 times Red StarRed StarRed Star]
74.   Dan Boneh,  Xavier Boyen,  Short Signatures Without Random Oracles, pp. 56 - 73, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 347 times Red StarRed StarRed Star]
75.   Dan Boneh,  Craig Gentry,  Ben Lynn,  Hovav Shacham,  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, pp. 416 - 432, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 347 times Red StarRed StarRed Star]
76.   Stuart Haber,  W. Scott Stornetta,  How to Time-Stamp a Digital Document, pp. 437 - 455, CRYPTO 1990.

[Electronic Edition][Cited 341 times Red StarRed StarRed Star]
77.   Eiichiro Fujisaki,  Tatsuaki Okamoto,  Secure Integration of Asymmetric and Symmetric Encryption Schemes, pp. 537 - 554, CRYPTO 1999.

[Electronic Edition][Cited 336 times Red StarRed StarRed Star]
78.   Markus Jakobsson,  Kazue Sako,  Russell Impagliazzo,  Designated Verifier Proofs and Their Applications, pp. 143 - 154, EUROCRYPT 1996.

[Electronic Edition][Cited 334 times Red StarRed StarRed Star]
79.   Brent Waters,  Efficient Identity-Based Encryption Without Random Oracles, pp. 114 - 127, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 333 times Red StarRed StarRed Star]
80.   Xuejia Lai,  James L. Massey,  A Proposal for a New Block Encryption Standard, pp. 389 - 404, EUROCRYPT 1990.

[Electronic Edition][Cited 332 times Red StarRed StarRed Star]
81.   Bruce Schneier,  Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish), pp. 191 - 204, FSE 1993.

[Electronic Edition][Cited 330 times Red StarRed StarRed Star]
82.   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 327 times Red StarRed StarRed Star]
83.   Rosario Gennaro,  Stanislaw Jarecki,  Hugo Krawczyk,  Tal Rabin,  Robust Threshold DSS Signatures, pp. 354 - 371, EUROCRYPT 1996.

[Electronic Edition][Cited 325 times Red StarRed StarRed Star]
84.   Dan Boneh,  Xavier Boyen,  Hovav Shacham,  Short Group Signatures, pp. 41 - 55, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 321 times Red StarRed StarRed Star]
85.   Nicolas Courtois,  Willi Meier,  Algebraic Attacks on Stream Ciphers with Linear Feedback, pp. 345 - 359, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 321 times Red StarRed StarRed Star]
86.   Nicolas Courtois,  Fast Algebraic Attacks on Stream Ciphers with Linear Feedback, pp. 176 - 194, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 321 times Red StarRed StarRed Star]
87.   Yuliang Zheng,  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption), pp. 165 - 179, CRYPTO 1997.

[Electronic Edition][Cited 321 times Red StarRed StarRed Star]
88.   Yvo Desmedt,  Yair Frankel,  Shared Generation of Authenticators and Signatures (Extended Abstract), pp. 457 - 469, CRYPTO 1991.

[Electronic Edition][Cited 321 times Red StarRed StarRed Star]
89.   Ran Canetti,  Hugo Krawczyk,  Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels, pp. 453 - 474, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 319 times Red StarRed StarRed Star]
90.   Craig Gentry,  Alice Silverberg,  Hierarchical ID-Based Cryptography, pp. 548 - 566, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 312 times Red StarRed StarRed Star]
91.   Nicolas Courtois,  Josef Pieprzyk,  Cryptanalysis of Block Ciphers with Overdefined Systems of Equations, pp. 267 - 287, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 311 times Red StarRed StarRed Star]
92.   Dan Boneh,  Matthew K. Franklin,  Efficient Generation of Shared RSA Keys (Extended Abstract), pp. 425 - 439, CRYPTO 1997.

[Electronic Edition][Cited 306 times Red StarRed StarRed Star]
93.   Mihir Bellare,  Sara K. Miner,  A Forward-Secure Digital Signature Scheme, pp. 431 - 448, CRYPTO 1999.

[Electronic Edition][Cited 305 times Red StarRed StarRed Star]
94.   Ralph C. Merkle,  A Digital Signature Based on a Conventional Encryption Function, pp. 369 - 378, CRYPTO 1987.

[Electronic Edition][Cited 305 times Red StarRed StarRed Star]
95.   Tatsuaki Okamoto,  Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes, pp. 31 - 53, CRYPTO 1992.

[Electronic Edition][Cited 304 times Red StarRed StarRed Star]
96.   Darrel Hankerson,  Julio LĂłpez Hernandez,  Alfred Menezes,  Software Implementation of Elliptic Curve Cryptography over Binary Fields, pp. 1 - 24, CHES 2000.

[Electronic Edition][Cited 301 times Red StarRed StarRed Star]
97.   Rosario Gennaro,  Pankaj Rohatgi,  How to Sign Digital Streams, pp. 180 - 197, CRYPTO 1997.

[Electronic Edition][Cited 301 times Red StarRed StarRed Star]
98.   Kaisa Nyberg,  Rainer A. Rueppel,  Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem, pp. 182 - 193, EUROCRYPT 1994.

[Electronic Edition][Cited 300 times Red StarRed StarRed Star]
99.   Hans Dobbertin,  Antoon Bosselaers,  Bart Preneel,  RIPEMD-160: A Strengthened Version of RIPEMD, pp. 71 - 82, FSE 1996.

[Electronic Edition][Cited 298 times Red StarRed StarRed Star]
100.   Sanjay E. Sarma,  Stephen A. Weis,  Daniel W. Engels,  RFID Systems and Security and Privacy Implications, pp. 454 - 469, CHES 2002.

[Electronic Edition][Cited 293 times Red StarRed StarRed Star]
101.   Daniel Bleichenbacher,  Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1, pp. 1 - 12, CRYPTO 1998.

[Electronic Edition][Cited 292 times Red StarRed StarRed Star]
102.   Josh Cohen Benaloh,  Jerry Leichter,  Generalized Secret Sharing and Monotone Functions, pp. 27 - 35, CRYPTO 1988.

[Electronic Edition][Cited 289 times Red StarRed StarRed Star]
103.   Victor Shoup,  OAEP Reconsidered, pp. 239 - 259, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 288 times Red StarRed StarRed Star]
104.   Markus Stadler,  Publicly Verifiable Secret Sharing, pp. 190 - 199, EUROCRYPT 1996.

[Electronic Edition][Cited 287 times Red StarRed StarRed Star]
105.   Tatsuaki Okamoto,  Shigenori Uchiyama,  A New Public-Key Cryptosystem as Secure as Factoring, pp. 308 - 318, EUROCRYPT 1998.

[Electronic Edition][Cited 282 times Red StarRed StarRed Star]
106.   Marc Girault,  Self-Certified Public Keys, pp. 490 - 497, EUROCRYPT 1991.

[Electronic Edition][Cited 279 times Red StarRed StarRed Star]
107.   Victor Boyko,  Philip D. MacKenzie,  Sarvar Patel,  Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman, pp. 156 - 171, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 278 times Red StarRed StarRed Star]
108.   Mihir Bellare,  Chanathip Namprempre,  Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm, pp. 531 - 545, ASIACRYPT 2000.

[Electronic Edition][Cited 278 times Red StarRed StarRed Star]
109.   Kaisa Nyberg,  Differentially Uniform Mappings for Cryptography, pp. 55 - 64, EUROCRYPT 1993.

[Electronic Edition][Cited 278 times Red StarRed StarRed Star]
110.   Michael J. Wiener,  Cryptanalysis of Short RSA Secret Exponents (Abstract), pp. 372 - 372, EUROCRYPT 1989.

[Electronic Edition][Cited 278 times Red StarRed StarRed Star]
111.   Henri Cohen,  Atsuko Miyaji,  Takatoshi Ono,  Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, pp. 51 - 65, ASIACRYPT 1998.

[Electronic Edition][Cited 276 times Red StarRed StarRed Star]
112.   Silvio Micali,  Phillip Rogaway,  Secure Computation (Abstract), pp. 392 - 404, CRYPTO 1991.

[Electronic Edition][Cited 275 times Red StarRed StarRed Star]
113.   Yvo Desmedt,  Society and Group Oriented Cryptography: A New Concept, pp. 120 - 127, CRYPTO 1987.

[Electronic Edition][Cited 273 times Red StarRed StarRed Star]
114.   Martin Feldhofer,  Sandra Dominikus,  Johannes Wolkerstorfer,  Strong Authentication for RFID Systems Using the AES Algorithm, pp. 357 - 370, CHES 2004.

[Electronic Edition][Cited 272 times Red StarRed StarRed Star]
115.   Eiichiro Fujisaki,  Tatsuaki Okamoto,  Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, pp. 16 - 30, CRYPTO 1997.

[Electronic Edition][Cited 271 times Red StarRed StarRed Star]
116.   Neal Koblitz,  CM-Curves with Good Cryptographic Properties, pp. 279 - 287, CRYPTO 1991.

[Electronic Edition][Cited 265 times Red StarRed StarRed Star]
117.   Tatsuaki Okamoto,  Kazuo Ohta,  Universal Electronic Cash, pp. 324 - 337, CRYPTO 1991.

[Electronic Edition][Cited 256 times Red StarRed StarRed Star]
118.   Andrew M. Odlyzko,  Discrete Logarithms in Finite Fields and Their Cryptographic Significance, pp. 224 - 314, EUROCRYPT 1984.

[Electronic Edition][Cited 254 times Red StarRed StarRed Star]
119.   Joan Daemen,  Lars R. Knudsen,  Vincent Rijmen,  The Block Cipher Square, pp. 149 - 165, FSE 1997.

[Electronic Edition][Cited 253 times Red StarRed StarRed Star]
120.   Luis von Ahn,  Manuel Blum,  Nicholas J. Hopper,  John Langford,  CAPTCHA: Using Hard AI Problems for Security, pp. 294 - 311, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 250 times Red StarRed StarRed Star]
121.   Kazue Sako,  Joe Kilian,  Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth, pp. 393 - 403, EUROCRYPT 1995.

[Electronic Edition][Cited 247 times Red StarRed Star]
122.   Louis C. Guillou,  Jean-Jacques Quisquater,  A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge, pp. 216 - 231, CRYPTO 1988.

[Electronic Edition][Cited 247 times Red StarRed Star]
123.   A. F. Webster,  Stafford E. Tavares,  On the Design of S-Boxes, pp. 523 - 534, CRYPTO 1985.

[Electronic Edition][Cited 247 times Red StarRed Star]
124.   Rosario Gennaro,  Stanislaw Jarecki,  Hugo Krawczyk,  Tal Rabin,  Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, pp. 295 - 310, EUROCRYPT 1999.

[Electronic Edition][Cited 246 times Red StarRed Star]
125.   Eli Biham,  New Types of Cryptanalytic Attacks Using related Keys (Extended Abstract), pp. 398 - 409, EUROCRYPT 1993.

[Electronic Edition][Cited 245 times Red StarRed Star]
126.   David Chaum,  Zero-Knowledge Undeniable Signatures, pp. 458 - 464, EUROCRYPT 1990.

[Electronic Edition][Cited 244 times Red StarRed Star]
127.   Sean W. Smith,  Elaine R. Palmer,  Steve Weingart,  Using a High-Performance, Programmable Secure Coprocessor, pp. 73 - 89, FC 1998.

[Electronic Edition][Cited 243 times Red StarRed Star]
128.   Nils Gura,  Arun Patel,  Arvinderpal Wander,  Hans Eberle,  Sheueling Chang Shantz,  Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs, pp. 119 - 132, CHES 2004.

[Electronic Edition][Cited 238 times Red StarRed Star]
129.   Willi Meier,  Othmar Staffelbach,  Nonlinearity Criteria for Cryptographic Functions, pp. 549 - 562, EUROCRYPT 1989.

[Electronic Edition][Cited 238 times Red StarRed Star]
130.   Ran Canetti,  Shai Halevi,  Jonathan Katz,  A Forward-Secure Public-Key Encryption Scheme, pp. 255 - 271, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 236 times Red StarRed Star]
131.   Christian Cachin,  Silvio Micali,  Markus Stadler,  Computationally Private Information Retrieval with Polylogarithmic Communication, pp. 402 - 414, EUROCRYPT 1999.

[Electronic Edition][Cited 231 times Red StarRed Star]
132.   Mitsuru Matsui,  The First Experimental Cryptanalysis of the Data Encryption Standard, pp. 1 - 11, CRYPTO 1994.

[Electronic Edition][Cited 231 times Red StarRed Star]
133.   Eli Biham,  Adi Shamir,  Differential Cryptanalysis of the Full 16-Round DES, pp. 487 - 496, CRYPTO 1992.

[Electronic Edition][Cited 228 times Red StarRed Star]
134.   Fangguo Zhang,  Kwangjo Kim,  ID-Based Blind Signature and Ring Signature from Pairings, pp. 533 - 547, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 227 times Red StarRed Star]
135.   Martin Hirt,  Kazue Sako,  Efficient Receipt-Free Voting Based on Homomorphic Encryption, pp. 539 - 556, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 227 times Red StarRed Star]
136.   Yevgeniy Dodis,  Leonid Reyzin,  Adam Smith,  Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data, pp. 523 - 540, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 226 times Red StarRed Star]
137.   Sattam S. Al-Riyami,  Kenneth G. Paterson,  Certificateless Public Key Cryptography, pp. 452 - 473, ASIACRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 226 times Red StarRed Star]
138.   Karine Gandolfi,  Christophe Mourtel,  Francis Olivier,  Electromagnetic Analysis: Concrete Results, pp. 251 - 261, CHES 2001.

[Electronic Edition][Cited 226 times Red StarRed Star]
139.   Suresh Chari,  Charanjit S. Jutla,  Josyula R. Rao,  Pankaj Rohatgi,  Towards Sound Approaches to Counteract Power-Analysis Attacks, pp. 398 - 412, CRYPTO 1999.

[Electronic Edition][Cited 224 times Red StarRed Star]
140.   Hans Dobbertin,  Cryptanalysis of MD4, pp. 53 - 69, FSE 1996.

[Electronic Edition][Cited 224 times Red StarRed Star]
141.   Russell Impagliazzo,  Steven Rudich,  Limits on the Provable Consequences of One-way Permutations, pp. 8 - 26, CRYPTO 1988.

[Electronic Edition][Cited 223 times Red StarRed Star]
142.   Adi Shamir,  A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem, pp. 279 - 288, CRYPTO 1982.

[Electronic Edition][Cited 223 times Red StarRed Star]
143.   Xiaoyun Wang,  Xuejia Lai,  Dengguo Feng,  Hui Chen,  Xiuyuan Yu,  Cryptanalysis of the Hash Functions MD4 and RIPEMD, pp. 1 - 18, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 221 times Red StarRed Star]
144.   Niko Bari,  Birgit Pfitzmann,  Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, pp. 480 - 494, EUROCRYPT 1997.

[Electronic Edition][Cited 220 times Red StarRed Star]
145.   Lars R. Knudsen,  Truncated and Higher Order Differentials, pp. 196 - 211, FSE 1994.

[Electronic Edition][Cited 220 times Red StarRed Star]
146.   Jee Hea An,  Yevgeniy Dodis,  Tal Rabin,  On the Security of Joint Signature and Encryption, pp. 83 - 107, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 215 times Red StarRed Star]
147.   Don Coppersmith,  Hugo Krawczyk,  Yishay Mansour,  The Shrinking Generator, pp. 22 - 39, CRYPTO 1993.

[Electronic Edition][Cited 215 times Red StarRed Star]
148.   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 213 times Red StarRed Star]
149.   Ran Canetti,  Shai Halevi,  Jonathan Katz,  Chosen-Ciphertext Security from Identity-Based Encryption, pp. 207 - 222, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 212 times Red StarRed Star]
150.   Shafi Goldwasser,  Leonid A. Levin,  Fair Computation of General Functions in Presence of Immoral Majority, pp. 77 - 93, CRYPTO 1990.

[Electronic Edition][Cited 212 times Red StarRed Star]
151.   Tatsuaki Okamoto,  David Pointcheval,  The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes, pp. 104 - 118, PKC 2001.

[Electronic Edition][Cited 210 times Red StarRed Star]
152.   Ari Juels,  Ravikanth Pappu,  Squealing Euros: Privacy Protection in RFID-Enabled Banknotes, pp. 103 - 121, FC 2003.

[Electronic Edition][Cited 209 times Red StarRed Star]
153.   Julio LĂłpez Hernandez,  Ricardo Dahab,  Fast Multiplication on Elliptic Curves over GF(2^m) without Precomputation, pp. 316 - 327, CHES 1999.

[Electronic Edition][Cited 209 times Red StarRed Star]
154.   Jan Camenisch,  Anna Lysyanskaya,  An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, pp. 93 - 118, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 208 times Red StarRed Star]
155.   Dan Boneh,  Matthew K. Franklin,  An Efficient Public Key Traitor Tracing Scheme, pp. 338 - 353, CRYPTO 1999.

[Electronic Edition][Cited 207 times Red StarRed Star]
156.   Fabrice Boudot,  Efficient Proofs that a Committed Number Lies in an Interval, pp. 431 - 444, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 206 times Red StarRed Star]
157.   Stefan Brands,  David Chaum,  Distance-Bounding Protocols (Extended Abstract), pp. 344 - 359, EUROCRYPT 1993.

[Electronic Edition][Cited 206 times Red StarRed Star]
158.   Jan Camenisch,  Efficient and Generalized Group Signatures, pp. 465 - 479, EUROCRYPT 1997.

[Electronic Edition][Cited 205 times Red StarRed Star]
159.   Catherine Meadows,  Formal Verification of Cryptographic Protocols: A Survey, pp. 135 - 150, ASIACRYPT 1994.

[Electronic Edition][Cited 205 times Red StarRed Star]
160.   Ivan Damgard,  Collision Free Hash Functions and Public Key Signature Schemes, pp. 203 - 216, EUROCRYPT 1987.

[Electronic Edition][Cited 205 times Red StarRed Star]
161.   Philippe Golle,  Markus Jakobsson,  Ari Juels,  Paul F. Syverson,  Universal Re-encryption for Mixnets, pp. 163 - 178, CT-RSA 2004.

[Electronic Edition][Cited 204 times Red StarRed Star]
162.   Louis Goubin,  Jacques Patarin,  DES and Differential Power Analysis (The "Duplication" Method), pp. 158 - 172, CHES 1999.

[Electronic Edition][Cited 204 times Red StarRed Star]
163.   Markus Stadler,  Jean-Marc Piveteau,  Jan Camenisch,  Fair Blind Signatures, pp. 209 - 219, EUROCRYPT 1995.

[Electronic Edition][Cited 204 times Red StarRed Star]
164.   Markus Jakobsson,  Susanne Wetzel,  Security Weaknesses in Bluetooth, pp. 176 - 191, CT-RSA 2001.

[Electronic Edition][Cited 202 times Red StarRed Star]
165.   Nicolas Courtois,  Alexander Klimov,  Jacques Patarin,  Adi Shamir,  Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, pp. 392 - 407, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 201 times Red StarRed Star]
166.   Martin Tompa,  Heather Woll,  How to Share a Secret with Cheaters, pp. 261 - 265, CRYPTO 1986.

[Electronic Edition][Cited 201 times Red StarRed Star]
167.   Michael J. Freedman,  Kobbi Nissim,  Benny Pinkas,  Efficient Private Matching and Set Intersection, pp. 1 - 19, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 200 times Red StarRed Star]
168.   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 198 times Red StarRed Star]
169.   Jacques Patarin,  Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, pp. 33 - 48, EUROCRYPT 1996.

[Electronic Edition][Cited 198 times Red StarRed Star]
170.   Dan Boneh,  Xavier Boyen,  Eu-Jin Goh,  Hierarchical Identity Based Encryption with Constant Size Ciphertext, pp. 440 - 456, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 197 times Red StarRed Star]
171.   Dani Halevy,  Adi Shamir,  The LSD Broadcast Encryption Scheme, pp. 47 - 60, CRYPTO 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 197 times Red StarRed Star]
172.   Thomas Jakobsen,  Lars R. Knudsen,  The Interpolation Attack on Block Ciphers, pp. 28 - 40, FSE 1997.

[Electronic Edition][Cited 197 times Red StarRed Star]
173.   Paul C. Kocher,  On Certificate Revocation and Validation, pp. 172 - 177, FC 1998.

[Electronic Edition][Cited 196 times Red StarRed Star]
174.   Matt Blaze,  Joan Feigenbaum,  Martin J. Strauss,  Compliance Checking in the PolicyMaker Trust Management System, pp. 254 - 274, FC 1998.

[Electronic Edition][Cited 195 times Red StarRed Star]
175.   Ronald Cramer,  Matthew K. Franklin,  Berry Schoenmakers,  Moti Yung,  Multi-Authority Secret-Ballot Elections with Linear Work, pp. 72 - 83, EUROCRYPT 1996.

[Electronic Edition][Cited 193 times Red StarRed Star]
176.   Richard Schroeppel,  Hilarie K. Orman,  Sean W. O'Malley,  Oliver Spatscheck,  Fast Key Exchange with Elliptic Curve Systems, pp. 43 - 56, CRYPTO 1995.

[Electronic Edition][Cited 193 times Red StarRed Star]
177.   Antoine Joux,  Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions, pp. 306 - 316, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 190 times Red StarRed Star]
178.   Anna Lysyanskaya,  Ronald L. Rivest,  Amit Sahai,  Stefan Wolf,  Pseudonym Systems, pp. 184 - 199, SAC 1999.

[Electronic Edition][Cited 190 times Red StarRed Star]
179.   Ross J. Anderson,  Roger M. Needham,  Robustness Principles for Public Key Protocols, pp. 236 - 247, CRYPTO 1995.

[Electronic Edition][Cited 188 times Red StarRed Star]
180.   Andreas Pfitzmann,  Michael Waidner,  Networks Without User Observability: Design Options, pp. 245 - 253, EUROCRYPT 1985.

[Electronic Edition][Cited 187 times Red StarRed Star]
181.   Akashi Satoh,  Sumio Morioka,  Kohji Takano,  Seiji Munetoh,  A Compact Rijndael Hardware Architecture with S-Box Optimization, pp. 239 - 254, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 186 times Red StarRed Star]
182.   Rosario Gennaro,  Stanislaw Jarecki,  Hugo Krawczyk,  Tal Rabin,  Robust and Efficient Sharing of RSA Functions, pp. 157 - 172, CRYPTO 1996.

[Electronic Edition][Cited 186 times Red StarRed Star]
183.   Manuel Blum,  Shafi Goldwasser,  An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information, pp. 289 - 302, CRYPTO 1984.

[Electronic Edition][Cited 186 times Red StarRed Star]
184.   Alex Biryukov,  Adi Shamir,  David Wagner,  Real Time Cryptanalysis of A5/1 on a PC, pp. 1 - 18, FSE 2000.

[Electronic Edition][Cited 185 times Red StarRed Star]
185.   Yiannis Tsiounis,  Moti Yung,  On the Security of ElGamal Based Encryption, pp. 117 - 134, PKC 1998.

[Electronic Edition][Cited 185 times Red StarRed Star]
186.   Xiaoyun Wang,  Hongbo Yu,  Yiqun Lisa Yin,  Efficient Collision Search Attacks on SHA-0, pp. 1 - 16, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 184 times Red StarRed Star]
187.   Arjen K. Lenstra,  Eric R. Verheul,  The XTR Public Key System, pp. 1 - 19, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 184 times Red StarRed Star]
188.   Thomas S. Messerges,  Ezzy A. Dabbish,  Robert H. Sloan,  Power Analysis Attacks of Modular Exponentiation in Smartcards, pp. 144 - 157, CHES 1999.

[Electronic Edition][Cited 184 times Red StarRed Star]
189.   Ran Canetti,  Marc Fischlin,  Universally Composable Commitments, pp. 19 - 40, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 183 times Red StarRed Star]
190.   Ernest F. Brickell,  Some Ideal Secret Sharing Schemes, pp. 468 - 475, EUROCRYPT 1989.

[Electronic Edition][Cited 183 times Red StarRed Star]
191.   Tal Rabin,  A Simplified Approach to Threshold and Proactive RSA, pp. 89 - 104, CRYPTO 1998.

[Electronic Edition][Cited 182 times Red StarRed Star]
192.   John Black,  Shai Halevi,  Hugo Krawczyk,  Ted Krovetz,  Phillip Rogaway,  UMAC: Fast and Secure Message Authentication, pp. 216 - 233, CRYPTO 1999.

[Electronic Edition][Cited 181 times Red StarRed Star]
193.   David Chaum,  Jan-Hendrik Evertse,  Jeroen van de Graaf,  An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations, pp. 127 - 141, EUROCRYPT 1987.

[Electronic Edition][Cited 181 times Red StarRed Star]
194.   Dan Boneh,  Giovanni Di Crescenzo,  Rafail Ostrovsky,  Giuseppe Persiano,  Public Key Encryption with Keyword Search, pp. 506 - 522, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 180 times Red StarRed Star]
195.   Ronald L. Rivest,  Can We Eliminate Certificate Revocations Lists?, pp. 178 - 183, FC 1998.

[Electronic Edition][Cited 180 times Red StarRed Star]
196.   Markus Jakobsson,  Jean-Pierre Hubaux,  Levente Buttyán,  A Micro-Payment Scheme Encouraging Collaboration in Multi-hop Cellular Networks, pp. 15 - 33, FC 2003.

[Electronic Edition][Cited 179 times Red StarRed Star]
197.   Chae Hoon Lim,  Pil Joong Lee,  More Flexible Exponentiation with Precomputation, pp. 95 - 107, CRYPTO 1994.

[Electronic Edition][Cited 179 times Red StarRed Star]
198.   Benny Chor,  Ronald L. Rivest,  A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields, pp. 54 - 65, CRYPTO 1984.

[Electronic Edition][Cited 179 times Red StarRed Star]
199.   Josh Cohen Benaloh,  Michael de Mare,  One-Way Accumulators: A Decentralized Alternative to Digital Signatures (Extended Abstract), pp. 274 - 285, EUROCRYPT 1993.

[Electronic Edition][Cited 178 times Red StarRed Star]
200.   Donald Beaver,  Foundations of Secure Interactive Computing, pp. 377 - 391, CRYPTO 1991.

[Electronic Edition][Cited 178 times Red StarRed Star]
201.   Gustavus J. Simmons,  Authentication Theory/Coding Theory, pp. 411 - 431, CRYPTO 1984.

[Electronic Edition][Cited 178 times Red StarRed Star]
202.   Jerome A. Solinas,  An Improved Algorithm for Arithmetic on a Family of Elliptic Curves, pp. 357 - 371, CRYPTO 1997.

[Electronic Edition][Cited 177 times Red StarRed Star]
203.   Jan Camenisch,  Jean-Marc Piveteau,  Markus Stadler,  Blind Signatures Based on the Discrete Logarithm Problem, pp. 428 - 432, EUROCRYPT 1994.

[Electronic Edition][Cited 177 times Red StarRed Star]
204.   Berry Schoenmakers,  A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic, pp. 148 - 164, CRYPTO 1999.

[Electronic Edition][Cited 176 times Red StarRed Star]
205.   Adi Shamir,  The Generation of Cryptographically Strong Pseudo-Random Sequences, pp. 1 - 1, CRYPTO 1981.

[Electronic Edition][Cited 174 times Red StarRed Star]
206.   Ronald Cramer,  Victor Shoup,  Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption, pp. 45 - 64, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 172 times Red StarRed Star]
207.   Kaisa Nyberg,  Perfect Nonlinear S-Boxes, pp. 378 - 386, EUROCRYPT 1991.

[Electronic Edition][Cited 172 times Red StarRed Star]
208.   Ari Juels,  Stephen A. Weis,  Authenticating Pervasive Devices with Human Protocols, pp. 293 - 308, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 171 times Red StarRed Star]
209.   Ran Canetti,  Hugo Krawczyk,  Universally Composable Notions of Key Exchange and Secure Channels, pp. 337 - 351, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 170 times Red StarRed Star]
210.   Steven D. Galbraith,  Supersingular Curves in Cryptography, pp. 495 - 513, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 170 times Red StarRed Star]
211.   Mehdi-Laurent Akkar,  Christophe Giraud,  An Implementation of DES and AES, Secure against Some Attacks, pp. 309 - 318, CHES 2001.

[Electronic Edition][Cited 170 times Red StarRed Star]
212.   Lidong Chen,  Torben P. Pedersen,  New Group Signature Schemes (Extended Abstract), pp. 171 - 181, EUROCRYPT 1994.

[Electronic Edition][Cited 170 times Red StarRed Star]
213.   David Chaum,  Designated Confirmer Signatures, pp. 86 - 91, EUROCRYPT 1994.

[Electronic Edition][Cited 170 times Red StarRed Star]
214.   Mihir Bellare,  Daniele Micciancio,  Bogdan Warinschi,  Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions, pp. 614 - 629, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 169 times Red StarRed Star]
215.   Sergei P. Skorobogatov,  Ross J. Anderson,  Optical Fault Induction Attacks, pp. 2 - 12, CHES 2002.

[Electronic Edition][Cited 169 times Red StarRed Star]
216.   Jan Camenisch,  Markus Michels,  Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes, pp. 107 - 122, EUROCRYPT 1999.

[Electronic Edition][Cited 169 times Red StarRed Star]
217.   Mitsuru Matsui,  New Block Encryption Algorithm MISTY, pp. 54 - 68, FSE 1997.

[Electronic Edition][Cited 169 times Red StarRed Star]
218.   Paul Barrett,  Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor, pp. 311 - 323, CRYPTO 1986.

[Electronic Edition][Cited 169 times Red StarRed Star]
219.   Jonathan Katz,  Moti Yung,  Scalable Protocols for Authenticated Group Key Exchange, pp. 110 - 125, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 168 times Red StarRed Star]
220.   Torben P. Pedersen,  Distributed Provers with Applications to Undeniable Signatures, pp. 221 - 242, EUROCRYPT 1991.

[Electronic Edition][Cited 168 times Red StarRed Star]
221.   Bart Preneel,  Werner Van Leekwijck,  Luc Van Linden,  RenĂ© Govaerts,  Joos Vandewalle,  Propagation Characteristics of Boolean Functions, pp. 161 - 173, EUROCRYPT 1990.

[Electronic Edition][Cited 168 times Red StarRed Star]
222.   Jeremy Horwitz,  Ben Lynn,  Toward Hierarchical Identity-Based Encryption, pp. 466 - 481, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 167 times Red StarRed Star]
223.   Rosario Gennaro,  Shai Halevi,  Tal Rabin,  Secure Hash-and-Sign Signatures Without the Random Oracle, pp. 123 - 139, EUROCRYPT 1999.

[Electronic Edition][Cited 167 times Red StarRed Star]
224.   Stephen R. DussĂ©,  Burton S. Kaliski Jr.,  A Cryptographic Library for the Motorola DSP56000, pp. 230 - 244, EUROCRYPT 1990.

[Electronic Edition][Cited 167 times Red StarRed Star]
225.   Eli Biham,  Rafi Chen,  Near-Collisions of SHA-0, pp. 290 - 305, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 166 times Red StarRed Star]
226.   Thomas S. Messerges,  Using Second-Order Power Analysis to Attack DPA Resistant Software, pp. 238 - 251, CHES 2000.

[Electronic Edition][Cited 166 times Red StarRed Star]
227.   Gerardo Orlando,  Christof Paar,  A High Performance Reconfigurable Elliptic Curve Processor for GF(2, pp. 41 - 56, CHES 2000.

[Electronic Edition][Cited 166 times Red StarRed Star]
228.   Dan Boneh,  Glenn Durfee,  Cryptanalysis of RSA with Private Key d less than N^0.292, pp. 1 - 11, EUROCRYPT 1999.

[Electronic Edition][Cited 166 times Red StarRed Star]
229.   Renato M. Capocelli,  Alfredo De Santis,  Luisa Gargano,  Ugo Vaccaro,  On the Size of Shares for Secret Sharing Schemes, pp. 101 - 113, CRYPTO 1991.

[Electronic Edition][Cited 165 times Red StarRed Star]
230.   Christophe Clavier,  Jean-SĂ©bastien Coron,  Nora Dabbous,  Differential Power Analysis in the Presence of Hardware Countermeasures, pp. 252 - 263, CHES 2000.

[Electronic Edition][Cited 164 times Red StarRed Star]
231.   Shimshon Berkovits,  How To Broadcast A Secret, pp. 535 - 541, EUROCRYPT 1991.

[Electronic Edition][Cited 164 times Red StarRed Star]
232.   Jan Camenisch,  Anna Lysyanskaya,  Signature Schemes and Anonymous Credentials from Bilinear Maps, pp. 56 - 72, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 162 times Red StarRed Star]
233.   Giuseppe Ateniese,  Gene Tsudik,  Some Open Issues and New Directions in Group Signatures, pp. 196 - 211, FC 1999.

[Electronic Edition][Cited 161 times Red StarRed Star]
234.   Douglas R. Stinson,  Universal Hashing and Authentication Codes, pp. 74 - 85, CRYPTO 1991.

[Electronic Edition][Cited 161 times Red StarRed Star]
235.   Ran Canetti,  Tal Malkin,  Kobbi Nissim,  Efficient Communication-Storage Tradeoffs for Multicast Encryption, pp. 459 - 474, EUROCRYPT 1999.

[Electronic Edition][Cited 160 times Red StarRed Star]
236.   Tsutomu Matsumoto,  Hideki Imai,  Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, pp. 419 - 453, EUROCRYPT 1988.

[Electronic Edition][Cited 160 times Red StarRed Star]
237.   Daniel V. Bailey,  Christof Paar,  Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms, pp. 472 - 485, CRYPTO 1998.

[Electronic Edition][Cited 159 times Red StarRed Star]
238.   Hugo Krawczyk,  LFSR-based Hashing and Authentication, pp. 129 - 139, CRYPTO 1994.

[Electronic Edition][Cited 159 times Red StarRed Star]
239.   Dakshi Agrawal,  Bruce Archambeault,  Josyula R. Rao,  Pankaj Rohatgi,  The EM Side-Channel(s), pp. 29 - 45, CHES 2002.

[Electronic Edition][Cited 158 times Red StarRed Star]
240.   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 158 times Red StarRed Star]
241.   Fangguo Zhang,  Reihaneh Safavi-Naini,  Willy Susilo,  An Efficient Signature Scheme from Bilinear Pairings and Its Applications, pp. 277 - 290, PKC 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 157 times Red StarRed Star]
242.   Victor Shoup,  Rosario Gennaro,  Securing Threshold Cryptosystems against Chosen Ciphertext Attack, pp. 1 - 16, EUROCRYPT 1998.

[Electronic Edition][Cited 157 times Red StarRed Star]
243.   Oded Goldreich,  Shafi Goldwasser,  Shai Halevi,  Public-Key Cryptosystems from Lattice Reduction Problems, pp. 112 - 131, CRYPTO 1997.

[Electronic Edition][Cited 157 times Red StarRed Star]
244.   David J. Wheeler,  Roger M. Needham,  TEA, a Tiny Encryption Algorithm, pp. 363 - 366, FSE 1994.

[Electronic Edition][Cited 157 times Red StarRed Star]
245.   Eli Biham,  Alex Biryukov,  Adi Shamir,  Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials, pp. 12 - 23, EUROCRYPT 1999.

[Electronic Edition][Cited 156 times Red StarRed Star]
246.   Joe Kilian,  Erez Petrank,  Identity Escrow, pp. 169 - 185, CRYPTO 1998.

[Electronic Edition][Cited 156 times Red StarRed Star]
247.   Ueli M. Maurer,  A Universal Statistical Test for Random Bit Generators, pp. 409 - 420, CRYPTO 1990.

[Electronic Edition][Cited 156 times Red StarRed Star]
248.   Gilles Brassard,  Claude CrĂ©peau,  Jean-Marc Robert,  All-or-Nothing Disclosure of Secrets, pp. 234 - 238, CRYPTO 1986.

[Electronic Edition][Cited 156 times Red StarRed Star]
249.   Jonathan Katz,  Rafail Ostrovsky,  Moti Yung,  Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords, pp. 475 - 494, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 155 times Red StarRed Star]
250.   Florent Chabaud,  Antoine Joux,  Differential Collisions in SHA-0, pp. 56 - 71, CRYPTO 1998.

[Electronic Edition][Cited 155 times Red StarRed Star]
251.   Mihir Bellare,  Roch GuĂ©rin,  Phillip Rogaway,  XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions, pp. 15 - 28, CRYPTO 1995.

[Electronic Edition][Cited 155 times Red StarRed Star]
252.   Uriel Feige,  Adi Shamir,  Zero Knowledge Proofs of Knowledge in Two Rounds, pp. 526 - 544, CRYPTO 1989.

[Electronic Edition][Cited 155 times Red StarRed Star]
253.   Charanjit S. Jutla,  Encryption Modes with Almost Free Message Integrity, pp. 529 - 544, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 154 times Red StarRed Star]
254.   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 154 times Red StarRed Star]
255.   Phillip Rogaway,  Don Coppersmith,  A Software-Optimized Encryption Algorithm, pp. 56 - 63, FSE 1993.

[Electronic Edition][Cited 154 times Red StarRed Star]
256.   Alexandra Boldyreva,  Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme, pp. 31 - 46, PKC 2003.

[Electronic Edition][Cited 153 times Red StarRed Star]
257.   James L. Massey,  SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm, pp. 1 - 17, FSE 1993.

[Electronic Edition][Cited 153 times Red StarRed Star]
258.   Mihir Bellare,  Silvio Micali,  Non-Interactive Oblivious Transfer and Applications, pp. 547 - 557, CRYPTO 1989.

[Electronic Edition][Cited 153 times Red StarRed Star]
259.   Willi Meier,  Enes Pasalic,  Claude Carlet,  Algebraic Attacks and Decomposition of Boolean Functions, pp. 474 - 491, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 152 times Red StarRed Star]
260.   Yevgeniy Dodis,  Jonathan Katz,  Shouhuai Xu,  Moti Yung,  Key-Insulated Public Key Cryptosystems, pp. 65 - 82, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 152 times Red StarRed Star]
261.   Makoto Tatebayashi,  Natsume Matsuzaki,  David B. Newman Jr.,  Key Distribution Protocol for Digital Mobile Communication Systems, pp. 324 - 334, CRYPTO 1989.

[Electronic Edition][Cited 152 times Red StarRed Star]
262.   Agnes Hui Chan,  Yair Frankel,  Yiannis Tsiounis,  Easy Come - Easy Go Divisible Cash, pp. 561 - 575, EUROCRYPT 1998.

[Electronic Edition][Cited 151 times Red StarRed Star]
263.   Masayuki Abe,  Eiichiro Fujisaki,  How to Date Blind Signatures, pp. 244 - 251, ASIACRYPT 1996.

[Electronic Edition][Cited 151 times Red StarRed Star]
264.   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 150 times Red StarRed Star]
265.   David Wagner,  The Boomerang Attack, pp. 156 - 170, FSE 1999.

[Electronic Edition][Cited 150 times Red StarRed Star]
266.   Eiichiro Fujisaki,  Tatsuaki Okamoto,  How to Enhance the Security of Public-Key Encryption at Minimum Cost, pp. 53 - 68, PKC 1999.

[Electronic Edition][Cited 150 times Red StarRed Star]
267.   Ernest F. Brickell,  Daniel M. Davenport,  On the Classification of Ideal Secret Sharing Schemes, pp. 278 - 285, CRYPTO 1989.

[Electronic Edition][Cited 150 times Red StarRed Star]
268.   Dan Boneh,  Craig Gentry,  Brent Waters,  Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys, pp. 258 - 275, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 149 times Red StarRed Star]
269.   Joe Kilian,  Phillip Rogaway,  How to Protect DES Against Exhaustive Key Search, pp. 252 - 267, CRYPTO 1996.

[Electronic Edition][Cited 149 times Red StarRed Star]
270.   Matthijs J. Coster,  Brian A. LaMacchia,  Andrew M. Odlyzko,  An Improved Low-Density Subset Sum Algorithm, pp. 54 - 67, EUROCRYPT 1991.

[Electronic Edition][Cited 149 times Red StarRed Star]
271.   Stephen Wolfram,  Cryptography with Cellular Automata, pp. 429 - 432, CRYPTO 1985.

[Electronic Edition][Cited 149 times Red StarRed Star]
272.   Gilles Brassard,  Louis Salvail,  Secret-Key Reconciliation by Public Discussion, pp. 410 - 423, EUROCRYPT 1993.

[Electronic Edition][Cited 147 times Red StarRed Star]
273.   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 146 times Red StarRed Star]
274.   Niels Ferguson,  John Kelsey,  Stefan Lucks,  Bruce Schneier,  Michael Stay,  David Wagner,  Doug Whiting,  Improved Cryptanalysis of Rijndael, pp. 213 - 230, FSE 2000.

[Electronic Edition][Cited 146 times Red StarRed Star]
275.   Tatsuaki Okamoto,  An Efficient Divisible Electronic Cash Scheme, pp. 438 - 451, CRYPTO 1995.

[Electronic Edition][Cited 146 times Red StarRed Star]
276.   Choonsik Park,  Kazutomo Itoh,  Kaoru Kurosawa,  Efficient Anonymous Channel and All/Nothing Election Scheme, pp. 248 - 259, EUROCRYPT 1993.

[Electronic Edition][Cited 146 times Red StarRed Star]
277.   Silvio Micali,  Fair Public-Key Cryptosystems, pp. 113 - 138, CRYPTO 1992.

[Electronic Edition][Cited 146 times Red StarRed Star]
278.   Masayuki Abe,  Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-servers, pp. 437 - 447, EUROCRYPT 1998.

[Electronic Edition][Cited 145 times Red StarRed Star]
279.   Paul Camion,  Claude Carlet,  Pascale Charpin,  Nicolas Sendrier,  On Correlation-Immune Functions, pp. 86 - 100, CRYPTO 1991.

[Electronic Edition][Cited 145 times Red StarRed Star]
280.   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 143 times Red StarRed Star]
281.   Eric R. Verheul,  Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems, pp. 195 - 210, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 143 times Red StarRed Star]
282.   Yair Frankel,  Yiannis Tsiounis,  Moti Yung,  "Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash, pp. 286 - 300, ASIACRYPT 1996.

[Electronic Edition][Cited 143 times Red StarRed Star]
283.   Richard A. Kemmerer,  Analyzing Encryption Protocols Using Formal Verification Techniques, pp. 48 - 48, EUROCRYPT 1986.

[Electronic Edition][Cited 143 times Red StarRed Star]
284.   Carl Pomerance,  The Quadratic Sieve Factoring Algorithm, pp. 169 - 182, EUROCRYPT 1984.

[Electronic Edition][Cited 143 times Red StarRed Star]
285.   Johannes Wolkerstorfer,  Elisabeth Oswald,  Mario Lamberger,  An ASIC Implementation of the AES SBoxes, pp. 67 - 78, CT-RSA 2002.

[Electronic Edition][Cited 142 times Red StarRed Star]
286.   Ivan Damgard,  Efficient Concurrent Zero-Knowledge in the Auxiliary String Model, pp. 418 - 430, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 142 times Red StarRed Star]
287.   Aviad Kipnis,  Adi Shamir,  Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, pp. 19 - 30, CRYPTO 1999.

[Electronic Edition][Cited 142 times Red StarRed Star]
288.   Jan Camenisch,  Markus Michels,  A Group Signature Scheme with Improved Efficiency, pp. 160 - 174, ASIACRYPT 1998.

[Electronic Edition][Cited 142 times Red StarRed Star]
289.   Joan Boyar,  David Chaum,  Ivan Damgard,  Torben P. Pedersen,  Convertible Undeniable Signatures, pp. 189 - 205, CRYPTO 1990.

[Electronic Edition][Cited 142 times Red StarRed Star]
290.   D. G. Steer,  L. Strawczynski,  Whitfield Diffie,  Michael J. Wiener,  A Secure Audio Teleconference System, pp. 520 - 528, CRYPTO 1988.

[Electronic Edition][Cited 142 times Red StarRed Star]
291.   Mihir Bellare,  Alexandra Boldyreva,  Silvio Micali,  Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements, pp. 259 - 274, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 141 times Red StarRed Star]
292.   Mihir Bellare,  Juan A. Garay,  Tal Rabin,  Fast Batch Verification for Modular Exponentiation and Digital Signatures, pp. 236 - 250, EUROCRYPT 1998.

[Electronic Edition][Cited 141 times Red StarRed Star]
293.   Simon Blake-Wilson,  Alfred Menezes,  Authenticated Diffie-Hellman Key Agreement Protocols, pp. 339 - 361, SAC 1998.

[Electronic Edition][Cited 141 times Red StarRed Star]
294.   Ivan Damgard,  Eiichiro Fujisaki,  A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order, pp. 125 - 142, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 140 times Red StarRed Star]
295.   Tatsuaki Okamoto,  David Pointcheval,  REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform, pp. 159 - 175, CT-RSA 2001.

[Electronic Edition][Cited 140 times Red StarRed Star]
296.   Bart Preneel,  RenĂ© Govaerts,  Joos Vandewalle,  Hash Functions Based on Block Ciphers: A Synthetic Approach, pp. 368 - 378, CRYPTO 1993.

[Electronic Edition][Cited 140 times Red StarRed Star]
297.   Bert den Boer,  Antoon Bosselaers,  Collisions for the Compression Function of MD5, pp. 293 - 304, EUROCRYPT 1993.

[Electronic Edition][Cited 140 times Red StarRed Star]
298.   Daniele Micciancio,  Bogdan Warinschi,  Soundness of Formal Encryption in the Presence of Active Adversaries, pp. 133 - 151, TCC 2004.

[Electronic Edition][Cited 139 times Red StarRed Star]
299.   David Pointcheval,  Jacques Stern,  Provably Secure Blind Signature Schemes, pp. 252 - 265, ASIACRYPT 1996.

[Electronic Edition][Cited 139 times Red StarRed Star]
300.   Jacques Patarin,  Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88, pp. 248 - 261, CRYPTO 1995.

[Electronic Edition][Cited 139 times Red StarRed Star]
301.   John Kelsey,  Bruce Schneier,  Second Preimages on n-Bit Hash Functions for Much Less than 2, pp. 474 - 490, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 138 times Red StarRed Star]
302.   Jan Camenisch,  Victor Shoup,  Practical Verifiable Encryption and Decryption of Discrete Logarithms, pp. 126 - 144, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 138 times Red StarRed Star]
303.   Masayuki Abe,  Miyako Ohkubo,  Koutarou Suzuki,  1-out-of-n Signatures from a Variety of Keys, pp. 415 - 432, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 138 times Red StarRed Star]
304.   Eran Gabber,  Phillip B. Gibbons,  Yossi Matias,  Alain J. Mayer,  How to Make Personalized Web Browsing Simple, Secure, and Anonymous, pp. 17 - 32, FC 1997.

[Electronic Edition][Cited 138 times Red StarRed Star]
305.   Philippe Flajolet,  Andrew M. Odlyzko,  Random Mapping Statistics, pp. 329 - 354, EUROCRYPT 1989.

[Electronic Edition][Cited 138 times Red StarRed Star]
306.   Christoph G. GĂĽnther,  An Identity-Based Key-Exchange Protocol, pp. 29 - 37, EUROCRYPT 1989.

[Electronic Edition][Cited 138 times Red StarRed Star]
307.   Silvio Micali,  Charles Rackoff,  Bob Sloan,  The Notion of Security for Probabilistic Cryptosystems, pp. 381 - 392, CRYPTO 1986.

[Electronic Edition][Cited 138 times Red StarRed Star]
308.   Eli Biham,  Rafi Chen,  Antoine Joux,  Patrick Carribault,  Christophe Lemuet,  William Jalby,  Collisions of SHA-0 and Reduced SHA-1, pp. 36 - 57, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 137 times Red StarRed Star]
309.   Ronald Cramer,  Ivan Damgard,  Ueli M. Maurer,  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme, pp. 316 - 334, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 137 times Red StarRed Star]
310.   Moni Naor,  Benny Pinkas,  Efficient Trace and Revoke Schemes, pp. 1 - 20, FC 2000.

[Electronic Edition][Cited 137 times Red StarRed Star]
311.   Florent Chabaud,  Serge Vaudenay,  Links Between Differential and Linear Cryptanalysis, pp. 356 - 365, EUROCRYPT 1994.

[Electronic Edition][Cited 137 times Red StarRed Star]
312.   Craig Gentry,  Certificate-Based Encryption and the Certificate Revocation Problem, pp. 272 - 293, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 136 times Red StarRed Star]
313.   James Goodman,  Anantha Chandrakasan,  An Energy Efficient Reconfigurable Public-Key Cryptography Processor Architecture, pp. 175 - 190, CHES 2000.

[Electronic Edition][Cited 136 times Red StarRed Star]
314.   John Kelsey,  Bruce Schneier,  David Wagner,  Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES, pp. 237 - 251, CRYPTO 1996.

[Electronic Edition][Cited 136 times Red StarRed Star]
315.   Dan Boneh,  Ramarathnam Venkatesan,  Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes, pp. 129 - 142, CRYPTO 1996.

[Electronic Edition][Cited 136 times Red StarRed Star]
316.   Niels Ferguson,  Single Term Off-Line Coins, pp. 318 - 328, EUROCRYPT 1993.

[Electronic Edition][Cited 136 times Red StarRed Star]
317.   Ray Bird,  Inder S. Gopal,  Amir Herzberg,  Philippe A. Janson,  Shay Kutten,  Refik Molva,  Moti Yung,  Systematic Design of Two-Party Authentication Protocols, pp. 44 - 61, CRYPTO 1991.

[Electronic Edition][Cited 136 times Red StarRed Star]
318.   Pierrick Gaudry,  An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, pp. 19 - 34, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 135 times Red StarRed Star]
319.   Markus Jakobsson,  A Practical Mix, pp. 448 - 461, EUROCRYPT 1998.

[Electronic Edition][Cited 135 times Red StarRed Star]
320.   Ran Canetti,  Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information, pp. 455 - 469, CRYPTO 1997.

[Electronic Edition][Cited 135 times Red StarRed Star]
321.   Jorge Guajardo,  Christof Paar,  Efficient Algorithms for Elliptic Curve Cryptosystems, pp. 342 - 356, CRYPTO 1997.

[Electronic Edition][Cited 135 times Red StarRed Star]
322.   Birgit Pfitzmann,  Matthias Schunter,  Asymmetric Fingerprinting (Extended Abstract), pp. 84 - 95, EUROCRYPT 1996.

[Electronic Edition][Cited 135 times Red StarRed Star]
323.   Ronald Cramer,  Ivan Damgard,  Jesper Buus Nielsen,  Multiparty Computation from Threshold Homomorphic Encryption, pp. 280 - 299, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 134 times Red StarRed Star]
324.   Bart Preneel,  Paul C. van Oorschot,  MDx-MAC and Building Fast MACs from Hash Functions, pp. 1 - 14, CRYPTO 1995.

[Electronic Edition][Cited 134 times Red StarRed Star]
325.   Claude CrĂ©peau,  Equivalence Between Two Flavours of Oblivious Transfers, pp. 350 - 354, CRYPTO 1987.

[Electronic Edition][Cited 134 times Red StarRed Star]
326.   Yair Frankel,  Peter Gemmell,  Philip D. MacKenzie,  Moti Yung,  Proactive RSA, pp. 440 - 454, CRYPTO 1997.

[Electronic Edition][Cited 133 times Red StarRed Star]
327.   Juan A. Garay,  Markus Jakobsson,  Philip D. MacKenzie,  Abuse-Free Optimistic Contract Signing, pp. 449 - 466, CRYPTO 1999.

[Electronic Edition][Cited 132 times Red StarRed Star]
328.   Don Coppersmith,  Finding a Small Root of a Univariate Modular Equation, pp. 155 - 165, EUROCRYPT 1996.

[Electronic Edition][Cited 132 times Red StarRed Star]
329.   Jean-Charles Faugère,  Antoine Joux,  Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases, pp. 44 - 60, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 131 times Red StarRed Star]
330.   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 131 times Red StarRed Star]
331.   Jun Furukawa,  Kazue Sako,  An Efficient Scheme for Proving a Shuffle, pp. 368 - 387, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 131 times Red StarRed Star]
332.   Máire McLoone,  John V. McCanny,  High Performance Single-Chip FPGA Rijndael Algorithm Implementations, pp. 65 - 76, CHES 2001.

[Electronic Edition][Cited 131 times Red StarRed Star]
333.   Michel Abdalla,  Leonid Reyzin,  A New Forward-Secure Digital Signature Scheme, pp. 116 - 129, ASIACRYPT 2000.

[Electronic Edition][Cited 130 times Red StarRed Star]
334.   Yuliang Zheng,  Josef Pieprzyk,  Jennifer Seberry,  HAVAL - A One-Way Hashing Algorithm with Variable Length of Output, pp. 83 - 104, ASIACRYPT 1992.

[Electronic Edition][Cited 129 times Red StarRed Star]
335.   Eric Brier,  Christophe Clavier,  Francis Olivier,  Correlation Power Analysis with a Leakage Model, pp. 16 - 29, CHES 2004.

[Electronic Edition][Cited 128 times Red StarRed Star]
336.   Elad Barkan,  Eli Biham,  Nathan Keller,  Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication, pp. 600 - 616, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 128 times Red StarRed Star]
337.   Jan Camenisch,  Markus Michels,  Separability and Efficiency for Generic Group Signature Schemes, pp. 413 - 430, CRYPTO 1999.

[Electronic Edition][Cited 128 times Red StarRed Star]
338.   Kaoru Kurosawa,  Yvo Desmedt,  Optimum Traitor Tracing and Asymmetric Schemes, pp. 145 - 157, EUROCRYPT 1998.

[Electronic Edition][Cited 128 times Red StarRed Star]
339.   Ueli M. Maurer,  Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms, pp. 271 - 281, CRYPTO 1994.

[Electronic Edition][Cited 128 times Red StarRed Star]
340.   Toshiki Habutsu,  Yoshifumi Nishio,  Iwao Sasase,  Shinsaku Mori,  A Secret Key Cryptosystem by Iterating a Chaotic Map, pp. 127 - 140, EUROCRYPT 1991.

[Electronic Edition][Cited 128 times Red StarRed Star]
341.   David Chaum,  Eugène van Heijst,  Birgit Pfitzmann,  Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer, pp. 470 - 484, CRYPTO 1991.

[Electronic Edition][Cited 128 times Red StarRed Star]
342.   Anna Lysyanskaya,  Zulfikar Ramzan,  Group Blind Digital Signatures: A Scalable Solution to Electronic Cash, pp. 184 - 197, FC 1998.

[Electronic Edition][Cited 127 times Red StarRed Star]
343.   Kaisa Nyberg,  Linear Approximation of Block Ciphers, pp. 439 - 444, EUROCRYPT 1994.

[Electronic Edition][Cited 127 times Red StarRed Star]
344.   Alex Biryukov,  David Wagner,  Slide Attacks, pp. 245 - 259, FSE 1999.

[Electronic Edition][Cited 126 times Red StarRed Star]
345.   Jovan Dj. Golic,  Cryptanalysis of Alleged A5 Stream Cipher, pp. 239 - 255, EUROCRYPT 1997.

[Electronic Edition][Cited 126 times Red StarRed Star]
346.   Iwan M. Duursma,  Hyang-Sook Lee,  Tate Pairing Implementation for Hyperelliptic Curves y, pp. 111 - 123, ASIACRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 125 times Red StarRed Star]
347.   Mike Just,  Serge Vaudenay,  Authenticated Multi-Party Key Agreement, pp. 36 - 49, ASIACRYPT 1996.

[Electronic Edition][Cited 125 times Red StarRed Star]
348.   David Chaum,  Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA, pp. 177 - 182, EUROCRYPT 1988.

[Electronic Edition][Cited 125 times Red StarRed Star]
349.   Mihir Bellare,  Alexandra Boldyreva,  Anand Desai,  David Pointcheval,  Key-Privacy in Public-Key Encryption, pp. 566 - 582, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 124 times Red StarRed Star]
350.   Kaisa Nyberg,  Lars R. Knudsen,  Provable Security Against Differential Cryptanalysis, pp. 566 - 574, CRYPTO 1992.

[Electronic Edition][Cited 124 times Red StarRed Star]
351.   Xavier Boyen,  Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography), pp. 383 - 399, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 123 times Red StarRed Star]
352.   Alex Biryukov,  Adi Shamir,  Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers, pp. 1 - 13, ASIACRYPT 2000.

[Electronic Edition][Cited 123 times Red StarRed Star]
353.   Anne Canteaut,  MichaĂ«l Trabbia,  Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5, pp. 573 - 588, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 122 times Red StarRed Star]
354.   Thomas S. Messerges,  Securing the AES Finalists Against Power Analysis Attacks, pp. 150 - 164, FSE 2000.

[Electronic Edition][Cited 122 times Red StarRed Star]
355.   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 121 times Red StarRed Star]
356.   Oded Goldreich,  Yehuda Lindell,  Session-Key Generation Using Human Passwords Only, pp. 408 - 432, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 121 times Red StarRed Star]
357.   Marc Joye,  Christophe Tymen,  Protections against Differential Analysis for Elliptic Curve Cryptography, pp. 377 - 390, CHES 2001.

[Electronic Edition][Cited 118 times Red StarRed Star]
358.   Jurjen N. Bos,  Matthijs J. Coster,  Addition Chain Heuristics, pp. 400 - 407, CRYPTO 1989.

[Electronic Edition][Cited 118 times Red StarRed Star]
359.   Michael Ben-Or,  Oded Goldreich,  Shafi Goldwasser,  Johan HĂĄstad,  Joe Kilian,  Silvio Micali,  Phillip Rogaway,  Everything Provable is Provable in Zero-Knowledge, pp. 37 - 56, CRYPTO 1988.

[Electronic Edition][Cited 118 times Red StarRed Star]
360.   Frederik Armknecht,  Matthias Krause,  Algebraic Attacks on Combiners with Memory, pp. 162 - 175, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 117 times Red StarRed Star]
361.   Emmanuel Bresson,  Olivier Chevassut,  David Pointcheval,  Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case, pp. 290 - 309, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 117 times Red StarRed Star]
362.   Erkay Savas,  Alexandre F. Tenca,  Ă‡etin Kaya Koç,  A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2^m), pp. 277 - 292, CHES 2000.

[Electronic Edition][Cited 117 times Red StarRed Star]
363.   Dan Boneh,  Richard J. Lipton,  Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract), pp. 283 - 297, CRYPTO 1996.

[Electronic Edition][Cited 117 times Red StarRed Star]
364.   Dan Boneh,  Eu-Jin Goh,  Kobbi Nissim,  Evaluating 2-DNF Formulas on Ciphertexts, pp. 325 - 341, TCC 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 116 times Red StarRed Star]
365.   Yevgeniy Dodis,  Jonathan Katz,  Shouhuai Xu,  Moti Yung,  Strong Key-Insulated Signature Schemes, pp. 130 - 144, PKC 2003.

[Electronic Edition][Cited 116 times Red StarRed Star]
366.   Pierre-Alain Fouque,  Guillaume Poupard,  Jacques Stern,  Sharing Decryption in the Context of Voting or Lotteries, pp. 90 - 104, FC 2000.

[Electronic Edition][Cited 116 times Red StarRed Star]
367.   Ransom Richardson,  Joe Kilian,  On the Concurrent Composition of Zero-Knowledge Proofs, pp. 415 - 431, EUROCRYPT 1999.

[Electronic Edition][Cited 116 times Red StarRed Star]
368.   Matt Blaze,  Gerrit Bleumer,  Martin J. Strauss,  Divertible Protocols and Atomic Proxy Cryptography, pp. 127 - 144, EUROCRYPT 1998.

[Electronic Edition][Cited 116 times Red StarRed Star]
369.   Eli Biham,  A Fast New DES Implementation in Software, pp. 260 - 272, FSE 1997.

[Electronic Edition][Cited 116 times Red StarRed Star]
370.   Don Coppersmith,  Matthew K. Franklin,  Jacques Patarin,  Michael K. Reiter,  Low-Exponent RSA with Related Messages, pp. 1 - 9, EUROCRYPT 1996.

[Electronic Edition][Cited 116 times Red StarRed Star]
371.   Willi Meier,  Othmar Staffelbach,  The Self-Shrinking Generator, pp. 205 - 214, EUROCRYPT 1994.

[Electronic Edition][Cited 116 times Red StarRed Star]
372.   Kenji Koyama,  Ueli M. Maurer,  Tatsuaki Okamoto,  Scott A. Vanstone,  New Public-Key Schemes Based on Elliptic Curves over the Ring Z, pp. 252 - 266, CRYPTO 1991.

[Electronic Edition][Cited 116 times Red StarRed Star]
373.   Jean-SĂ©bastien Coron,  Yevgeniy Dodis,  CĂ©cile Malinaud,  Prashant Puniya,  Merkle-DamgĂĄrd Revisited: How to Construct a Hash Function, pp. 430 - 448, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 115 times Red StarRed Star]
374.   Mihir Bellare,  Phillip Rogaway,  Collision-Resistant Hashing: Towards Making UOWHFs Practical, pp. 470 - 484, CRYPTO 1997.

[Electronic Edition][Cited 115 times Red StarRed Star]
375.   Rosario Gennaro,  Hugo Krawczyk,  Tal Rabin,  RSA-Based Undeniable Signatures, pp. 132 - 149, CRYPTO 1997.

[Electronic Edition][Cited 115 times Red StarRed Star]
376.   Moni Naor,  Benny Pinkas,  Visual Authentication and Identification, pp. 322 - 336, CRYPTO 1997.

[Electronic Edition][Cited 115 times Red StarRed Star]
377.   David Chaum,  Torben P. Pedersen,  Transferred Cash Grows in Size, pp. 390 - 407, EUROCRYPT 1992.

[Electronic Edition][Cited 115 times Red StarRed Star]
378.   Paulo S. L. M. Barreto,  Michael Naehrig,  Pairing-Friendly Elliptic Curves of Prime Order, pp. 319 - 331, SAC 2005.

[Electronic Edition][Cited 114 times Red StarRed Star]
379.   David Wagner,  A Generalized Birthday Problem, pp. 288 - 303, CRYPTO 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 114 times Red StarRed Star]
380.   G. R. Blakley,  Catherine Meadows,  Security of Ramp Schemes, pp. 242 - 268, CRYPTO 1984.

[Electronic Edition][Cited 114 times Red StarRed Star]
381.   Don Coppersmith,  Markus Jakobsson,  Almost Optimal Hash Sequence Traversal, pp. 102 - 119, FC 2002.

[Electronic Edition][Cited 113 times Red StarRed Star]
382.   Julio LĂłpez Hernandez,  Ricardo Dahab,  Improved Algorithms for Elliptic Curve Arithmetic in GF(2^n), pp. 201 - 212, SAC 1998.

[Electronic Edition][Cited 113 times Red StarRed Star]
383.   Erik De Win,  Antoon Bosselaers,  Servaas Vandenberghe,  Peter De Gersem,  Joos Vandewalle,  A Fast Software Implementation for Arithmetic Operations in GF(2, pp. 65 - 76, ASIACRYPT 1996.

[Electronic Edition][Cited 113 times Red StarRed Star]
384.   William Aiello,  Yuval Ishai,  Omer Reingold,  Priced Oblivious Transfer: How to Sell Digital Goods, pp. 119 - 135, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 112 times Red StarRed Star]
385.   Michael Brown,  Darrel Hankerson,  Julio LĂłpez Hernandez,  Alfred Menezes,  Software Implementation of the NIST Elliptic Curves Over Prime Fields, pp. 250 - 265, CT-RSA 2001.

[Electronic Edition][Cited 112 times Red StarRed Star]
386.   Victor Shoup,  Using Hash Functions as a Hedge against Chosen Ciphertext Attack, pp. 275 - 288, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 112 times Red StarRed Star]
387.   Ernest F. Brickell,  Kevin S. McCurley,  An Interactive Identification Scheme Based on Discrete Logarithms and Factoring, pp. 63 - 71, EUROCRYPT 1990.

[Electronic Edition][Cited 112 times Red StarRed Star]
388.   Joonsang Baek,  Ron Steinfeld,  Yuliang Zheng,  Formal Proofs for the Security of Signcryption, pp. 80 - 98, PKC 2002.

[Electronic Edition][Cited 111 times Red StarRed Star]
389.   Ernest F. Brickell,  Douglas R. Stinson,  Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, pp. 242 - 252, CRYPTO 1990.

[Electronic Edition][Cited 111 times Red StarRed Star]
390.   Phillip Rogaway,  Thomas Shrimpton,  Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance, pp. 371 - 388, FSE 2004.

[Electronic Edition][Cited 110 times Red StarRed Star]
391.   Emmanuel Bresson,  Olivier Chevassut,  David Pointcheval,  Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions, pp. 321 - 336, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 110 times Red StarRed Star]
392.   Nicholas J. Hopper,  Manuel Blum,  Secure Human Identification Protocols, pp. 52 - 66, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 110 times Red StarRed Star]
393.   Daniel R. Simon,  Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?, pp. 334 - 345, EUROCRYPT 1998.

[Electronic Edition][Cited 110 times Red StarRed Star]
394.   Mihir Bellare,  Chanathip Namprempre,  Gregory Neven,  Security Proofs for Identity-Based Identification and Signature Schemes, pp. 268 - 286, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 109 times Red StarRed Star]
395.   Mihir Bellare,  Alexandra Boldyreva,  Adriana Palacio,  An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem, pp. 171 - 188, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 108 times Red StarRed Star]
396.   Cynthia Dwork,  Andrew Goldberg,  Moni Naor,  On Memory-Bound Functions for Fighting Spam, pp. 426 - 444, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 108 times Red StarRed Star]
397.   Adi Shamir,  Yael Tauman,  Improved Online/Offline Signature Schemes, pp. 355 - 367, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 108 times Red StarRed Star]
398.   Tsutomu Matsumoto,  Hideki Imai,  On the Key Predistribution System: A Practical Solution to the Key Distribution Problem, pp. 185 - 193, CRYPTO 1987.

[Electronic Edition][Cited 108 times Red StarRed Star]
399.   Shuchi Chawla,  Cynthia Dwork,  Frank McSherry,  Adam Smith,  Hoeteck Wee,  Toward Privacy in Public Databases, pp. 363 - 385, TCC 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 107 times Red StarRed Star]
400.   Shafi Goldwasser,  Yael Tauman Kalai,  On the (In)security of the Fiat-Shamir Paradigm, pp. 102 - 102, FOCS 2003.

[Electronic Edition][Cited 107 times Red StarRed Star]
401.   Phong Q. Nguyen,  The Two Faces of Lattices in Cryptology, pp. 313 - 313, SAC 2001.

[Electronic Edition][Cited 107 times Red StarRed Star]
402.   Kazumaro Aoki,  Tetsuya Ichikawa,  Masayuki Kanda,  Mitsuru Matsui,  Shiho Moriai,  Junko Nakajima,  Toshio Tokita,  Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms - Design and Analysis, pp. 39 - 56, SAC 2000.

[Electronic Edition][Cited 107 times Red StarRed Star]
403.   Mitsuru Matsui,  New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis, pp. 205 - 218, FSE 1996.

[Electronic Edition][Cited 107 times Red StarRed Star]
404.   RĂ©jane ForrĂ©,  The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition, pp. 450 - 468, CRYPTO 1988.

[Electronic Edition][Cited 107 times Red StarRed Star]
405.   Michael Luby,  Jessica Staddon,  Combinatorial Bounds for Broadcast Encryption, pp. 512 - 526, EUROCRYPT 1998.

[Electronic Edition][Cited 106 times Red StarRed Star]
406.   Charles H. Bennett,  Gilles Brassard,  Claude CrĂ©peau,  Marie-HĂ©lène Skubiszewska,  Practical Quantum Oblivious Transfer, pp. 351 - 366, CRYPTO 1991.

[Electronic Edition][Cited 106 times Red StarRed Star]
407.   David C. Feldmeier,  Philip R. Karn,  UNIX Password Security - Ten Years Later, pp. 44 - 63, CRYPTO 1989.

[Electronic Edition][Cited 106 times Red StarRed Star]
408.   Ernest F. Brickell,  A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography, pp. 51 - 60, CRYPTO 1982.

[Electronic Edition][Cited 106 times Red StarRed Star]
409.   Craig Gentry,  Practical Identity-Based Encryption Without Random Oracles, pp. 445 - 464, EUROCRYPT 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 105 times Red StarRed Star]
410.   Mihir Bellare,  Haixia Shi,  Chong Zhang,  Foundations of Group Signatures: The Case of Dynamic Groups, pp. 136 - 153, CT-RSA 2005.

[Electronic Edition][Cited 105 times Red StarRed Star]
411.   Ronald L. Rivest,  All-or-Nothing Encryption and the Package Transform, pp. 210 - 218, FSE 1997.

[Electronic Edition][Cited 105 times Red StarRed Star]
412.   Don Coppersmith,  Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known, pp. 178 - 189, EUROCRYPT 1996.

[Electronic Edition][Cited 105 times Red StarRed Star]
413.   Hans Dobbertin,  Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity, pp. 61 - 74, FSE 1994.

[Electronic Edition][Cited 105 times Red StarRed Star]
414.   Brian A. LaMacchia,  Andrew M. Odlyzko,  Solving Large Sparse Linear Systems over Finite Fields, pp. 109 - 133, CRYPTO 1990.

[Electronic Edition][Cited 105 times Red StarRed Star]
415.   Ernest F. Brickell,  A Survey of Hardware Implementations of RSA (Abstract), pp. 368 - 370, CRYPTO 1989.

[Electronic Edition][Cited 105 times Red StarRed Star]
416.   Umesh V. Vazirani,  Vijay V. Vazirani,  Efficient and Secure Pseudo-Random Number Generation, pp. 193 - 202, CRYPTO 1984.

[Electronic Edition][Cited 105 times Red StarRed Star]
417.   Dan Boneh,  Jonathan Katz,  Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption, pp. 87 - 103, CT-RSA 2005.

[Electronic Edition][Cited 104 times Red StarRed Star]
418.   Michel Abdalla,  Mihir Bellare,  Phillip Rogaway,  The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES, pp. 143 - 158, CT-RSA 2001.

[Electronic Edition][Cited 104 times Red StarRed Star]
419.   Pierre-Yvan Liardet,  Nigel P. Smart,  Preventing SPA/DPA in ECC Systems Using the Jacobi Form, pp. 391 - 401, CHES 2001.

[Electronic Edition][Cited 104 times Red StarRed Star]
420.   Vincent Rijmen,  Joan Daemen,  Bart Preneel,  Antoon Bosselaers,  Erik De Win,  The Cipher SHARK, pp. 99 - 111, FSE 1996.

[Electronic Edition][Cited 104 times Red StarRed Star]
421.   Mihir Bellare,  Oded Goldreich,  Shafi Goldwasser,  Incremental Cryptography: The Case of Hashing and Signing, pp. 216 - 233, CRYPTO 1994.

[Electronic Edition][Cited 104 times Red StarRed Star]
422.   Amit Sahai,  Brent Waters,  Fuzzy Identity-Based Encryption, pp. 457 - 473, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 103 times Red StarRed Star]
423.   Louis Goubin,  A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems, pp. 199 - 210, PKC 2003.

[Electronic Edition][Cited 103 times Red StarRed Star]
424.   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 103 times Red StarRed Star]
425.   Philip D. MacKenzie,  Sarvar Patel,  Ram Swaminathan,  Password-Authenticated Key Exchange Based on RSA, pp. 599 - 613, ASIACRYPT 2000.

[Electronic Edition][Cited 103 times Red StarRed Star]
426.   Alexandre F. Tenca,  Ă‡etin Kaya Koç,  A Scalable Architecture for Montgomery Multiplication, pp. 94 - 108, CHES 1999.

[Electronic Edition][Cited 103 times Red StarRed Star]
427.   Ran Canetti,  Cynthia Dwork,  Moni Naor,  Rafail Ostrovsky,  Deniable Encryption, pp. 90 - 104, CRYPTO 1997.

[Electronic Edition][Cited 103 times Red StarRed Star]
428.   Birgit Pfitzmann,  Michael Waidner,  Anonymous Fingerprinting, pp. 88 - 102, EUROCRYPT 1997.

[Electronic Edition][Cited 103 times Red StarRed Star]
429.   Ivan Damgard,  Practical and Provably Secure Release of a Secret and Exchange of Signatures, pp. 200 - 217, EUROCRYPT 1993.

[Electronic Edition][Cited 103 times Red StarRed Star]
430.   Ueli M. Maurer,  Yacov Yacobi,  Non-interactive Public-Key Cryptography, pp. 498 - 507, EUROCRYPT 1991.

[Electronic Edition][Cited 103 times Red StarRed Star]
431.   Dag Arne Osvik,  Adi Shamir,  Eran Tromer,  Cache Attacks and Countermeasures: The Case of AES, pp. 1 - 20, CT-RSA 2006.

[Electronic Edition][Cited 102 times Red StarRed Star]
432.   Jean-SĂ©bastien Coron,  Louis Goubin,  On Boolean and Arithmetic Masking against Differential Power Analysis, pp. 231 - 237, CHES 2000.

[Electronic Edition][Cited 102 times Red StarRed Star]
433.   Derek Atkins,  Michael Graff,  Arjen K. Lenstra,  Paul C. Leyland,  The Magic Words are Squeamish Ossifrage, pp. 263 - 277, ASIACRYPT 1994.

[Electronic Edition][Cited 102 times Red StarRed Star]
434.   Kazue Sako,  Joe Kilian,  Secure Voting Using Partially Compatible Homomorphisms, pp. 411 - 424, CRYPTO 1994.

[Electronic Edition][Cited 102 times Red StarRed Star]
435.   Danny Dolev,  Shimon Even,  Richard M. Karp,  On the Security of Ping-Pong Protocols, pp. 177 - 186, CRYPTO 1982.

[Electronic Edition][Cited 102 times Red StarRed Star]
436.   Tetsu Iwata,  Kaoru Kurosawa,  OMAC: One-Key CBC MAC, pp. 129 - 153, FSE 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 101 times Red StarRed Star]
437.   Masayuki Abe,  Tatsuaki Okamoto,  Provably Secure Partially Blind Signatures, pp. 271 - 286, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 101 times Red StarRed Star]
438.   Werner Schindler,  A Timing Attack against RSA with the Chinese Remainder Theorem, pp. 109 - 124, CHES 2000.

[Electronic Edition][Cited 101 times Red StarRed Star]
439.   Stefan Droste,  New Results on Visual Cryptography, pp. 401 - 415, CRYPTO 1996.

[Electronic Edition][Cited 101 times Red StarRed Star]
440.   Lawrence Brown,  Josef Pieprzyk,  Jennifer Seberry,  LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications, pp. 229 - 236, ASIACRYPT 1990.

[Electronic Edition][Cited 101 times Red StarRed Star]
441.   Akihiro Shimizu,  Shoji Miyaguchi,  Fast Data Encipherment Algorithm FEAL, pp. 267 - 278, EUROCRYPT 1987.

[Electronic Edition][Cited 101 times Red StarRed Star]
442.   Henry Kuo,  Ingrid Verbauwhede,  Architectural Optimization for a 1.82Gbits/sec VLSI Implementation of the AES Rijndael Algorithm, pp. 51 - 64, CHES 2001.

[Electronic Edition][Cited 100 times Red StarRed Star]
443.   Gustavus J. Simmons,  How to (Really) Share a Secret, pp. 390 - 448, CRYPTO 1988.

[Electronic Edition][Cited 100 times Red StarRed Star]
444.   Shimon Even,  Oded Goldreich,  On the Security of Multi-Party Ping-Pong Protocols, pp. 315 - 315, CRYPTO 1982.

[Electronic Edition][Cited 100 times Red StarRed Star]
445.   Markus Jakobsson,  Ari Juels,  Mix and Match: Secure Function Evaluation via Ciphertexts, pp. 162 - 177, ASIACRYPT 2000.

[Electronic Edition][Cited 99 times Red Star]
446.   Thomas Johansson,  Fredrik Jönsson,  Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes, pp. 347 - 362, EUROCRYPT 1999.

[Electronic Edition][Cited 99 times Red Star]
447.   George I. Davida,  Yair Frankel,  Yiannis Tsiounis,  Moti Yung,  Anonymity Control in E-Cash Systems, pp. 1 - 16, FC 1997.

[Electronic Edition][Cited 99 times Red Star]
448.   Kaisa Nyberg,  On the Construction of Highly Nonlinear Permutations, pp. 92 - 98, EUROCRYPT 1992.

[Electronic Edition][Cited 99 times Red Star]
449.   Tsutomu Matsumoto,  Koki Kato,  Hideki Imai,  Speeding Up Secret Computations with Insecure Auxiliary Devices, pp. 497 - 506, CRYPTO 1988.

[Electronic Edition][Cited 99 times Red Star]
450.   Russell Impagliazzo,  Moti Yung,  Direct Minimum-Knowledge Computations, pp. 40 - 51, CRYPTO 1987.

[Electronic Edition][Cited 99 times Red Star]
451.   Suresh Chari,  Josyula R. Rao,  Pankaj Rohatgi,  Template Attacks, pp. 13 - 28, CHES 2002.

[Electronic Edition][Cited 98 times Red Star]
452.   Silvio Micali,  Ronald L. Rivest,  Micropayments Revisited, pp. 149 - 163, CT-RSA 2002.

[Electronic Edition][Cited 98 times Red Star]
453.   Marc Joye,  Jean-Jacques Quisquater,  Hessian Elliptic Curves and Side-Channel Attacks, pp. 402 - 410, CHES 2001.

[Electronic Edition][Cited 98 times Red Star]
454.   Vladimor V. Chepyzhov,  Thomas Johansson,  Ben J. M. Smeets,  A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers, pp. 181 - 195, FSE 2000.

[Electronic Edition][Cited 98 times Red Star]
455.   Ravi Kumar,  Sridhar Rajagopalan,  Amit Sahai,  Coding Constructions for Blacklisting Problems without Computational Assumptions, pp. 609 - 623, CRYPTO 1999.

[Electronic Edition][Cited 98 times Red Star]
456.   Jacques Stern,  A New Identification Scheme Based on Syndrome Decoding, pp. 13 - 21, CRYPTO 1993.

[Electronic Edition][Cited 98 times Red Star]
457.   Claude Carlet,  Partially-Bent Functions, pp. 280 - 291, CRYPTO 1992.

[Electronic Edition][Cited 98 times Red Star]
458.   Oded Goldreich,  Hugo Krawczyk,  Michael Luby,  On the Existence of Pseudorandom Generators, pp. 146 - 162, CRYPTO 1988.

[Electronic Edition][Cited 98 times Red Star]
459.   Ran Canetti,  Tal Rabin,  Universal Composition with Joint State, pp. 265 - 281, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 97 times Red Star]
460.   Dan Boneh,  Moni Naor,  Timed Commitments, pp. 236 - 254, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 97 times Red Star]
461.   Guillaume Poupard,  Jacques Stern,  Security Analysis of a Practical "on the fly" Authentication and Signature Generation, pp. 422 - 436, EUROCRYPT 1998.

[Electronic Edition][Cited 97 times Red Star]
462.   Chae Hoon Lim,  Pil Joong Lee,  A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroup, pp. 249 - 263, CRYPTO 1997.

[Electronic Edition][Cited 97 times Red Star]
463.   Frank Thomson Leighton,  Silvio Micali,  Secret-Key Agreement without Public-Key Cryptography, pp. 456 - 479, CRYPTO 1993.

[Electronic Edition][Cited 97 times Red Star]
464.   Eli Biham,  Adi Shamir,  Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer, pp. 156 - 171, CRYPTO 1991.

[Electronic Edition][Cited 97 times Red Star]
465.   Gildas Avoine,  Philippe Oechslin,  RFID Traceability: A Multilayer Problem, pp. 125 - 140, FC 2005.

[Electronic Edition][Cited 96 times Red Star]
466.   Kaoru Kurosawa,  Yvo Desmedt,  A New Paradigm of Hybrid Encryption Scheme, pp. 426 - 442, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 96 times Red Star]
467.   Hugo Krawczyk,  SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols, pp. 400 - 425, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 96 times Red Star]
468.   Atri Rudra,  Pradeep K. Dubey,  Charanjit S. Jutla,  Vijay Kumar,  Josyula R. Rao,  Pankaj Rohatgi,  Efficient Rijndael Encryption Implementation with Composite Field Arithmetic, pp. 171 - 184, CHES 2001.

[Electronic Edition][Cited 96 times Red Star]
469.   Ahto Buldas,  Peeter Laud,  Helger Lipmaa,  Jan Willemson,  Time-Stamping with Binary Linking Schemes, pp. 486 - 501, CRYPTO 1998.

[Electronic Edition][Cited 96 times Red Star]
470.   Paul C. van Oorschot,  Michael J. Wiener,  On Diffie-Hellman Key Agreement with Short Exponents, pp. 332 - 343, EUROCRYPT 1996.

[Electronic Edition][Cited 96 times Red Star]
471.   Carlo Blundo,  Alfredo De Santis,  Douglas R. Stinson,  Ugo Vaccaro,  Graph Decompositions and Secret Sharing Schemes, pp. 1 - 24, EUROCRYPT 1992.

[Electronic Edition][Cited 96 times Red Star]
472.   Arjen K. Lenstra,  Mark S. Manasse,  Factoring by Electronic Mail, pp. 355 - 371, EUROCRYPT 1989.

[Electronic Edition][Cited 96 times Red Star]
473.   David Chaum,  Jan-Hendrik Evertse,  A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations, pp. 118 - 167, CRYPTO 1986.

[Electronic Edition][Cited 96 times Red Star]
474.   Hugo Krawczyk,  HMQV: A High-Performance Secure Diffie-Hellman Protocol, pp. 546 - 566, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 95 times Red Star]
475.   Elisabeth Oswald,  Manfred Aigner,  Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks, pp. 39 - 50, CHES 2001.

[Electronic Edition][Cited 95 times Red Star]
476.   Michel Abdalla,  Mihir Bellare,  Dario Catalano,  Eike Kiltz,  Tadayoshi Kohno,  Tanja Lange,  John Malone-Lee,  Gregory Neven,  Pascal Paillier,  Haixia Shi,  Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions, pp. 205 - 222, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 94 times Red Star]
477.   David Molnar,  Andrea Soppera,  David Wagner,  A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags, pp. 276 - 290, SAC 2005.

[Electronic Edition][Cited 94 times Red Star]
478.   Michel Abdalla,  Pierre-Alain Fouque,  David Pointcheval,  Password-Based Authenticated Key Exchange in the Three-Party Setting, pp. 65 - 84, PKC 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 94 times Red Star]
479.   Cynthia Dwork,  Kobbi Nissim,  Privacy-Preserving Datamining on Vertically Partitioned Databases, pp. 528 - 544, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 94 times Red Star]
480.   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 94 times Red Star]
481.   Peter L. Montgomery,  A Block Lanczos Algorithm for Finding Dependencies Over GF(2), pp. 106 - 120, EUROCRYPT 1995.

[Electronic Edition][Cited 94 times Red Star]
482.   Dan Boneh,  Richard J. Lipton,  Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract), pp. 424 - 437, CRYPTO 1995.

[Electronic Edition][Cited 94 times Red Star]
483.   Rosario Gennaro,  Yehuda Lindell,  A Framework for Password-Based Authenticated Key Exchange, pp. 524 - 543, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 93 times Red Star]
484.   Jens Groth,  A Verifiable Secret Shuffle of Homomorphic Encryptions, pp. 145 - 160, PKC 2003.

[Electronic Edition][Cited 93 times Red Star]
485.   Ron Steinfeld,  Laurence Bull,  Huaxiong Wang,  Josef Pieprzyk,  Universal Designated-Verifier Signatures, pp. 523 - 542, ASIACRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 93 times Red Star]
486.   Virgil D. Gligor,  Pompiliu Donescu,  Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes, pp. 92 - 108, FSE 2001.

[Electronic Edition][Cited 93 times Red Star]
487.   Palash Sarkar,  Subhamoy Maitra,  Construction of Nonlinear Boolean Functions with Important Cryptographic Properties, pp. 485 - 506, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 93 times Red Star]
488.   Burton S. Kaliski Jr.,  The MD4 Message Digest Algorithm (Abstract), pp. 492 - 492, EUROCRYPT 1990.

[Electronic Edition][Cited 93 times Red Star]
489.   Michael Waidner,  Birgit Pfitzmann,  The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract), pp. 690 - 690, EUROCRYPT 1989.

[Electronic Edition][Cited 92 times Red Star]
490.   Leonard M. Adleman,  Jonathan DeMarrais,  A Subexponential Algorithm for Discrete Logarithms over All Finite Fields, pp. 147 - 158, CRYPTO 1993.

[Electronic Edition][Cited 91 times Red Star]
491.   Arjen K. Lenstra,  Mark S. Manasse,  Factoring With Two Large Primes, pp. 72 - 82, EUROCRYPT 1990.

[Electronic Edition][Cited 91 times Red Star]
492.   Donald Beaver,  Shafi Goldwasser,  Multiparty Computation with Faulty Majority, pp. 589 - 590, CRYPTO 1989.

[Electronic Edition][Cited 91 times Red Star]
493.   Johan HĂĄstad,  On Using RSA with Low Exponent in a Public Key Network, pp. 403 - 408, CRYPTO 1985.

[Electronic Edition][Cited 91 times Red Star]
494.   Kris Tiri,  Ingrid Verbauwhede,  Securing Encryption Algorithms against DPA at the Logic Level: Next Generation Smart Card Technology, pp. 125 - 136, CHES 2003.

[Electronic Edition][Cited 90 times Red Star]
495.   Paulo S. L. M. Barreto,  Ben Lynn,  Michael Scott,  On the Selection of Pairing-Friendly Groups, pp. 17 - 25, SAC 2003.

[Electronic Edition][Cited 90 times Red Star]
496.   Johannes Blömer,  Jean-Pierre Seifert,  Fault Based Cryptanalysis of the Advanced Encryption Standard (AES), pp. 162 - 181, FC 2003.

[Electronic Edition][Cited 90 times Red Star]
497.   Tetsuya Izu,  Tsuyoshi Takagi,  A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks, pp. 280 - 296, PKC 2002.

[Electronic Edition][Cited 90 times Red Star]
498.   Moses Liskov,  Ronald L. Rivest,  David Wagner,  Tweakable Block Ciphers, pp. 31 - 46, CRYPTO 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 90 times Red Star]
499.   Louis Granboulan,  Phong Q. Nguyen,  Fabrice Noilhan,  Serge Vaudenay,  DFCv2, pp. 57 - 71, SAC 2000.

[Electronic Edition][Cited 90 times Red Star]
500.   Feng Bao,  Robert H. Deng,  A Signcryption Scheme with Signature Directly Verifiable by Public Key, pp. 55 - 59, PKC 1998.

[Electronic Edition][Cited 90 times Red Star]
501.   Burton S. Kaliski Jr.,  Matthew J. B. Robshaw,  Linear Cryptanalysis Using Multiple Approximations, pp. 26 - 39, CRYPTO 1994.

[Electronic Edition][Cited 90 times Red Star]
502.   Patrik Ekdahl,  Thomas Johansson,  A New Version of the Stream Cipher SNOW, pp. 47 - 61, SAC 2002.

[Electronic Edition][Cited 89 times Red Star]
503.   Katsuyuki Okeya,  Kouichi Sakurai,  Power Analysis Breaks Elliptic Curve Cryptosystems even Secure against the Timing Attack, pp. 178 - 190, INDOCRYPT 2000.

[Electronic Edition][Cited 89 times Red Star]
504.   Dan Boneh,  Ramarathnam Venkatesan,  Breaking RSA May Not Be Equivalent to Factoring, pp. 59 - 71, EUROCRYPT 1998.

[Electronic Edition][Cited 89 times Red Star]
505.   Shai Halevi,  Phillip Rogaway,  A Tweakable Enciphering Mode, pp. 482 - 499, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 88 times Red Star]
506.   Jovan Dj. Golic,  Christophe Tymen,  Multiplicative Masking and Power Analysis of AES, pp. 198 - 212, CHES 2002.

[Electronic Edition][Cited 88 times Red Star]
507.   Mihir Bellare,  Amit Sahai,  Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization, pp. 519 - 536, CRYPTO 1999.

[Electronic Edition][Cited 88 times Red Star]
508.   Colin Boyd,  Ernest Foo,  Off-Line Fair Payment Protocols Using Convertible Signatures, pp. 271 - 285, ASIACRYPT 1998.

[Electronic Edition][Cited 88 times Red Star]
509.   Michael J. Wiener,  Robert J. Zuccherato,  Faster Attacks on Elliptic Curve Cryptosystems, pp. 190 - 200, SAC 1998.

[Electronic Edition][Cited 88 times Red Star]
510.   Ross J. Anderson,  Eli Biham,  Two Practical and Provably Secure Block Ciphers: BEARS and LION, pp. 113 - 120, FSE 1996.

[Electronic Edition][Cited 88 times Red Star]
511.   Stefan Brands,  Restrictive Blinding of Secret-Key Certificates, pp. 231 - 247, EUROCRYPT 1995.

[Electronic Edition][Cited 88 times Red Star]
512.   Kazuo Ohta,  Tatsuaki Okamoto,  A Modification of the Fiat-Shamir Scheme, pp. 232 - 243, CRYPTO 1988.

[Electronic Edition][Cited 88 times Red Star]
513.   Philippe Oechslin,  Making a Faster Cryptanalytic Time-Memory Trade-Off, pp. 617 - 630, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 87 times Red Star]
514.   Pawel Chodowiec,  Kris Gaj,  Very Compact FPGA Implementation of the AES Algorithm, pp. 319 - 333, CHES 2003.

[Electronic Edition][Cited 87 times Red Star]
515.   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 87 times Red Star]
516.   Itsik Mantin,  Adi Shamir,  A Practical Attack on Broadcast RC4, pp. 152 - 164, FSE 2001.

[Electronic Edition][Cited 87 times Red Star]
517.   James Cowie,  Bruce Dodson,  R. Marije Elkenbracht-Huizing,  Arjen K. Lenstra,  Peter L. Montgomery,  Jörg Zayer,  A World Wide Number Field Sieve Factoring Record: On to 512 Bits, pp. 382 - 394, ASIACRYPT 1996.

[Electronic Edition][Cited 87 times Red Star]
518.   Claus-Peter Schnorr,  Horst Helmut Hörner,  Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, pp. 1 - 12, EUROCRYPT 1995.

[Electronic Edition][Cited 87 times Red Star]
519.   Cynthia Dwork,  Moni Naor,  An Efficient Existentially Unforgeable Signature Scheme and its Applications, pp. 234 - 246, CRYPTO 1994.

[Electronic Edition][Cited 87 times Red Star]
520.   Bert den Boer,  Antoon Bosselaers,  An Attack on the Last Two Rounds of MD4, pp. 194 - 203, CRYPTO 1991.

[Electronic Edition][Cited 87 times Red Star]
521.   Vladimor V. Chepyzhov,  Ben J. M. Smeets,  On A Fast Correlation Attack on Certain Stream Ciphers, pp. 176 - 185, EUROCRYPT 1991.

[Electronic Edition][Cited 87 times Red Star]
522.   Robert Johnson,  David Molnar,  Dawn Xiaodong Song,  David Wagner,  Homomorphic Signature Schemes, pp. 244 - 262, CT-RSA 2002.

[Electronic Edition][Cited 86 times Red Star]
523.   Adi Shamir,  Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies, pp. 71 - 77, CHES 2000.

[Electronic Edition][Cited 86 times Red Star]
524.   Ronald Cramer,  Ivan Damgard,  Stefan Dziembowski,  Martin Hirt,  Tal Rabin,  Efficient Multiparty Computations Secure Against an Adaptive Adversary, pp. 311 - 326, EUROCRYPT 1999.

[Electronic Edition][Cited 86 times Red Star]
525.   Moni Naor,  Benny Pinkas,  Threshold Traitor Tracing, pp. 502 - 517, CRYPTO 1998.

[Electronic Edition][Cited 86 times Red Star]
526.   Willi Meier,  Othmar Staffelbach,  Correlation Properties of Combiners with Memory in Stream Ciphers, pp. 204 - 213, EUROCRYPT 1990.

[Electronic Edition][Cited 86 times Red Star]
527.   Tatsuaki Okamoto,  Kazuo Ohta,  Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash, pp. 481 - 496, CRYPTO 1989.

[Electronic Edition][Cited 86 times Red Star]
528.   Sumio Morioka,  Akashi Satoh,  An Optimized S-Box Circuit Architecture for Low Power AES Design, pp. 172 - 186, CHES 2002.

[Electronic Edition][Cited 85 times Red Star]
529.   Emmanuel Bresson,  Olivier Chevassut,  David Pointcheval,  Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks, pp. 497 - 514, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 85 times Red Star]
530.   Nils Gura,  Sheueling Chang Shantz,  Hans Eberle,  Sumit Gupta,  Vipul Gupta,  Daniel Finchelstein,  Edouard Goupy,  Douglas Stebila,  An End-to-End Systems Approach to Elliptic Curve Cryptography, pp. 349 - 365, CHES 2002.

[Electronic Edition][Cited 85 times Red Star]
531.   Stefania Cavallar,  Bruce Dodson,  Arjen K. Lenstra,  Walter M. Lioen,  Peter L. Montgomery,  Brian Murphy,  Herman te Riele,  Karen Aardal,  Jeff Gilchrist,  GĂ©rard Guillerm,  Paul C. Leyland,  JoĂ«l Marchand,  François Morain,  Alec Muffett,  Chris Putnam,  Craig Putnam,  Paul Zimmermann,  Factorization of a 512-Bit RSA Modulus, pp. 1 - 18, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 85 times Red Star]
532.   Alex Biryukov,  David Wagner,  Advanced Slide Attacks, pp. 589 - 606, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 85 times Red Star]
533.   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 85 times Red Star]
534.   Ari Juels,  Michael Luby,  Rafail Ostrovsky,  Security of Blind Digital Signatures (Extended Abstract), pp. 150 - 164, CRYPTO 1997.

[Electronic Edition][Cited 85 times Red Star]
535.   Phillip Rogaway,  Bucket Hashing and its Application to Fast Message Authentication, pp. 29 - 42, CRYPTO 1995.

[Electronic Edition][Cited 85 times Red Star]
536.   Zvi Galil,  Stuart Haber,  Moti Yung,  Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model, pp. 135 - 155, CRYPTO 1987.

[Electronic Edition][Cited 85 times Red Star]
537.   Brian Neil Levine,  Michael K. Reiter,  Chenxi Wang,  Matthew Wright,  Timing Attacks in Low-Latency Mix Systems (Extended Abstract), pp. 251 - 265, FC 2004.

[Electronic Edition][Cited 84 times Red Star]
538.   Stephen W. Boyd,  Angelos D. Keromytis,  SQLrand: Preventing SQL Injection Attacks, pp. 292 - 302, ACNS 2004.

[Electronic Edition][Cited 84 times Red Star]
539.   Aggelos Kiayias,  Yiannis Tsiounis,  Moti Yung,  Traceable Signatures, pp. 571 - 589, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 84 times Red Star]
540.   Frederik Armknecht,  Improving Fast Algebraic Attacks, pp. 65 - 82, FSE 2004.

[Electronic Edition][Cited 84 times Red Star]
541.   Alessandro Acquisti,  Roger Dingledine,  Paul F. Syverson,  On the Economics of Anonymity, pp. 84 - 102, FC 2003.

[Electronic Edition][Cited 84 times Red Star]
542.   Ran Canetti,  Eyal Kushilevitz,  Yehuda Lindell,  On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions, pp. 68 - 86, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 84 times Red Star]
543.   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 84 times Red Star]
544.   Jean-SĂ©bastien Coron,  Paul C. Kocher,  David Naccache,  Statistics and Secret Leakage, pp. 157 - 173, FC 2000.

[Electronic Edition][Cited 84 times Red Star]
545.   Shai Halevi,  Hugo Krawczyk,  MMH: Software Message Authentication in the Gbit/Second Rates, pp. 172 - 189, FSE 1997.

[Electronic Edition][Cited 84 times Red Star]
546.   Victor Shoup,  On Fast and Provably Secure Message Authentication Based on Universal Hashing, pp. 313 - 328, CRYPTO 1996.

[Electronic Edition][Cited 84 times Red Star]
547.   Carlo Harpes,  Gerhard G. Kramer,  James L. Massey,  A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma, pp. 24 - 38, EUROCRYPT 1995.

[Electronic Edition][Cited 84 times Red Star]
548.   Kenji Koyama,  Yukio Tsuruoka,  Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method, pp. 345 - 357, CRYPTO 1992.

[Electronic Edition][Cited 84 times Red Star]
549.   H. Ong,  Claus-Peter Schnorr,  Fast Signature Generation With a Fiat Shamir-Like Scheme, pp. 432 - 440, EUROCRYPT 1990.

[Electronic Edition][Cited 84 times Red Star]
550.   Ernest F. Brickell,  David Chaum,  Ivan Damgard,  Jeroen van de Graaf,  Gradual and Verifiable Release of a Secret, pp. 156 - 166, CRYPTO 1987.

[Electronic Edition][Cited 84 times Red Star]
551.   R. Eier,  Helmut Lagger,  Trapdoors in Knapsack Cryptosystems, pp. 316 - 322, EUROCRYPT 1982.

[Electronic Edition][Cited 84 times Red Star]
552.   Lars R. Knudsen,  David Wagner,  Integral Cryptanalysis, pp. 112 - 127, FSE 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 83 times Red Star]
553.   Viktor Fischer,  Milos DrutarovskĂ˝,  Two Methods of Rijndael Implementation in Reconfigurable Hardware, pp. 77 - 92, CHES 2001.

[Electronic Edition][Cited 83 times Red Star]
554.   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 83 times Red Star]
555.   Jan Camenisch,  Ivan Damgard,  Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes, pp. 331 - 345, ASIACRYPT 2000.

[Electronic Edition][Cited 83 times Red Star]
556.   Eli Gafni,  Jessica Staddon,  Yiqun Lisa Yin,  Efficient Methods for Integrating Traceability and Broadcast Encryption, pp. 372 - 387, CRYPTO 1999.

[Electronic Edition][Cited 83 times Red Star]
557.   Funda ErgĂĽn,  Joe Kilian,  Ravi Kumar,  A Note on the Limits of Collusion-Resistant Watermarks, pp. 140 - 149, EUROCRYPT 1999.

[Electronic Edition][Cited 83 times Red Star]
558.   Claude CrĂ©peau,  Efficient Cryptographic Protocols Based on Noisy Channels, pp. 306 - 317, EUROCRYPT 1997.

[Electronic Edition][Cited 83 times Red Star]
559.   Jovan Dj. Golic,  Linear Statistical Weakness of Alleged RC4 Keystream Generator, pp. 226 - 238, EUROCRYPT 1997.

[Electronic Edition][Cited 83 times Red Star]
560.   Mihir Bellare,  Silvio Micali,  How To Sign Given Any Trapdoor Function, pp. 200 - 215, CRYPTO 1988.

[Electronic Edition][Cited 83 times Red Star]
561.   Oded Goldreich,  Ronen Vainish,  How to Solve any Protocol Problem - An Efficiency Improvement, pp. 73 - 86, CRYPTO 1987.

[Electronic Edition][Cited 83 times Red Star]
562.   Lea Kissner,  Dawn Xiaodong Song,  Privacy-Preserving Set Operations, pp. 241 - 257, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 82 times Red Star]
563.   Stefan Lucks,  A Failure-Friendly Design Principle for Hash Functions, pp. 474 - 494, ASIACRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 82 times Red Star]
564.   Oded Regev,  New lattice based cryptographic constructions, pp. 407 - 416, STOC 2003.

[Electronic Edition][Cited 82 times Red Star]
565.   Matthias Krause,  BDD-Based Cryptanalysis of Keystream Generators, pp. 222 - 237, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 82 times Red Star]
566.   Ivan Damgard,  Maciej Koprowski,  Practical Threshold RSA Signatures without a Trusted Dealer, pp. 152 - 165, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 82 times Red Star]
567.   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 82 times Red Star]
568.   Yvo Desmedt,  Kaoru Kurosawa,  How to Break a Practical MIX and Design a New One, pp. 557 - 572, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 82 times Red Star]
569.   David Pointcheval,  Chosen-Ciphertext Security for Any One-Way Cryptosystem, pp. 129 - 146, PKC 2000.

[Electronic Edition][Cited 82 times Red Star]
570.   Ran Canetti,  Rosario Gennaro,  Stanislaw Jarecki,  Hugo Krawczyk,  Tal Rabin,  Adaptive Security for Threshold Cryptosystems, pp. 98 - 115, CRYPTO 1999.

[Electronic Edition][Cited 82 times Red Star]
571.   Julien P. Stern,  A New Efficient All-Or-Nothing Disclosure of Secrets Protocol, pp. 357 - 371, ASIACRYPT 1998.

[Electronic Edition][Cited 82 times Red Star]
572.   Mihir Bellare,  Daniele Micciancio,  A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost, pp. 163 - 192, EUROCRYPT 1997.

[Electronic Edition][Cited 82 times Red Star]
573.   Claude CrĂ©peau,  Jeroen van de Graaf,  Alain Tapp,  Committed Oblivious Transfer and Private Multi-Party Computation, pp. 110 - 123, CRYPTO 1995.

[Electronic Edition][Cited 82 times Red Star]
574.   Serge Vaudenay,  On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER, pp. 286 - 297, FSE 1994.

[Electronic Edition][Cited 82 times Red Star]
575.   Xuejia Lai,  James L. Massey,  Hash Functions Based on Block Ciphers, pp. 55 - 70, EUROCRYPT 1992.

[Electronic Edition][Cited 82 times Red Star]
576.   Yair Frankel,  A Practical Protocol for Large Group Oriented Networks, pp. 56 - 61, EUROCRYPT 1989.

[Electronic Edition][Cited 82 times Red Star]
577.   Ivan Damgard,  Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals, pp. 328 - 335, CRYPTO 1988.

[Electronic Edition][Cited 82 times Red Star]
578.   Yevgeniy Dodis,  Aggelos Kiayias,  Antonio Nicolosi,  Victor Shoup,  Anonymous Identification in Ad Hoc Groups, pp. 609 - 626, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 81 times Red Star]
579.   Mihir Bellare,  Bennet S. Yee,  Forward-Security in Private-Key Cryptography, pp. 1 - 18, CT-RSA 2003.

[Electronic Edition][Cited 81 times Red Star]
580.   Gerardo Orlando,  Christof Paar,  A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware, pp. 348 - 363, CHES 2001.

[Electronic Edition][Cited 81 times Red Star]
581.   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 81 times Red Star]
582.   Mehdi-Laurent Akkar,  RĂ©gis Bevan,  Paul Dischamp,  Didier Moyart,  Power Analysis, What Is Now Possible, pp. 489 - 502, ASIACRYPT 2000.

[Electronic Edition][Cited 81 times Red Star]
583.   Kazuo Ohta,  Tatsuaki Okamoto,  On Concrete Security Treatment of Signatures Derived from Identification, pp. 354 - 369, CRYPTO 1998.

[Electronic Edition][Cited 81 times Red Star]
584.   Ran Canetti,  Amir Herzberg,  Maintaining Security in the Presence of Transient Faults, pp. 425 - 438, CRYPTO 1994.

[Electronic Edition][Cited 81 times Red Star]
585.   Ernest F. Brickell,  Solving Low Density Knapsacks, pp. 25 - 37, CRYPTO 1983.

[Electronic Edition][Cited 81 times Red Star]
586.   Anna Lysyanskaya,  Silvio Micali,  Leonid Reyzin,  Hovav Shacham,  Sequential Aggregate Signatures from Trapdoor Permutations, pp. 74 - 90, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 80 times Red Star]
587.   Dan Boneh,  Simplified OAEP for the RSA and Rabin Functions, pp. 275 - 291, CRYPTO 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 80 times Red Star]
588.   Scott R. Fluhrer,  David A. McGrew,  Statistical Analysis of the Alleged RC4 Keystream Generator, pp. 19 - 30, FSE 2000.

[Electronic Edition][Cited 80 times Red Star]
589.   Juan A. Garay,  Jessica Staddon,  Avishai Wool,  Long-Lived Broadcast Encryption, pp. 333 - 352, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 80 times Red Star]
590.   Yuriy Tarannikov,  On Resilient Boolean Functions with Maximal Possible Nonlinearity, pp. 19 - 30, INDOCRYPT 2000.

[Electronic Edition][Cited 80 times Red Star]
591.   Aviad Kipnis,  Jacques Patarin,  Louis Goubin,  Unbalanced Oil and Vinegar Signature Schemes, pp. 206 - 222, EUROCRYPT 1999.

[Electronic Edition][Cited 80 times Red Star]
592.   Matthew K. Franklin,  Dahlia Malkhi,  Auditable Metering with Lightweight Security, pp. 151 - 160, FC 1997.

[Electronic Edition][Cited 80 times Red Star]
593.   Carlo Blundo,  Antonella Cresti,  Space Requirements for Broadcast Encryption, pp. 287 - 298, EUROCRYPT 1994.

[Electronic Edition][Cited 80 times Red Star]
594.   Eli Biham,  On Matsui's Linear Cryptanalysis, pp. 341 - 355, EUROCRYPT 1994.

[Electronic Edition][Cited 80 times Red Star]
595.   Ivan Damgard,  Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks, pp. 445 - 456, CRYPTO 1991.

[Electronic Edition][Cited 80 times Red Star]
596.   Kazuo Ohta,  Tatsuaki Okamoto,  A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme, pp. 139 - 148, ASIACRYPT 1991.

[Electronic Edition][Cited 80 times Red Star]
597.   Leonard M. Adleman,  An Abstract Theory of Computer Viruses, pp. 354 - 374, CRYPTO 1988.

[Electronic Edition][Cited 80 times Red Star]
598.   Lawrence H. Ozarow,  Aaron D. Wyner,  Wire-Tap Channel II, pp. 33 - 50, EUROCRYPT 1984.

[Electronic Edition][Cited 80 times Red Star]
599.   Oded Regev,  On lattices, learning with errors, random linear codes, and cryptography, pp. 84 - 93, STOC 2005.

[Electronic Edition][Cited 79 times Red Star]
600.   Howard Barnum,  Claude CrĂ©peau,  Daniel Gottesman,  Adam Smith,  Alain Tapp,  Authentication of Quantum Messages, pp. 449 - 458, FOCS 2002.

[Electronic Edition][Cited 79 times Red Star]
601.   Claus-Peter Schnorr,  Markus Jakobsson,  Security of Signed ElGamal Encryption, pp. 73 - 89, ASIACRYPT 2000.

[Electronic Edition][Cited 79 times Red Star]
602.   Ran Canetti,  Shafi Goldwasser,  An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack, pp. 90 - 106, EUROCRYPT 1999.

[Electronic Edition][Cited 79 times Red Star]
603.   John Kelsey,  Bruce Schneier,  David Wagner,  Chris Hall,  Cryptanalytic Attacks on Pseudorandom Number Generators, pp. 168 - 188, FSE 1998.

[Electronic Edition][Cited 79 times Red Star]
604.   Moni Naor,  Benny Pinkas,  Secure and Efficient Metering, pp. 576 - 590, EUROCRYPT 1998.

[Electronic Edition][Cited 79 times Red Star]
605.   Giovanni Di Crescenzo,  Tal Malkin,  Rafail Ostrovsky,  Single Database Private Information Retrieval Implies Oblivious Transfer, pp. 122 - 138, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 78 times Red Star]
606.   Jean-SĂ©bastien Coron,  David Naccache,  Julien P. Stern,  On the Security of RSA Padding, pp. 1 - 18, CRYPTO 1999.

[Electronic Edition][Cited 78 times Red Star]
607.   Hugo Krawczyk,  Secret Sharing Made Short, pp. 136 - 146, CRYPTO 1993.

[Electronic Edition][Cited 78 times Red Star]
608.   G. R. Blakley,  Catherine Meadows,  George B. Purdy,  Fingerprinting Long Forgiving Messages, pp. 180 - 189, CRYPTO 1985.

[Electronic Edition][Cited 78 times Red Star]
609.   Jan Camenisch,  Susan Hohenberger,  Anna Lysyanskaya,  Compact E-Cash, pp. 302 - 321, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 77 times Red Star]
610.   Nicolas Courtois,  The Security of Hidden Field Equations (HFE), pp. 266 - 281, CT-RSA 2001.

[Electronic Edition][Cited 77 times Red Star]
611.   Tony Eng,  Tatsuaki Okamoto,  Single-Term Divisible Electronic Coins, pp. 306 - 319, EUROCRYPT 1994.

[Electronic Edition][Cited 77 times Red Star]
612.   Peter Smith,  Christopher Skinner,  A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms, pp. 357 - 364, ASIACRYPT 1994.

[Electronic Edition][Cited 77 times Red Star]
613.   Rudolf Lidl,  On Cryptosystems Based on Polynomials and Finite Fields, pp. 10 - 15, EUROCRYPT 1984.

[Electronic Edition][Cited 77 times Red Star]
614.   Roger Dingledine,  Paul F. Syverson,  Reliable MIX Cascade Networks through Reputation, pp. 253 - 268, FC 2002.

[Electronic Edition][Cited 76 times Red Star]
615.   GaĂ«l Hachez,  Jean-Jacques Quisquater,  Montgomery Exponentiation with no Final Subtractions: Improved Results, pp. 293 - 301, CHES 2000.

[Electronic Edition][Cited 76 times Red Star]
616.   Claude Carlet,  Two New Classes of Bent Functions, pp. 77 - 101, EUROCRYPT 1993.

[Electronic Edition][Cited 76 times Red Star]
617.   Donald Beaver,  Joan Feigenbaum,  Joe Kilian,  Phillip Rogaway,  Security with Low Communication Overhead, pp. 62 - 76, CRYPTO 1990.

[Electronic Edition][Cited 76 times Red Star]
618.   Amos Fiat,  Batch RSA, pp. 175 - 185, CRYPTO 1989.

[Electronic Edition][Cited 76 times Red Star]
619.   Pil Joong Lee,  Ernest F. Brickell,  An Observation on the Security of McEliece's Public-Key Cryptosystem, pp. 275 - 280, EUROCRYPT 1988.

[Electronic Edition][Cited 76 times Red Star]
620.   Yvo Desmedt,  Claude Goutier,  Samy Bengio,  Special Uses and Abuses of the Fiat-Shamir Passport Protocol, pp. 21 - 39, CRYPTO 1987.

[Electronic Edition][Cited 76 times Red Star]
621.   Gildas Avoine,  Etienne Dysli,  Philippe Oechslin,  Reducing Time Complexity in RFID Systems, pp. 291 - 306, SAC 2005.

[Electronic Edition][Cited 75 times Red Star]
622.   Joonsang Baek,  Yuliang Zheng,  Identity-Based Threshold Decryption, pp. 262 - 276, PKC 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 75 times Red Star]
623.   Gene Itkis,  Leonid Reyzin,  SiBIR: Signer-Base Intrusion-Resilient Signatures, pp. 499 - 514, CRYPTO 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 75 times Red Star]
624.   John Black,  Phillip Rogaway,  A Block-Cipher Mode of Operation for Parallelizable Message Authentication, pp. 384 - 397, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 75 times Red Star]
625.   Marc Joye,  Sung-Ming Yen,  The Montgomery Powering Ladder, pp. 291 - 302, CHES 2002.

[Electronic Edition][Cited 75 times Red Star]
626.   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 75 times Red Star]
627.   Eric R. Verheul,  Self-Blindable Credential Certificates from the Weil Pairing, pp. 533 - 551, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 75 times Red Star]
628.   Matthew K. Franklin,  Rebecca N. Wright,  Secure Communications in Minimal Connectivity Models, pp. 346 - 360, EUROCRYPT 1998.

[Electronic Edition][Cited 75 times Red Star]
629.   Bruce Schneier,  John Kelsey,  Unbalanced Feistel Networks and Block Cipher Design, pp. 121 - 144, FSE 1996.

[Electronic Edition][Cited 75 times Red Star]
630.   Jovan Dj. Golic,  On the Security of Nonlinear Filter Generators, pp. 173 - 188, FSE 1996.

[Electronic Edition][Cited 75 times Red Star]
631.   Shai Halevi,  Silvio Micali,  Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, pp. 201 - 215, CRYPTO 1996.

[Electronic Edition][Cited 75 times Red Star]
632.   Mitsuru Matsui,  On Correlation Between the Order of S-boxes and the Strength of DES, pp. 366 - 375, EUROCRYPT 1994.

[Electronic Edition][Cited 75 times Red Star]
633.   Donald Beaver,  Stuart Haber,  Cryptographic Protocols Provably Secure Against Dynamic Adversaries, pp. 307 - 323, EUROCRYPT 1992.

[Electronic Edition][Cited 75 times Red Star]
634.   Thomas Beth,  Efficient Zero-Knowledge Identification Scheme for Smart Cards, pp. 77 - 84, EUROCRYPT 1988.

[Electronic Edition][Cited 75 times Red Star]
635.   Gilles Brassard,  Claude CrĂ©peau,  Zero-Knowledge Simulation of Boolean Circuits, pp. 223 - 233, CRYPTO 1986.

[Electronic Edition][Cited 75 times Red Star]
636.   David Chaum,  Jan-Hendrik Evertse,  Jeroen van de Graaf,  RenĂ© Peralta,  Demonstrating Possession of a Discrete Logarithm Without Revealing It, pp. 200 - 212, CRYPTO 1986.

[Electronic Edition][Cited 75 times Red Star]
637.   Cynthia Dwork,  Frank McSherry,  Kobbi Nissim,  Adam Smith,  Calibrating Noise to Sensitivity in Private Data Analysis, pp. 265 - 284, TCC 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 74 times Red Star]
638.   Paulo S. L. M. Barreto,  BenoĂ®t Libert,  Noel McCullagh,  Jean-Jacques Quisquater,  Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps, pp. 515 - 532, ASIACRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 74 times Red Star]
639.   Masayuki Abe,  Rosario Gennaro,  Kaoru Kurosawa,  Victor Shoup,  Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM, pp. 128 - 146, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 74 times Red Star]
640.   Emmanuel Bresson,  Olivier Chevassut,  David Pointcheval,  New Security Results on Encrypted Key Exchange, pp. 145 - 158, PKC 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 74 times Red Star]
641.   Michael T. Goodrich,  Jonathan Z. Sun,  Roberto Tamassia,  Efficient Tree-Based Revocation in Groups of Low-State Devices, pp. 511 - 527, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 74 times Red Star]
642.   Gábor Tardos,  Optimal probabilistic fingerprint codes, pp. 116 - 125, STOC 2003.

[Electronic Edition][Cited 74 times Red Star]
643.   Colin Boyd,  Juan Manuel González Nieto,  Round-Optimal Contributory Conference Key Agreement, pp. 161 - 174, PKC 2003.

[Electronic Edition][Cited 74 times Red Star]
644.   Christian AumĂĽller,  Peter Bier,  Wieland Fischer,  Peter Hofreiter,  Jean-Pierre Seifert,  Fault Attacks on RSA with CRT: Concrete Results and Practical Countermeasures, pp. 260 - 275, CHES 2002.

[Electronic Edition][Cited 74 times Red Star]
645.   Eli Biham,  Orr Dunkelman,  Nathan Keller,  The Rectangle Attack - Rectangling the Serpent, pp. 340 - 357, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 74 times Red Star]
646.   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 74 times Red Star]
647.   Emmanuel Bresson,  Jacques Stern,  Efficient Revocation in Group Signatures, pp. 190 - 206, PKC 2001.

[Electronic Edition][Cited 74 times Red Star]
648.   Reihaneh Safavi-Naini,  Yejing Wang,  Sequential Traitor Tracing, pp. 316 - 332, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 74 times Red Star]
649.   Ronald L. Rivest,  Electronic Lottery Tickets as Micropayments, pp. 307 - 314, FC 1997.

[Electronic Edition][Cited 74 times Red Star]
650.   Dominic Mayers,  Quantum Key Distribution and String Oblivious Transfer in Noisy Channels, pp. 343 - 357, CRYPTO 1996.

[Electronic Edition][Cited 74 times Red Star]
651.   Ivan Damgard,  Torben P. Pedersen,  Birgit Pfitzmann,  On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures, pp. 250 - 265, CRYPTO 1993.

[Electronic Edition][Cited 74 times Red Star]
652.   N. Demytko,  A New Elliptic Curve Based Analogue of RSA, pp. 40 - 49, EUROCRYPT 1993.

[Electronic Edition][Cited 74 times Red Star]
653.   Birgit Pfitzmann,  Andreas Pfitzmann,  How to Break the Direct RSA-Implementation of Mixes, pp. 373 - 381, EUROCRYPT 1989.

[Electronic Edition][Cited 74 times Red Star]
654.   Gerald C. Chick,  Stafford E. Tavares,  Flexible Access Control with Master Keys, pp. 316 - 322, CRYPTO 1989.

[Electronic Edition][Cited 74 times Red Star]
655.   Ueli M. Maurer,  Renato Renner,  Clemens Holenstein,  Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology, pp. 21 - 39, TCC 2004.

[Electronic Edition][Cited 73 times Red Star]
656.   Nicolas ThĂ©riault,  Index Calculus Attack for Hyperelliptic Curves of Small Genus, pp. 75 - 92, ASIACRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 73 times Red Star]
657.   François-Xavier Standaert,  GaĂ«l Rouvroy,  Jean-Jacques Quisquater,  Jean-Didier Legat,  Efficient Implementation of Rijndael Encryption in Reconfigurable Hardware: Improvements and Design Tradeoffs, pp. 334 - 350, CHES 2003.

[Electronic Edition][Cited 73 times Red Star]
658.   Boaz Barak,  Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model, pp. 345 - 355, FOCS 2002.

[Electronic Edition][Cited 73 times Red Star]
659.   Ueli M. Maurer,  Stefan Wolf,  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free, pp. 351 - 368, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 73 times Red Star]
660.   Adi Shamir,  Nicko van Someren,  Playing "Hide and Seek" with Stored Keys, pp. 118 - 124, FC 1999.

[Electronic Edition][Cited 73 times Red Star]
661.   Kouichi Itoh,  Masahiko Takenaka,  Naoya Torii,  Syouji Temma,  Yasushi Kurihara,  Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201, pp. 61 - 72, CHES 1999.

[Electronic Edition][Cited 73 times Red Star]
662.   Ronald Cramer,  Ivan Damgard,  Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?, pp. 424 - 441, CRYPTO 1998.

[Electronic Edition][Cited 73 times Red Star]
663.   Don Coppersmith,  Adi Shamir,  Lattice Attacks on NTRU, pp. 52 - 61, EUROCRYPT 1997.

[Electronic Edition][Cited 73 times Red Star]
664.   Lars R. Knudsen,  Matthew J. B. Robshaw,  Non-Linear Approximations in Linear Cryptanalysis, pp. 224 - 236, EUROCRYPT 1996.

[Electronic Edition][Cited 73 times Red Star]
665.   Colin Boyd,  Wenbo Mao,  On a Limitation of BAN Logic, pp. 240 - 247, EUROCRYPT 1993.

[Electronic Edition][Cited 73 times Red Star]
666.   Willi Meier,  Othmar Staffelbach,  Efficient Multiplication on Certain Nonsupersingular Elliptic Curves, pp. 333 - 344, CRYPTO 1992.

[Electronic Edition][Cited 73 times Red Star]
667.   Shai Halevi,  Phillip Rogaway,  A Parallelizable Enciphering Mode, pp. 292 - 304, CT-RSA 2004.

[Electronic Edition][Cited 72 times Red Star]
668.   Jan Camenisch,  Markus Michels,  Confirmer Signature Schemes Secure against Adaptive Adversaries, pp. 243 - 258, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 72 times Red Star]
669.   Stuart G. Stubblebine,  Paul F. Syverson,  Fair On-Line Auctions without Special Trusted Parties, pp. 230 - 240, FC 1999.

[Electronic Edition][Cited 72 times Red Star]
670.   Eiichiro Fujisaki,  Tatsuaki Okamoto,  A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications, pp. 32 - 46, EUROCRYPT 1998.

[Electronic Edition][Cited 72 times Red Star]
671.   Carlo Blundo,  Luiz A. Frota Mattos,  Douglas R. Stinson,  Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution, pp. 387 - 400, CRYPTO 1996.

[Electronic Edition][Cited 72 times Red Star]
672.   Ralph C. Merkle,  Fast Software Encryption Functions, pp. 476 - 501, CRYPTO 1990.

[Electronic Edition][Cited 72 times Red Star]
673.   Charles H. Bennett,  Gilles Brassard,  Seth Breidbard,  Stephen Wiesner,  Quantum Cryptography, or Unforgeable Subway Tokens, pp. 267 - 275, CRYPTO 1982.

[Electronic Edition][Cited 72 times Red Star]
674.   Gagan Aggarwal,  Nina Mishra,  Benny Pinkas,  Secure Computation of the k th-Ranked Element, pp. 40 - 55, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 71 times Red Star]
675.   Tal Malkin,  Daniele Micciancio,  Sara K. Miner,  Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods, pp. 400 - 417, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 71 times Red Star]
676.   Karl Rubin,  Alice Silverberg,  Supersingular Abelian Varieties in Cryptology, pp. 336 - 353, CRYPTO 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 71 times Red Star]
677.   Ran Canetti,  Yevgeniy Dodis,  Shai Halevi,  Eyal Kushilevitz,  Amit Sahai,  Exposure-Resilient Functions and All-or-Nothing Transforms, pp. 453 - 469, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 71 times Red Star]
678.   Eli Biham,  Alex Biryukov,  Adi Shamir,  Miss in the Middle Attacks on IDEA and Khufu, pp. 124 - 138, FSE 1999.

[Electronic Edition][Cited 71 times Red Star]
679.   Douglas R. Stinson,  Ruizhong Wei,  Key Preassigned Traceability Schemes for Broadcast Encryption, pp. 144 - 156, SAC 1998.

[Electronic Edition][Cited 71 times Red Star]
680.   Dan Boneh,  Glenn Durfee,  Yair Frankel,  An Attack on RSA Given a Small Fraction of the Private Key Bits, pp. 25 - 34, ASIACRYPT 1998.

[Electronic Edition][Cited 71 times Red Star]
681.   Burton S. Kaliski Jr.,  Yiqun Lisa Yin,  On Differential and Linear Cryptanalysis of the RC5 Encryption Algorithm, pp. 171 - 184, CRYPTO 1995.

[Electronic Edition][Cited 71 times Red Star]
682.   David Naccache,  David M'RaĂŻhi,  Serge Vaudenay,  Dan Raphaeli,  Can D.S.A. be Improved? Complexity Trade-Offs with the Digital Signature Standard, pp. 77 - 85, EUROCRYPT 1994.

[Electronic Edition][Cited 71 times Red Star]
683.   Avrim Blum,  Merrick L. Furst,  Michael J. Kearns,  Richard J. Lipton,  Cryptographic Primitives Based on Hard Learning Problems, pp. 278 - 291, CRYPTO 1993.

[Electronic Edition][Cited 71 times Red Star]
684.   Niels Ferguson,  Extensions of Single-term Coins, pp. 292 - 301, CRYPTO 1993.

[Electronic Edition][Cited 71 times Red Star]
685.   Noel McCullagh,  Paulo S. L. M. Barreto,  A New Two-Party Identity-Based Authenticated Key Agreement, pp. 262 - 274, CT-RSA 2005.

[Electronic Edition][Cited 70 times Red Star]
686.   Jooyoung Lee,  Douglas R. Stinson,  Deterministic Key Predistribution Schemes for Distributed Sensor Networks, pp. 294 - 307, SAC 2004.

[Electronic Edition][Cited 70 times Red Star]
687.   Serge Vaudenay,  Security Flaws Induced by CBC Padding - Applications to SSL, IPSEC, WTLS , pp. 534 - 546, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 70 times Red Star]
688.   Niels Ferguson,  Richard Schroeppel,  Doug Whiting,  A Simple Algebraic Representation of Rijndael, pp. 103 - 111, SAC 2001.

[Electronic Edition][Cited 70 times Red Star]
689.   Thomas Johansson,  Fredrik Jönsson,  Fast Correlation Attacks Based on Turbo Code Techniques, pp. 181 - 197, CRYPTO 1999.

[Electronic Edition][Cited 70 times Red Star]
690.   William Aiello,  Sachin Lodha,  Rafail Ostrovsky,  Fast Digital Identity Revocation (Extended Abstract), pp. 137 - 152, CRYPTO 1998.

[Electronic Edition][Cited 70 times Red Star]
691.   Victor Shoup,  Aviel D. Rubin,  Session Key Distribution Using Smart Cards, pp. 321 - 331, EUROCRYPT 1996.

[Electronic Edition][Cited 70 times Red Star]
692.   Birgit Pfitzmann,  Breaking an Efficient Anonymous Channel, pp. 332 - 340, EUROCRYPT 1994.

[Electronic Edition][Cited 70 times Red Star]
693.   Antoon Bosselaers,  RenĂ© Govaerts,  Joos Vandewalle,  Comparison of Three Modular Reduction Functions, pp. 175 - 186, CRYPTO 1993.

[Electronic Edition][Cited 70 times Red Star]
694.   Jeroen van de Graaf,  RenĂ© Peralta,  A Simple and Secure Way to Show the Validity of Your Public Key, pp. 128 - 134, CRYPTO 1987.

[Electronic Edition][Cited 70 times Red Star]
695.   Thomas Beth,  Fred Piper,  The Stop-and-Go Generator, pp. 88 - 92, EUROCRYPT 1984.

[Electronic Edition][Cited 70 times Red Star]
696.   Mihir Bellare,  New Proofs for NMAC and HMAC: Security Without Collision-Resistance, pp. 602 - 619, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 69 times Red Star]
697.   John Kelsey,  Tadayoshi Kohno,  Herding Hash Functions and the Nostradamus Attack, pp. 183 - 200, EUROCRYPT 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 69 times Red Star]
698.   Souichi Okada,  Naoya Torii,  Kouichi Itoh,  Masahiko Takenaka,  Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2, pp. 25 - 40, CHES 2000.

[Electronic Edition][Cited 69 times Red Star]
699.   M. Anwar Hasan,  Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems, pp. 93 - 108, CHES 2000.

[Electronic Edition][Cited 69 times Red Star]
700.   Steve H. Weingart,  Physical Security Devices for Computer Subsystems: A Survey of Attacks and Defenses, pp. 302 - 317, CHES 2000.

[Electronic Edition][Cited 69 times Red Star]
701.   Cynthia Dwork,  Amit Sahai,  Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints, pp. 442 - 457, CRYPTO 1998.

[Electronic Edition][Cited 69 times Red Star]
702.   Matt Blaze,  High-Bandwidth Encryption with Low-Bandwidth Smartcards, pp. 33 - 40, FSE 1996.

[Electronic Edition][Cited 69 times Red Star]
703.   Tatsuaki Okamoto,  Designated Confirmer Signatures and Public-Key Encryption are Equivalent, pp. 61 - 74, CRYPTO 1994.

[Electronic Edition][Cited 69 times Red Star]
704.   Ross J. Anderson,  Searching for the Optimum Correlation Attack, pp. 137 - 143, FSE 1994.

[Electronic Edition][Cited 69 times Red Star]
705.   Gustavus J. Simmons,  Subliminal Communication is Easy Using the DSA, pp. 218 - 232, EUROCRYPT 1993.

[Electronic Edition][Cited 69 times Red Star]
706.   Michael Backes,  Birgit Pfitzmann,  Michael Waidner,  A General Composition Theorem for Secure Reactive Systems, pp. 336 - 354, TCC 2004.

[Electronic Edition][Cited 68 times Red Star]
707.   Adi Shamir,  Eran Tromer,  Factoring Large Numbers with the TWIRL Device, pp. 1 - 26, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 68 times Red Star]
708.   Nicholas J. Hopper,  John Langford,  Luis von Ahn,  Provably Secure Steganography, pp. 77 - 92, CRYPTO 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 68 times Red Star]
709.   Amos Beimel,  Yuval Ishai,  Eyal Kushilevitz,  Jean-François Raymond,  Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval, pp. 261 - 270, FOCS 2002.

[Electronic Edition][Cited 68 times Red Star]
710.   Moni Naor,  Deniable Ring Authentication, pp. 481 - 498, CRYPTO 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 68 times Red Star]
711.   Duncan S. Wong,  Agnes Hui Chan,  Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices, pp. 272 - 289, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 68 times Red Star]
712.   Bart Preneel,  Paul C. van Oorschot,  On the Security of Two MAC Algorithms, pp. 19 - 32, EUROCRYPT 1996.

[Electronic Edition][Cited 68 times Red Star]
713.   Lawrence Brown,  Matthew Kwan,  Josef Pieprzyk,  Jennifer Seberry,  Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI, pp. 36 - 50, ASIACRYPT 1991.

[Electronic Edition][Cited 68 times Red Star]
714.   Eli Biham,  Adi Shamir,  Differential Cryptanalysis of Feal and N-Hash, pp. 1 - 16, EUROCRYPT 1991.

[Electronic Edition][Cited 68 times Red Star]
715.   Serge Vaudenay,  Secure Communications over Insecure Channels Based on Short Authenticated Strings, pp. 309 - 326, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 67 times Red Star]
716.   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 67 times Red Star]
717.   Masayuki Abe,  Koutarou Suzuki,  M+1-st Price Auction Using Homomorphic Encryption, pp. 115 - 124, PKC 2002.

[Electronic Edition][Cited 67 times Red Star]
718.   Alexander Klimov,  Adi Shamir,  A New Class of Invertible Mappings, pp. 470 - 483, CHES 2002.

[Electronic Edition][Cited 67 times Red Star]
719.   Philippe Golle,  Ilya Mironov,  Uncheatable Distributed Computations, pp. 425 - 440, CT-RSA 2001.

[Electronic Edition][Cited 67 times Red Star]
720.   Bodo Möller,  Algorithms for Multi-exponentiation, pp. 165 - 180, SAC 2001.

[Electronic Edition][Cited 67 times Red Star]
721.   Satoshi Hada,  Toshiaki Tanaka,  On the Existence of 3-Round Zero-Knowledge Protocols, pp. 408 - 423, CRYPTO 1998.

[Electronic Edition][Cited 67 times Red Star]
722.   Susan K. Langford,  Martin E. Hellman,  Differential-Linear Cryptanalysis, pp. 17 - 25, CRYPTO 1994.

[Electronic Edition][Cited 67 times Red Star]
723.   David Chaum,  Online Cash Checks, pp. 288 - 293, EUROCRYPT 1989.

[Electronic Edition][Cited 67 times Red Star]
724.   Yan-Cheng Chang,  Michael Mitzenmacher,  Privacy Preserving Keyword Searches on Remote Encrypted Data, pp. 442 - 455, ACNS 2005.

[Electronic Edition][Cited 66 times Red Star]
725.   Johannes Blömer,  Jorge Guajardo,  Volker Krummel,  Provably Secure Masking of AES, pp. 69 - 83, SAC 2004.

[Electronic Edition][Cited 66 times Red Star]
726.   Jung-Yeun Lee,  Jung Hee Cheon,  Seungjoo Kim,  An Analysis of Proxy Signatures: Is a Secure Channel Necessary?, pp. 68 - 79, CT-RSA 2003.

[Electronic Edition][Cited 66 times Red Star]
727.   Kris Gaj,  Pawel Chodowiec,  Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays, pp. 84 - 99, CT-RSA 2001.

[Electronic Edition][Cited 66 times Red Star]
728.   Hiroaki Kikuchi,  (M+1)st-Price Auction Protocol, pp. 341 - 353, FC 2001.

[Electronic Edition][Cited 66 times Red Star]
729.   Moni Naor,  Benny Pinkas,  Omer Reingold,  Distributed Pseudo-random Functions and KDCs, pp. 327 - 346, EUROCRYPT 1999.

[Electronic Edition][Cited 66 times Red Star]
730.   Markus Jakobsson,  Ripping Coins For a Fair Exchange, pp. 220 - 230, EUROCRYPT 1995.

[Electronic Edition][Cited 66 times Red Star]
731.   Patrick Horster,  Markus Michels,  Holger Petersen,  Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications, pp. 224 - 237, ASIACRYPT 1994.

[Electronic Edition][Cited 66 times Red Star]
732.   Carlo Blundo,  Alfredo De Santis,  Luisa Gargano,  Ugo Vaccaro,  On the Information Rate of Secret Sharing Schemes (Extended Abstract), pp. 148 - 167, CRYPTO 1992.

[Electronic Edition][Cited 66 times Red Star]
733.   Yacov Yacobi,  Exponentiating Faster with Addition Chains, pp. 222 - 229, EUROCRYPT 1990.

[Electronic Edition][Cited 66 times Red Star]
734.   Shoji Miyaguchi,  The FEAL Cipher Family, pp. 627 - 638, CRYPTO 1990.

[Electronic Edition][Cited 66 times Red Star]
735.   Hugo Krawczyk,  How to Predict Congruential Generators, pp. 138 - 153, CRYPTO 1989.

[Electronic Edition][Cited 66 times Red Star]
736.   Rolf Blom,  Non-Public Key Distribution, pp. 231 - 236, CRYPTO 1982.

[Electronic Edition][Cited 66 times Red Star]
737.   Michael Scott,  Computing the Tate Pairing, pp. 293 - 304, CT-RSA 2005.

[Electronic Edition][Cited 65 times Red Star]
738.   Michael Scott,  Paulo S. L. M. Barreto,  Compressed Pairings, pp. 140 - 156, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 65 times Red Star]
739.   Gilles Piret,  Jean-Jacques Quisquater,  A Differential Fault Attack Technique against SPN Structures, with Application to the AES and KHAZAD, pp. 77 - 88, CHES 2003.

[Electronic Edition][Cited 65 times Red Star]
740.   Simon Blake-Wilson,  Alfred Menezes,  Unknown Key-Share Attacks on the Station-to-Station (STS) Protocol, pp. 154 - 170, PKC 1999.

[Electronic Edition][Cited 65 times Red Star]
741.   Joseph H. Silverman,  Joe Suzuki,  Elliptic Curve Discrete Logarithms and the Index Calculus, pp. 110 - 125, ASIACRYPT 1998.

[Electronic Edition][Cited 65 times Red Star]
742.   Gilles Brassard,  Claude CrĂ©peau,  Oblivious Transfers and Privacy Amplification, pp. 334 - 347, EUROCRYPT 1997.

[Electronic Edition][Cited 65 times Red Star]
743.   Marc Girault,  An Identity-based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number, pp. 481 - 486, EUROCRYPT 1990.

[Electronic Edition][Cited 65 times Red Star]
744.   Richard Cleve,  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications, pp. 573 - 588, CRYPTO 1989.

[Electronic Edition][Cited 65 times Red Star]
745.   John Gordon,  Strong Primes are Easy to Find, pp. 216 - 223, EUROCRYPT 1984.

[Electronic Edition][Cited 65 times Red Star]
746.   Christophe De Cannière,  Christian Rechberger,  Finding SHA-1 Characteristics: General Results and Applications, pp. 1 - 20, ASIACRYPT 2006.

[Electronic Edition][Cited 64 times Red Star]
747.   Adam Bender,  Jonathan Katz,  Ruggero Morselli,  Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles, pp. 60 - 79, TCC 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 64 times Red Star]
748.   Ben Lynn,  Manoj Prabhakaran,  Amit Sahai,  Positive Results and Techniques for Obfuscation, pp. 20 - 39, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 64 times Red Star]
749.   Yevgeniy Dodis,  Nelly Fazio,  Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack, pp. 100 - 115, PKC 2003.

[Electronic Edition][Cited 64 times Red Star]
750.   Philippe Chose,  Antoine Joux,  Michel Mitton,  Fast Correlation Attacks: An Algorithmic Point of View, pp. 209 - 221, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 64 times Red Star]
751.   Christophe Clavier,  Marc Joye,  Universal Exponentiation Algorithm, pp. 300 - 308, CHES 2001.

[Electronic Edition][Cited 64 times Red Star]
752.   Pierre-Alain Fouque,  David Pointcheval,  Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks, pp. 351 - 368, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 64 times Red Star]
753.   Mike Bond,  Attacks on Cryptoprocessor Transaction Sets, pp. 220 - 234, CHES 2001.

[Electronic Edition][Cited 64 times Red Star]
754.   Wen-Guey Tzeng,  A Practical and Secure-Fault-Tolerant Conference-Key Agreement Protocol, pp. 1 - 13, PKC 2000.

[Electronic Edition][Cited 64 times Red Star]
755.   Joan Daemen,  Craig S. K. Clapp,  Fast Hashing and Stream Encryption with PANAMA, pp. 60 - 74, FSE 1998.

[Electronic Edition][Cited 64 times Red Star]
756.   Hans Eberle,  A High-Speed DES Implementation for Network Applications, pp. 521 - 539, CRYPTO 1992.

[Electronic Edition][Cited 64 times Red Star]
757.   Adi Shamir,  An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract), pp. 606 - 609, CRYPTO 1989.

[Electronic Edition][Cited 64 times Red Star]
758.   Neal Koblitz,  A Family of Jacobians Suitable for Discrete Log Cryptosystems, pp. 94 - 99, CRYPTO 1988.

[Electronic Edition][Cited 64 times Red Star]
759.   Michael Luby,  Charles Rackoff,  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract), pp. 447 - 447, CRYPTO 1985.

[Electronic Edition][Cited 64 times Red Star]
760.   Xavier Boyen,  Brent Waters,  Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles), pp. 290 - 307, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 63 times Red Star]
761.   Yevgeniy Dodis,  Aleksandr Yampolskiy,  A Verifiable Random Function with Short Proofs and Keys, pp. 416 - 431, PKC 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 63 times Red Star]
762.   Tim Kerins,  William P. Marnane,  Emanuel M. Popovici,  Paulo S. L. M. Barreto,  Efficient Hardware for the Tate Pairing Calculation in Characteristic Three, pp. 412 - 426, CHES 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 63 times Red Star]
763.   Jeffrey Hoffstein,  Nick Howgrave-Graham,  Jill Pipher,  Joseph H. Silverman,  William Whyte,  NTRUSIGN: Digital Signatures Using the NTRU Lattice, pp. 122 - 140, CT-RSA 2003.

[Electronic Edition][Cited 63 times Red Star]
764.   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 63 times Red Star]
765.   Victor Shoup,  A Composition Theorem for Universal One-Way Hash Functions, pp. 445 - 452, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 63 times Red Star]
766.   Lars R. Knudsen,  Willi Meier,  Bart Preneel,  Vincent Rijmen,  Sven Verdoolaege,  Analysis Methods for (Alleged) RC4, pp. 327 - 341, ASIACRYPT 1998.

[Electronic Edition][Cited 63 times Red Star]
767.   Daniel Bleichenbacher,  Generating EIGamal Signatures Without Knowing the Secret Key, pp. 10 - 18, EUROCRYPT 1996.

[Electronic Edition][Cited 63 times Red Star]
768.   Stefan Lucks,  Faster Luby-Rackoff Ciphers, pp. 189 - 203, FSE 1996.

[Electronic Edition][Cited 63 times Red Star]
769.   Chuan-Ming Li,  Tzonelih Hwang,  Narn-Yih Lee,  Threshold-Multisignature Schemes where Suspected Forgery Implies Traceability of Adversarial Shareholders, pp. 194 - 204, EUROCRYPT 1994.

[Electronic Edition][Cited 63 times Red Star]
770.   Ueli M. Maurer,  A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator, pp. 239 - 255, EUROCRYPT 1992.

[Electronic Edition][Cited 63 times Red Star]
771.   Tatsuaki Okamoto,  Kazuo Ohta,  Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility, pp. 134 - 148, EUROCRYPT 1989.

[Electronic Edition][Cited 63 times Red Star]
772.   Ernest F. Brickell,  Breaking Iterated Knapsacks, pp. 342 - 358, CRYPTO 1984.

[Electronic Edition][Cited 63 times Red Star]
773.   Jens Groth,  Rafail Ostrovsky,  Amit Sahai,  Perfect Non-interactive Zero Knowledge for NP, pp. 339 - 358, EUROCRYPT 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 62 times Red Star]
774.   Elisabeth Oswald,  Stefan Mangard,  Norbert Pramstaller,  Vincent Rijmen,  A Side-Channel Analysis Resistant Description of the AES S-Box, pp. 413 - 423, FSE 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 62 times Red Star]
775.   Thomas Popp,  Stefan Mangard,  Masked Dual-Rail Pre-charge Logic: DPA-Resistance Without Routing Constraints, pp. 172 - 186, CHES 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 62 times Red Star]
776.   Lan Nguyen,  Accumulators from Bilinear Pairings and Applications, pp. 275 - 292, CT-RSA 2005.

[Electronic Edition][Cited 62 times Red Star]
777.   Salil P. Vadhan,  On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model, pp. 61 - 77, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 62 times Red Star]
778.   Niels Ferguson,  Doug Whiting,  Bruce Schneier,  John Kelsey,  Stefan Lucks,  Tadayoshi Kohno,  Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive, pp. 330 - 346, FSE 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 62 times Red Star]
779.   Andrew Huang,  Keeping Secrets in Hardware: The Microsoft Xbox Case Study, pp. 213 - 227, CHES 2002.

[Electronic Edition][Cited 62 times Red Star]
780.   Manoj Prabhakaran,  Alon Rosen,  Amit Sahai,  Concurrent Zero Knowledge with Logarithmic Round-Complexity, pp. 366 - 375, FOCS 2002.

[Electronic Edition][Cited 62 times Red Star]
781.   Giovanni Di Crescenzo,  Jonathan Katz,  Rafail Ostrovsky,  Adam Smith,  Efficient and Non-interactive Non-malleable Commitment, pp. 40 - 59, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 62 times Red Star]
782.   Alexandre F. Tenca,  Georgi Todorov,  Ă‡etin Kaya Koç,  High-Radix Design of a Scalable Modular Multiplier, pp. 185 - 201, CHES 2001.

[Electronic Edition][Cited 62 times Red Star]
783.   Louis Goubin,  Nicolas Courtois,  Cryptanalysis of the TTM Cryptosystem, pp. 44 - 57, ASIACRYPT 2000.

[Electronic Edition][Cited 62 times Red Star]
784.   Niv Gilboa,  Two Party RSA Key Generation, pp. 116 - 129, CRYPTO 1999.

[Electronic Edition][Cited 62 times Red Star]
785.   Antoon Bosselaers,  RenĂ© Govaerts,  Joos Vandewalle,  Fast Hashing on the Pentium, pp. 298 - 312, CRYPTO 1996.

[Electronic Edition][Cited 62 times Red Star]
786.   Christian Cachin,  Ueli M. Maurer,  Linking Information Reconciliation and Privacy Amplification (Extended Abstract), pp. 266 - 274, EUROCRYPT 1994.

[Electronic Edition][Cited 62 times Red Star]
787.   JĂĽrgen Bierbrauer,  Thomas Johansson,  Gregory Kabatianskii,  Ben J. M. Smeets,  On Families of Hash Functions via Geometric Codes and Concatenation, pp. 331 - 342, CRYPTO 1993.

[Electronic Edition][Cited 62 times Red Star]
788.   Shimon Even,  Yishay Mansour,  A Construction of a Cipher From a Single Pseudorandom Permutation, pp. 210 - 224, ASIACRYPT 1991.

[Electronic Edition][Cited 62 times Red Star]
789.   Christoph G. GĂĽnther,  Alternating Step Generators Controlled by De Bruijn Sequences, pp. 5 - 14, EUROCRYPT 1987.

[Electronic Edition][Cited 62 times Red Star]
790.   Jan-Hendrik Evertse,  Linear Structures in Blockciphers, pp. 249 - 266, EUROCRYPT 1987.

[Electronic Edition][Cited 62 times Red Star]
791.   Amir Herzberg,  Shlomit S. Pinter,  Public Protection of Software, pp. 158 - 179, CRYPTO 1985.

[Electronic Edition][Cited 62 times Red Star]
792.   Oded Goldreich,  Shafi Goldwasser,  Silvio Micali,  On the Cryptographic Applications of Random Functions, pp. 276 - 288, CRYPTO 1984.

[Electronic Edition][Cited 62 times Red Star]
793.   Stefan Mangard,  Thomas Popp,  Berndt M. Gammel,  Side-Channel Leakage of Masked CMOS Gates, pp. 351 - 365, CT-RSA 2005.

[Electronic Edition][Cited 61 times Red Star]
794.   Guido Bertoni,  Jorge Guajardo,  Sandeep S. Kumar,  Gerardo Orlando,  Christof Paar,  Thomas J. Wollinger,  Efficient GF (pm) Arithmetic Architectures for Cryptographic Applications, pp. 158 - 175, CT-RSA 2003.

[Electronic Edition][Cited 61 times Red Star]
795.   Siddika Berna Ă–rs,  Elisabeth Oswald,  Bart Preneel,  Power-Analysis Attacks on an FPGA - First Experimental Results, pp. 35 - 50, CHES 2003.

[Electronic Edition][Cited 61 times Red Star]
796.   Helger Lipmaa,  N. Asokan,  Valtteri Niemi,  Secure Vickrey Auctions without Threshold Trust, pp. 87 - 101, FC 2002.

[Electronic Edition][Cited 61 times Red Star]
797.   Colin D. Walter,  Susan Thompson,  Distinguishing Exponent Digits by Observing Modular Subtractions, pp. 192 - 207, CT-RSA 2001.

[Electronic Edition][Cited 61 times Red Star]
798.   Nicolas Courtois,  Matthieu Finiasz,  Nicolas Sendrier,  How to Achieve a McEliece-Based Digital Signature Scheme, pp. 157 - 174, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 61 times Red Star]
799.   Patrick Drew McDaniel,  Aviel D. Rubin,  A Response to ''Can We Eliminate Certificate Revocation Lists?'', pp. 245 - 258, FC 2000.

[Electronic Edition][Cited 61 times Red Star]
800.   Colin D. Walter,  Montgomery's Multiplication Technique: How to Make It Smaller and Faster, pp. 80 - 93, CHES 1999.

[Electronic Edition][Cited 61 times Red Star]
801.   Jun Anzai,  Natsume Matsuzaki,  Tsutomu Matsumoto,  A Quick Group Key Distribution Scheme with "Entity Revocation", pp. 333 - 347, ASIACRYPT 1999.

[Electronic Edition][Cited 61 times Red Star]
802.   Neal Koblitz,  An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm, pp. 327 - 337, CRYPTO 1998.

[Electronic Edition][Cited 61 times Red Star]
803.   Christian Cachin,  Ueli M. Maurer,  Unconditional Security Against Memory-Bounded Adversaries, pp. 292 - 306, CRYPTO 1997.

[Electronic Edition][Cited 61 times Red Star]
804.   Reynald Lercier,  François Morain,  Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance, pp. 79 - 94, EUROCRYPT 1995.

[Electronic Edition][Cited 61 times Red Star]
805.   LászlĂł Csirmaz,  The Size of a Share Must Be Large, pp. 13 - 22, EUROCRYPT 1994.

[Electronic Edition][Cited 61 times Red Star]
806.   Mike Burmester,  On the Risk of Opening Distributed Keys, pp. 308 - 317, CRYPTO 1994.

[Electronic Edition][Cited 61 times Red Star]
807.   Xuejia Lai,  Lars R. Knudsen,  Attacks on Double Block Length Hash Functions, pp. 157 - 165, FSE 1993.

[Electronic Edition][Cited 61 times Red Star]
808.   Matthew K. Franklin,  Stuart Haber,  Joint Encryption and Message-Efficient Secure Computation, pp. 266 - 277, CRYPTO 1993.

[Electronic Edition][Cited 61 times Red Star]
809.   Maurice Herlihy,  J. D. Tygar,  How to Make Replicated Data Secure, pp. 379 - 391, CRYPTO 1987.

[Electronic Edition][Cited 61 times Red Star]
810.   Oded Goldreich,  Silvio Micali,  Avi Wigderson,  How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design, pp. 171 - 185, CRYPTO 1986.

[Electronic Edition][Cited 61 times Red Star]
811.   Oded Goldreich,  Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme, pp. 104 - 110, CRYPTO 1986.

[Electronic Edition][Cited 61 times Red Star]
812.   Jason Waddle,  David Wagner,  Towards Efficient Second-Order Power Analysis, pp. 1 - 15, CHES 2004.

[Electronic Edition][Cited 60 times Red Star]
813.   Mihir Bellare,  Adriana Palacio,  The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols, pp. 273 - 289, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 60 times Red Star]
814.   Silvio Micali,  Ronald L. Rivest,  Transitive Signature Schemes, pp. 236 - 243, CT-RSA 2002.

[Electronic Edition][Cited 60 times Red Star]
815.   Markus Jakobsson,  David Pointcheval,  Mutual Authentication for Low-Power Mobile Devices, pp. 169 - 186, FC 2001.

[Electronic Edition][Cited 60 times Red Star]
816.   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 60 times Red Star]
817.   Andreas Dandalis,  Viktor K. Prasanna,  JosĂ© D. P. Rolim,  A Comparative Study of Performance of AES Final Candidates Using FPGAs, pp. 125 - 140, CHES 2000.

[Electronic Edition][Cited 60 times Red Star]
818.   Martin Hirt,  Ueli M. Maurer,  Bartosz Przydatek,  Efficient Secure Multi-party Computation, pp. 143 - 161, ASIACRYPT 2000.

[Electronic Edition][Cited 60 times Red Star]
819.   Dan Boneh,  Glenn Durfee,  Nick Howgrave-Graham,  Factoring N = prq for large r, pp. 326 - 337, CRYPTO 1999.

[Electronic Edition][Cited 60 times Red Star]
820.   Roger Fischlin,  Claus-Peter Schnorr,  Stronger Security Proofs for RSA and Rabin Bits, pp. 267 - 279, EUROCRYPT 1997.

[Electronic Edition][Cited 60 times Red Star]
821.   Reynald Lercier,  Finding Good Random Elliptic Curves for Cryptosystems Defined over F, pp. 379 - 392, EUROCRYPT 1997.

[Electronic Edition][Cited 60 times Red Star]
822.   Ross J. Anderson,  Eli Biham,  TIGER: A Fast New Hash Function, pp. 89 - 97, FSE 1996.

[Electronic Edition][Cited 60 times Red Star]
823.   Ronald Cramer,  Ivan Damgard,  New Generation of Secure and Practical RSA-Based Signatures, pp. 173 - 185, CRYPTO 1996.

[Electronic Edition][Cited 60 times Red Star]
824.   Eli Biham,  Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91, pp. 532 - 534, EUROCRYPT 1991.

[Electronic Edition][Cited 60 times Red Star]
825.   Hatsukazu Tanaka,  A Realization Scheme for the Identity-Based Cryptosystem, pp. 340 - 349, CRYPTO 1987.

[Electronic Edition][Cited 60 times Red Star]
826.   Phong Q. Nguyen,  Damien StehlĂ©,  Floating-Point LLL Revisited, pp. 215 - 233, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 59 times Red Star]
827.   Silvio Micali,  Leonid Reyzin,  Physically Observable Cryptography (Extended Abstract), pp. 278 - 296, TCC 2004.

[Electronic Edition][Cited 59 times Red Star]
828.   Thomas Baignères,  Pascal Junod,  Serge Vaudenay,  How Far Can We Go Beyond Linear Cryptanalysis?, pp. 432 - 450, ASIACRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 59 times Red Star]
829.   Deepak Kumar Dalai,  Kishan Chand Gupta,  Subhamoy Maitra,  Results on Algebraic Immunity for Cryptographically Significant Boolean Functions, pp. 92 - 106, INDOCRYPT 2004.

[Electronic Edition][Cited 59 times Red Star]
830.   Elena Trichina,  Domenico De Seta,  Lucia Germani,  Simplified Adaptive Multiplicative Masking for AES, pp. 187 - 197, CHES 2002.

[Electronic Edition][Cited 59 times Red Star]
831.   John Kelsey,  Tadayoshi Kohno,  Bruce Schneier,  Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent, pp. 75 - 93, FSE 2000.

[Electronic Edition][Cited 59 times Red Star]
832.   Erik Woodward Knudsen,  Elliptic Scalar Multiplication Using Point Halving, pp. 135 - 149, ASIACRYPT 1999.

[Electronic Edition][Cited 59 times Red Star]
833.   Tsuyoshi Takagi,  Fast RSA-Type Cryptosystem Modulo p, pp. 318 - 326, CRYPTO 1998.

[Electronic Edition][Cited 59 times Red Star]
834.   Matthew K. Franklin,  Gene Tsudik,  Secure Group Barter: Multi-party Fair Exchange with Semi-Trusted Neutral Parties, pp. 90 - 102, FC 1998.

[Electronic Edition][Cited 59 times Red Star]
835.   Stanislaw Jarecki,  Andrew M. Odlyzko,  An Efficient Micropayment System Based on Probabilistic Polling, pp. 173 - 192, FC 1997.

[Electronic Edition][Cited 59 times Red Star]
836.   Daniel R. Simon,  Anonymous Communication and Anonymous Cash, pp. 61 - 73, CRYPTO 1996.

[Electronic Edition][Cited 59 times Red Star]
837.   Atsuko Miyaji,  Elliptic Curves over Fp Suitable for Cryptosystems, pp. 479 - 491, ASIACRYPT 1992.

[Electronic Edition][Cited 59 times Red Star]
838.   Joe Kilian,  Silvio Micali,  Rafail Ostrovsky,  Minimum Resource Zero-Knowledge Proofs (Extended Abstract), pp. 545 - 546, CRYPTO 1989.

[Electronic Edition][Cited 59 times Red Star]
839.   Douglas R. Stinson,  Some Constructions and Bounds for authentication Codes, pp. 418 - 425, CRYPTO 1986.

[Electronic Edition][Cited 59 times Red Star]
840.   Xavier Boyen,  Brent Waters,  Compact Group Signatures Without Random Oracles, pp. 427 - 444, EUROCRYPT 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 58 times Red Star]
841.   Stefan Mangard,  Norbert Pramstaller,  Elisabeth Oswald,  Successfully Attacking Masked AES Hardware Implementations, pp. 157 - 171, CHES 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 58 times Red Star]
842.   Philip Hawkes,  Gregory G. Rose,  Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers, pp. 390 - 406, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 58 times Red Star]
843.   Steven D. Galbraith,  Wenbo Mao,  Invisibility and Anonymity of Undeniable and Confirmer Signatures, pp. 80 - 97, CT-RSA 2003.

[Electronic Edition][Cited 58 times Red Star]
844.   Philippe Golle,  Sheng Zhong,  Dan Boneh,  Markus Jakobsson,  Ari Juels,  Optimistic Mixing for Exit-Polls, pp. 451 - 465, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 58 times Red Star]
845.   Olivier Baudron,  Jacques Stern,  Non-interactive Private Auctions, pp. 354 - 354, FC 2001.

[Electronic Edition][Cited 58 times Red Star]
846.   Wen-Guey Tzeng,  Zhi-Jia Tzeng,  A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares, pp. 207 - 224, PKC 2001.

[Electronic Edition][Cited 58 times Red Star]
847.   Rita Mayer-Sommer,  Smartly Analyzing the Simplicity and the Power of Simple Power Analysis on Smartcards, pp. 78 - 92, CHES 2000.

[Electronic Edition][Cited 58 times Red Star]
848.   John Kelsey,  Bruce Schneier,  Niels Ferguson,  Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator, pp. 13 - 33, SAC 1999.

[Electronic Edition][Cited 58 times Red Star]
849.   Jianying Zhou,  Dieter Gollmann,  Observations on Non-repudiation, pp. 133 - 144, ASIACRYPT 1996.

[Electronic Edition][Cited 58 times Red Star]
850.   Markus Michels,  Patrick Horster,  On the Risk of Disruption in Several Multiparty Signature Schemes, pp. 334 - 345, ASIACRYPT 1996.

[Electronic Edition][Cited 58 times Red Star]
851.   Don Davis,  Ross Ihaka,  Philip Fenstermacher,  Cryptographic Randomness from Air Turbulence in Disk Drives, pp. 114 - 120, CRYPTO 1994.

[Electronic Edition][Cited 58 times Red Star]
852.   Jovan Dj. Golic,  Luke O'Connor,  Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers, pp. 230 - 243, EUROCRYPT 1994.

[Electronic Edition][Cited 58 times Red Star]
853.   Ronald Cramer,  Torben P. Pedersen,  Improved Privacy in Wallets with Observers (Extended Abstract), pp. 329 - 343, EUROCRYPT 1993.

[Electronic Edition][Cited 58 times Red Star]
854.   Joan Daemen,  RenĂ© Govaerts,  Joos Vandewalle,  Weak Keys for IDEA, pp. 224 - 231, CRYPTO 1993.

[Electronic Edition][Cited 58 times Red Star]
855.   Mitsuru Matsui,  Atsuhiro Yamagishi,  A New Method for Known Plaintext Attack of FEAL Cipher, pp. 81 - 91, EUROCRYPT 1992.

[Electronic Edition][Cited 58 times Red Star]
856.   Jean-Jacques Quisquater,  Jean-Paul Delescaille,  How Easy is Collision Search? Application to DES (Extended Summary), pp. 429 - 434, EUROCRYPT 1989.

[Electronic Edition][Cited 58 times Red Star]
857.   Kencheng Zeng,  Chung-Huang Yang,  T. R. N. Rao,  On the Linear Consistency Test (LCT) in Cryptanalysis with Applications, pp. 164 - 174, CRYPTO 1989.

[Electronic Edition][Cited 58 times Red Star]
858.   Mihir Bellare,  Thomas Ristenpart,  Multi-Property-Preserving Hash Domain Extension and the EMD Transform, pp. 299 - 314, ASIACRYPT 2006.

[Electronic Edition][Cited 57 times Red Star]
859.   Ivan Damgard,  Matthias Fitzi,  Eike Kiltz,  Jesper Buus Nielsen,  Tomas Toft,  Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation, pp. 285 - 304, TCC 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 57 times Red Star]
860.   Markus Jakobsson,  Modeling and Preventing Phishing Attacks, pp. 89 - 89, FC 2005.

[Electronic Edition][Cited 57 times Red Star]
861.   Omer Reingold,  Luca Trevisan,  Salil P. Vadhan,  Notions of Reducibility between Cryptographic Primitives, pp. 1 - 20, TCC 2004.

[Electronic Edition][Cited 57 times Red Star]
862.   Karl Rubin,  Alice Silverberg,  Torus-Based Cryptography, pp. 349 - 365, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 57 times Red Star]
863.   Brice Canvel,  Alain P. Hiltgen,  Serge Vaudenay,  Martin Vuagnoux,  Password Interception in a SSL/TLS Channel, pp. 583 - 599, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 57 times Red Star]
864.   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 57 times Red Star]
865.   Jean-SĂ©bastien Coron,  Optimal Security Proofs for PSS and Other Signature Schemes, pp. 272 - 287, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 57 times Red Star]
866.   Irene Gassko,  Peter Gemmell,  Philip D. MacKenzie,  Efficient and Fresh Certification, pp. 342 - 353, PKC 2000.

[Electronic Edition][Cited 57 times Red Star]
867.   Ivan Damgard,  Joe Kilian,  Louis Salvail,  On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions, pp. 56 - 73, EUROCRYPT 1999.

[Electronic Edition][Cited 57 times Red Star]
868.   Joan Daemen,  RenĂ© Govaerts,  Joos Vandewalle,  Resynchronization Weaknesses in Synchronous Stream Ciphers, pp. 159 - 167, EUROCRYPT 1993.

[Electronic Edition][Cited 57 times Red Star]
869.   Birgit Pfitzmann,  Michael Waidner,  Attacks on Protocols for Server-Aided RSA Computation, pp. 153 - 162, EUROCRYPT 1992.

[Electronic Edition][Cited 57 times Red Star]
870.   Lars R. Knudsen,  Cryptanalysis of LOKI91, pp. 196 - 208, ASIACRYPT 1992.

[Electronic Edition][Cited 57 times Red Star]
871.   Burton S. Kaliski Jr.,  A Pseudo-Random Bit Generator Based on Elliptic Logarithms, pp. 84 - 103, CRYPTO 1986.

[Electronic Edition][Cited 57 times Red Star]
872.   Xavier Boyen,  Yevgeniy Dodis,  Jonathan Katz,  Rafail Ostrovsky,  Adam Smith,  Secure Remote Authentication Using Biometric Data, pp. 147 - 163, EUROCRYPT 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 56 times Red Star]
873.   Vincent Rijmen,  Elisabeth Oswald,  Update on SHA-1, pp. 58 - 71, CT-RSA 2005.

[Electronic Edition][Cited 56 times Red Star]
874.   Mihir Bellare,  Phillip Rogaway,  David Wagner,  The EAX Mode of Operation, pp. 389 - 407, FSE 2004.

[Electronic Edition][Cited 56 times Red Star]
875.   Roberto Maria Avanzi,  Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations, pp. 148 - 162, CHES 2004.

[Electronic Edition][Cited 56 times Red Star]
876.   Yehuda Lindell,  A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions, pp. 241 - 254, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 56 times Red Star]
877.   JaeCheol Ha,  Sang-Jae Moon,  Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks, pp. 551 - 563, CHES 2002.

[Electronic Edition][Cited 56 times Red Star]
878.   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 56 times Red Star]
879.   Reto Kohlas,  Ueli M. Maurer,  Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence, pp. 93 - 112, PKC 2000.

[Electronic Edition][Cited 56 times Red Star]
880.   Julio LĂłpez Hernandez,  Ricardo Dahab,  High-Speed Software Multiplication in F 2 m, pp. 203 - 212, INDOCRYPT 2000.

[Electronic Edition][Cited 56 times Red Star]
881.   Daniel Bleichenbacher,  Phong Q. Nguyen,  Noisy Polynomial Interpolation and Noisy Chinese Remaindering, pp. 53 - 69, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 56 times Red Star]
882.   Yongge Wang,  Yvo Desmedt,  Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question, pp. 446 - 458, EUROCRYPT 1999.

[Electronic Edition][Cited 56 times Red Star]
883.   Catherine Meadows,  Paul F. Syverson,  A Formal Specification of Requirements for Payment Transactions in the SET Protocol, pp. 122 - 140, FC 1998.

[Electronic Edition][Cited 56 times Red Star]
884.   Andrew Klapper,  Mark Goresky,  2-Adic Shift Registers, pp. 174 - 178, FSE 1993.

[Electronic Edition][Cited 56 times Red Star]
885.   Carlo Blundo,  Antonella Cresti,  Alfredo De Santis,  Ugo Vaccaro,  Fully Dynamic Secret Sharing Schemes, pp. 110 - 125, CRYPTO 1993.

[Electronic Edition][Cited 56 times Red Star]
886.   Douglas R. Stinson,  Combinatorial Characterizations of Authentication Codes, pp. 62 - 73, CRYPTO 1991.

[Electronic Edition][Cited 56 times Red Star]
887.   RenĂ© Peralta,  Jeroen van de Graaf,  A Simple and Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number, pp. 15 - 15, EUROCRYPT 1986.

[Electronic Edition][Cited 56 times Red Star]
888.   Rainer A. Rueppel,  Correlation Immunity and the Summation Generator, pp. 260 - 272, CRYPTO 1985.

[Electronic Edition][Cited 56 times Red Star]
889.   Shai Halevi,  Hugo Krawczyk,  Strengthening Digital Signatures Via Randomized Hashing, pp. 41 - 59, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 55 times Red Star]
890.   Rafail Ostrovsky,  William E. Skeith III,  Private Searching on Streaming Data, pp. 223 - 240, CRYPTO 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 55 times Red Star]
891.   Nicolas Courtois,  Jacques Patarin,  About the XL Algorithm over GF(2), pp. 141 - 157, CT-RSA 2003.

[Electronic Edition][Cited 55 times Red Star]
892.   John Malone-Lee,  Wenbo Mao,  Two Birds One Stone: Signcryption Using RSA, pp. 211 - 225, CT-RSA 2003.

[Electronic Edition][Cited 55 times Red Star]
893.   Jan Pelzl,  Thomas J. Wollinger,  Jorge Guajardo,  Christof Paar,  Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves, pp. 351 - 365, CHES 2003.

[Electronic Edition][Cited 55 times Red Star]
894.   Ran Canetti,  Hugo Krawczyk,  Jesper Buus Nielsen,  Relaxing Chosen-Ciphertext Security, pp. 565 - 582, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 55 times Red Star]
895.   Yvo Desmedt,  Yongge Wang,  Perfectly Secure Message Transmission Revisited, pp. 502 - 517, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 55 times Red Star]
896.   Stanley Chow,  Philip A. Eisen,  Harold Johnson,  Paul C. van Oorschot,  White-Box Cryptography and an AES Implementation, pp. 250 - 270, SAC 2002.

[Electronic Edition][Cited 55 times Red Star]
897.   Arjen K. Lenstra,  Unbelievable Security. Matching AES Security Using Public Key Systems, pp. 67 - 86, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 55 times Red Star]
898.   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 55 times Red Star]
899.   Marc Fischlin,  A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires, pp. 457 - 472, CT-RSA 2001.

[Electronic Edition][Cited 55 times Red Star]
900.   Scott R. Fluhrer,  Stefan Lucks,  Analysis of the E 0 Encryption System, pp. 38 - 48, SAC 2001.

[Electronic Edition][Cited 55 times Red Star]
901.   Arjen K. Lenstra,  Eric R. Verheul,  Key Improvements to XTR, pp. 220 - 233, ASIACRYPT 2000.

[Electronic Edition][Cited 55 times Red Star]
902.   Andries E. Brouwer,  Ruud Pellikaan,  Eric R. Verheul,  Doing More with Fewer Bits, pp. 321 - 332, ASIACRYPT 1999.

[Electronic Edition][Cited 55 times Red Star]
903.   Jacques Patarin,  Louis Goubin,  Nicolas Courtois,  C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai, pp. 35 - 49, ASIACRYPT 1998.

[Electronic Edition][Cited 55 times Red Star]
904.   Lars R. Knudsen,  Willi Meier,  Improved Differential Attacks on RC5, pp. 216 - 228, CRYPTO 1996.

[Electronic Edition][Cited 55 times Red Star]
905.   Ueli M. Maurer,  Stefan Wolf,  Diffie-Hellman Oracles, pp. 268 - 282, CRYPTO 1996.

[Electronic Edition][Cited 55 times Red Star]
906.   Markus Michels,  Patrick Horster,  Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme, pp. 125 - 132, ASIACRYPT 1996.

[Electronic Edition][Cited 55 times Red Star]
907.   Joe Kilian,  Frank Thomson Leighton,  Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract), pp. 208 - 221, CRYPTO 1995.

[Electronic Edition][Cited 55 times Red Star]
908.   Bob Blakley,  G. R. Blakley,  Agnes Hui Chan,  James L. Massey,  Threshold Schemes with Disenrollment, pp. 540 - 548, CRYPTO 1992.

[Electronic Edition][Cited 55 times Red Star]
909.   Ingemar Ingemarsson,  Gustavus J. Simmons,  A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party, pp. 266 - 282, EUROCRYPT 1990.

[Electronic Edition][Cited 55 times Red Star]
910.   Pim Tuyls,  Lejla Batina,  RFID-Tags for Anti-counterfeiting, pp. 115 - 131, CT-RSA 2006.

[Electronic Edition][Cited 54 times Red Star]
911.   Michel Abdalla,  David Pointcheval,  Simple Password-Based Encrypted Key Exchange Protocols, pp. 191 - 208, CT-RSA 2005.

[Electronic Edition][Cited 54 times Red Star]
912.   Alexander Klimov,  Adi Shamir,  Cryptographic Applications of T-Functions, pp. 248 - 261, SAC 2003.

[Electronic Edition][Cited 54 times Red Star]
913.   Fangguo Zhang,  Reihaneh Safavi-Naini,  Willy Susilo,  Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings, pp. 191 - 204, INDOCRYPT 2003.

[Electronic Edition][Cited 54 times Red Star]
914.   Iris Anshel,  Michael Anshel,  Benji Fisher,  Dorian Goldfeld,  New Key Agreement Protocols in Braid Group Cryptography, pp. 13 - 27, CT-RSA 2001.

[Electronic Edition][Cited 54 times Red Star]
915.   Philip D. MacKenzie,  More Efficient Password-Authenticated Key Exchange, pp. 361 - 377, CT-RSA 2001.

[Electronic Edition][Cited 54 times Red Star]
916.   Giovanni Di Crescenzo,  Rafail Ostrovsky,  Sivaramakrishnan Rajagopalan,  Conditional Oblivious Transfer and Timed-Release Encryption, pp. 74 - 89, EUROCRYPT 1999.

[Electronic Edition][Cited 54 times Red Star]
917.   Markus Michels,  Markus Stadler,  Generic Constructions for Secure and Efficient Confirmer Signature Schemes, pp. 406 - 421, EUROCRYPT 1998.

[Electronic Edition][Cited 54 times Red Star]
918.   Adam Young,  Moti Yung,  Kleptography: Using Cryptography Against Cryptography, pp. 62 - 74, EUROCRYPT 1997.

[Electronic Edition][Cited 54 times Red Star]
919.   Sherman S. M. Chow,  Siu-Ming Yiu,  Lucas Chi Kwong Hui,  Efficient Identity Based Ring Signature, pp. 499 - 512, ACNS 2005.

[Electronic Edition][Cited 53 times Red Star]
920.   Liqun Chen,  John Malone-Lee,  Improved Identity-Based Signcryption, pp. 362 - 379, PKC 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 53 times Red Star]
921.   Yehuda Lindell,  General Composition and Universal Composability in Secure Multi-Party Computation, pp. 394 - 403, FOCS 2003.

[Electronic Edition][Cited 53 times Red Star]
922.   Silvio Micali,  Michael O. Rabin,  Joe Kilian,  Zero-Knowledge Sets, pp. 80 - 91, FOCS 2003.

[Electronic Edition][Cited 53 times Red Star]
923.   Jacques J. A. Fournier,  Simon W. Moore,  Huiyun Li,  Robert D. Mullins,  George S. Taylor,  Security Evaluation of Asynchronous Circuits, pp. 137 - 151, CHES 2003.

[Electronic Edition][Cited 53 times Red Star]
924.   Ivan Damgard,  Jesper Buus Nielsen,  Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption, pp. 247 - 264, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 53 times Red Star]
925.   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 53 times Red Star]
926.   Nigel P. Smart,  The Hessian Form of an Elliptic Curve, pp. 118 - 125, CHES 2001.

[Electronic Edition][Cited 53 times Red Star]
927.   Alfred Menezes,  Minghua Qu,  Analysis of the Weil Descent Attack of Gaudry, Hess and Smart, pp. 308 - 318, CT-RSA 2001.

[Electronic Edition][Cited 53 times Red Star]
928.   Olivier Markowitch,  Shahrokh Saeednia,  Optimistic Fair Exchange with Transparent Signature Recovery, pp. 329 - 340, FC 2001.

[Electronic Edition][Cited 53 times Red Star]
929.   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 53 times Red Star]
930.   Alex Biryukov,  Eyal Kushilevitz,  Improved Cryptanalysis of RC5, pp. 85 - 99, EUROCRYPT 1998.

[Electronic Edition][Cited 53 times Red Star]
931.   Ueli M. Maurer,  Stefan Wolf,  Lower Bounds on Generic Algorithms in Groups, pp. 72 - 84, EUROCRYPT 1998.

[Electronic Edition][Cited 53 times Red Star]
932.   Lars R. Knudsen,  Practically Secure Feistel Ciphers, pp. 211 - 221, FSE 1993.

[Electronic Edition][Cited 53 times Red Star]
933.   Carlisle M. Adams,  Henk Meijer,  Security-Related Comments Regarding McEliece's Public-Key Cryptosystem, pp. 224 - 228, CRYPTO 1987.

[Electronic Edition][Cited 53 times Red Star]
934.   Liqun Chen,  Caroline Kudla,  Kenneth G. Paterson,  Concurrent Signatures, pp. 287 - 305, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 52 times Red Star]
935.   Jonathan Herzog,  Moses Liskov,  Silvio Micali,  Plaintext Awareness via Key Registration, pp. 548 - 564, CRYPTO 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 52 times Red Star]
936.   Marc Fischlin,  The Cramer-Shoup Strong-RSA Signature Scheme Revisited, pp. 116 - 129, PKC 2003.

[Electronic Edition][Cited 52 times Red Star]
937.   Miodrag J. Mihaljevic,  Marc P. C. Fossorier,  Hideki Imai,  A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack, pp. 196 - 212, FSE 2000.

[Electronic Edition][Cited 52 times Red Star]
938.   Marc Fischlin,  Roger Fischlin,  Efficient Non-malleable Commitment Schemes, pp. 413 - 431, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 52 times Red Star]
939.   Tatsuaki Okamoto,  Keisuke Tanaka,  Shigenori Uchiyama,  Quantum Public-Key Cryptosystems, pp. 147 - 165, CRYPTO 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 52 times Red Star]
940.   Oded Goldreich,  On the Foundations of Modern Cryptography, pp. 46 - 74, CRYPTO 1997.

[Electronic Edition][Cited 52 times Red Star]
941.   David Naccache,  Jacques Stern,  A New Public-Key Cryptosystem, pp. 27 - 36, EUROCRYPT 1997.

[Electronic Edition][Cited 52 times Red Star]
942.   Adam Young,  Moti Yung,  The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone?, pp. 89 - 103, CRYPTO 1996.

[Electronic Edition][Cited 52 times Red Star]
943.   Susan K. Langford,  Threshold DSS Signatures without a Trusted Party, pp. 397 - 409, CRYPTO 1995.

[Electronic Edition][Cited 52 times Red Star]
944.   Silvio Micali,  Adi Shamir,  An Improvement of the Fiat-Shamir Identification and Signature Scheme, pp. 244 - 247, CRYPTO 1988.

[Electronic Edition][Cited 52 times Red Star]
945.   Yossi Matias,  Adi Shamir,  A Video Scrambling Technique Based On Space Filling Curves, pp. 398 - 417, CRYPTO 1987.

[Electronic Edition][Cited 52 times Red Star]
946.   Ran Canetti,  Jonathan Herzog,  Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols, pp. 380 - 403, TCC 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
947.   Jonathan Katz,  Ji Sun Shin,  Parallel and Concurrent Security of the HB and HB, pp. 73 - 87, EUROCRYPT 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
948.   Dan Boneh,  Amit Sahai,  Brent Waters,  Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys, pp. 573 - 592, EUROCRYPT 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
949.   David Canright,  A Very Compact S-Box for AES, pp. 441 - 455, CHES 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
950.   Deepak Kumar Dalai,  Kishan Chand Gupta,  Subhamoy Maitra,  Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity, pp. 98 - 111, FSE 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
951.   Katsuyuki Okeya,  Katja Schmidt-Samoa,  Christian Spahn,  Tsuyoshi Takagi,  Signed Binary Representations Revisited, pp. 123 - 139, CRYPTO 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
952.   Philippe Golle,  Jessica Staddon,  Brent Waters,  Secure Conjunctive Keyword Search over Encrypted Data, pp. 31 - 45, ACNS 2004.

[Electronic Edition][Cited 51 times Red Star]
953.   Eu-Jin Goh,  Stanislaw Jarecki,  A Signature Scheme as Secure as the Diffie-Hellman Problem, pp. 401 - 415, EUROCRYPT 2003.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
954.   Yukiyasu Tsunoo,  Teruo Saito,  Tomoyasu Suzaki,  Maki Shigeri,  Hiroshi Miyauchi,  Cryptanalysis of DES Implemented on Computers with Cache, pp. 62 - 76, CHES 2003.

[Electronic Edition][Cited 51 times Red Star]
955.   Aggelos Kiayias,  Moti Yung,  Traitor Tracing with Constant Transmission Rate, pp. 450 - 465, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 51 times Red Star]
956.   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 51 times Red Star]
957.   Ernest F. Brickell,  David Pointcheval,  Serge Vaudenay,  Moti Yung,  Design Validations for Discrete Logarithm Based Signature Schemes, pp. 276 - 292, PKC 2000.

[Electronic Edition][Cited 51 times Red Star]
958.   Dan Boneh,  Antoine Joux,  Phong Q. Nguyen,  Why Textbook ElGamal and RSA Encryption Are Insecure, pp. 30 - 43, ASIACRYPT 2000.

[Electronic Edition][Cited 51 times Red Star]
959.   Moni Naor,  Benny Pinkas,  Oblivious Transfer with Adaptive Queries, pp. 573 - 590, CRYPTO 1999.

[Electronic Edition][Cited 51 times Red Star]
960.   Adam Young,  Moti Yung,  Auto-Recoverable Auto-Certifiable Cryptosystems, pp. 17 - 31, EUROCRYPT 1998.

[Electronic Edition][Cited 51 times Red Star]
961.   Yair Frankel,  Yiannis Tsiounis,  Moti Yung,  Fair Off-Line e-cash Made Easy, pp. 257 - 270, ASIACRYPT 1998.

[Electronic Edition][Cited 51 times Red Star]
962.   Ross J. Anderson,  Charalampos Manifavas,  Chameleon - A New Kind of Stream Cipher, pp. 107 - 113, FSE 1997.

[Electronic Edition][Cited 51 times Red Star]
963.   Serge Vaudenay,  Hidden Collisions on DSS, pp. 83 - 88, CRYPTO 1996.

[Electronic Edition][Cited 51 times Red Star]
964.   Lars R. Knudsen,  Thomas A. Berson,  Truncated Differentials of SAFER, pp. 15 - 26, FSE 1996.

[Electronic Edition][Cited 51 times Red Star]
965.   Yair Frankel,  Moti Yung,  Escrow Encryption Systems Visited: Attacks, Analysis and Designs, pp. 222 - 235, CRYPTO 1995.

[Electronic Edition][Cited 51 times Red Star]
966.   Valtteri Niemi,  Ari Renvall,  How to Prevent Buying of Votes in Computer Elections, pp. 164 - 170, ASIACRYPT 1994.

[Electronic Edition][Cited 51 times Red Star]
967.   Willi Meier,  Othmar Staffelbach,  Analysis of Pseudo Random Sequences Generated by Cellular Automata, pp. 186 - 199, EUROCRYPT 1991.

[Electronic Edition][Cited 51 times Red Star]
968.   Michael Waidner,  Unconditional Sender and Recipient Untraceability in Spite of Active Attacks, pp. 302 - 319, EUROCRYPT 1989.

[Electronic Edition][Cited 51 times Red Star]
969.   David Chaum,  Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How, pp. 195 - 199, CRYPTO 1986.

[Electronic Edition][Cited 51 times Red Star]
970.   Andrey Bogdanov,  Lars R. Knudsen,  Gregor Leander,  Christof Paar,  Axel Poschmann,  Matthew J. B. Robshaw,  Yannick Seurin,  C. Vikkelsoe,  PRESENT: An Ultra-Lightweight Block Cipher, pp. 450 - 466, CHES 2007.

[Electronic Edition][Cited 50 times Red Star]
971.   Boaz Barak,  Ran Canetti,  Jesper Buus Nielsen,  Rafael Pass,  Universally Composable Protocols with Relaxed Set-Up Assumptions, pp. 186 - 195, FOCS 2004.

[Electronic Edition][Cited 50 times Red Star]
972.   Ron Steinfeld,  Huaxiong Wang,  Josef Pieprzyk,  Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures, pp. 86 - 100, PKC 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 50 times Red Star]
973.   Philip D. MacKenzie,  An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack, pp. 47 - 61, PKC 2003.

[Electronic Edition][Cited 50 times Red Star]
974.   Henri Gilbert,  Helena Handschuh,  Security Analysis of SHA-256 and Sisters, pp. 175 - 193, SAC 2003.

[Electronic Edition][Cited 50 times Red Star]
975.   Felix Brandt,  Fully Private Auctions in a Constant Number of Rounds, pp. 223 - 238, FC 2003.

[Electronic Edition][Cited 50 times Red Star]
976.   Matthias Ernst,  M. Jung,  F. Madlener,  S. Huss,  Rainer BlĂĽmel,  A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2, pp. 381 - 399, CHES 2002.

[Electronic Edition][Cited 50 times Red Star]
977.   Steven D. Galbraith,  Florian Hess,  Nigel P. Smart,  Extending the GHS Weil Descent Attack, pp. 29 - 44, EUROCRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 50 times Red Star]
978.   Tomoyuki Asano,  A Revocation Scheme with Minimal Storage at Receivers, pp. 433 - 450, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 50 times Red Star]
979.   Matt Blaze,  John Ioannidis,  Angelos D. Keromytis,  Offline Micropayments without Trusted Hardware, pp. 21 - 40, FC 2001.

[Electronic Edition][Cited 50 times Red Star]
980.   Masayuki Abe,  Fumitaka Hoshino,  Remarks on Mix-Network Based on Permutation Networks, pp. 317 - 324, PKC 2001.

[Electronic Edition][Cited 50 times Red Star]
981.   Michel Abdalla,  Sara K. Miner,  Chanathip Namprempre,  Forward-Secure Threshold Signature Schemes, pp. 441 - 456, CT-RSA 2001.

[Electronic Edition][Cited 50 times Red Star]
982.   Jonathan Katz,  Moti Yung,  Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation, pp. 284 - 299, FSE 2000.

[Electronic Edition][Cited 50 times Red Star]
983.   Masayuki Abe,  Mix-Networks on Permutation Networks, pp. 258 - 273, ASIACRYPT 1999.

[Electronic Edition][Cited 50 times Red Star]
984.   Paul N. Fahn,  Peter K. Pearson,  IPA: A New Class of Power Attacks, pp. 173 - 186, CHES 1999.

[Electronic Edition][Cited 50 times Red Star]
985.   R. Reed Taylor,  Seth Copen Goldstein,  A High-Performance Flexible Architecture for Cryptography, pp. 231 - 245, CHES 1999.

[Electronic Edition][Cited 50 times Red Star]
986.   William Millan,  Andrew J. Clark,  Ed Dawson,  Heuristic Design of Cryptographically Strong Balanced Boolean Functions, pp. 489 - 499, EUROCRYPT 1998.

[Electronic Edition][Cited 50 times Red Star]
987.   Thomas Jakobson,  Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree, pp. 212 - 222, CRYPTO 1998.

[Electronic Edition][Cited 50 times Red Star]
988.   Liqun Chen,  Efficient Fair Exchange with Verifiable Confirmation of Signatures, pp. 286 - 299, ASIACRYPT 1998.

[Electronic Edition][Cited 50 times Red Star]
989.   Colin D. Walter,  Faster Modular Multiplication by Operand Scaling, pp. 313 - 323, CRYPTO 1991.

[Electronic Edition][Cited 50 times Red Star]
990.   Rainer A. Rueppel,  Othmar Staffelbach,  Products of Linear Recurring Sequence with Maximum Complexity, pp. 30 - 32, EUROCRYPT 1986.

[Electronic Edition][Cited 50 times Red Star]
991.   Suresh C. Kothari,  Generalized Linear Threshold Scheme, pp. 231 - 241, CRYPTO 1984.

[Electronic Edition][Cited 50 times Red Star]


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