Cryptographers' World
 

Highly Cited Journal Papers

 
1.   Ronald L. Rivest,  Adi Shamir,  Leonard M. Adleman,  A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Volume 21(2), pp. 120 - 126, Association for Computing Machinery, 1978.

[Cited 7536 times Red StarRed StarRed StarRed StarRed StarRed Star]
2.   Whitfield Diffie,  Martin E. Hellman,  New Directions in Cryptography, IEEE Transactions on Information Theory, Volume 22(6), pp. 644 - 654, IEEE Information Theory Society, 1976.

[Cited 6147 times Red StarRed StarRed StarRed StarRed StarRed Star]
3.   Adi Shamir,  How to Share a Secret, Communications of the ACM, Volume 22(11), pp. 612 - 613, Association for Computing Machinery, 1979.

[Cited 3672 times Red StarRed StarRed StarRed StarRed StarRed Star]
4.   David Chaum,  Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, Volume 24(2), pp. 84 - 90, Association for Computing Machinery, 1981.

[Cited 2248 times Red StarRed StarRed StarRed StarRed Star]
5.   Shafi Goldwasser,  Silvio Micali,  Probabilistic Encryption, Journal of Computer and System Sciences, Volume 28(2), pp. 270 - 299, Elsevier, 1984.

[Cited 1733 times Red StarRed StarRed StarRed StarRed Star]
6.   Arjen K. Lenstra,  Hendrik W. Lenstra,  LászlĂł Lovász,  Factoring Polynomials with Rational Coefficients, Mathematische Annalen, Volume 261(4), pp. 515 - 534, Springer, 1982.

[Cited 1505 times Red StarRed StarRed StarRed StarRed Star]
7.   Shafi Goldwasser,  Silvio Micali,  Ronald L. Rivest,  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM Journal on Computing, Volume 17(2), pp. 281 - 308, Society for Industrial and Applied Mathematics, 1988.

[Cited 1392 times Red StarRed StarRed StarRed StarRed Star]
8.   Claus-Peter Schnorr,  Efficient Signature Generation by Smart Cards, Journal of Cryptology, Volume 4(3), pp. 161 - 174, Springer, 1991.

[Cited 1212 times Red StarRed StarRed StarRed StarRed Star]
9.   Dan Boneh,  Ben Lynn,  Hovav Shacham,  Short Signatures from the Weil Pairing, Journal of Cryptology, Volume 17(4), pp. 297 - 319, Springer, 2004.

[Cited 960 times Red StarRed StarRed StarRed Star]
10.   Yehuda Lindell,  Benny Pinkas,  Privacy Preserving Data Mining, Journal of Cryptology, Volume 15(3), pp. 177 - 206, Springer, 2002.

[Cited 946 times Red StarRed StarRed StarRed Star]
11.   Eli Biham,  Adi Shamir,  Differential Cryptanalysis of DES-like Cryptosystems, Journal of Cryptology, Volume 4(1), pp. 3 - 72, Springer, 1991.

[Cited 927 times Red StarRed StarRed StarRed Star]
12.   Oded Goldreich,  Shafi Goldwasser,  Silvio Micali,  How to Construct Random Functions, Journal of the ACM, Volume 33(4), pp. 792 - 807, Association for Computing Machinery, 1986.

[Cited 916 times Red StarRed StarRed StarRed Star]
13.   Uriel Feige,  Amos Fiat,  Adi Shamir,  Zero-Knowledge Proofs of Identity, Journal of Cryptology, Volume 1(2), pp. 77 - 94, Springer, 1988.

[Cited 694 times Red StarRed StarRed StarRed Star]
14.   Whitfield Diffie,  Paul C. van Oorschot,  Michael J. Wiener,  Authentication and Authenticated Key Exchanges, Designs, Codes and Cryptography, Volume 2(2), pp. 107 - 125, Springer, 1992.

[Electronic Edition][Cited 693 times Red StarRed StarRed StarRed Star]
15.   David Chaum,  The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability, Journal of Cryptology, Volume 1(1), pp. 65 - 75, Springer, 1988.

[Cited 680 times Red StarRed StarRed StarRed Star]
16.   Shimon Even,  Oded Goldreich,  Abraham Lempel,  A Randomized Protocol for Signing Contracts, Communications of the ACM, Volume 28(6), pp. 637 - 647, Association for Computing Machinery, 1985.

[Cited 635 times Red StarRed StarRed StarRed Star]
17.   David Pointcheval,  Jacques Stern,  Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, Volume 13(3), pp. 361 - 396, Springer, 2000.

[Cited 594 times Red StarRed StarRed StarRed Star]
18.   Arjen K. Lenstra,  Eric R. Verheul,  Selecting Cryptographic Key Sizes, Journal of Cryptology, Volume 14(4), pp. 255 - 293, Springer, 2001.

[Cited 586 times Red StarRed StarRed StarRed Star]
19.   Arjen K. Lenstra,  Integer Factoring, Designs, Codes and Cryptography, Volume 19(2), pp. 101 - 128, Springer, 2000.

[Electronic Edition][Cited 569 times Red StarRed StarRed StarRed Star]
20.   Charles H. Bennett,  François Bessette,  Gilles Brassard,  Louis Salvail,  John A. Smolin,  Experimental Quantum Cryptography, Journal of Cryptology, Volume 5(1), pp. 3 - 28, Springer, 1992.

[Cited 569 times Red StarRed StarRed StarRed Star]
21.   Oded Goldreich,  Silvio Micali,  Avi Wigderson,  Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, Volume 38(3), pp. 690 - 728, Association for Computing Machinery, 1991.

[Cited 528 times Red StarRed StarRed StarRed Star]
22.   Antoine Joux,  A One Round Protocol for Tripartite Diffie-Hellman, Journal of Cryptology, Volume 17(4), pp. 263 - 276, Springer, 2004.

[Cited 524 times Red StarRed StarRed StarRed Star]
23.   Mihir Bellare,  Joe Kilian,  Phillip Rogaway,  Security of the Cipher Block Chaining Message Authentication Code , Journal of Computer and System Sciences, Volume 61(3), pp. 362 - 399, Elsevier, 2000.

[Cited 453 times Red StarRed StarRed Star]
24.   Ran Canetti,  Security and Composition of Multiparty Cryptographic Protocols, Journal of Cryptology, Volume 13(1), pp. 143 - 202, Springer, 2000.

[Cited 407 times Red StarRed StarRed Star]
25.   Ueli M. Maurer,  Secret Key Agreement by Public Discussion from Common Information, IEEE Transactions on Information Theory, Volume 39(3), pp. 733 - 742, IEEE Information Theory Society, 1993.

[Cited 398 times Red StarRed StarRed Star]
26.   MartĂ­n Abadi,  Phillip Rogaway,  Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption), Journal of Cryptology, Volume 15(2), pp. 103 - 127, Springer, 2002.

[Cited 389 times Red StarRed StarRed Star]
27.   Alfred Menezes,  Scott A. Vanstone,  Elliptic Curve Cryptosystems and Their Implementations, Journal of Cryptology, Volume 6(4), pp. 209 - 224, Springer, 1993.

[Cited 364 times Red StarRed StarRed Star]
28.   Willi Meier,  Othmar Staffelbach,  Fast Correlation Attacks on Certain Stream Ciphers, Journal of Cryptology, Volume 1(3), pp. 159 - 176, Springer, 1989.

[Cited 345 times Red StarRed StarRed Star]
29.   Stuart Haber,  W. Scott Stornetta,  How to Time-Stamp a Digital Document, Journal of Cryptology, Volume 3(2), pp. 99 - 111, Springer, 1991.

[Cited 339 times Red StarRed StarRed Star]
30.   Moni Naor,  Bit Commitment Using Pseudorandomness, Journal of Cryptology, Volume 4(2), pp. 151 - 158, Springer, 1991.

[Cited 330 times Red StarRed StarRed Star]
31.   Neal Koblitz,  Hyperelliptic Cryptosystems, Journal of Cryptology, Volume 1(3), pp. 139 - 150, Springer, 1989.

[Cited 319 times Red StarRed StarRed Star]
32.   Kaisa Nyberg,  Rainer A. Rueppel,  Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem, Designs, Codes and Cryptography, Volume 7(1), pp. 61 - 81, Springer, 1996.

[Electronic Edition][Cited 300 times Red StarRed StarRed Star]
33.   Victor Shoup,  OAEP Reconsidered, Journal of Cryptology, Volume 15(4), pp. 223 - 249, Springer, 2002.

[Cited 282 times Red StarRed StarRed Star]
34.   Paul C. van Oorschot,  Michael J. Wiener,  Parallel Collision Search with Cryptanalytic Applications, Journal of Cryptology, Volume 12(1), pp. 1 - 28, Springer, 1999.

[Cited 279 times Red StarRed StarRed Star]
35.   Mihir Bellare,  Chanathip Namprempre,  Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm, Journal of Cryptology, Volume 21(4), pp. 469 - 491, Springer, 2008.

[Cited 278 times Red StarRed StarRed Star]
36.   Rosario Gennaro,  Stanislaw Jarecki,  Hugo Krawczyk,  Tal Rabin,  Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Journal of Cryptology, Volume 20(1), pp. 51 - 83, Springer, 2007.

[Cited 246 times Red StarRed Star]
37.   Eli Biham,  New Types of Cryptanalytic Attacks Using Related Keys, Journal of Cryptology, Volume 7(4), pp. 229 - 246, Springer, 1994.

[Cited 245 times Red StarRed Star]
38.   Don Coppersmith,  Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities, Journal of Cryptology, Volume 10(4), pp. 233 - 260, Springer, 1997.

[Cited 234 times Red StarRed Star]
39.   Richard A. Kemmerer,  Catherine Meadows,  Jonathan K. Millen,  Three Systems for Cryptographic Protocol Analysis, Journal of Cryptology, Volume 7(2), pp. 79 - 130, Springer, 1994.

[Cited 234 times Red StarRed Star]
40.   Ran Canetti,  Shai Halevi,  Jonathan Katz,  A Forward-Secure Public-Key Encryption Scheme, Journal of Cryptology, Volume 20(3), pp. 265 - 294, Springer, 2007.

[Cited 225 times Red StarRed Star]
41.   Hans Dobbertin,  Cryptanalysis of MD4, Journal of Cryptology, Volume 11(4), pp. 253 - 271, Springer, 1998.

[Cited 224 times Red StarRed Star]
42.   Adi Shamir,  A Polynomial-Time Algorithm for Breaking the Basic Merkle - Hellman Cryptosystem, IEEE Transactions on Information Theory, Volume 30(5), pp. 699 - 704, IEEE Information Theory Society, 1984.

[Cited 223 times Red StarRed Star]
43.   Werner Alexi,  Benny Chor,  Oded Goldreich,  Claus-Peter Schnorr,  RSA and Rabin Functions: Certain Parts are as Hard as the Whole, SIAM Journal on Computing, Volume 17(2), pp. 194 - 209, Society for Industrial and Applied Mathematics, 1988.

[Cited 218 times Red StarRed Star]
44.   Moni Naor,  Omer Reingold,  On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited, Journal of Cryptology, Volume 12(1), pp. 29 - 66, Springer, 1999.

[Cited 213 times Red StarRed Star]
45.   Eiichiro Fujisaki,  Tatsuaki Okamoto,  David Pointcheval,  Jacques Stern,  RSA-OAEP Is Secure under the RSA Assumption, Journal of Cryptology, Volume 17(2), pp. 81 - 104, Springer, 2004.

[Cited 212 times Red StarRed Star]
46.   Jerome A. Solinas,  Efficient Arithmetic on Koblitz Curves, Designs, Codes and Cryptography, Volume 19(2), pp. 195 - 249, Springer, 2000.

[Electronic Edition][Cited 206 times Red StarRed Star]
47.   Donald Beaver,  Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority, Journal of Cryptology, Volume 4(2), pp. 75 - 122, Springer, 1991.

[Cited 206 times Red StarRed Star]
48.   Shimon Even,  Oded Goldreich,  Silvio Micali,  On-Line/Off-Line Digital Signatures, Journal of Cryptology, Volume 9(1), pp. 35 - 67, Springer, 1996.

[Cited 205 times Red StarRed Star]
49.   Joan Boyar,  Carsten Lund,  RenĂ© Peralta,  On the Communication Complexity of Zero-Knowledge Proofs, Journal of Cryptology, Volume 6(2), pp. 65 - 85, Springer, 1993.

[Cited 204 times Red StarRed Star]
50.   Pierrick Gaudry,  Florian Hess,  Nigel P. Smart,  Constructive and Destructive Facets of Weil Descent on Elliptic Curves, Journal of Cryptology, Volume 15(1), pp. 19 - 46, Springer, 2002.

[Cited 203 times Red StarRed Star]
51.   Nigel P. Smart,  The Discrete Logarithm Problem on Elliptic Curves of Trace One, Journal of Cryptology, Volume 12(3), pp. 193 - 196, Springer, 1999.

[Cited 203 times Red StarRed Star]
52.   Oded Goldreich,  Yair Oren,  Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, Volume 7(1), pp. 1 - 32, Springer, 1994.

[Cited 202 times Red StarRed Star]
53.   Neal Koblitz,  Alfred Menezes,  Scott A. Vanstone,  The State of Elliptic Curve Cryptography, Designs, Codes and Cryptography, Volume 19(2), pp. 173 - 193, Springer, 2000.

[Electronic Edition][Cited 201 times Red StarRed Star]
54.   Martin Tompa,  Heather Woll,  How to Share a Secret with Cheaters, Journal of Cryptology, Volume 1(2), pp. 133 - 138, Springer, 1988.

[Cited 199 times Red StarRed Star]
55.   Douglas R. Stinson,  An Explication of Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 2(4), pp. 357 - 390, Springer, 1992.

[Electronic Edition][Cited 196 times Red StarRed Star]
56.   Antoine Joux,  Kim Nguyen,  Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups, Journal of Cryptology, Volume 16(4), pp. 239 - 247, Springer, 2003.

[Cited 186 times Red StarRed Star]
57.   Rosario Gennaro,  Tal Rabin,  Stanislaw Jarecki,  Hugo Krawczyk,  Robust and Efficient Sharing of RSA Functions, Journal of Cryptology, Volume 20(3), pp. 393 - 0, Springer, 2007.

[Cited 185 times Red StarRed Star]
58.   Rosario Gennaro,  Tal Rabin,  Stanislaw Jarecki,  Hugo Krawczyk,  Robust and Efficient Sharing of RSA Functions, Journal of Cryptology, Volume 13(2), pp. 273 - 300, Springer, 2000.

[Cited 185 times Red StarRed Star]
59.   Paulo S. L. M. Barreto,  Steven D. Galbraith,  Colm O'Eigeartaigh,  Michael Scott,  Efficient pairing computation on supersingular Abelian varieties, Designs, Codes and Cryptography, Volume 42(3), pp. 239 - 271, Springer, 2007.

[Electronic Edition][Cited 170 times Red StarRed Star]
60.   Laurie Law,  Alfred Menezes,  Minghua Qu,  Jerome A. Solinas,  Scott A. Vanstone,  An Efficient Protocol for Authenticated Key Agreement, Designs, Codes and Cryptography, Volume 28(2), pp. 119 - 134, Springer, 2003.

[Electronic Edition][Cited 168 times Red StarRed Star]
61.   Renato M. Capocelli,  Alfredo De Santis,  Luisa Gargano,  Ugo Vaccaro,  On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, Volume 6(3), pp. 157 - 167, Springer, 1993.

[Cited 164 times Red StarRed Star]
62.   Jonathan Katz,  Moti Yung,  Scalable Protocols for Authenticated Group Key Exchange, Journal of Cryptology, Volume 20(1), pp. 85 - 113, Springer, 2007.

[Cited 162 times Red StarRed Star]
63.   Christian Cachin,  Klaus Kursawe,  Victor Shoup,  Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography, Journal of Cryptology, Volume 18(3), pp. 219 - 246, Springer, 2005.

[Cited 162 times Red StarRed Star]
64.   Douglas R. Stinson,  Universal Hashing and Authentication Codes, Designs, Codes and Cryptography, Volume 4(4), pp. 369 - 380, Springer, 1994.

[Electronic Edition][Cited 160 times Red StarRed Star]
65.   Victor Shoup,  Rosario Gennaro,  Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Journal of Cryptology, Volume 15(2), pp. 75 - 96, Springer, 2002.

[Cited 157 times Red StarRed Star]
66.   Eli Biham,  Alex Biryukov,  Adi Shamir,  Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials, Journal of Cryptology, Volume 18(4), pp. 291 - 311, Springer, 2005.

[Cited 156 times Red StarRed Star]
67.   Charanjit S. Jutla,  Encryption Modes with Almost Free Message Integrity, Journal of Cryptology, Volume 21(4), pp. 547 - 578, Springer, 2008.

[Cited 154 times Red StarRed Star]
68.   Ueli M. Maurer,  A Universal Statistical Test for Random Bit Generators, Journal of Cryptology, Volume 5(2), pp. 89 - 105, Springer, 1992.

[Cited 154 times Red StarRed Star]
69.   Phillip Rogaway,  Don Coppersmith,  A Software-Optimized Encryption Algorithm, Journal of Cryptology, Volume 11(4), pp. 273 - 287, Springer, 1998.

[Cited 151 times Red StarRed Star]
70.   Oded Goldreich,  Ariel Kahan,  How to Construct Constant-Round Zero-Knowledge Proof Systems for NP, Journal of Cryptology, Volume 9(3), pp. 167 - 190, Springer, 1996.

[Cited 149 times Red StarRed Star]
71.   Ernest F. Brickell,  Daniel M. Davenport,  On the Classification of Ideal Secret Sharing Schemes, Journal of Cryptology, Volume 4(2), pp. 123 - 134, Springer, 1991.

[Cited 148 times Red StarRed Star]
72.   Russell Impagliazzo,  Moni Naor,  Efficient Cryptographic Schemes Provably as Secure as Subset Sum, Journal of Cryptology, Volume 9(4), pp. 199 - 216, Springer, 1996.

[Cited 145 times Red StarRed Star]
73.   Eric R. Verheul,  Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems, Journal of Cryptology, Volume 17(4), pp. 277 - 296, Springer, 2004.

[Cited 143 times Red StarRed Star]
74.   Johannes Buchmann,  Hugh C. Williams,  A Key-Exchange System Based on Imaginary Quadratic Fields, Journal of Cryptology, Volume 1(2), pp. 107 - 118, Springer, 1988.

[Cited 135 times Red StarRed Star]
75.   R. Balasubramanian,  Neal Koblitz,  The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes - Okamoto - Vanstone Algorithm, Journal of Cryptology, Volume 11(2), pp. 141 - 145, Springer, 1998.

[Cited 132 times Red StarRed Star]
76.   Victor S. Miller,  The Weil Pairing, and Its Efficient Calculation, Journal of Cryptology, Volume 17(4), pp. 235 - 261, Springer, 2004.

[Cited 129 times Red StarRed Star]
77.   Claude Carlet,  Pascale Charpin,  Victor Zinoviev,  Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems, Designs, Codes and Cryptography, Volume 15(2), pp. 125 - 156, Springer, 1998.

[Electronic Edition][Cited 129 times Red StarRed Star]
78.   Gordon B. Agnew,  Ronald C. Mullin,  I. M. Onyszchuk,  Scott A. Vanstone,  An Implementation for a Fast Public-Key Cryptosystem, Journal of Cryptology, Volume 3(2), pp. 63 - 79, Springer, 1991.

[Cited 127 times Red StarRed Star]
79.   Kevin S. McCurley,  A Key Distribution System Equivalent to Factoring, Journal of Cryptology, Volume 1(2), pp. 95 - 105, Springer, 1988.

[Cited 126 times Red StarRed Star]
80.   Dan Boneh,  Richard A. DeMillo,  Richard J. Lipton,  On the Importance of Eliminating Errors in Cryptographic Computations, Journal of Cryptology, Volume 14(2), pp. 101 - 119, Springer, 2001.

[Cited 125 times Red StarRed Star]
81.   Elad Barkan,  Eli Biham,  Nathan Keller,  Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication, Journal of Cryptology, Volume 21(3), pp. 392 - 429, Springer, 2008.

[Cited 122 times Red StarRed Star]
82.   Eric R. Verheul,  Henk C. A. van Tilborg,  Constructions and Properties of k out of n Visual Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 11(2), pp. 179 - 196, Springer, 1997.

[Electronic Edition][Cited 122 times Red StarRed Star]
83.   MartĂ­n Abadi,  Joan Feigenbaum,  Secure Circuit Evaluation, Journal of Cryptology, Volume 2(1), pp. 1 - 12, Springer, 1990.

[Cited 121 times Red StarRed Star]
84.   Eli Biham,  Michel Boyer,  P. Oscar Boykin,  Tal Mor,  Vwani P. Roychowdhury,  A Proof of the Security of Quantum Key Distribution, Journal of Cryptology, Volume 19(4), pp. 381 - 439, Springer, 2006.

[Cited 119 times Red StarRed Star]
85.   Oded Goldreich,  Yehuda Lindell,  Session-Key Generation Using Human Passwords Only, Journal of Cryptology, Volume 19(3), pp. 241 - 340, Springer, 2006.

[Cited 118 times Red StarRed Star]
86.   Andrew M. Odlyzko,  Discrete Logarithms: The Past and the Future, Designs, Codes and Cryptography, Volume 19(2), pp. 129 - 145, Springer, 2000.

[Electronic Edition][Cited 118 times Red StarRed Star]
87.   Douglas R. Stinson,  On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption, Designs, Codes and Cryptography, Volume 12(3), pp. 215 - 243, Springer, 1997.

[Electronic Edition][Cited 118 times Red StarRed Star]
88.   Daniel V. Bailey,  Christof Paar,  Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography, Journal of Cryptology, Volume 14(3), pp. 153 - 176, Springer, 2001.

[Cited 117 times Red StarRed Star]
89.   Amos Fiat,  Tamir Tassa,  Dynamic Traitor Tracing, Journal of Cryptology, Volume 14(3), pp. 211 - 223, Springer, 2001.

[Cited 116 times Red StarRed Star]
90.   Kathleen A. S. Quinn,  Bounds for Key Distribution Patterns, Journal of Cryptology, Volume 12(4), pp. 227 - 239, Springer, 1999.

[Cited 115 times Red StarRed Star]
91.   Oded Goldreich,  A Uniform-Complexity Treatment of Encryption and Zero-Knowledge, Journal of Cryptology, Volume 6(1), pp. 21 - 53, Springer, 1993.

[Cited 115 times Red StarRed Star]
92.   Ernest F. Brickell,  Kevin S. McCurley,  An Interactive Identification Scheme Based on Discrete Logarithms and Factoring, Journal of Cryptology, Volume 5(1), pp. 29 - 39, Springer, 1992.

[Cited 115 times Red StarRed Star]
93.   Rosario Gennaro,  Tal Rabin,  Hugo Krawczyk,  RSA-Based Undeniable Signatures, Journal of Cryptology, Volume 20(3), pp. 394 - 0, Springer, 2007.

[Cited 114 times Red StarRed Star]
94.   Rosario Gennaro,  Tal Rabin,  Hugo Krawczyk,  RSA-Based Undeniable Signatures, Journal of Cryptology, Volume 13(4), pp. 397 - 416, Springer, 2000.

[Cited 114 times Red StarRed Star]
95.   Ernest F. Brickell,  Douglas R. Stinson,  Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, Journal of Cryptology, Volume 5(3), pp. 153 - 166, Springer, 1992.

[Cited 114 times Red StarRed Star]
96.   Joonsang Baek,  Ron Steinfeld,  Yuliang Zheng,  Formal Proofs for the Security of Signcryption, Journal of Cryptology, Volume 20(2), pp. 203 - 235, Springer, 2007.

[Cited 111 times Red StarRed Star]
97.   Brian A. LaMacchia,  Andrew M. Odlyzko,  Computation of Discrete Logarithms in Prime Fields, Designs, Codes and Cryptography, Volume 1(1), pp. 47 - 62, Springer, 1991.

[Electronic Edition][Cited 109 times Red StarRed Star]
98.   Martin Hirt,  Ueli M. Maurer,  Player Simulation and General Adversary Structures in Perfect Multiparty Computation, Journal of Cryptology, Volume 13(1), pp. 31 - 60, Springer, 2000.

[Cited 107 times Red StarRed Star]
99.   Ivan Damgard,  Practical and Provably Secure Release of a Secret and Exchange of Signatures, Journal of Cryptology, Volume 8(4), pp. 201 - 222, Springer, 1995.

[Cited 103 times Red StarRed Star]
100.   Carlisle M. Adams,  Constructing Symmetric Ciphers Using the CAST Design Procedure, Designs, Codes and Cryptography, Volume 12(3), pp. 283 - 316, Springer, 1997.

[Electronic Edition][Cited 102 times Red StarRed Star]
101.   Marc Joye,  Arjen K. Lenstra,  Jean-Jacques Quisquater,  Chinese Remaindering Based Cryptosystems in the Presence of Faults, Journal of Cryptology, Volume 12(4), pp. 241 - 245, Springer, 1999.

[Cited 101 times Red StarRed Star]
102.   Kaisa Nyberg,  Lars R. Knudsen,  Provable Security Against a Differential Attack, Journal of Cryptology, Volume 8(1), pp. 27 - 37, Springer, 1995.

[Cited 101 times Red StarRed Star]
103.   Douglas R. Stinson,  The Combinatorics of Authentication and Secrecy Codes, Journal of Cryptology, Volume 2(1), pp. 23 - 49, Springer, 1990.

[Cited 101 times Red StarRed Star]
104.   Phong Q. Nguyen,  Igor Shparlinski,  The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces, Designs, Codes and Cryptography, Volume 30(2), pp. 201 - 217, Springer, 2003.

[Electronic Edition][Cited 100 times Red StarRed Star]
105.   Claude Carlet,  Partially-Bent Functions, Designs, Codes and Cryptography, Volume 3(2), pp. 135 - 145, Springer, 1993.

[Electronic Edition][Cited 98 times Red Star]
106.   Phong Q. Nguyen,  Igor Shparlinski,  The Insecurity of the Digital Signature Algorithm with Partially Known Nonces, Journal of Cryptology, Volume 15(3), pp. 151 - 176, Springer, 2002.

[Cited 97 times Red Star]
107.   Carlo Blundo,  Alfredo De Santis,  Douglas R. Stinson,  Ugo Vaccaro,  Graph Decompositions and Secret Sharing Schemes, Journal of Cryptology, Volume 8(1), pp. 39 - 64, Springer, 1995.

[Cited 96 times Red Star]
108.   Ueli M. Maurer,  Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher, Journal of Cryptology, Volume 5(1), pp. 53 - 66, Springer, 1992.

[Cited 94 times Red Star]
109.   Andrew Klapper,  Mark Goresky,  Feedback Shift Registers, 2-Adic Span, and Combiners with Memory, Journal of Cryptology, Volume 10(2), pp. 111 - 147, Springer, 1997.

[Cited 92 times Red Star]
110.   Ralph C. Merkle,  A Fast Software One-Way Hash Function, Journal of Cryptology, Volume 3(1), pp. 43 - 58, Springer, 1990.

[Cited 91 times Red Star]
111.   Neal Koblitz,  Alfred Menezes,  Another Look at "Provable Security", Journal of Cryptology, Volume 20(1), pp. 3 - 37, Springer, 2007.

[Cited 90 times Red Star]
112.   Carlo Blundo,  Alfredo De Santis,  Douglas R. Stinson,  On the Contrast in Visual Cryptography Schemes, Journal of Cryptology, Volume 12(4), pp. 261 - 289, Springer, 1999.

[Cited 90 times Red Star]
113.   Jonathan Katz,  Moti Yung,  Characterization of Security Notions for Probabilistic Private-Key Encryption, Journal of Cryptology, Volume 19(1), pp. 67 - 95, Springer, 2006.

[Cited 89 times Red Star]
114.   Jovan Dj. Golic,  Miodrag J. Mihaljevic,  A Generalized Correlation Attack on a Class of Stream Ciphers Based on the Levenshtein Distance, Journal of Cryptology, Volume 3(3), pp. 201 - 212, Springer, 1991.

[Cited 88 times Red Star]
115.   Antoine Joux,  Jacques Stern,  Lattice Reduction: A Toolbox for the Cryptanalyst, Journal of Cryptology, Volume 11(3), pp. 161 - 185, Springer, 1998.

[Cited 86 times Red Star]
116.   Cynthia Dwork,  Moni Naor,  An Efficient Existentially Unforgeable Signature Scheme and Its Applications, Journal of Cryptology, Volume 11(3), pp. 187 - 208, Springer, 1998.

[Cited 86 times Red Star]
117.   Willi Meier,  Othmar Staffelbach,  Correlation Properties of Combiners with Memory in Stream Ciphers, Journal of Cryptology, Volume 5(1), pp. 67 - 86, Springer, 1992.

[Cited 86 times Red Star]
118.   Phillip Rogaway,  Bucket Hashing and Its Application to Fast Message Authentication, Journal of Cryptology, Volume 12(2), pp. 91 - 115, Springer, 1999.

[Cited 85 times Red Star]
119.   Volker MĂĽller,  Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two, Journal of Cryptology, Volume 11(4), pp. 219 - 234, Springer, 1998.

[Cited 85 times Red Star]
120.   Erez Petrank,  Charles Rackoff,  CBC MAC for Real-Time Data Sources, Journal of Cryptology, Volume 13(3), pp. 315 - 338, Springer, 2000.

[Cited 84 times Red Star]
121.   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, Journal of Cryptology, Volume 21(3), pp. 350 - 391, Springer, 2008.

[Cited 83 times Red Star]
122.   Hoi-Kwong Lo,  H. F. Chau,  M. Ardehali,  Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security, Journal of Cryptology, Volume 18(2), pp. 133 - 165, Springer, 2005.

[Cited 82 times Red Star]
123.   John Black,  Phillip Rogaway,  CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions, Journal of Cryptology, Volume 18(2), pp. 111 - 131, Springer, 2005.

[Cited 81 times Red Star]
124.   Friederike Brezing,  Annegret Weng,  Elliptic Curves Suitable for Pairing Based Cryptography, Designs, Codes and Cryptography, Volume 37(1), pp. 133 - 141, Springer, 2005.

[Electronic Edition][Cited 81 times Red Star]
125.   Ueli M. Maurer,  Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters, Journal of Cryptology, Volume 8(3), pp. 123 - 155, Springer, 1995.

[Cited 81 times Red Star]
126.   Moni Naor,  Rafail Ostrovsky,  Ramarathnam Venkatesan,  Moti Yung,  Perfect Zero-Knowledge Arguments for , Journal of Cryptology, Volume 11(2), pp. 87 - 108, Springer, 1998.

[Cited 80 times Red Star]
127.   Ran Canetti,  Eyal Kushilevitz,  Yehuda Lindell,  On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions, Journal of Cryptology, Volume 19(2), pp. 135 - 167, Springer, 2006.

[Cited 79 times Red Star]
128.   Li Gong,  D. J. Wheeler,  A Matrix Key-Distribution Scheme, Journal of Cryptology, Volume 2(1), pp. 51 - 59, Springer, 1990.

[Cited 79 times Red Star]
129.   Mihir Bellare,  Chanathip Namprempre,  David Pointcheval,  Michael Semanko,  The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme, Journal of Cryptology, Volume 16(3), pp. 185 - 215, Springer, 2003.

[Cited 78 times Red Star]
130.   Nick Howgrave-Graham,  Nigel P. Smart,  Lattice Attacks on Digital Signature Schemes, Designs, Codes and Cryptography, Volume 23(3), pp. 283 - 290, Springer, 2001.

[Electronic Edition][Cited 78 times Red Star]
131.   Joan Boyar,  S. A. Kurtz,  Mark W. Krentel,  A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs, Journal of Cryptology, Volume 2(2), pp. 63 - 76, Springer, 1990.

[Cited 78 times Red Star]
132.   Douglas R. Stinson,  Tran van Trung,  Some New Results on Key Distribution Patterns and Broadcast Encryption, Designs, Codes and Cryptography, Volume 14(3), pp. 261 - 279, Springer, 1998.

[Electronic Edition][Cited 77 times Red Star]
133.   Masayuki Abe,  Rosario Gennaro,  Kaoru Kurosawa,  Tag-KEM/DEM: A New Framework for Hybrid Encryption, Journal of Cryptology, Volume 21(1), pp. 97 - 130, Springer, 2008.

[Cited 76 times Red Star]
134.   Matthew K. Franklin,  Rebecca N. Wright,  Secure Communication in Minimal Connectivity Models, Journal of Cryptology, Volume 13(1), pp. 9 - 30, Springer, 2000.

[Cited 75 times Red Star]
135.   Amos Fiat,  Batch RSA, Journal of Cryptology, Volume 10(2), pp. 75 - 88, Springer, 1997.

[Cited 75 times Red Star]
136.   Ivan Damgard,  Torben P. Pedersen,  Birgit Pfitzmann,  On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures, Journal of Cryptology, Volume 10(3), pp. 163 - 194, Springer, 1997.

[Cited 73 times Red Star]
137.   Yehuda Lindell,  Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation, Journal of Cryptology, Volume 16(3), pp. 143 - 184, Springer, 2003.

[Cited 70 times Red Star]
138.   Gordon B. Agnew,  Thomas Beth,  Ronald C. Mullin,  Scott A. Vanstone,  Arithmetic Operations in GF(2 m), Journal of Cryptology, Volume 6(1), pp. 3 - 13, Springer, 1993.

[Cited 70 times Red Star]
139.   Shuhong Gao,  Hendrik W. Lenstra Jr.,  Optimal Normal Bases, Designs, Codes and Cryptography, Volume 2(4), pp. 315 - 323, Springer, 1992.

[Electronic Edition][Cited 70 times Red Star]
140.   Hans Dobbertin,  RIPEMD with Two-Round Compress Function is Not Collision-Free, Journal of Cryptology, Volume 10(1), pp. 51 - 70, Springer, 1997.

[Cited 68 times Red Star]
141.   Ran Canetti,  Shai Halevi,  Amir Herzberg,  Maintaining Authenticated Communication in the Presence of Break-Ins, Journal of Cryptology, Volume 13(1), pp. 61 - 105, Springer, 2000.

[Cited 67 times Red Star]
142.   Howard M. Heys,  Stafford E. Tavares,  Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis, Journal of Cryptology, Volume 9(1), pp. 1 - 19, Springer, 1996.

[Cited 67 times Red Star]
143.   Gustavus J. Simmons,  A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration, Journal of Cryptology, Volume 2(2), pp. 77 - 104, Springer, 1990.

[Cited 67 times Red Star]
144.   Gilles Brassard,  Claude CrĂ©peau,  Stefan Wolf,  Oblivious Transfers and Privacy Amplification, Journal of Cryptology, Volume 16(4), pp. 219 - 237, Springer, 2003.

[Cited 65 times Red Star]
145.   Martin E. Dyer,  Trevor I. Fenner,  Alan M. Frieze,  Andrew Thomason,  On Key Storage in Secure Networks, Journal of Cryptology, Volume 8(4), pp. 189 - 200, Springer, 1995.

[Cited 65 times Red Star]
146.   Don Coppersmith,  Modifications to the Number Field Sieve, Journal of Cryptology, Volume 6(3), pp. 169 - 180, Springer, 1993.

[Cited 65 times Red Star]
147.   Ueli M. Maurer,  Stefan Wolf,  The Diffie-Hellman Protocol, Designs, Codes and Cryptography, Volume 19(2), pp. 147 - 171, Springer, 2000.

[Electronic Edition][Cited 64 times Red Star]
148.   Nigel P. Smart,  Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic, Journal of Cryptology, Volume 12(2), pp. 141 - 151, Springer, 1999.

[Cited 63 times Red Star]
149.   Salil P. Vadhan,  Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model, Journal of Cryptology, Volume 17(1), pp. 43 - 77, Springer, 2004.

[Cited 62 times Red Star]
150.   Michael J. Jacobson Jr.,  Neal Koblitz,  Joseph H. Silverman,  Andreas Stein,  Edlyn Teske,  Analysis of the Xedni Calculus Attack, Designs, Codes and Cryptography, Volume 20(1), pp. 1 - 64, Springer, 2000.

[Electronic Edition][Cited 62 times Red Star]
151.   Christian Cachin,  Ueli M. Maurer,  Linking Information Reconciliation and Privacy Amplification, Journal of Cryptology, Volume 10(2), pp. 97 - 110, Springer, 1997.

[Cited 62 times Red Star]
152.   Shimon Even,  Yishay Mansour,  A Construction of a Cipher from a Single Pseudorandom Permutation, Journal of Cryptology, Volume 10(3), pp. 151 - 162, Springer, 1997.

[Cited 62 times Red Star]
153.   Amos Beimel,  Yuval Ishai,  Tal Malkin,  Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing, Journal of Cryptology, Volume 17(2), pp. 125 - 151, Springer, 2004.

[Cited 60 times Red Star]
154.   Matthew K. Franklin,  Stuart Haber,  Joint Encryption and Message-Efficient Secure Computation, Journal of Cryptology, Volume 9(4), pp. 217 - 232, Springer, 1996.

[Cited 60 times Red Star]
155.   Paulo S. L. M. Barreto,  Ben Lynn,  Michael Scott,  Efficient Implementation of Pairing-Based Cryptosystems, Journal of Cryptology, Volume 17(4), pp. 321 - 334, Springer, 2004.

[Cited 59 times Red Star]
156.   Joseph H. Silverman,  The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem, Designs, Codes and Cryptography, Volume 20(1), pp. 5 - 40, Springer, 2000.

[Electronic Edition][Cited 59 times Red Star]
157.   LászlĂł Csirmaz,  The Size of a Share Must Be Large, Journal of Cryptology, Volume 10(4), pp. 223 - 231, Springer, 1997.

[Cited 59 times Red Star]
158.   Douglas R. Stinson,  Some Constructions and Bounds for Authentication Codes, Journal of Cryptology, Volume 1(1), pp. 37 - 52, Springer, 1988.

[Cited 59 times Red Star]
159.   Sosina Martirosyan,  Tran van Trung,  Explicit constructions for perfect hash families, Designs, Codes and Cryptography, Volume 46(1), pp. 97 - 112, Springer, 2008.

[Electronic Edition][Cited 58 times Red Star]
160.   Wen-Guey Tzeng,  Zhi-Jia Tzeng,  A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares, Designs, Codes and Cryptography, Volume 35(1), pp. 47 - 61, Springer, 2005.

[Electronic Edition][Cited 58 times Red Star]
161.   Philip A. Eisen,  Douglas R. Stinson,  Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels, Designs, Codes and Cryptography, Volume 25(1), pp. 15 - 61, Springer, 2002.

[Electronic Edition][Cited 58 times Red Star]
162.   Roger Fischlin,  Claus-Peter Schnorr,  Stronger Security Proofs for RSA and Rabin Bits, Journal of Cryptology, Volume 13(2), pp. 221 - 244, Springer, 2000.

[Cited 58 times Red Star]
163.   Don Coppersmith,  Igor Shparlinski,  On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping, Journal of Cryptology, Volume 13(3), pp. 339 - 360, Springer, 2000.

[Cited 58 times Red Star]
164.   Joe Kilian,  Erez Petrank,  An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions, Journal of Cryptology, Volume 11(1), pp. 1 - 27, Springer, 1998.

[Cited 58 times Red Star]
165.   Lars R. Knudsen,  Xuejia Lai,  Bart Preneel,  Attacks on Fast Double Block Length Hash Functions, Journal of Cryptology, Volume 11(1), pp. 59 - 72, Springer, 1998.

[Cited 57 times Red Star]
166.   Philip D. MacKenzie,  Thomas Shrimpton,  Markus Jakobsson,  Threshold Password-Authenticated Key Exchange, Journal of Cryptology, Volume 19(1), pp. 27 - 66, Springer, 2006.

[Cited 56 times Red Star]
167.   Carlisle M. Adams,  Stafford E. Tavares,  The Structured Design of Cryptographically Good S-Boxes, Journal of Cryptology, Volume 3(1), pp. 27 - 41, Springer, 1990.

[Cited 56 times Red Star]
168.   Rafail Ostrovsky,  William E. Skeith III,  Private Searching on Streaming Data, Journal of Cryptology, Volume 20(4), pp. 397 - 430, Springer, 2007.

[Cited 55 times Red Star]
169.   Renate Scheidler,  Andreas Stein,  Hugh C. Williams,  Key-Exchange in Real Quadratic Congruence Function Fields, Designs, Codes and Cryptography, Volume 7(1), pp. 153 - 174, Springer, 1996.

[Electronic Edition][Cited 55 times Red Star]
170.   Ueli M. Maurer,  James L. Massey,  Cascade Ciphers: The Importance of Being First, Journal of Cryptology, Volume 6(1), pp. 55 - 61, Springer, 1993.

[Cited 55 times Red Star]
171.   Yehuda Lindell,  A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions, Journal of Cryptology, Volume 19(3), pp. 359 - 377, Springer, 2006.

[Cited 54 times Red Star]
172.   Carlo Blundo,  Alfredo De Santis,  Roberto De Simone,  Ugo Vaccaro,  Tight Bounds on the Information Rate of Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 11(2), pp. 107 - 122, Springer, 1997.

[Electronic Edition][Cited 54 times Red Star]
173.   Douglas R. Stinson,  James L. Massey,  An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions, Journal of Cryptology, Volume 8(3), pp. 167 - 173, Springer, 1995.

[Cited 54 times Red Star]
174.   Douglas R. Stinson,  Combinatorial Characterizations of Authentication Codes, Designs, Codes and Cryptography, Volume 2(2), pp. 175 - 187, Springer, 1992.

[Electronic Edition][Cited 54 times Red Star]
175.   Klaus Gaarder,  Einar Snekkenes,  Applying a Formal Analysis Technique to the CCITT X.509 Strong Two-Way Authentication Protocol, Journal of Cryptology, Volume 3(2), pp. 81 - 98, Springer, 1991.

[Cited 54 times Red Star]
176.   Kamel Bentahar,  Pooya Farshim,  John Malone-Lee,  Nigel P. Smart,  Generic Constructions of Identity-Based and Certificateless KEMs, Journal of Cryptology, Volume 21(2), pp. 178 - 199, Springer, 2008.

[Cited 53 times Red Star]
177.   Chris J. Mitchell,  Enumerating Boolean Functions of Cryptographic Significance, Journal of Cryptology, Volume 2(3), pp. 155 - 170, Springer, 1990.

[Cited 52 times Red Star]
178.   Paul F. Syverson,  Catherine Meadows,  A Formal Language for Cryptographic Protocol Requirements, Designs, Codes and Cryptography, Volume 7(1), pp. 27 - 59, Springer, 1996.

[Electronic Edition][Cited 51 times Red Star]
179.   Ching-Nung Yang,  Chi-Sung Laih,  New Colored Visual Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 20(3), pp. 325 - 336, Springer, 2000.

[Electronic Edition][Cited 50 times Red Star]
180.   Marten van Dijk,  On the Information Rate of Perfect Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 6(2), pp. 143 - 169, Springer, 1995.

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