Cryptographer's World -- Highly Cited Conference Papers

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 ]
2.	Ronald L. Rivest, The MD4 Message Digest Algorithm, pp. 303 - 311, CRYPTO 1990. [Electronic Edition][Cited 3030 times ]
3.	Dan Boneh, Matthew K. Franklin, Identity-Based Encryption from the Weil Pairing, pp. 213 - 229, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 2248 times ]
4.	Adi Shamir, Identity-Based Cryptosystems and Signature Schemes, pp. 47 - 53, CRYPTO 1984. [Electronic Edition][Cited 1610 times ]
5.	Paul C. Kocher, Joshua Jaffe, Benjamin Jun, Differential Power Analysis, pp. 388 - 397, CRYPTO 1999. [Electronic Edition][Cited 1508 times ]
6.	Victor S. Miller, Use of Elliptic Curves in Cryptography, pp. 417 - 426, CRYPTO 1985. [Electronic Edition][Cited 1438 times ]
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 ]
8.	David Chaum, Blind Signatures for Untraceable Payments, pp. 199 - 203, CRYPTO 1982. [Electronic Edition][Cited 1272 times ]
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 ]
10.	Mitsuru Matsui, Linear Cryptanalysis Method for DES Cipher, pp. 386 - 397, EUROCRYPT 1993. [Electronic Edition][Cited 1028 times ]
11.	Dan Boneh, Ben Lynn, Hovav Shacham, Short Signatures from the Weil Pairing, pp. 514 - 532, ASIACRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 1011 times ]
12.	Eli Biham, Adi Shamir, Differential Cryptanalysis of DES-like Cryptosystems, pp. 2 - 21, CRYPTO 1990. [Electronic Edition][Cited 974 times ]
13.	Yehuda Lindell, Benny Pinkas, Privacy Preserving Data Mining, pp. 36 - 54, CRYPTO 2000. [Electronic Edition][IACR Online Archive][Cited 963 times ]
14.	David Chaum, Amos Fiat, Moni Naor, Untraceable Electronic Cash, pp. 319 - 327, CRYPTO 1988. [Electronic Edition][Cited 758 times ]
15.	Pascal Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, pp. 223 - 238, EUROCRYPT 1999. [Electronic Edition][Cited 749 times ]
16.	Mihir Bellare, Phillip Rogaway, Entity Authentication and Key Distribution, pp. 232 - 249, CRYPTO 1993. [Electronic Edition][Cited 702 times ]
17.	David Chaum, Eugène van Heyst, Group Signatures, pp. 257 - 265, EUROCRYPT 1991. [Electronic Edition][Cited 702 times ]
18.	Mihir Bellare, Phillip Rogaway, Optimal Asymmetric Encryption, pp. 92 - 111, EUROCRYPT 1994. [Electronic Edition][Cited 677 times ]
19.	Dan Boneh, James Shaw, Collusion-Secure Fingerprinting for Digital Data (Extended Abstract), pp. 452 - 465, CRYPTO 1995. [Electronic Edition][Cited 672 times ]
20.	Mihir Bellare, Ran Canetti, Hugo Krawczyk, Keying Hash Functions for Message Authentication, pp. 1 - 15, CRYPTO 1996. [Electronic Edition][Cited 664 times ]
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 ]
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 ]
23.	Yvo Desmedt, Yair Frankel, Threshold Cryptosystems, pp. 307 - 315, CRYPTO 1989. [Electronic Edition][Cited 646 times ]
24.	Shimon Even, Oded Goldreich, Abraham Lempel, A Randomized Protocol for Signing Contracts, pp. 205 - 210, CRYPTO 1982. [Electronic Edition][Cited 642 times ]
25.	Torben P. Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, pp. 129 - 140, CRYPTO 1991. [Electronic Edition][Cited 641 times ]
26.	Claus-Peter Schnorr, Efficient Identification and Signatures for Smart Cards, pp. 239 - 252, CRYPTO 1989. [Electronic Edition][Cited 636 times ]
27.	David Chaum, Torben P. Pedersen, Wallet Databases with Observers, pp. 89 - 105, CRYPTO 1992. [Electronic Edition][Cited 601 times ]
28.	Amos Fiat, Moni Naor, Broadcast Encryption, pp. 480 - 491, CRYPTO 1993. [Electronic Edition][Cited 599 times ]
29.	Fred Piper, Stream Ciphers, pp. 181 - 188, EUROCRYPT 1982. [Electronic Edition][Cited 590 times ]
30.	Arjen K. Lenstra, Eric R. Verheul, Selecting Cryptographic Key Sizes, pp. 446 - 465, PKC 2000. [Electronic Edition][Cited 586 times ]
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 ]
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 ]
33.	Ronald L. Rivest, The RC5 Encryption Algorithm, pp. 86 - 96, FSE 1994. [Electronic Edition][Cited 545 times ]
34.	Jan Camenisch, Markus Stadler, Efficient Group Signature Schemes for Large Groups (Extended Abstract), pp. 410 - 424, CRYPTO 1997. [Electronic Edition][Cited 531 times ]
35.	Ralph C. Merkle, A Certified Digital Signature, pp. 218 - 238, CRYPTO 1989. [Electronic Edition][Cited 523 times ]
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 Archive][Cited 516 times ]
37.	Stefan Brands, Untraceable Off-line Cash in Wallets with Observers (Extended Abstract), pp. 302 - 318, CRYPTO 1993. [Electronic Edition][Cited 509 times ]
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 ]
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 ]
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 ]
41.	Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu, Finding Collisions in the Full SHA-1, pp. 17 - 36, CRYPTO 2005. [Electronic Edition][IACR Online Archive][Cited 476 times ]
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 ]
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 ]
44.	David Pointcheval, Jacques Stern, Security Proofs for Signature Schemes, pp. 387 - 398, EUROCRYPT 1996. [Electronic Edition][Cited 470 times ]
45.	Mihir Bellare, David Pointcheval, Phillip Rogaway, Authenticated Key Exchange Secure against Dictionary Attacks, pp. 139 - 155, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 467 times ]
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 ]
47.	Ivan Damgard, A Design Principle for Hash Functions, pp. 416 - 427, CRYPTO 1989. [Electronic Edition][Cited 459 times ]
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 Archive][Cited 450 times ]
49.	Moni Naor, Adi Shamir, Visual Cryptography, pp. 1 - 12, EUROCRYPT 1994. [Electronic Edition][Cited 437 times ]
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 ]
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 ]
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 ]
53.	Victor Shoup, Lower Bounds for Discrete Logarithms and Related Problems, pp. 256 - 266, EUROCRYPT 1997. [Electronic Edition][Cited 426 times ]
54.	Benny Chor, Amos Fiat, Moni Naor, Tracing Traitors, pp. 257 - 270, CRYPTO 1994. [Electronic Edition][Cited 422 times ]
55.	Florian Hess, Efficient Identity Based Signature Schemes Based on Pairings, pp. 310 - 324, SAC 2002. [Electronic Edition][Cited 417 times ]
56.	Ralph C. Merkle, One Way Hash Functions and DES, pp. 428 - 446, CRYPTO 1989. [Electronic Edition][Cited 417 times ]
57.	Torben P. Pedersen, A Threshold Cryptosystem without a Trusted Party (Extended Abstract), pp. 522 - 526, EUROCRYPT 1991. [Electronic Edition][Cited 411 times ]
58.	Rolf Blom, An Optimal Class of Symmetric Key Generation Systems, pp. 335 - 338, EUROCRYPT 1984. [Electronic Edition][Cited 410 times ]
59.	Xiaoyun Wang, Hongbo Yu, How to Break MD5 and Other Hash Functions, pp. 19 - 35, EUROCRYPT 2005. [Electronic Edition][IACR Online Archive][Cited 404 times ]
60.	David Chaum, Hans Van Antwerpen, Undeniable Signatures, pp. 212 - 216, CRYPTO 1989. [Electronic Edition][Cited 398 times ]
61.	Dan Boneh, Xavier Boyen, Secure Identity Based Encryption Without Random Oracles, pp. 443 - 459, CRYPTO 2004. [Electronic Edition][IACR Online Archive][Cited 385 times ]
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 ]
63.	Jean-Sébastien Coron, Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems, pp. 292 - 302, CHES 1999. [Electronic Edition][Cited 379 times ]
64.	Eli Biham, Adi Shamir, Differential Fault Analysis of Secret Key Cryptosystems, pp. 513 - 525, CRYPTO 1997. [Electronic Edition][Cited 379 times ]
65.	Dalit Naor, Moni Naor, Jeffery Lotspiech, Revocation and Tracing Schemes for Stateless Receivers, pp. 41 - 62, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 378 times ]
66.	Xuejia Lai, James L. Massey, Markov Ciphers and Differential Cryptanalysis, pp. 17 - 38, EUROCRYPT 1991. [Electronic Edition][Cited 375 times ]
67.	Ronald L. Rivest, Adi Shamir, Yael Tauman, How to Leak a Secret, pp. 552 - 565, ASIACRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 372 times ]
68.	Gustavus J. Simmons, The Prisoners' Problem and the Subliminal Channel, pp. 51 - 67, CRYPTO 1983. [Electronic Edition][Cited 372 times ]
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 ]
70.	Victor Shoup, Practical Threshold Signatures, pp. 207 - 220, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 368 times ]
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 ]
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 ]
73.	Cynthia Dwork, Moni Naor, Pricing via Processing or Combatting Junk Mail, pp. 139 - 147, CRYPTO 1992. [Electronic Edition][Cited 354 times ]
74.	Dan Boneh, Xavier Boyen, Short Signatures Without Random Oracles, pp. 56 - 73, EUROCRYPT 2004. [Electronic Edition][IACR Online Archive][Cited 347 times ]
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 Archive][Cited 347 times ]
76.	Stuart Haber, W. Scott Stornetta, How to Time-Stamp a Digital Document, pp. 437 - 455, CRYPTO 1990. [Electronic Edition][Cited 341 times ]
77.	Eiichiro Fujisaki, Tatsuaki Okamoto, Secure Integration of Asymmetric and Symmetric Encryption Schemes, pp. 537 - 554, CRYPTO 1999. [Electronic Edition][Cited 336 times ]
78.	Markus Jakobsson, Kazue Sako, Russell Impagliazzo, Designated Verifier Proofs and Their Applications, pp. 143 - 154, EUROCRYPT 1996. [Electronic Edition][Cited 334 times ]
79.	Brent Waters, Efficient Identity-Based Encryption Without Random Oracles, pp. 114 - 127, EUROCRYPT 2005. [Electronic Edition][IACR Online Archive][Cited 333 times ]
80.	Xuejia Lai, James L. Massey, A Proposal for a New Block Encryption Standard, pp. 389 - 404, EUROCRYPT 1990. [Electronic Edition][Cited 332 times ]
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 ]
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 Archive][Cited 327 times ]
83.	Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin, Robust Threshold DSS Signatures, pp. 354 - 371, EUROCRYPT 1996. [Electronic Edition][Cited 325 times ]
84.	Dan Boneh, Xavier Boyen, Hovav Shacham, Short Group Signatures, pp. 41 - 55, CRYPTO 2004. [Electronic Edition][IACR Online Archive][Cited 321 times ]
85.	Nicolas Courtois, Willi Meier, Algebraic Attacks on Stream Ciphers with Linear Feedback, pp. 345 - 359, EUROCRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 321 times ]
86.	Nicolas Courtois, Fast Algebraic Attacks on Stream Ciphers with Linear Feedback, pp. 176 - 194, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 321 times ]
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 ]
88.	Yvo Desmedt, Yair Frankel, Shared Generation of Authenticators and Signatures (Extended Abstract), pp. 457 - 469, CRYPTO 1991. [Electronic Edition][Cited 321 times ]
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 Archive][Cited 319 times ]
90.	Craig Gentry, Alice Silverberg, Hierarchical ID-Based Cryptography, pp. 548 - 566, ASIACRYPT 2002. [Electronic Edition][IACR Online Archive][Cited 312 times ]
91.	Nicolas Courtois, Josef Pieprzyk, Cryptanalysis of Block Ciphers with Overdefined Systems of Equations, pp. 267 - 287, ASIACRYPT 2002. [Electronic Edition][IACR Online Archive][Cited 311 times ]
92.	Dan Boneh, Matthew K. Franklin, Efficient Generation of Shared RSA Keys (Extended Abstract), pp. 425 - 439, CRYPTO 1997. [Electronic Edition][Cited 306 times ]
93.	Mihir Bellare, Sara K. Miner, A Forward-Secure Digital Signature Scheme, pp. 431 - 448, CRYPTO 1999. [Electronic Edition][Cited 305 times ]
94.	Ralph C. Merkle, A Digital Signature Based on a Conventional Encryption Function, pp. 369 - 378, CRYPTO 1987. [Electronic Edition][Cited 305 times ]
95.	Tatsuaki Okamoto, Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes, pp. 31 - 53, CRYPTO 1992. [Electronic Edition][Cited 304 times ]
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 ]
97.	Rosario Gennaro, Pankaj Rohatgi, How to Sign Digital Streams, pp. 180 - 197, CRYPTO 1997. [Electronic Edition][Cited 301 times ]
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 ]
99.	Hans Dobbertin, Antoon Bosselaers, Bart Preneel, RIPEMD-160: A Strengthened Version of RIPEMD, pp. 71 - 82, FSE 1996. [Electronic Edition][Cited 298 times ]
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 ]
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 ]
102.	Josh Cohen Benaloh, Jerry Leichter, Generalized Secret Sharing and Monotone Functions, pp. 27 - 35, CRYPTO 1988. [Electronic Edition][Cited 289 times ]
103.	Victor Shoup, OAEP Reconsidered, pp. 239 - 259, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 288 times ]
104.	Markus Stadler, Publicly Verifiable Secret Sharing, pp. 190 - 199, EUROCRYPT 1996. [Electronic Edition][Cited 287 times ]
105.	Tatsuaki Okamoto, Shigenori Uchiyama, A New Public-Key Cryptosystem as Secure as Factoring, pp. 308 - 318, EUROCRYPT 1998. [Electronic Edition][Cited 282 times ]
106.	Marc Girault, Self-Certified Public Keys, pp. 490 - 497, EUROCRYPT 1991. [Electronic Edition][Cited 279 times ]
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 Archive][Cited 278 times ]
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 ]
109.	Kaisa Nyberg, Differentially Uniform Mappings for Cryptography, pp. 55 - 64, EUROCRYPT 1993. [Electronic Edition][Cited 278 times ]
110.	Michael J. Wiener, Cryptanalysis of Short RSA Secret Exponents (Abstract), pp. 372 - 372, EUROCRYPT 1989. [Electronic Edition][Cited 278 times ]
111.	Henri Cohen, Atsuko Miyaji, Takatoshi Ono, Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, pp. 51 - 65, ASIACRYPT 1998. [Electronic Edition][Cited 276 times ]
112.	Silvio Micali, Phillip Rogaway, Secure Computation (Abstract), pp. 392 - 404, CRYPTO 1991. [Electronic Edition][Cited 275 times ]
113.	Yvo Desmedt, Society and Group Oriented Cryptography: A New Concept, pp. 120 - 127, CRYPTO 1987. [Electronic Edition][Cited 273 times ]
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 ]
115.	Eiichiro Fujisaki, Tatsuaki Okamoto, Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, pp. 16 - 30, CRYPTO 1997. [Electronic Edition][Cited 271 times ]
116.	Neal Koblitz, CM-Curves with Good Cryptographic Properties, pp. 279 - 287, CRYPTO 1991. [Electronic Edition][Cited 265 times ]
117.	Tatsuaki Okamoto, Kazuo Ohta, Universal Electronic Cash, pp. 324 - 337, CRYPTO 1991. [Electronic Edition][Cited 256 times ]
118.	Andrew M. Odlyzko, Discrete Logarithms in Finite Fields and Their Cryptographic Significance, pp. 224 - 314, EUROCRYPT 1984. [Electronic Edition][Cited 254 times ]
119.	Joan Daemen, Lars R. Knudsen, Vincent Rijmen, The Block Cipher Square, pp. 149 - 165, FSE 1997. [Electronic Edition][Cited 253 times ]
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 Archive][Cited 250 times ]
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 ]
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 ]
123.	A. F. Webster, Stafford E. Tavares, On the Design of S-Boxes, pp. 523 - 534, CRYPTO 1985. [Electronic Edition][Cited 247 times ]
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 ]
125.	Eli Biham, New Types of Cryptanalytic Attacks Using related Keys (Extended Abstract), pp. 398 - 409, EUROCRYPT 1993. [Electronic Edition][Cited 245 times ]
126.	David Chaum, Zero-Knowledge Undeniable Signatures, pp. 458 - 464, EUROCRYPT 1990. [Electronic Edition][Cited 244 times ]
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 ]
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 ]
129.	Willi Meier, Othmar Staffelbach, Nonlinearity Criteria for Cryptographic Functions, pp. 549 - 562, EUROCRYPT 1989. [Electronic Edition][Cited 238 times ]
130.	Ran Canetti, Shai Halevi, Jonathan Katz, A Forward-Secure Public-Key Encryption Scheme, pp. 255 - 271, EUROCRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 236 times ]
131.	Christian Cachin, Silvio Micali, Markus Stadler, Computationally Private Information Retrieval with Polylogarithmic Communication, pp. 402 - 414, EUROCRYPT 1999. [Electronic Edition][Cited 231 times ]
132.	Mitsuru Matsui, The First Experimental Cryptanalysis of the Data Encryption Standard, pp. 1 - 11, CRYPTO 1994. [Electronic Edition][Cited 231 times ]
133.	Eli Biham, Adi Shamir, Differential Cryptanalysis of the Full 16-Round DES, pp. 487 - 496, CRYPTO 1992. [Electronic Edition][Cited 228 times ]
134.	Fangguo Zhang, Kwangjo Kim, ID-Based Blind Signature and Ring Signature from Pairings, pp. 533 - 547, ASIACRYPT 2002. [Electronic Edition][IACR Online Archive][Cited 227 times ]
135.	Martin Hirt, Kazue Sako, Efficient Receipt-Free Voting Based on Homomorphic Encryption, pp. 539 - 556, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 227 times ]
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 Archive][Cited 226 times ]
137.	Sattam S. Al-Riyami, Kenneth G. Paterson, Certificateless Public Key Cryptography, pp. 452 - 473, ASIACRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 226 times ]
138.	Karine Gandolfi, Christophe Mourtel, Francis Olivier, Electromagnetic Analysis: Concrete Results, pp. 251 - 261, CHES 2001. [Electronic Edition][Cited 226 times ]
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 ]
140.	Hans Dobbertin, Cryptanalysis of MD4, pp. 53 - 69, FSE 1996. [Electronic Edition][Cited 224 times ]
141.	Russell Impagliazzo, Steven Rudich, Limits on the Provable Consequences of One-way Permutations, pp. 8 - 26, CRYPTO 1988. [Electronic Edition][Cited 223 times ]
142.	Adi Shamir, A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem, pp. 279 - 288, CRYPTO 1982. [Electronic Edition][Cited 223 times ]
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 Archive][Cited 221 times ]
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 ]
145.	Lars R. Knudsen, Truncated and Higher Order Differentials, pp. 196 - 211, FSE 1994. [Electronic Edition][Cited 220 times ]
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 Archive][Cited 215 times ]
147.	Don Coppersmith, Hugo Krawczyk, Yishay Mansour, The Shrinking Generator, pp. 22 - 39, CRYPTO 1993. [Electronic Edition][Cited 215 times ]
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 Archive][Cited 213 times ]
149.	Ran Canetti, Shai Halevi, Jonathan Katz, Chosen-Ciphertext Security from Identity-Based Encryption, pp. 207 - 222, EUROCRYPT 2004. [Electronic Edition][IACR Online Archive][Cited 212 times ]
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 ]
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 ]
152.	Ari Juels, Ravikanth Pappu, Squealing Euros: Privacy Protection in RFID-Enabled Banknotes, pp. 103 - 121, FC 2003. [Electronic Edition][Cited 209 times ]
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 ]
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 Archive][Cited 208 times ]
155.	Dan Boneh, Matthew K. Franklin, An Efficient Public Key Traitor Tracing Scheme, pp. 338 - 353, CRYPTO 1999. [Electronic Edition][Cited 207 times ]
156.	Fabrice Boudot, Efficient Proofs that a Committed Number Lies in an Interval, pp. 431 - 444, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 206 times ]
157.	Stefan Brands, David Chaum, Distance-Bounding Protocols (Extended Abstract), pp. 344 - 359, EUROCRYPT 1993. [Electronic Edition][Cited 206 times ]
158.	Jan Camenisch, Efficient and Generalized Group Signatures, pp. 465 - 479, EUROCRYPT 1997. [Electronic Edition][Cited 205 times ]
159.	Catherine Meadows, Formal Verification of Cryptographic Protocols: A Survey, pp. 135 - 150, ASIACRYPT 1994. [Electronic Edition][Cited 205 times ]
160.	Ivan Damgard, Collision Free Hash Functions and Public Key Signature Schemes, pp. 203 - 216, EUROCRYPT 1987. [Electronic Edition][Cited 205 times ]
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 ]
162.	Louis Goubin, Jacques Patarin, DES and Differential Power Analysis (The "Duplication" Method), pp. 158 - 172, CHES 1999. [Electronic Edition][Cited 204 times ]
163.	Markus Stadler, Jean-Marc Piveteau, Jan Camenisch, Fair Blind Signatures, pp. 209 - 219, EUROCRYPT 1995. [Electronic Edition][Cited 204 times ]
164.	Markus Jakobsson, Susanne Wetzel, Security Weaknesses in Bluetooth, pp. 176 - 191, CT-RSA 2001. [Electronic Edition][Cited 202 times ]
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 Archive][Cited 201 times ]
166.	Martin Tompa, Heather Woll, How to Share a Secret with Cheaters, pp. 261 - 265, CRYPTO 1986. [Electronic Edition][Cited 201 times ]
167.	Michael J. Freedman, Kobbi Nissim, Benny Pinkas, Efficient Private Matching and Set Intersection, pp. 1 - 19, EUROCRYPT 2004. [Electronic Edition][IACR Online Archive][Cited 200 times ]
168.	Jan Camenisch, Anna Lysyanskaya, Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials, pp. 61 - 76, CRYPTO 2002. [Electronic Edition][IACR Online Archive][Cited 198 times ]
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 ]
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 Archive][Cited 197 times ]
171.	Dani Halevy, Adi Shamir, The LSD Broadcast Encryption Scheme, pp. 47 - 60, CRYPTO 2002. [Electronic Edition][IACR Online Archive][Cited 197 times ]
172.	Thomas Jakobsen, Lars R. Knudsen, The Interpolation Attack on Block Ciphers, pp. 28 - 40, FSE 1997. [Electronic Edition][Cited 197 times ]
173.	Paul C. Kocher, On Certificate Revocation and Validation, pp. 172 - 177, FC 1998. [Electronic Edition][Cited 196 times ]
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 ]
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 ]
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 ]
177.	Antoine Joux, Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions, pp. 306 - 316, CRYPTO 2004. [Electronic Edition][IACR Online Archive][Cited 190 times ]
178.	Anna Lysyanskaya, Ronald L. Rivest, Amit Sahai, Stefan Wolf, Pseudonym Systems, pp. 184 - 199, SAC 1999. [Electronic Edition][Cited 190 times ]
179.	Ross J. Anderson, Roger M. Needham, Robustness Principles for Public Key Protocols, pp. 236 - 247, CRYPTO 1995. [Electronic Edition][Cited 188 times ]
180.	Andreas Pfitzmann, Michael Waidner, Networks Without User Observability: Design Options, pp. 245 - 253, EUROCRYPT 1985. [Electronic Edition][Cited 187 times ]
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 Archive][Cited 186 times ]
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 ]
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 ]
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 ]
185.	Yiannis Tsiounis, Moti Yung, On the Security of ElGamal Based Encryption, pp. 117 - 134, PKC 1998. [Electronic Edition][Cited 185 times ]
186.	Xiaoyun Wang, Hongbo Yu, Yiqun Lisa Yin, Efficient Collision Search Attacks on SHA-0, pp. 1 - 16, CRYPTO 2005. [Electronic Edition][IACR Online Archive][Cited 184 times ]
187.	Arjen K. Lenstra, Eric R. Verheul, The XTR Public Key System, pp. 1 - 19, CRYPTO 2000. [Electronic Edition][IACR Online Archive][Cited 184 times ]
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 ]
189.	Ran Canetti, Marc Fischlin, Universally Composable Commitments, pp. 19 - 40, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 183 times ]
190.	Ernest F. Brickell, Some Ideal Secret Sharing Schemes, pp. 468 - 475, EUROCRYPT 1989. [Electronic Edition][Cited 183 times ]
191.	Tal Rabin, A Simplified Approach to Threshold and Proactive RSA, pp. 89 - 104, CRYPTO 1998. [Electronic Edition][Cited 182 times ]
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 ]
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 ]
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 Archive][Cited 180 times ]
195.	Ronald L. Rivest, Can We Eliminate Certificate Revocations Lists?, pp. 178 - 183, FC 1998. [Electronic Edition][Cited 180 times ]
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 ]
197.	Chae Hoon Lim, Pil Joong Lee, More Flexible Exponentiation with Precomputation, pp. 95 - 107, CRYPTO 1994. [Electronic Edition][Cited 179 times ]
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 ]
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 ]
200.	Donald Beaver, Foundations of Secure Interactive Computing, pp. 377 - 391, CRYPTO 1991. [Electronic Edition][Cited 178 times ]
201.	Gustavus J. Simmons, Authentication Theory/Coding Theory, pp. 411 - 431, CRYPTO 1984. [Electronic Edition][Cited 178 times ]
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 ]
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 ]
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 ]
205.	Adi Shamir, The Generation of Cryptographically Strong Pseudo-Random Sequences, pp. 1 - 1, CRYPTO 1981. [Electronic Edition][Cited 174 times ]
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 Archive][Cited 172 times ]
207.	Kaisa Nyberg, Perfect Nonlinear S-Boxes, pp. 378 - 386, EUROCRYPT 1991. [Electronic Edition][Cited 172 times ]
208.	Ari Juels, Stephen A. Weis, Authenticating Pervasive Devices with Human Protocols, pp. 293 - 308, CRYPTO 2005. [Electronic Edition][IACR Online Archive][Cited 171 times ]
209.	Ran Canetti, Hugo Krawczyk, Universally Composable Notions of Key Exchange and Secure Channels, pp. 337 - 351, EUROCRYPT 2002. [Electronic Edition][IACR Online Archive][Cited 170 times ]
210.	Steven D. Galbraith, Supersingular Curves in Cryptography, pp. 495 - 513, ASIACRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 170 times ]
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 ]
212.	Lidong Chen, Torben P. Pedersen, New Group Signature Schemes (Extended Abstract), pp. 171 - 181, EUROCRYPT 1994. [Electronic Edition][Cited 170 times ]
213.	David Chaum, Designated Confirmer Signatures, pp. 86 - 91, EUROCRYPT 1994. [Electronic Edition][Cited 170 times ]
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 Archive][Cited 169 times ]
215.	Sergei P. Skorobogatov, Ross J. Anderson, Optical Fault Induction Attacks, pp. 2 - 12, CHES 2002. [Electronic Edition][Cited 169 times ]
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 ]
217.	Mitsuru Matsui, New Block Encryption Algorithm MISTY, pp. 54 - 68, FSE 1997. [Electronic Edition][Cited 169 times ]
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 ]
219.	Jonathan Katz, Moti Yung, Scalable Protocols for Authenticated Group Key Exchange, pp. 110 - 125, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 168 times ]
220.	Torben P. Pedersen, Distributed Provers with Applications to Undeniable Signatures, pp. 221 - 242, EUROCRYPT 1991. [Electronic Edition][Cited 168 times ]
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 ]
222.	Jeremy Horwitz, Ben Lynn, Toward Hierarchical Identity-Based Encryption, pp. 466 - 481, EUROCRYPT 2002. [Electronic Edition][IACR Online Archive][Cited 167 times ]
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 ]
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 ]
225.	Eli Biham, Rafi Chen, Near-Collisions of SHA-0, pp. 290 - 305, CRYPTO 2004. [Electronic Edition][IACR Online Archive][Cited 166 times ]
226.	Thomas S. Messerges, Using Second-Order Power Analysis to Attack DPA Resistant Software, pp. 238 - 251, CHES 2000. [Electronic Edition][Cited 166 times ]
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 ]
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 ]
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 ]
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 ]
231.	Shimshon Berkovits, How To Broadcast A Secret, pp. 535 - 541, EUROCRYPT 1991. [Electronic Edition][Cited 164 times ]
232.	Jan Camenisch, Anna Lysyanskaya, Signature Schemes and Anonymous Credentials from Bilinear Maps, pp. 56 - 72, CRYPTO 2004. [Electronic Edition][IACR Online Archive][Cited 162 times ]
233.	Giuseppe Ateniese, Gene Tsudik, Some Open Issues and New Directions in Group Signatures, pp. 196 - 211, FC 1999. [Electronic Edition][Cited 161 times ]
234.	Douglas R. Stinson, Universal Hashing and Authentication Codes, pp. 74 - 85, CRYPTO 1991. [Electronic Edition][Cited 161 times ]
235.	Ran Canetti, Tal Malkin, Kobbi Nissim, Efficient Communication-Storage Tradeoffs for Multicast Encryption, pp. 459 - 474, EUROCRYPT 1999. [Electronic Edition][Cited 160 times ]
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 ]
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 ]
238.	Hugo Krawczyk, LFSR-based Hashing and Authentication, pp. 129 - 139, CRYPTO 1994. [Electronic Edition][Cited 159 times ]
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 ]
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 Archive][Cited 158 times ]
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 Archive][Cited 157 times ]
242.	Victor Shoup, Rosario Gennaro, Securing Threshold Cryptosystems against Chosen Ciphertext Attack, pp. 1 - 16, EUROCRYPT 1998. [Electronic Edition][Cited 157 times ]
243.	Oded Goldreich, Shafi Goldwasser, Shai Halevi, Public-Key Cryptosystems from Lattice Reduction Problems, pp. 112 - 131, CRYPTO 1997. [Electronic Edition][Cited 157 times ]
244.	David J. Wheeler, Roger M. Needham, TEA, a Tiny Encryption Algorithm, pp. 363 - 366, FSE 1994. [Electronic Edition][Cited 157 times ]
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 ]
246.	Joe Kilian, Erez Petrank, Identity Escrow, pp. 169 - 185, CRYPTO 1998. [Electronic Edition][Cited 156 times ]
247.	Ueli M. Maurer, A Universal Statistical Test for Random Bit Generators, pp. 409 - 420, CRYPTO 1990. [Electronic Edition][Cited 156 times ]
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 ]
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 Archive][Cited 155 times ]
250.	Florent Chabaud, Antoine Joux, Differential Collisions in SHA-0, pp. 56 - 71, CRYPTO 1998. [Electronic Edition][Cited 155 times ]
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 ]
252.	Uriel Feige, Adi Shamir, Zero Knowledge Proofs of Knowledge in Two Rounds, pp. 526 - 544, CRYPTO 1989. [Electronic Edition][Cited 155 times ]
253.	Charanjit S. Jutla, Encryption Modes with Almost Free Message Integrity, pp. 529 - 544, EUROCRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 154 times ]
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 Archive][Cited 154 times ]
255.	Phillip Rogaway, Don Coppersmith, A Software-Optimized Encryption Algorithm, pp. 56 - 63, FSE 1993. [Electronic Edition][Cited 154 times ]
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 ]
257.	James L. Massey, SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm, pp. 1 - 17, FSE 1993. [Electronic Edition][Cited 153 times ]
258.	Mihir Bellare, Silvio Micali, Non-Interactive Oblivious Transfer and Applications, pp. 547 - 557, CRYPTO 1989. [Electronic Edition][Cited 153 times ]
259.	Willi Meier, Enes Pasalic, Claude Carlet, Algebraic Attacks and Decomposition of Boolean Functions, pp. 474 - 491, EUROCRYPT 2004. [Electronic Edition][IACR Online Archive][Cited 152 times ]
260.	Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung, Key-Insulated Public Key Cryptosystems, pp. 65 - 82, EUROCRYPT 2002. [Electronic Edition][IACR Online Archive][Cited 152 times ]
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 ]
262.	Agnes Hui Chan, Yair Frankel, Yiannis Tsiounis, Easy Come - Easy Go Divisible Cash, pp. 561 - 575, EUROCRYPT 1998. [Electronic Edition][Cited 151 times ]
263.	Masayuki Abe, Eiichiro Fujisaki, How to Date Blind Signatures, pp. 244 - 251, ASIACRYPT 1996. [Electronic Edition][Cited 151 times ]
264.	Jean-Sébastien Coron, On the Exact Security of Full Domain Hash, pp. 229 - 235, CRYPTO 2000. [Electronic Edition][IACR Online Archive][Cited 150 times ]
265.	David Wagner, The Boomerang Attack, pp. 156 - 170, FSE 1999. [Electronic Edition][Cited 150 times ]
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 ]
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 ]
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 Archive][Cited 149 times ]
269.	Joe Kilian, Phillip Rogaway, How to Protect DES Against Exhaustive Key Search, pp. 252 - 267, CRYPTO 1996. [Electronic Edition][Cited 149 times ]
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 ]
271.	Stephen Wolfram, Cryptography with Cellular Automata, pp. 429 - 432, CRYPTO 1985. [Electronic Edition][Cited 149 times ]
272.	Gilles Brassard, Louis Salvail, Secret-Key Reconciliation by Public Discussion, pp. 410 - 423, EUROCRYPT 1993. [Electronic Edition][Cited 147 times ]
273.	Gene Itkis, Leonid Reyzin, Forward-Secure Signatures with Optimal Signing and Verifying, pp. 332 - 354, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 146 times ]
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 ]
275.	Tatsuaki Okamoto, An Efficient Divisible Electronic Cash Scheme, pp. 438 - 451, CRYPTO 1995. [Electronic Edition][Cited 146 times ]
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 ]
277.	Silvio Micali, Fair Public-Key Cryptosystems, pp. 113 - 138, CRYPTO 1992. [Electronic Edition][Cited 146 times ]
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 ]
279.	Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier, On Correlation-Immune Functions, pp. 86 - 100, CRYPTO 1991. [Electronic Edition][Cited 145 times ]
280.	Sean Murphy, Matthew J. B. Robshaw, Essential Algebraic Structure within the AES, pp. 1 - 16, CRYPTO 2002. [Electronic Edition][IACR Online Archive][Cited 143 times ]
281.	Eric R. Verheul, Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems, pp. 195 - 210, EUROCRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 143 times ]
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 ]
283.	Richard A. Kemmerer, Analyzing Encryption Protocols Using Formal Verification Techniques, pp. 48 - 48, EUROCRYPT 1986. [Electronic Edition][Cited 143 times ]
284.	Carl Pomerance, The Quadratic Sieve Factoring Algorithm, pp. 169 - 182, EUROCRYPT 1984. [Electronic Edition][Cited 143 times ]
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 ]
286.	Ivan Damgard, Efficient Concurrent Zero-Knowledge in the Auxiliary String Model, pp. 418 - 430, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 142 times ]
287.	Aviad Kipnis, Adi Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, pp. 19 - 30, CRYPTO 1999. [Electronic Edition][Cited 142 times ]
288.	Jan Camenisch, Markus Michels, A Group Signature Scheme with Improved Efficiency, pp. 160 - 174, ASIACRYPT 1998. [Electronic Edition][Cited 142 times ]
289.	Joan Boyar, David Chaum, Ivan Damgard, Torben P. Pedersen, Convertible Undeniable Signatures, pp. 189 - 205, CRYPTO 1990. [Electronic Edition][Cited 142 times ]
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 ]
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 Archive][Cited 141 times ]
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 ]
293.	Simon Blake-Wilson, Alfred Menezes, Authenticated Diffie-Hellman Key Agreement Protocols, pp. 339 - 361, SAC 1998. [Electronic Edition][Cited 141 times ]
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 Archive][Cited 140 times ]
295.	Tatsuaki Okamoto, David Pointcheval, REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform, pp. 159 - 175, CT-RSA 2001. [Electronic Edition][Cited 140 times ]
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 ]
297.	Bert den Boer, Antoon Bosselaers, Collisions for the Compression Function of MD5, pp. 293 - 304, EUROCRYPT 1993. [Electronic Edition][Cited 140 times ]
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 ]
299.	David Pointcheval, Jacques Stern, Provably Secure Blind Signature Schemes, pp. 252 - 265, ASIACRYPT 1996. [Electronic Edition][Cited 139 times ]
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 ]
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 Archive][Cited 138 times ]
302.	Jan Camenisch, Victor Shoup, Practical Verifiable Encryption and Decryption of Discrete Logarithms, pp. 126 - 144, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 138 times ]
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 Archive][Cited 138 times ]
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 ]
305.	Philippe Flajolet, Andrew M. Odlyzko, Random Mapping Statistics, pp. 329 - 354, EUROCRYPT 1989. [Electronic Edition][Cited 138 times ]
306.	Christoph G. Günther, An Identity-Based Key-Exchange Protocol, pp. 29 - 37, EUROCRYPT 1989. [Electronic Edition][Cited 138 times ]
307.	Silvio Micali, Charles Rackoff, Bob Sloan, The Notion of Security for Probabilistic Cryptosystems, pp. 381 - 392, CRYPTO 1986. [Electronic Edition][Cited 138 times ]
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 Archive][Cited 137 times ]
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 Archive][Cited 137 times ]
310.	Moni Naor, Benny Pinkas, Efficient Trace and Revoke Schemes, pp. 1 - 20, FC 2000. [Electronic Edition][Cited 137 times ]
311.	Florent Chabaud, Serge Vaudenay, Links Between Differential and Linear Cryptanalysis, pp. 356 - 365, EUROCRYPT 1994. [Electronic Edition][Cited 137 times ]
312.	Craig Gentry, Certificate-Based Encryption and the Certificate Revocation Problem, pp. 272 - 293, EUROCRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 136 times ]
313.	James Goodman, Anantha Chandrakasan, An Energy Efficient Reconfigurable Public-Key Cryptography Processor Architecture, pp. 175 - 190, CHES 2000. [Electronic Edition][Cited 136 times ]
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 ]
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 ]
316.	Niels Ferguson, Single Term Off-Line Coins, pp. 318 - 328, EUROCRYPT 1993. [Electronic Edition][Cited 136 times ]
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 ]
318.	Pierrick Gaudry, An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, pp. 19 - 34, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 135 times ]
319.	Markus Jakobsson, A Practical Mix, pp. 448 - 461, EUROCRYPT 1998. [Electronic Edition][Cited 135 times ]
320.	Ran Canetti, Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information, pp. 455 - 469, CRYPTO 1997. [Electronic Edition][Cited 135 times ]
321.	Jorge Guajardo, Christof Paar, Efficient Algorithms for Elliptic Curve Cryptosystems, pp. 342 - 356, CRYPTO 1997. [Electronic Edition][Cited 135 times ]
322.	Birgit Pfitzmann, Matthias Schunter, Asymmetric Fingerprinting (Extended Abstract), pp. 84 - 95, EUROCRYPT 1996. [Electronic Edition][Cited 135 times ]
323.	Ronald Cramer, Ivan Damgard, Jesper Buus Nielsen, Multiparty Computation from Threshold Homomorphic Encryption, pp. 280 - 299, EUROCRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 134 times ]
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 ]
325.	Claude Crépeau, Equivalence Between Two Flavours of Oblivious Transfers, pp. 350 - 354, CRYPTO 1987. [Electronic Edition][Cited 134 times ]
326.	Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung, Proactive RSA, pp. 440 - 454, CRYPTO 1997. [Electronic Edition][Cited 133 times ]
327.	Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie, Abuse-Free Optimistic Contract Signing, pp. 449 - 466, CRYPTO 1999. [Electronic Edition][Cited 132 times ]
328.	Don Coppersmith, Finding a Small Root of a Univariate Modular Equation, pp. 155 - 165, EUROCRYPT 1996. [Electronic Edition][Cited 132 times ]
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 Archive][Cited 131 times ]
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 Archive][Cited 131 times ]
331.	Jun Furukawa, Kazue Sako, An Efficient Scheme for Proving a Shuffle, pp. 368 - 387, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 131 times ]
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 ]
333.	Michel Abdalla, Leonid Reyzin, A New Forward-Secure Digital Signature Scheme, pp. 116 - 129, ASIACRYPT 2000. [Electronic Edition][Cited 130 times ]
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 ]
335.	Eric Brier, Christophe Clavier, Francis Olivier, Correlation Power Analysis with a Leakage Model, pp. 16 - 29, CHES 2004. [Electronic Edition][Cited 128 times ]
336.	Elad Barkan, Eli Biham, Nathan Keller, Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication, pp. 600 - 616, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 128 times ]
337.	Jan Camenisch, Markus Michels, Separability and Efficiency for Generic Group Signature Schemes, pp. 413 - 430, CRYPTO 1999. [Electronic Edition][Cited 128 times ]
338.	Kaoru Kurosawa, Yvo Desmedt, Optimum Traitor Tracing and Asymmetric Schemes, pp. 145 - 157, EUROCRYPT 1998. [Electronic Edition][Cited 128 times ]
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 ]
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 ]
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 ]
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 ]
343.	Kaisa Nyberg, Linear Approximation of Block Ciphers, pp. 439 - 444, EUROCRYPT 1994. [Electronic Edition][Cited 127 times ]
344.	Alex Biryukov, David Wagner, Slide Attacks, pp. 245 - 259, FSE 1999. [Electronic Edition][Cited 126 times ]
345.	Jovan Dj. Golic, Cryptanalysis of Alleged A5 Stream Cipher, pp. 239 - 255, EUROCRYPT 1997. [Electronic Edition][Cited 126 times ]
346.	Iwan M. Duursma, Hyang-Sook Lee, Tate Pairing Implementation for Hyperelliptic Curves y, pp. 111 - 123, ASIACRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 125 times ]
347.	Mike Just, Serge Vaudenay, Authenticated Multi-Party Key Agreement, pp. 36 - 49, ASIACRYPT 1996. [Electronic Edition][Cited 125 times ]
348.	David Chaum, Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA, pp. 177 - 182, EUROCRYPT 1988. [Electronic Edition][Cited 125 times ]
349.	Mihir Bellare, Alexandra Boldyreva, Anand Desai, David Pointcheval, Key-Privacy in Public-Key Encryption, pp. 566 - 582, ASIACRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 124 times ]
350.	Kaisa Nyberg, Lars R. Knudsen, Provable Security Against Differential Cryptanalysis, pp. 566 - 574, CRYPTO 1992. [Electronic Edition][Cited 124 times ]
351.	Xavier Boyen, Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography), pp. 383 - 399, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 123 times ]
352.	Alex Biryukov, Adi Shamir, Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers, pp. 1 - 13, ASIACRYPT 2000. [Electronic Edition][Cited 123 times ]
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 Archive][Cited 122 times ]
354.	Thomas S. Messerges, Securing the AES Finalists Against Power Analysis Attacks, pp. 150 - 164, FSE 2000. [Electronic Edition][Cited 122 times ]
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 Archive][Cited 121 times ]
356.	Oded Goldreich, Yehuda Lindell, Session-Key Generation Using Human Passwords Only, pp. 408 - 432, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 121 times ]
357.	Marc Joye, Christophe Tymen, Protections against Differential Analysis for Elliptic Curve Cryptography, pp. 377 - 390, CHES 2001. [Electronic Edition][Cited 118 times ]
358.	Jurjen N. Bos, Matthijs J. Coster, Addition Chain Heuristics, pp. 400 - 407, CRYPTO 1989. [Electronic Edition][Cited 118 times ]
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 ]
360.	Frederik Armknecht, Matthias Krause, Algebraic Attacks on Combiners with Memory, pp. 162 - 175, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 117 times ]
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 Archive][Cited 117 times ]
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 ]
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 ]
364.	Dan Boneh, Eu-Jin Goh, Kobbi Nissim, Evaluating 2-DNF Formulas on Ciphertexts, pp. 325 - 341, TCC 2005. [Electronic Edition][IACR Online Archive][Cited 116 times ]
365.	Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung, Strong Key-Insulated Signature Schemes, pp. 130 - 144, PKC 2003. [Electronic Edition][Cited 116 times ]
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 ]
367.	Ransom Richardson, Joe Kilian, On the Concurrent Composition of Zero-Knowledge Proofs, pp. 415 - 431, EUROCRYPT 1999. [Electronic Edition][Cited 116 times ]
368.	Matt Blaze, Gerrit Bleumer, Martin J. Strauss, Divertible Protocols and Atomic Proxy Cryptography, pp. 127 - 144, EUROCRYPT 1998. [Electronic Edition][Cited 116 times ]
369.	Eli Biham, A Fast New DES Implementation in Software, pp. 260 - 272, FSE 1997. [Electronic Edition][Cited 116 times ]
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 ]
371.	Willi Meier, Othmar Staffelbach, The Self-Shrinking Generator, pp. 205 - 214, EUROCRYPT 1994. [Electronic Edition][Cited 116 times ]
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 ]
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 Archive][Cited 115 times ]
374.	Mihir Bellare, Phillip Rogaway, Collision-Resistant Hashing: Towards Making UOWHFs Practical, pp. 470 - 484, CRYPTO 1997. [Electronic Edition][Cited 115 times ]
375.	Rosario Gennaro, Hugo Krawczyk, Tal Rabin, RSA-Based Undeniable Signatures, pp. 132 - 149, CRYPTO 1997. [Electronic Edition][Cited 115 times ]
376.	Moni Naor, Benny Pinkas, Visual Authentication and Identification, pp. 322 - 336, CRYPTO 1997. [Electronic Edition][Cited 115 times ]
377.	David Chaum, Torben P. Pedersen, Transferred Cash Grows in Size, pp. 390 - 407, EUROCRYPT 1992. [Electronic Edition][Cited 115 times ]
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 ]
379.	David Wagner, A Generalized Birthday Problem, pp. 288 - 303, CRYPTO 2002. [Electronic Edition][IACR Online Archive][Cited 114 times ]
380.	G. R. Blakley, Catherine Meadows, Security of Ramp Schemes, pp. 242 - 268, CRYPTO 1984. [Electronic Edition][Cited 114 times ]
381.	Don Coppersmith, Markus Jakobsson, Almost Optimal Hash Sequence Traversal, pp. 102 - 119, FC 2002. [Electronic Edition][Cited 113 times ]
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 ]
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 ]
384.	William Aiello, Yuval Ishai, Omer Reingold, Priced Oblivious Transfer: How to Sell Digital Goods, pp. 119 - 135, EUROCRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 112 times ]
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 ]
386.	Victor Shoup, Using Hash Functions as a Hedge against Chosen Ciphertext Attack, pp. 275 - 288, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 112 times ]
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 ]
388.	Joonsang Baek, Ron Steinfeld, Yuliang Zheng, Formal Proofs for the Security of Signcryption, pp. 80 - 98, PKC 2002. [Electronic Edition][Cited 111 times ]
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 ]
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 ]
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 Archive][Cited 110 times ]
392.	Nicholas J. Hopper, Manuel Blum, Secure Human Identification Protocols, pp. 52 - 66, ASIACRYPT 2001. [Electronic Edition][IACR Online Archive][Cited 110 times ]
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 ]
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 Archive][Cited 109 times ]
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 Archive][Cited 108 times ]
396.	Cynthia Dwork, Andrew Goldberg, Moni Naor, On Memory-Bound Functions for Fighting Spam, pp. 426 - 444, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 108 times ]
397.	Adi Shamir, Yael Tauman, Improved Online/Offline Signature Schemes, pp. 355 - 367, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 108 times ]
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 ]
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 Archive][Cited 107 times ]
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 ]
401.	Phong Q. Nguyen, The Two Faces of Lattices in Cryptology, pp. 313 - 313, SAC 2001. [Electronic Edition][Cited 107 times ]
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 ]
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 ]
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 ]
405.	Michael Luby, Jessica Staddon, Combinatorial Bounds for Broadcast Encryption, pp. 512 - 526, EUROCRYPT 1998. [Electronic Edition][Cited 106 times ]
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 ]
407.	David C. Feldmeier, Philip R. Karn, UNIX Password Security - Ten Years Later, pp. 44 - 63, CRYPTO 1989. [Electronic Edition][Cited 106 times ]
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 ]
409.	Craig Gentry, Practical Identity-Based Encryption Without Random Oracles, pp. 445 - 464, EUROCRYPT 2006. [Electronic Edition][IACR Online Archive][Cited 105 times ]
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 ]
411.	Ronald L. Rivest, All-or-Nothing Encryption and the Package Transform, pp. 210 - 218, FSE 1997. [Electronic Edition][Cited 105 times ]
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 ]
413.	Hans Dobbertin, Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity, pp. 61 - 74, FSE 1994. [Electronic Edition][Cited 105 times ]
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 ]
415.	Ernest F. Brickell, A Survey of Hardware Implementations of RSA (Abstract), pp. 368 - 370, CRYPTO 1989. [Electronic Edition][Cited 105 times ]
416.	Umesh V. Vazirani, Vijay V. Vazirani, Efficient and Secure Pseudo-Random Number Generation, pp. 193 - 202, CRYPTO 1984. [Electronic Edition][Cited 105 times ]
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 ]
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 ]
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 ]
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 ]
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 ]
422.	Amit Sahai, Brent Waters, Fuzzy Identity-Based Encryption, pp. 457 - 473, EUROCRYPT 2005. [Electronic Edition][IACR Online Archive][Cited 103 times ]
423.	Louis Goubin, A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems, pp. 199 - 210, PKC 2003. [Electronic Edition][Cited 103 times ]
424.	Palash Sarkar, Subhamoy Maitra, Nonlinearity Bounds and Constructions of Resilient Boolean Functions, pp. 515 - 532, CRYPTO 2000. [Electronic Edition][IACR Online Archive][Cited 103 times ]
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 ]
426.	Alexandre F. Tenca, Çetin Kaya Koç, A Scalable Architecture for Montgomery Multiplication, pp. 94 - 108, CHES 1999. [Electronic Edition][Cited 103 times ]
427.	Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky, Deniable Encryption, pp. 90 - 104, CRYPTO 1997. [Electronic Edition][Cited 103 times ]
428.	Birgit Pfitzmann, Michael Waidner, Anonymous Fingerprinting, pp. 88 - 102, EUROCRYPT 1997. [Electronic Edition][Cited 103 times ]
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 ]
430.	Ueli M. Maurer, Yacov Yacobi, Non-interactive Public-Key Cryptography, pp. 498 - 507, EUROCRYPT 1991. [Electronic Edition][Cited 103 times ]
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 ]
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 ]
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 ]
434.	Kazue Sako, Joe Kilian, Secure Voting Using Partially Compatible Homomorphisms, pp. 411 - 424, CRYPTO 1994. [Electronic Edition][Cited 102 times ]
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 ]
436.	Tetsu Iwata, Kaoru Kurosawa, OMAC: One-Key CBC MAC, pp. 129 - 153, FSE 2003. [Electronic Edition][IACR Online Archive][Cited 101 times ]
437.	Masayuki Abe, Tatsuaki Okamoto, Provably Secure Partially Blind Signatures, pp. 271 - 286, CRYPTO 2000. [Electronic Edition][IACR Online Archive][Cited 101 times ]
438.	Werner Schindler, A Timing Attack against RSA with the Chinese Remainder Theorem, pp. 109 - 124, CHES 2000. [Electronic Edition][Cited 101 times ]
439.	Stefan Droste, New Results on Visual Cryptography, pp. 401 - 415, CRYPTO 1996. [Electronic Edition][Cited 101 times ]
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 ]
441.	Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encipherment Algorithm FEAL, pp. 267 - 278, EUROCRYPT 1987. [Electronic Edition][Cited 101 times ]
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 ]
443.	Gustavus J. Simmons, How to (Really) Share a Secret, pp. 390 - 448, CRYPTO 1988. [Electronic Edition][Cited 100 times ]
444.	Shimon Even, Oded Goldreich, On the Security of Multi-Party Ping-Pong Protocols, pp. 315 - 315, CRYPTO 1982. [Electronic Edition][Cited 100 times ]
445.	Markus Jakobsson, Ari Juels, Mix and Match: Secure Function Evaluation via Ciphertexts, pp. 162 - 177, ASIACRYPT 2000. [Electronic Edition][Cited 99 times ]
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 ]
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 ]
448.	Kaisa Nyberg, On the Construction of Highly Nonlinear Permutations, pp. 92 - 98, EUROCRYPT 1992. [Electronic Edition][Cited 99 times ]
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 ]
450.	Russell Impagliazzo, Moti Yung, Direct Minimum-Knowledge Computations, pp. 40 - 51, CRYPTO 1987. [Electronic Edition][Cited 99 times ]
451.	Suresh Chari, Josyula R. Rao, Pankaj Rohatgi, Template Attacks, pp. 13 - 28, CHES 2002. [Electronic Edition][Cited 98 times ]
452.	Silvio Micali, Ronald L. Rivest, Micropayments Revisited, pp. 149 - 163, CT-RSA 2002. [Electronic Edition][Cited 98 times ]
453.	Marc Joye, Jean-Jacques Quisquater, Hessian Elliptic Curves and Side-Channel Attacks, pp. 402 - 410, CHES 2001. [Electronic Edition][Cited 98 times ]
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 ]
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 ]
456.	Jacques Stern, A New Identification Scheme Based on Syndrome Decoding, pp. 13 - 21, CRYPTO 1993. [Electronic Edition][Cited 98 times ]
457.	Claude Carlet, Partially-Bent Functions, pp. 280 - 291, CRYPTO 1992. [Electronic Edition][Cited 98 times ]
458.	Oded Goldreich, Hugo Krawczyk, Michael Luby, On the Existence of Pseudorandom Generators, pp. 146 - 162, CRYPTO 1988. [Electronic Edition][Cited 98 times ]
459.	Ran Canetti, Tal Rabin, Universal Composition with Joint State, pp. 265 - 281, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 97 times ]
460.	Dan Boneh, Moni Naor, Timed Commitments, pp. 236 - 254, CRYPTO 2000. [Electronic Edition][IACR Online Archive][Cited 97 times ]
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 ]
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 ]
463.	Frank Thomson Leighton, Silvio Micali, Secret-Key Agreement without Public-Key Cryptography, pp. 456 - 479, CRYPTO 1993. [Electronic Edition][Cited 97 times ]
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 ]
465.	Gildas Avoine, Philippe Oechslin, RFID Traceability: A Multilayer Problem, pp. 125 - 140, FC 2005. [Electronic Edition][Cited 96 times ]
466.	Kaoru Kurosawa, Yvo Desmedt, A New Paradigm of Hybrid Encryption Scheme, pp. 426 - 442, CRYPTO 2004. [Electronic Edition][IACR Online Archive][Cited 96 times ]
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 Archive][Cited 96 times ]
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 ]
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 ]
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 ]
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 ]
472.	Arjen K. Lenstra, Mark S. Manasse, Factoring by Electronic Mail, pp. 355 - 371, EUROCRYPT 1989. [Electronic Edition][Cited 96 times ]
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 ]
474.	Hugo Krawczyk, HMQV: A High-Performance Secure Diffie-Hellman Protocol, pp. 546 - 566, CRYPTO 2005. [Electronic Edition][IACR Online Archive][Cited 95 times ]
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 ]
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 Archive][Cited 94 times ]
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 ]
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 Archive][Cited 94 times ]
479.	Cynthia Dwork, Kobbi Nissim, Privacy-Preserving Datamining on Vertically Partitioned Databases, pp. 528 - 544, CRYPTO 2004. [Electronic Edition][IACR Online Archive][Cited 94 times ]
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 Archive][Cited 94 times ]
481.	Peter L. Montgomery, A Block Lanczos Algorithm for Finding Dependencies Over GF(2), pp. 106 - 120, EUROCRYPT 1995. [Electronic Edition][Cited 94 times ]
482.	Dan Boneh, Richard J. Lipton, Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract), pp. 424 - 437, CRYPTO 1995. [Electronic Edition][Cited 94 times ]
483.	Rosario Gennaro, Yehuda Lindell, A Framework for Password-Based Authenticated Key Exchange, pp. 524 - 543, EUROCRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 93 times ]
484.	Jens Groth, A Verifiable Secret Shuffle of Homomorphic Encryptions, pp. 145 - 160, PKC 2003. [Electronic Edition][Cited 93 times ]
485.	Ron Steinfeld, Laurence Bull, Huaxiong Wang, Josef Pieprzyk, Universal Designated-Verifier Signatures, pp. 523 - 542, ASIACRYPT 2003. [Electronic Edition][IACR Online Archive][Cited 93 times ]
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 ]
487.	Palash Sarkar, Subhamoy Maitra, Construction of Nonlinear Boolean Functions with Important Cryptographic Properties, pp. 485 - 506, EUROCRYPT 2000. [Electronic Edition][IACR Online Archive][Cited 93 times ]
488.	Burton S. Kaliski Jr., The MD4 Message Digest Algorithm (Abstract), pp. 492 - 492, EUROCRYPT 1990. [Electronic Edition][Cited 93 times ]
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 ]
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 ]
491.	Arjen K. Lenstra, Mark S. Manasse, Factoring With Two Large Primes, pp. 72 - 82, EUROCRYPT 1990. [Electronic Edition][Cited 91 times ]
492.	Donald Beaver, Shafi Goldwasser, Multiparty Computation with Faulty Majority, pp. 589 - 590, CRYPTO 1989. [Electronic Edition][Cited 91 times ]
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 ]
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 ]
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 ]
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 ]
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 ]
498.	Moses Liskov, Ronald L. Rivest, David Wagner, Tweakable Block Ciphers, pp. 31 - 46, CRYPTO 2002. [Electronic Edition][IACR Online Archive][Cited 90 times ]
499.	Louis Granboulan, Phong Q. Nguyen, Fabrice Noilhan, Serge Vaudenay, DFCv2, pp. 57 - 71, SAC 2000. [Electronic Edition][Cited 90 times ]
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 ]
501.	Burton S. Kaliski Jr., Matthew J. B. Robshaw, Linear Cryptanalysis Using Multiple Approximations, pp. 26 - 39, CRYPTO 1994. [Electronic Edition][Cited 90 times ]
502.	Patrik Ekdahl, Thomas Johansson, A New Version of the Stream Cipher SNOW, pp. 47 - 61, SAC 2002. [Electronic Edition][Cited 89 times ]
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 ]
504.	Dan Boneh, Ramarathnam Venkatesan, Breaking RSA May Not Be Equivalent to Factoring, pp. 59 - 71, EUROCRYPT 1998. [Electronic Edition][Cited 89 times ]
505.	Shai Halevi, Phillip Rogaway, A Tweakable Enciphering Mode, pp. 482 - 499, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 88 times ]
506.	Jovan Dj. Golic, Christophe Tymen, Multiplicative Masking and Power Analysis of AES, pp. 198 - 212, CHES 2002. [Electronic Edition][Cited 88 times ]
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 ]
508.	Colin Boyd, Ernest Foo, Off-Line Fair Payment Protocols Using Convertible Signatures, pp. 271 - 285, ASIACRYPT 1998. [Electronic Edition][Cited 88 times ]
509.	Michael J. Wiener, Robert J. Zuccherato, Faster Attacks on Elliptic Curve Cryptosystems, pp. 190 - 200, SAC 1998. [Electronic Edition][Cited 88 times ]
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 ]
511.	Stefan Brands, Restrictive Blinding of Secret-Key Certificates, pp. 231 - 247, EUROCRYPT 1995. [Electronic Edition][Cited 88 times ]
512.	Kazuo Ohta, Tatsuaki Okamoto, A Modification of the Fiat-Shamir Scheme, pp. 232 - 243, CRYPTO 1988. [Electronic Edition][Cited 88 times ]
513.	Philippe Oechslin, Making a Faster Cryptanalytic Time-Memory Trade-Off, pp. 617 - 630, CRYPTO 2003. [Electronic Edition][IACR Online Archive][Cited 87 times ]
514.	Pawel Chodowiec, Kris Gaj, Very Compact FPGA Implementation of the AES Algorithm, pp. 319 - 333, CHES 2003. [Electronic Edition][Cited 87 times ]
515.	Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup, Secure and Efficient Asynchronous Broadcast Protocols, pp. 524 - 541, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 87 times ]
516.	Itsik Mantin, Adi Shamir, A Practical Attack on Broadcast RC4, pp. 152 - 164, FSE 2001. [Electronic Edition]