Cryptographers' World
All
Journal of Cryptology / Designs, Codes and Cryptography
IEEE Transactions on Information Theory / Communications of the ACM
SIAM Journal on Computing / Journal of the ACM
Journal of Computer and System Sciences / Mathematische Annalen
 

Journal of Cryptology

 
Volume 21(4)
 
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]

Ralf KĂĽsters,  Anupam Datta,  John C. Mitchell,  Ajith Ramanathan,  On the Relationships between Notions of Simulation-Based Security, Journal of Cryptology, Volume 21(4), pp. 492 - 546, Springer, 2008.

[Cited 26 times ]

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]

Rahul Jain,  New Binding-Concealing Trade-Offs for Quantum String Commitment, Journal of Cryptology, Volume 21(4), pp. 579 - 592, Springer, 2008.

[No citation]

Claus Diem,  Emmanuel ThomĂ©,  Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three, Journal of Cryptology, Volume 21(4), pp. 593 - 611, Springer, 2008.

[Cited 9 times ]

Volume 21(3)
 
Jonathan Katz,  Yehuda Lindell,  Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs, Journal of Cryptology, Volume 21(3), pp. 303 - 349, Springer, 2008.

[Cited 4 times ]

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]

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]

Yi Lu,  Serge Vaudenay,  Cryptanalysis of an E0-like Combiner with Memory, Journal of Cryptology, Volume 21(3), pp. 430 - 457, Springer, 2008.

[Cited 2 times ]

Francesco Matucci,  Cryptanalysis of the Shpilrain-Ushakov Protocol for Thompson's Group, Journal of Cryptology, Volume 21(3), pp. 458 - 468, Springer, 2008.

[Cited 3 times ]

Volume 21(2)
 
Dan Boneh,  Xavier Boyen,  Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups, Journal of Cryptology, Volume 21(2), pp. 149 - 177, Springer, 2008.

[Cited 19 times ]

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]

Yehuda Lindell,  Lower Bounds and Impossibility Results for Concurrent Self Composition, Journal of Cryptology, Volume 21(2), pp. 200 - 249, Springer, 2008.

[Cited 4 times ]

JĂ©rĂ´me Renault,  Tristan Tomala,  Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks, Journal of Cryptology, Volume 21(2), pp. 250 - 279, Springer, 2008.

[Cited 2 times ]

Raphael Overbeck,  Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes, Journal of Cryptology, Volume 21(2), pp. 280 - 301, Springer, 2008.

[Cited 3 times ]

Volume 21(1)
 
Johan HĂĄstad,  Mats Näslund,  Practical Construction and Analysis of Pseudo-Randomness Primitives, Journal of Cryptology, Volume 21(1), pp. 1 - 26, Springer, 2008.

[Cited 12 times ]

Don Coppersmith,  Jean-SĂ©bastien Coron,  François Grieu,  Shai Halevi,  Charanjit S. Jutla,  David Naccache,  Julien P. Stern,  Cryptanalysis of ISO/IEC 9796-1, Journal of Cryptology, Volume 21(1), pp. 27 - 51, Springer, 2008.

[Cited 3 times ]

Minh-Huyen Nguyen,  Salil P. Vadhan,  Simpler Session-Key Generation from Short Random Passwords, Journal of Cryptology, Volume 21(1), pp. 52 - 96, Springer, 2008.

[Cited 16 times ]

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]

Ali Aydin Selçuk,  On Probability of Success in Linear and Differential Cryptanalysis, Journal of Cryptology, Volume 21(1), pp. 131 - 147, Springer, 2008.

[Cited 18 times ]

Volume 20(4)
 
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]

Yael Tauman Kalai,  Yehuda Lindell,  Manoj Prabhakaran,  Concurrent Composition of Secure Protocols in the Timing Model, Journal of Cryptology, Volume 20(4), pp. 431 - 492, Springer, 2007.

[Cited 18 times ]

Eu-Jin Goh,  Stanislaw Jarecki,  Jonathan Katz,  Nan Wang,  Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems, Journal of Cryptology, Volume 20(4), pp. 493 - 514, Springer, 2007.

[Cited 5 times ]

Volume 20(3)
 
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]

Amos Beimel,  Yoav Stahl,  Robust Information-Theoretic Private Information Retrieval, Journal of Cryptology, Volume 20(3), pp. 295 - 321, Springer, 2007.

[Cited 24 times ]

Carlo Blundo,  Paolo D'Arco,  Alfredo De Santis,  Douglas R. Stinson,  On Unconditionally Secure Distributed Oblivious Transfer, Journal of Cryptology, Volume 20(3), pp. 323 - 373, Springer, 2007.

[Cited 8 times ]

Qi Cheng,  Primality Proving via One Round in ECPP and One Iteration in AKS, Journal of Cryptology, Volume 20(3), pp. 375 - 387, Springer, 2007.

[Cited 21 times ]

Boaz Tsaban,  Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1, Journal of Cryptology, Volume 20(3), pp. 389 - 392, Springer, 2007.

[Cited 1 times ]

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]

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]

Volume 20(2)
 
Johan HĂĄstad,  The Security of the IAPM and IACBC Modes, Journal of Cryptology, Volume 20(2), pp. 153 - 163, Springer, 2007.

[Cited 1 times ]

Yan Zong Ding,  Danny Harnik,  Alon Rosen,  Ronen Shaltiel,  Constant-Round Oblivious Transfer in the Bounded Storage Model, Journal of Cryptology, Volume 20(2), pp. 165 - 202, Springer, 2007.

[Cited 34 times ]

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]

Tamir Tassa,  Hierarchical Threshold Secret Sharing, Journal of Cryptology, Volume 20(2), pp. 237 - 264, Springer, 2007.

[Cited 17 times ]

Volume 20(1)
 
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]

Jean-SĂ©bastien Coron,  Alexander May,  Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring, Journal of Cryptology, Volume 20(1), pp. 39 - 50, Springer, 2007.

[Cited 20 times ]

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]

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]

Dario Catalano,  David Pointcheval,  Thomas Pornin,  Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication, Journal of Cryptology, Volume 20(1), pp. 115 - 149, Springer, 2007.

[Cited 16 times ]

Volume 19(4)
 
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]

Deukjo Hong,  Seokhie Hong,  Wonil Lee,  Sangjin Lee,  Jongin Lim,  Jaechul Sung,  Okyeon Yi,  Known-IV, Known-in-Advance-IV, and Replayed-and-Known-IV Attacks on Multiple Modes of Operation of Block Ciphers, Journal of Cryptology, Volume 19(4), pp. 441 - 462, Springer, 2006.

[No citation]

Marc Girault,  Guillaume Poupard,  Jacques Stern,  On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order, Journal of Cryptology, Volume 19(4), pp. 463 - 487, Springer, 2006.

[Cited 21 times ]

Ivan Damgard,  Gudmund Skovbjerg Frandsen,  An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate, Journal of Cryptology, Volume 19(4), pp. 489 - 520, Springer, 2006.

[Cited 8 times ]

Danny Harnik,  Moni Naor,  Omer Reingold,  Alon Rosen,  Completeness in Two-Party Secure Computation: A Computational View, Journal of Cryptology, Volume 19(4), pp. 521 - 552, Springer, 2006.

[Cited 7 times ]

Florian Luca,  Igor Shparlinski,  Elliptic Curves with Low Embedding Degree, Journal of Cryptology, Volume 19(4), pp. 553 - 562, Springer, 2006.

[Cited 12 times ]

Volume 19(3)
 
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]

Markus Bläser,  Andreas Jakoby,  Maciej Liskiewicz,  Bodo Manthey,  Private Computation: k-Connected versus 1-Connected Networks, Journal of Cryptology, Volume 19(3), pp. 341 - 357, Springer, 2006.

[Cited 12 times ]

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]

Volume 19(2)
 
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]

Juan A. Garay,  Philip D. MacKenzie,  Ke Yang,  Strengthening Zero-Knowledge Protocols Using Signatures, Journal of Cryptology, Volume 19(2), pp. 169 - 209, Springer, 2006.

[Cited 42 times ]

Michael J. Jacobson Jr.,  Renate Scheidler,  Hugh C. Williams,  An Improved Real-Quadratic-Field-Based Key Exchange Procedure, Journal of Cryptology, Volume 19(2), pp. 211 - 239, Springer, 2006.

[Cited 11 times ]

Volume 19(1)
 
Jan Denef,  Frederik Vercauteren,  An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2, Journal of Cryptology, Volume 19(1), pp. 1 - 25, Springer, 2006.

[Cited 25 times ]

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]

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]

Yan-Cheng Chang,  Chun-Yuan Hsiao,  Chi-Jen Lu,  The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives, Journal of Cryptology, Volume 19(1), pp. 97 - 114, Springer, 2006.

[Cited 1 times ]

Edlyn Teske,  An Elliptic Curve Trapdoor System, Journal of Cryptology, Volume 19(1), pp. 115 - 133, Springer, 2006.

[Cited 11 times ]

Volume 18(4)
 
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]

Adrian Kent,  Secure Classical Bit Commitment Using Fixed Capacity Communication Channels, Journal of Cryptology, Volume 18(4), pp. 313 - 335, Springer, 2005.

[Cited 6 times ]

Joachim von zur Gathen,  Michael Nöcker,  Polynomial and Normal Bases for Finite Fields, Journal of Cryptology, Volume 18(4), pp. 337 - 355, Springer, 2005.

[Cited 15 times ]

Roberto Maria Avanzi,  The Complexity of Certain Multi-Exponentiation Techniques in Cryptography, Journal of Cryptology, Volume 18(4), pp. 357 - 373, Springer, 2005.

[Cited 19 times ]

Lars R. Knudsen,  Chris J. Mitchell,  Partial Key Recovery Attack Against RMAC, Journal of Cryptology, Volume 18(4), pp. 375 - 389, Springer, 2005.

[Cited 6 times ]

Carlo Blundo,  Paolo D'Arco,  Analysis and Design of Distributed Key Distribution Centers, Journal of Cryptology, Volume 18(4), pp. 391 - 414, Springer, 2005.

[Cited 3 times ]

Volume 18(3)
 
Jeffrey Considine,  Matthias Fitzi,  Matthew K. Franklin,  Leonid A. Levin,  Ueli M. Maurer,  David Metcalf,  Byzantine Agreement Given Partial Broadcast, Journal of Cryptology, Volume 18(3), pp. 191 - 217, Springer, 2005.

[Cited 7 times ]

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]

Shafi Goldwasser,  Yehuda Lindell,  Secure Multi-Party Computation without Agreement, Journal of Cryptology, Volume 18(3), pp. 247 - 287, Springer, 2005.

[Cited 8 times ]

Volume 18(2)
 
RĂ©gis Dupont,  Andreas Enge,  François Morain,  Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields, Journal of Cryptology, Volume 18(2), pp. 79 - 89, Springer, 2005.

[Cited 48 times ]

Rosario Gennaro,  An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem, Journal of Cryptology, Volume 18(2), pp. 91 - 110, Springer, 2005.

[Cited 41 times ]

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]

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]

Tamir Tassa,  Low Bandwidth Dynamic Traitor Tracing Schemes, Journal of Cryptology, Volume 18(2), pp. 167 - 183, Springer, 2005.

[Cited 7 times ]

Volume 18(1)
 
Moni Naor,  Benny Pinkas,  Computationally Secure Oblivious Transfer, Journal of Cryptology, Volume 18(1), pp. 1 - 35, Springer, 2005.

[Cited 26 times ]

Matthias Fitzi,  Juan A. Garay,  Ueli M. Maurer,  Rafail Ostrovsky,  Minimal Complete Primitives for Secure Multi-Party Computation, Journal of Cryptology, Volume 18(1), pp. 37 - 61, Springer, 2005.

[Cited 15 times ]

Henri Cohen,  Analysis of the Sliding Window Powering Algorithm, Journal of Cryptology, Volume 18(1), pp. 63 - 76, Springer, 2005.

[Cited 15 times ]

Volume 17(4)
 
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]

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]

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]

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]

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]

Volume 17(3)
 
Ran Canetti,  Ivan Damgard,  Stefan Dziembowski,  Yuval Ishai,  Tal Malkin,  Adaptive versus Non-Adaptive Security of Multi-Party Protocols, Journal of Cryptology, Volume 17(3), pp. 153 - 207, Springer, 2004.

[Cited 4 times ]

Gustav Hast,  Nearly One-Sided Tests and the Goldreich?Levin Predicate, Journal of Cryptology, Volume 17(3), pp. 209 - 229, Springer, 2004.

[Cited 3 times ]

Volume 17(2)
 
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]

Michael J. Wiener,  The Full Cost of Cryptanalytic Attacks, Journal of Cryptology, Volume 17(2), pp. 105 - 124, Springer, 2004.

[Cited 19 times ]

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]

Volume 17(1)
 
Stefan Dziembowski,  Ueli M. Maurer,  Optimal Randomizer Efficiency in the Bounded-Storage Model, Journal of Cryptology, Volume 17(1), pp. 5 - 26, Springer, 2004.

[Cited 27 times ]

Chi-Jen Lu,  Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors, Journal of Cryptology, Volume 17(1), pp. 27 - 42, Springer, 2004.

[Cited 31 times ]

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]

Volume 16(4)
 
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]

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]

Serge Vaudenay,  Decorrelation: A Theory for Block Cipher Security, Journal of Cryptology, Volume 16(4), pp. 249 - 286, Springer, 2003.

[Cited 39 times ]

Adam Kalai,  Generating Random Factored Numbers, Easily, Journal of Cryptology, Volume 16(4), pp. 287 - 289, Springer, 2003.

[Cited 48 times ]

Volume 16(3)
 
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]

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]

Volume 16(2)
 
Oded Goldreich,  Vered Rosen,  On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators, Journal of Cryptology, Volume 16(2), pp. 71 - 93, Springer, 2003.

[Cited 15 times ]

Michael Ben-Or,  Danny Gutfreund,  Trading Help for Interaction in Statistical Zero-Knowledge Proofs, Journal of Cryptology, Volume 16(2), pp. 95 - 116, Springer, 2003.

[Cited 5 times ]

Siguna MĂĽller,  A Probable Prime Test with Very High Confidence for n L 3 mod 4, Journal of Cryptology, Volume 16(2), pp. 117 - 139, Springer, 2003.

[Cited 12 times ]

Volume 16(1)
 
Steven Myers,  Efficient Amplification of the Security of Weak Pseudo-Random Function Generators, Journal of Cryptology, Volume 16(1), pp. 1 - 24, Springer, 2003.

[Cited 5 times ]

Amos Beimel,  Shlomi Dolev,  Buses for Anonymous Message Delivery, Journal of Cryptology, Volume 16(1), pp. 25 - 39, Springer, 2003.

[Cited 41 times ]

Jovan Dj. Golic,  Renato Menicocci,  Edit Probability Correlation Attacks on Stop/ Go Clocked Keystream Generators, Journal of Cryptology, Volume 16(1), pp. 41 - 68, Springer, 2003.

[Cited 5 times ]

Volume 15(4)
 
Victor Shoup,  OAEP Reconsidered, Journal of Cryptology, Volume 15(4), pp. 223 - 249, Springer, 2002.

[Cited 282 times Red StarRed StarRed Star]

Dario Catalano,  Rosario Gennaro,  Nick Howgrave-Graham,  Paillier's Trapdoor Function Hides up to , Journal of Cryptology, Volume 15(4), pp. 251 - 269, Springer, 2002.

[Cited 10 times ]

Mihir Bellare,  A Note on Negligible Functions, Journal of Cryptology, Volume 15(4), pp. 271 - 284, Springer, 2002.

[Cited 31 times ]

Spyros S. Magliveras,  Douglas R. Stinson,  Tran van Trung,  New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups, Journal of Cryptology, Volume 15(4), pp. 285 - 297, Springer, 2002.

[Cited 37 times ]

Volume 15(3)
 
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]

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]

Lars R. Knudsen,  The Security of Feistel Ciphers with Six Rounds or Less, Journal of Cryptology, Volume 15(3), pp. 207 - 222, Springer, 2002.

[Cited 8 times ]

Volume 15(2)
 
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]

Moni Naor,  Omer Reingold,  Constructing Pseudo-Random Permutations with a Prescribed Structure, Journal of Cryptology, Volume 15(2), pp. 97 - 102, Springer, 2002.

[Cited 18 times ]

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]

Steven D. Galbraith,  Elliptic Curve Paillier Schemes, Journal of Cryptology, Volume 15(2), pp. 129 - 138, Springer, 2002.

[Cited 36 times ]

Anna M. Johnston,  Peter Gemmell,  Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack, Journal of Cryptology, Volume 15(2), pp. 139 - 148, Springer, 2002.

[Cited 15 times ]

Volume 15(1)
 
Silvio Micali,  Leonid Reyzin,  Improving the Exact Security of Digital Signature Schemes, Journal of Cryptology, Volume 15(1), pp. 1 - 18, Springer, 2002.

[Cited 30 times ]

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]

Eli Biham,  Lars R. Knudsen,  Cryptanalysis of the ANSI X9.52 CBCM Mode, Journal of Cryptology, Volume 15(1), pp. 47 - 59, Springer, 2002.

[Cited 12 times ]

Alexander A. Moldovyan,  Nick A. Moldovyan,  A Cipher Based on Data-Dependent Permutations, Journal of Cryptology, Volume 15(1), pp. 61 - 72, Springer, 2002.

[Cited 32 times ]

Volume 14(4)
 
Thomas Scanlon,  Public Key Cryptosystems Based on Drinfeld Modules Are Insecure, Journal of Cryptology, Volume 14(4), pp. 225 - 230, Springer, 2001.

[Cited 6 times ]

Kaoru Kurosawa,  Thomas Johansson,  Douglas R. Stinson,  Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications, Journal of Cryptology, Volume 14(4), pp. 231 - 253, Springer, 2001.

[Cited 27 times ]

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]

Volume 14(3)
 
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]

Mikael Goldmann,  Mats Näslund,  Alexander Russell,  Complexity Bounds on General Hard-Core Predicates, Journal of Cryptology, Volume 14(3), pp. 177 - 195, Springer, 2001.

[Cited 5 times ]

Thomas Jakobsen,  Lars R. Knudsen,  Attacks on Block Ciphers of Low Algebraic Degree, Journal of Cryptology, Volume 14(3), pp. 197 - 210, Springer, 2001.

[Cited 20 times ]

Amos Fiat,  Tamir Tassa,  Dynamic Traitor Tracing, Journal of Cryptology, Volume 14(3), pp. 211 - 223, Springer, 2001.

[Cited 116 times Red StarRed Star]

Volume 14(2)
 
Don Coppersmith,  Weakness in Quaternion Signatures, Journal of Cryptology, Volume 14(2), pp. 77 - 85, Springer, 2001.

[Cited 5 times ]

Serge Vaudenay,  Cryptanalysis of the Chor-Rivest Cryptosystem, Journal of Cryptology, Volume 14(2), pp. 87 - 100, Springer, 2001.

[Cited 35 times ]

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]

Yongge Wang,  Yvo Desmedt,  Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question, Journal of Cryptology, Volume 14(2), pp. 121 - 135, Springer, 2001.

[Cited 15 times ]

Dingfeng Ye,  Zongduo Dai,  Kwok-Yan Lam,  Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions, Journal of Cryptology, Volume 14(2), pp. 137 - 150, Springer, 2001.

[Cited 9 times ]

Volume 14(1)
 
Andrew Klapper,  On the Existence of Secure Keystream Generators, Journal of Cryptology, Volume 14(1), pp. 1 - 15, Springer, 2001.

[Cited 7 times ]

Joe Kilian,  Phillip Rogaway,  How to Protect DES Against Exhaustive Key Search (an Analysis of DESX), Journal of Cryptology, Volume 14(1), pp. 17 - 35, Springer, 2001.

[Cited 14 times ]

Giovanni Di Crescenzo,  Yuval Ishai,  Rafail Ostrovsky,  Universal Service-Providers for Private Information Retrieval, Journal of Cryptology, Volume 14(1), pp. 37 - 74, Springer, 2001.

[Cited 36 times ]

Volume 13(4)
 
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]

Lars R. Knudsen,  A Detailed Analysis of SAFER K, Journal of Cryptology, Volume 13(4), pp. 417 - 436, Springer, 2000.

[Cited 13 times ]

John M. Pollard,  Kangaroos, Monopoly and Discrete Logarithms, Journal of Cryptology, Volume 13(4), pp. 437 - 447, Springer, 2000.

[Cited 29 times ]

Joan Boyar,  Ivan Damgard,  RenĂ© Peralta,  Short Non-Interactive Cryptographic Proofs, Journal of Cryptology, Volume 13(4), pp. 449 - 472, Springer, 2000.

[Cited 14 times ]

Michael J. Jacobson Jr.,  Computing Discrete Logarithms in Quadratic Orders, Journal of Cryptology, Volume 13(4), pp. 473 - 492, Springer, 2000.

[Cited 11 times ]

Volume 13(3)
 
Muxiang Zhang,  Maximum Correlation Analysis of Nonlinear Combining Functions in Stream Ciphers, Journal of Cryptology, Volume 13(3), pp. 301 - 314, Springer, 2000.

[Cited 13 times ]

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]

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]

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]

Volume 13(2)
 
H. Zbinden,  Nicolas Gisin,  B. Huttner,  A. Muller,  W. Tittel,  Practical Aspects of Quantum Cryptographic Key Distribution, Journal of Cryptology, Volume 13(2), pp. 207 - 220, Springer, 2000.

[Cited 32 times ]

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]

Jovan Dj. Golic,  Mahmoud Salmasizadeh,  Ed Dawson,  Fast Correlation Attacks on the Summation Generator, Journal of Cryptology, Volume 13(2), pp. 245 - 262, Springer, 2000.

[Cited 18 times ]

Sachar Paulus,  Tsuyoshi Takagi,  A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time, Journal of Cryptology, Volume 13(2), pp. 263 - 272, Springer, 2000.

[Cited 28 times ]

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]

Volume 13(1)
 
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]

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]

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]

Ran Canetti,  Eyal Kushilevitz,  Rafail Ostrovsky,  Adi RosĂ©n,  Randomness versus Fault-Tolerance, Journal of Cryptology, Volume 13(1), pp. 107 - 142, Springer, 2000.

[Cited 5 times ]

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]

Volume 12(4)
 
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]

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]

Victor Shoup,  On the Security of a Practical Identification Scheme, Journal of Cryptology, Volume 12(4), pp. 247 - 260, Springer, 1999.

[Cited 46 times ]

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]

Volume 12(3)
 
Carlo Blundo,  Alfredo De Santis,  Kaoru Kurosawa,  Wakaha Ogata,  On a Fallacious Bound for Authentication Codes, Journal of Cryptology, Volume 12(3), pp. 155 - 159, Springer, 1999.

[Cited 5 times ]

Eli Biham,  Cryptanalysis of Triple Modes of Operation, Journal of Cryptology, Volume 12(3), pp. 161 - 184, Springer, 1999.

[Cited 21 times ]

Daniel J. Bernstein,  How to Stretch Random Functions: The Security of Protected Counter Sums, Journal of Cryptology, Volume 12(3), pp. 185 - 192, Springer, 1999.

[Cited 22 times ]

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]

Mike Burmester,  Yvo Desmedt,  Toshiya Itoh,  Kouichi Sakurai,  Hiroki Shizuya,  Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages, Journal of Cryptology, Volume 12(3), pp. 197 - 223, Springer, 1999.

[Cited 5 times ]

Volume 12(2)
 
Shai Halevi,  Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver, Journal of Cryptology, Volume 12(2), pp. 77 - 89, Springer, 1999.

[Cited 12 times ]

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]

Mihir Bellare,  Ronald L. Rivest,  Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer, Journal of Cryptology, Volume 12(2), pp. 117 - 139, Springer, 1999.

[Cited 9 times ]

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]

Volume 12(1)
 
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]

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]

Nigel P. Smart,  Samir Siksek,  A Fast Diffie-Hellman Protocol in Genus 2, Journal of Cryptology, Volume 12(1), pp. 67 - 73, Springer, 1999.

[Cited 6 times ]

Volume 11(4)
 
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]

Sean Murphy,  An Analysis of SAFER, Journal of Cryptology, Volume 11(4), pp. 235 - 251, Springer, 1998.

[Cited 13 times ]

Hans Dobbertin,  Cryptanalysis of MD4, Journal of Cryptology, Volume 11(4), pp. 253 - 271, Springer, 1998.

[Cited 224 times Red StarRed Star]

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]

Volume 11(3)
 
Jørgen Brandt,  Ivan Damgard,  Peter Landrock,  Torben P. Pedersen,  Zero-Knowledge Authentication Scheme with Secret Key Exchange, Journal of Cryptology, Volume 11(3), pp. 147 - 159, Springer, 1998.

[Cited 34 times ]

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]

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]

Ivan Damgard,  Lars R. Knudsen,  Two-Key Triple Encryption, Journal of Cryptology, Volume 11(3), pp. 209 - 218, Springer, 1998.

[Cited 42 times ]

Volume 11(2)
 
Jovan Dj. Golic,  On Matroid Characterization of Ideal Secret Sharing Schemes, Journal of Cryptology, Volume 11(2), pp. 75 - 86, Springer, 1998.

[Cited 8 times ]

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]

Renate Scheidler,  A Public-Key Cryptosystem Using Purely Cubic Fields, Journal of Cryptology, Volume 11(2), pp. 109 - 124, Springer, 1998.

[Cited 11 times ]

Claus-Peter Schnorr,  Serge Vaudenay,  The Black-Box Model for Cryptographic Primitives, Journal of Cryptology, Volume 11(2), pp. 125 - 140, Springer, 1998.

[Cited 6 times ]

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]

Volume 11(1)
 
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]

Kouichi Sakurai,  Hiroki Shizuya,  A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems, Journal of Cryptology, Volume 11(1), pp. 29 - 43, Springer, 1998.

[Cited 13 times ]

Eli Biham,  Cryptanalysis of Multiple Modes of Operation, Journal of Cryptology, Volume 11(1), pp. 45 - 58, Springer, 1998.

[Cited 33 times ]

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]

Volume 10(4)
 
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]

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]

Wen-Ai Jackson,  Keith M. Martin,  Christine M. O'Keefe,  Mutually Trusted Authority-Free Secret Sharing Schemes, Journal of Cryptology, Volume 10(4), pp. 261 - 289, Springer, 1997.

[Cited 13 times ]

Volume 10(3)
 
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]

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]

Eli Biham,  Alex Biryukov,  An Improvement of Davies' Attack on DES, Journal of Cryptology, Volume 10(3), pp. 195 - 206, Springer, 1997.

[Cited 39 times ]

Don Coppersmith,  Jacques Stern,  Serge Vaudenay,  The Security of the Birational Permutation Signature Schemes, Journal of Cryptology, Volume 10(3), pp. 207 - 221, Springer, 1997.

[Cited 36 times ]

Volume 10(2)
 
Amos Fiat,  Batch RSA, Journal of Cryptology, Volume 10(2), pp. 75 - 88, Springer, 1997.

[Cited 75 times Red Star]

Yacov Yacobi,  Michael J. Beller,  Batch Diffie-Hellman Key Agreement Systems, Journal of Cryptology, Volume 10(2), pp. 89 - 96, Springer, 1997.

[Cited 6 times ]

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]

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]

Volume 10(1)
 
Peter de Rooij,  On Schnorr's Preprocessing for Digital Signature Schemes, Journal of Cryptology, Volume 10(1), pp. 1 - 16, Springer, 1997.

[Cited 18 times ]

Donald Beaver,  Joan Feigenbaum,  Joe Kilian,  Phillip Rogaway,  Locally Random Reductions: Improvements and Applications, Journal of Cryptology, Volume 10(1), pp. 17 - 36, Springer, 1997.

[Cited 40 times ]

Toshiya Itoh,  Yuji Ohta,  Hiroki Shizuya,  A Language-Dependent Cryptographic Primitive, Journal of Cryptology, Volume 10(1), pp. 37 - 50, Springer, 1997.

[Cited 26 times ]

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]

Burton S. Kaliski Jr.,  A Chosen Message Attack on Demytko's Elliptic Curve Cryptosystem, Journal of Cryptology, Volume 10(1), pp. 71 - 72, Springer, 1997.

[Cited 12 times ]

Volume 9(4)
 
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]

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]

Wen-Ai Jackson,  Keith M. Martin,  Christine M. O'Keefe,  Ideal Secret Sharing Schemes with Multiple Secrets, Journal of Cryptology, Volume 9(4), pp. 233 - 250, Springer, 1996.

[Cited 13 times ]

Yenjo Han,  Lane A. Hemaspaandra,  Pseudorandom Generators and the Frequency of Simplicity, Journal of Cryptology, Volume 9(4), pp. 251 - 261, Springer, 1996.

[Cited 2 times ]

Volume 9(3)
 
Claude CrĂ©peau,  Guest Editor's Introduction, Journal of Cryptology, Volume 9(3), pp. 127 - 128, Springer, 1996.

[No citation]

Alfredo De Santis,  Giuseppe Persiano,  The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge, Journal of Cryptology, Volume 9(3), pp. 129 - 148, Springer, 1996.

[No citation]

Mihir Bellare,  Moti Yung,  Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation, Journal of Cryptology, Volume 9(3), pp. 149 - 166, Springer, 1996.

[Cited 35 times ]

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]

Michael J. Fischer,  Silvio Micali,  Charles Rackoff,  A Secure Protocol for the Oblivious Transfer (Extended Abstract), Journal of Cryptology, Volume 9(3), pp. 191 - 195, Springer, 1996.

[Cited 46 times ]

Volume 9(2)
 
Michael J. Fischer,  Rebecca N. Wright,  Bounds on Secret Key Exchange Using a Random Deal of Cards, Journal of Cryptology, Volume 9(2), pp. 71 - 99, Springer, 1996.

[Cited 39 times ]

Toshiya Itoh,  Masafumi Hoshi,  Shigeo Tsujii,  A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity, Journal of Cryptology, Volume 9(2), pp. 101 - 109, Springer, 1996.

[Cited 1 times ]

Jovan Dj. Golic,  Correlation Properties of a General Binary Combiner with Memory, Journal of Cryptology, Volume 9(2), pp. 111 - 126, Springer, 1996.

[Cited 40 times ]

Volume 9(1)
 
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]

Ishai Ben-Aroya,  Eli Biham,  Differential Cryptanalysis of Lucifer, Journal of Cryptology, Volume 9(1), pp. 21 - 34, Springer, 1996.

[Cited 36 times ]

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]

Volume 8(4)
 
Dingyi Pei,  Information-Theoretic Bounds for Authentication Codes and Block Designs, Journal of Cryptology, Volume 8(4), pp. 177 - 188, Springer, 1995.

[Cited 36 times ]

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]

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]

Volume 8(3)
 
Yi Xian Yang,  Baoan Guo,  Further Enumerating Boolean Functions of Cryptographic Significance, Journal of Cryptology, Volume 8(3), pp. 115 - 122, Springer, 1995.

[Cited 34 times ]

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]

Simon R. Blackburn,  Sean Murphy,  Jacques Stern,  The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings, Journal of Cryptology, Volume 8(3), pp. 157 - 166, Springer, 1995.

[Cited 4 times ]

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]

Volume 8(2)
 
Luke O'Connor,  On the Distribution of Characteristics in Bijective Mappings, Journal of Cryptology, Volume 8(2), pp. 67 - 86, Springer, 1995.

[Cited 43 times ]

Alexander Russell,  Necessary and Sufficient Condtions for Collision-Free Hashing, Journal of Cryptology, Volume 8(2), pp. 87 - 100, Springer, 1995.

[Cited 30 times ]

Scott A. Vanstone,  Robert J. Zuccherato,  Short RSA Keys and Their Generation, Journal of Cryptology, Volume 8(2), pp. 101 - 114, Springer, 1995.

[Cited 39 times ]

Volume 8(1)
 
Donald W. Davies,  Sean Murphy,  Pairs and Triplets of DES S-Boxes, Journal of Cryptology, Volume 8(1), pp. 1 - 25, Springer, 1995.

[Cited 37 times ]

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]

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]

Volume 7(4)
 
Minghua Qu,  Scott A. Vanstone,  Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance, Journal of Cryptology, Volume 7(4), pp. 201 - 212, Springer, 1994.

[Cited 7 times ]

Luke O'Connor,  Andrew Klapper,  Algebraic Nonlinearity and Its Applications to Cryptography, Journal of Cryptology, Volume 7(4), pp. 213 - 227, Springer, 1994.

[Cited 12 times ]

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]

Volume 7(3)
 
Luke O'Connor,  An Analysis of a Class of Algorithms for S-Box Construction, Journal of Cryptology, Volume 7(3), pp. 133 - 151, Springer, 1994.

[Cited 9 times ]

Shang-Hua Teng,  Functional Inversion and Communication Complexity, Journal of Cryptology, Volume 7(3), pp. 153 - 170, Springer, 1994.

[Cited 1 times ]

Renate Scheidler,  Johannes Buchmann,  Hugh C. Williams,  A Key-Exchange Protocol Using Real Quadratic Fields, Journal of Cryptology, Volume 7(3), pp. 171 - 199, Springer, 1994.

[Cited 40 times ]

Volume 7(2)
 
Gustavus J. Simmons,  Proof of Soundness (Integrity) of Cryptographic Protocols, Journal of Cryptology, Volume 7(2), pp. 69 - 77, Springer, 1994.

[Cited 11 times ]

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]

Volume 7(1)
 
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]

Andrew Klapper,  The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic, Journal of Cryptology, Volume 7(1), pp. 33 - 51, Springer, 1994.

[Cited 26 times ]

Benny Chor,  Mihály GerĂ©b-Graus,  Eyal Kushilevitz,  On the Structure of the Privacy Hierarchy, Journal of Cryptology, Volume 7(1), pp. 53 - 60, Springer, 1994.

[Cited 20 times ]

Sean Murphy,  Kenneth G. Paterson,  Peter R. Wild,  A Weak Cipher that Generates the Symmetric Group, Journal of Cryptology, Volume 7(1), pp. 61 - 65, Springer, 1994.

[Cited 8 times ]

Volume 6(4)
 
Glenn A. Orton,  Lloyd E. Peppard,  Stafford E. Tavares,  A Design of a Fast Pipelined Modular Multiplier Based on a Diminished-Radix Algorithm, Journal of Cryptology, Volume 6(4), pp. 183 - 208, Springer, 1993.

[Cited 11 times ]

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]

Arjen K. Lenstra,  Yacov Yacobi,  User Impersonation in Key Certification Schemes, Journal of Cryptology, Volume 6(4), pp. 225 - 232, Springer, 1993.

[Cited 4 times ]

Volume 6(3)
 
A. W. Schrift,  Adi Shamir,  Universal Tests for Nonuniform Distributions, Journal of Cryptology, Volume 6(3), pp. 119 - 133, Springer, 1993.

[Cited 5 times ]

Ute Rosenbaum,  A Lower Bound on Authentication After Having Observed a Sequence of Messages, Journal of Cryptology, Volume 6(3), pp. 135 - 156, Springer, 1993.

[Cited 34 times ]

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]

Don Coppersmith,  Modifications to the Number Field Sieve, Journal of Cryptology, Volume 6(3), pp. 169 - 180, Springer, 1993.

[Cited 65 times Red Star]

Volume 6(2)
 
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]

Benny Chor,  Eyal Kushilevitz,  Secret Sharing Over Infinite Domains, Journal of Cryptology, Volume 6(2), pp. 87 - 95, Springer, 1993.

[Cited 14 times ]

Oded Goldreich,  Eyal Kushilevitz,  A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm, Journal of Cryptology, Volume 6(2), pp. 97 - 116, Springer, 1993.

[Cited 28 times ]

Volume 6(1)
 
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]

M. Ito,  A. Saio,  Takao Nishizeki,  Multiple Assignment Scheme for Sharing Secret, Journal of Cryptology, Volume 6(1), pp. 15 - 20, Springer, 1993.

[Cited 33 times ]

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]

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]

Volume 5(3)
 
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]

Spyros S. Magliveras,  Nasir D. Memon,  Algebraic Properties of Cryptosystem PGM, Journal of Cryptology, Volume 5(3), pp. 167 - 183, Springer, 1992.

[Cited 39 times ]

S. J. Phillips,  N. C. Phillips,  Strongly Ideal Secret Sharing Schemes, Journal of Cryptology, Volume 5(3), pp. 185 - 191, Springer, 1992.

[Cited 8 times ]

Zong-Duo Dai,  Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials, Journal of Cryptology, Volume 5(3), pp. 193 - 207, Springer, 1992.

[No citation]

Volume 5(2)
 
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]

S. Lloyd,  Counting Binary Functions with Certain Cryptographic Properties, Journal of Cryptology, Volume 5(2), pp. 107 - 131, Springer, 1992.

[Cited 25 times ]

J. Georgiades,  Some Remarks on the Security of the Identification Scheme Based on Permuted Kernels, Journal of Cryptology, Volume 5(2), pp. 133 - 137, Springer, 1992.

[Cited 11 times ]

John H. Loxton,  David S. P. Khoo,  Gregory J. Bird,  Jennifer Seberry,  A Cubic RSA Code Equivalent to Factorization, Journal of Cryptology, Volume 5(2), pp. 139 - 150, Springer, 1992.

[Cited 25 times ]

Volume 5(1)
 
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]

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]

Jan-Hendrik Evertse,  Eugène van Heyst,  Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures?, Journal of Cryptology, Volume 5(1), pp. 41 - 52, Springer, 1992.

[Cited 22 times ]

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]

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]

Volume 4(3)
 
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]

Samy Bengio,  Gilles Brassard,  Yvo Desmedt,  Claude Goutier,  Jean-Jacques Quisquater,  Secure Implementations of Identification Systems, Journal of Cryptology, Volume 4(3), pp. 175 - 183, Springer, 1991.

[Cited 41 times ]

Joan Boyar,  Katalin Friedl,  Carsten Lund,  Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies, Journal of Cryptology, Volume 4(3), pp. 185 - 206, Springer, 1991.

[Cited 49 times ]

Neal Koblitz,  Elliptic Curve Implementations of Zero-Knowledge Blobs, Journal of Cryptology, Volume 4(3), pp. 207 - 213, Springer, 1991.

[No citation]

Volume 4(2)
 
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]

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]

Ueli M. Maurer,  James L. Massey,  Local Randomness in Pseudorandom Sequences, Journal of Cryptology, Volume 4(2), pp. 135 - 149, Springer, 1991.

[Cited 27 times ]

Moni Naor,  Bit Commitment Using Pseudorandomness, Journal of Cryptology, Volume 4(2), pp. 151 - 158, Springer, 1991.

[Cited 330 times Red StarRed StarRed Star]

Volume 4(1)
 
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]

Volume 3(3)
 
Hendrik W. Lenstra Jr.,  On the Chor-Rivest Knapsack Cryptosystem, Journal of Cryptology, Volume 3(3), pp. 149 - 155, Springer, 1991.

[Cited 21 times ]

Silvio Micali,  Claus-Peter Schnorr,  Efficient, Perfect Polynomial Random Number Generators, Journal of Cryptology, Volume 3(3), pp. 157 - 172, Springer, 1991.

[Cited 28 times ]

Marijke De Soete,  New Bounds and Constructions for Authentication/Secrecy Codes with Splitting, Journal of Cryptology, Volume 3(3), pp. 173 - 186, Springer, 1991.

[Cited 18 times ]

Burton S. Kaliski Jr.,  One-Way Permutations on Elliptic Curves, Journal of Cryptology, Volume 3(3), pp. 187 - 199, Springer, 1991.

[Cited 24 times ]

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]

Volume 3(2)
 
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]

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]

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]

Stephen M. Matyas,  Key Processing with Control Vectors, Journal of Cryptology, Volume 3(2), pp. 113 - 136, Springer, 1991.

[Cited 12 times ]

J. Pastor,  CRYPTOPOST - A Cryptographic Application to Mail Processing, Journal of Cryptology, Volume 3(2), pp. 137 - 146, Springer, 1991.

[Cited 19 times ]

Volume 3(1)
 
Philippe Godlewski,  Chris J. Mitchell,  Key-Minimal Cryptosystems for Unconditional Secrecy, Journal of Cryptology, Volume 3(1), pp. 1 - 25, Springer, 1990.

[Cited 9 times ]

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]

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]

Volume 2(3)
 
R. Forre,  Methods and Instruments for Designing S-Boxes, Journal of Cryptology, Volume 2(3), pp. 115 - 130, Springer, 1990.

[Cited 30 times ]

Michael Walker,  Information-Theoretic Bounds for Authentication Schemes, Journal of Cryptology, Volume 2(3), pp. 131 - 143, Springer, 1990.

[Cited 27 times ]

Sean Murphy,  The Cryptanalysis of FEAL-4 with 20 Chosen Plaintexts, Journal of Cryptology, Volume 2(3), pp. 145 - 154, Springer, 1990.

[Cited 33 times ]

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]

Volume 2(2)
 
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]

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]

Harald Niederreiter,  A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences, Journal of Cryptology, Volume 2(2), pp. 105 - 112, Springer, 1990.

[Cited 9 times ]

Volume 2(1)
 
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]

K. Nishimura,  M. Sibuya,  Probability To Meet in the Middle, Journal of Cryptology, Volume 2(1), pp. 13 - 22, Springer, 1990.

[Cited 28 times ]

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]

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]

Volume 1(3)
 
Neal Koblitz,  Hyperelliptic Cryptosystems, Journal of Cryptology, Volume 1(3), pp. 139 - 150, Springer, 1989.

[Cited 319 times Red StarRed StarRed Star]

Michael Luby,  Charles Rackoff,  A Study of Password Security, Journal of Cryptology, Volume 1(3), pp. 151 - 158, Springer, 1989.

[Cited 15 times ]

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]

Joan Boyar,  Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits, Journal of Cryptology, Volume 1(3), pp. 177 - 184, Springer, 1989.

[Cited 30 times ]

Fred Piper,  Michael Walker,  Linear Ciphers and Spreads, Journal of Cryptology, Volume 1(3), pp. 185 - 188, Springer, 1989.

[No citation]

Volume 1(2)
 
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]

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]

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]

Douglas R. Stinson,  A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs, Journal of Cryptology, Volume 1(2), pp. 119 - 127, Springer, 1988.

[Cited 38 times ]

Pierre Beauchemin,  Gilles Brassard,  A Generalization of Hellman's Extension to Shannon's Approach to Cryptography, Journal of Cryptology, Volume 1(2), pp. 129 - 131, Springer, 1988.

[Cited 11 times ]

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]

Volume 1(1)
 
Burton S. Kaliski Jr.,  Ronald L. Rivest,  Alan T. Sherman,  Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES), Journal of Cryptology, Volume 1(1), pp. 3 - 36, Springer, 1988.

[Cited 44 times ]

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]

Pierre Beauchemin,  Gilles Brassard,  Claude CrĂ©peau,  Claude Goutier,  Carl Pomerance,  The Generation of Random Numbers that Are Probably Prime, Journal of Cryptology, Volume 1(1), pp. 53 - 64, Springer, 1988.

[Cited 46 times ]

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]

 

Designs, Codes and Cryptography

 
Volume 49(1)
 
Pascale Charpin,  Tor Helleseth,  Editorial: In memory of Hans Dobbertin, Designs, Codes and Cryptography, Volume 49(1), pp. 1 - 2, Springer, 2008.

[Electronic Edition][No citation]

Hans Dobbertin,  Gregor Leander,  Bent functions embedded into the recursive framework of \mathbb, Designs, Codes and Cryptography, Volume 49(1), pp. 3 - 22, Springer, 2008.

[Electronic Edition][No citation]

Igor Semaev,  On solving sparse algebraic equations over finite fields, Designs, Codes and Cryptography, Volume 49(1), pp. 47 - 60, Springer, 2008.

[Electronic Edition][Cited 3 times ]

Ferruh Ă–zbudak,  ZĂĽlfĂĽkar Saygi,  Systematic authentication codes using additive polynomials, Designs, Codes and Cryptography, Volume 49(1), pp. 61 - 77, Springer, 2008.

[Electronic Edition][Cited 1 times ]

Sumanta Sarkar,  Subhamoy Maitra,  Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros, Designs, Codes and Cryptography, Volume 49(1), pp. 95 - 103, Springer, 2008.

[Electronic Edition][Cited 2 times ]

Goutam Paul,  Siddheshwar Rathi,  Subhamoy Maitra,  On non-negligible bias of the first output byte of RC4 towards the first three bytes of the secret key, Designs, Codes and Cryptography, Volume 49(1), pp. 123 - 134, Springer, 2008.

[Electronic Edition][Cited 7 times ]

Reza Rezaeian Farashahi,  Ruud Pellikaan,  Andrey Sidorenko,  Extractors for binary elliptic curves, Designs, Codes and Cryptography, Volume 49(1), pp. 171 - 186, Springer, 2008.

[Electronic Edition][Cited 3 times ]

Mariusz Czapski,  Maciej Nikodem,  Error detection and error correction procedures for the advanced encryption standard, Designs, Codes and Cryptography, Volume 49(1), pp. 217 - 232, Springer, 2008.

[Electronic Edition][Cited 1 times ]

Haifeng Qian,  Yuan Zhou,  Zhibin Li,  Zecheng Wang,  Bing Zhang,  Efficient public key encryption with smallest ciphertext expansion from factoring, Designs, Codes and Cryptography, Volume 49(1), pp. 233 - 249, Springer, 2008.

[Electronic Edition][No citation]

Marcus Brinkmann,  Gregor Leander,  On the classification of APN functions up to dimension five, Designs, Codes and Cryptography, Volume 49(1), pp. 273 - 288, Springer, 2008.

[Electronic Edition][Cited 8 times ]

Ryo Nojima,  Hideki Imai,  Kazukuni Kobara,  Kirill Morozov,  Semantic security for the McEliece cryptosystem without random oracles, Designs, Codes and Cryptography, Volume 49(1), pp. 289 - 305, Springer, 2008.

[Electronic Edition][Cited 5 times ]

RogĂ©rio M. Siqueira,  Sueli I. Rodrigues Costa,  Flat tori, lattices and bounds for commutative group codes, Designs, Codes and Cryptography, Volume 49(1), pp. 307 - 321, Springer, 2008.

[Electronic Edition][No citation]

RafaĂ«l Fourquet,  CĂ©dric Tavernier,  An improved list decoding algorithm for the second order Reed-Muller codes and its applications, Designs, Codes and Cryptography, Volume 49(1), pp. 323 - 340, Springer, 2008.

[Electronic Edition][Cited 1 times ]

Christian Bey,  Gohar M. M. Kyureghyan,  On Boolean functions with the sum of every two of them being bent, Designs, Codes and Cryptography, Volume 49(1), pp. 341 - 346, Springer, 2008.

[Electronic Edition][No citation]

Volume 48(3)
 
Andreas Klein,  Attacks on the RC4 stream cipher, Designs, Codes and Cryptography, Volume 48(3), pp. 269 - 286, Springer, 2008.

[Electronic Edition][Cited 13 times ]

Zheng Gong,  Xuejia Lai,  Kefei Chen,  A synthetic indifferentiability analysis of some block-cipher-based hash functions, Designs, Codes and Cryptography, Volume 48(3), pp. 293 - 305, Springer, 2008.

[Electronic Edition][Cited 2 times ]

Volume 48(2)
 
Ernst M. Gabidulin,  Attacks and counter-attacks on the GPT public key cryptosystem, Designs, Codes and Cryptography, Volume 48(2), pp. 171 - 177, Springer, 2008.

[Electronic Edition][No citation]

Volume 48(1)
 
Oded Blayer,  Tamir Tassa,  Improved versions of Tardos' fingerprinting scheme, Designs, Codes and Cryptography, Volume 48(1), pp. 79 - 103, Springer, 2008.

[Electronic Edition][Cited 3 times ]

Volume 47(1)
 
Doreen Hertel,  Alexander Pott,  Two results on maximum nonlinear functions, Designs, Codes and Cryptography, Volume 47(1), pp. 225 - 235, Springer, 2008.

[Electronic Edition][Cited 3 times ]

Volume 46(3)
 
Berkant Ustaoglu,  Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS, Designs, Codes and Cryptography, Volume 46(3), pp. 329 - 342, Springer, 2008.

[Electronic Edition][Cited 16 times ]

Nicholas Kolokotronis,  Cryptographic properties of nonlinear pseudorandom number generators, Designs, Codes and Cryptography, Volume 46(3), pp. 353 - 363, Springer, 2008.

[Electronic Edition][No citation]

Volume 46(2)
 
Boris Skoric,  Stefan Katzenbeisser,  Mehmet Utku Celik,  Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes, Designs, Codes and Cryptography, Volume 46(2), pp. 137 - 166, Springer, 2008.

[Electronic Edition][Cited 10 times ]

Volume 46(1)
 
Weiming Zhang,  Shiqu Li,  A coding problem in steganography, Designs, Codes and Cryptography, Volume 46(1), pp. 67 - 81, Springer, 2008.

[Electronic Edition][Cited 3 times ]

James A. Davis,  Laurent Poinsot,  G-Perfect nonlinear functions, Designs, Codes and Cryptography, Volume 46(1), pp. 83 - 96, Springer, 2008.

[Electronic Edition][Cited 1 times ]

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]

Volume 45(3)
 
Ki Hyoung Ko,  Jang-Won Lee,  Tony Thomas,  Towards generating secure keys for braid cryptography, Designs, Codes and Cryptography, Volume 45(3), pp. 317 - 333, Springer, 2007.

[Electronic Edition][Cited 2 times ]

Volume 45(1)
 
Susan G. Barwick,  Wen-Ai Jackson,  A sequence approach to linear perfect hash families, Designs, Codes and Cryptography, Volume 45(1), pp. 95 - 121, Springer, 2007.

[Electronic Edition][Cited 5 times ]

Volume 44(1)
 
Chris J. Mitchell,  Fred Piper,  Peter R. Wild,  ID-based cryptography using symmetric primitives, Designs, Codes and Cryptography, Volume 44(1), pp. 249 - 262, Springer, 2007.

[Electronic Edition][No citation]

Volume 43(2)
 
Aggelos Kiayias,  Moti Yung,  Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice, Designs, Codes and Cryptography, Volume 43(2), pp. 61 - 78, Springer, 2007.

[Electronic Edition][Cited 2 times ]

Wen-Ai Jackson,  Sean Murphy,  Projective aspects of the AES inversion, Designs, Codes and Cryptography, Volume 43(2), pp. 167 - 179, Springer, 2007.

[Electronic Edition][Cited 2 times ]

Volume 43(1)
 
Tetsuya Izu,  Jun Kogure,  Takeshi Koshiba,  Takeshi Shimoyama,  Low-density attack revisited, Designs, Codes and Cryptography, Volume 43(1), pp. 47 - 59, Springer, 2007.

[Electronic Edition][Cited 2 times ]

Volume 42(3)
 
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]

Maura B. Paterson,  Sequential and dynamic frameproof codes, Designs, Codes and Cryptography, Volume 42(3), pp. 317 - 326, Springer, 2007.

[Electronic Edition][Cited 1 times ]

Volume 42(2)
 
Bessie C. Hu,  Duncan S. Wong,  Zhenfeng Zhang,  Xiaotie Deng,  Certificateless signature: a new security model and an improved generic construction, Designs, Codes and Cryptography, Volume 42(2), pp. 109 - 126, Springer, 2007.

[Electronic Edition][Cited 14 times ]

Volume 42(1)
 
Peter Roelse,  The design of composite permutations with applications to DES-like S-boxes, Designs, Codes and Cryptography, Volume 42(1), pp. 21 - 42, Springer, 2007.

[Electronic Edition][No citation]

Nevine Maurice Ebeid,  M. Anwar Hasan,  On binary signed digit representations of integers, Designs, Codes and Cryptography, Volume 42(1), pp. 43 - 65, Springer, 2007.

[Electronic Edition][Cited 3 times ]

Volume 41(3)
 
Ferruh Ă–zbudak,  ZĂĽlfĂĽkar Saygi,  Some constructions of systematic authentication codes using galois rings, Designs, Codes and Cryptography, Volume 41(3), pp. 343 - 357, Springer, 2006.

[Electronic Edition][Cited 2 times ]

Volume 41(2)
 
Lihua Liu,  Hao Shen,  Explicit constructions of separating hash families from algebraic curves over finite fields, Designs, Codes and Cryptography, Volume 41(2), pp. 221 - 233, Springer, 2006.

[Electronic Edition][Cited 6 times ]

Volume 41(1)
 
Reihaneh Safavi-Naini,  Huaxiong Wang,  Secret sharing schemes with partial broadcast channels, Designs, Codes and Cryptography, Volume 41(1), pp. 5 - 22, Springer, 2006.

[Electronic Edition][No citation]

Volume 40(3)
 
Christopher Wolf,  An Braeken,  Bart Preneel,  On the security of stepwise triangular systems, Designs, Codes and Cryptography, Volume 40(3), pp. 285 - 302, Springer, 2006.

[Electronic Edition][No citation]

Volume 40(2)
 
Shoulun Long,  Josef Pieprzyk,  Huaxiong Wang,  Duncan S. Wong,  Generalised Cumulative Arrays in Secret Sharing, Designs, Codes and Cryptography, Volume 40(2), pp. 191 - 209, Springer, 2006.

[Electronic Edition][Cited 2 times ]

Mike J. Grannell,  Terry S. Griggs,  Anne Penfold Street,  A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 40(2), pp. 225 - 236, Springer, 2006.

[Electronic Edition][No citation]

Volume 40(1)
 
François Rodier,  Asymptotic Nonlinearity of Boolean Functions, Designs, Codes and Cryptography, Volume 40(1), pp. 59 - 70, Springer, 2006.

[Electronic Edition][Cited 5 times ]

Claude Carlet,  Cunsheng Ding,  Harald Niederreiter,  Authentication Schemes from Highly Nonlinear Functions, Designs, Codes and Cryptography, Volume 40(1), pp. 71 - 79, Springer, 2006.

[Electronic Edition][Cited 4 times ]

Javier Herranz,  Germán Sáez,  Distributed Ring Signatures from General Dual Access Structures, Designs, Codes and Cryptography, Volume 40(1), pp. 103 - 120, Springer, 2006.

[Electronic Edition][Cited 1 times ]

Volume 39(2)
 
Hassan Aly,  Arne Winterhof,  On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials, Designs, Codes and Cryptography, Volume 39(2), pp. 155 - 162, Springer, 2006.

[Electronic Edition][Cited 2 times ]

Mathieu Ciet,  Marc Joye,  Kristin Lauter,  Peter L. Montgomery,  Trading Inversions for Multiplications in Elliptic Curve Cryptography, Designs, Codes and Cryptography, Volume 39(2), pp. 189 - 206, Springer, 2006.

[Electronic Edition][Cited 49 times ]

Gilles Piret,  Luby-Rackoff Revisited: On the Use of Permutations as Inner Functions of a Feistel Scheme, Designs, Codes and Cryptography, Volume 39(2), pp. 233 - 245, Springer, 2006.

[Electronic Edition][Cited 3 times ]

Marten van Dijk,  Dwaine E. Clarke,  Blaise Gassend,  G. Edward Suh,  Srinivas Devadas,  Speeding up Exponentiation using an Untrusted Computational Resource, Designs, Codes and Cryptography, Volume 39(2), pp. 253 - 273, Springer, 2006.

[Electronic Edition][Cited 5 times ]

Volume 39(1)
 
Barbara Masucci,  Sharing Multiple Secrets: Models, Schemes and Analysis, Designs, Codes and Cryptography, Volume 39(1), pp. 89 - 111, Springer, 2006.

[Electronic Edition][Cited 1 times ]

Igor Shparlinski,  On RSA Moduli with Prescribed Bit Patterns, Designs, Codes and Cryptography, Volume 39(1), pp. 113 - 122, Springer, 2006.

[Electronic Edition][Cited 5 times ]

Volume 38(3)
 
Annegret Weng,  A Low-Memory Algorithm for Point Counting on Picard Curves, Designs, Codes and Cryptography, Volume 38(3), pp. 383 - 393, Springer, 2006.

[Electronic Edition][Cited 2 times ]

Benjamin Arazi,  Communication-Computation Trade-off in Executing ECDSA in a Contactless Smartcard, Designs, Codes and Cryptography, Volume 38(3), pp. 399 - 415, Springer, 2006.

[Electronic Edition][Cited 1 times ]

Volume 38(2)
 
Michael Scott,  Paulo S. L. M. Barreto,  Generating More MNT Elliptic Curves, Designs, Codes and Cryptography, Volume 38(2), pp. 209 - 217, Springer, 2006.

[Electronic Edition][Cited 45 times ]

Gwoboa Horng,  Tzungher Chen,  Du-shiau Tsai,  Cheating in Visual Cryptography, Designs, Codes and Cryptography, Volume 38(2), pp. 219 - 236, Springer, 2006.

[Electronic Edition][Cited 12 times ]

Douglas R. Stinson,  Some Observations on the Theory of Cryptographic Hash Functions, Designs, Codes and Cryptography, Volume 38(2), pp. 259 - 277, Springer, 2006.

[Electronic Edition][Cited 30 times ]

Khoongming Khoo,  Guang Gong,  Douglas R. Stinson,  A New Characterization of Semi-bent and Bent Functions on Finite Fields*, Designs, Codes and Cryptography, Volume 38(2), pp. 279 - 295, Springer, 2006.

[Electronic Edition][Cited 14 times ]

Volume 38(1)
 
Jean-SĂ©bastien Coron,  David Naccache,  Yvo Desmedt,  Andrew M. Odlyzko,  Julien P. Stern,  Index Calculation Attacks on RSA Signature and Encryption, Designs, Codes and Cryptography, Volume 38(1), pp. 41 - 53, Springer, 2006.

[Electronic Edition][Cited 2 times ]

A. Caranti,  F. Volta,  The Round Functions of Cryptosystem PGM Generate the Symmetric Group, Designs, Codes and Cryptography, Volume 38(1), pp. 147 - 155, Springer, 2006.

[Electronic Edition][Cited 1 times ]

Volume 37(3)
 
Susan G. Barwick,  Wen-Ai Jackson,  An Optimal Multisecret Threshold Scheme Construction, Designs, Codes and Cryptography, Volume 37(3), pp. 367 - 389, Springer, 2005.

[Electronic Edition][Cited 1 times ]

Claude Carlet,  Joseph L. Yucas,  Piecewise Constructions of Bent and Almost Optimal Boolean Functions, Designs, Codes and Cryptography, Volume 37(3), pp. 449 - 464, Springer, 2005.

[Electronic Edition][Cited 4 times ]

Jens-Matthias Bohli,  Rainer Steinwandt,  Maria Isabel Gonzalez Vasco,  Consuelo MartĂ­nez,  Weak Keys in , Designs, Codes and Cryptography, Volume 37(3), pp. 509 - 524, Springer, 2005.

[Electronic Edition][Cited 32 times ]

Volume 37(2)
 
Reihaneh Safavi-Naini,  Chris Charnes,  MRD Hashing, Designs, Codes and Cryptography, Volume 37(2), pp. 229 - 242, Springer, 2005.

[Electronic Edition][Cited 2 times ]

Pascale Charpin,  Enes Pasalic,  Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces, Designs, Codes and Cryptography, Volume 37(2), pp. 319 - 346, Springer, 2005.

[Electronic Edition][Cited 2 times ]

Volume 37(1)
 
Philippe Langevin,  Pascal VĂ©ron,  On the Non-linearity of Power Functions, Designs, Codes and Cryptography, Volume 37(1), pp. 31 - 43, Springer, 2005.

[Electronic Edition][Cited 7 times ]

John Malone-Lee,  Signcryption with Non-interactive Non-repudiation, Designs, Codes and Cryptography, Volume 37(1), pp. 81 - 109, Springer, 2005.

[Electronic Edition][Cited 13 times ]

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]

Pim Tuyls,  Henk D. L. Hollmann,  Jack H. van Lint,  Ludo M. G. M. Tolhuizen,  XOR-based Visual Cryptography Schemes, Designs, Codes and Cryptography, Volume 37(1), pp. 169 - 186, Springer, 2005.

[Electronic Edition][Cited 4 times ]

Volume 36(3)
 
Ezra Brown,  Bruce T. Myers,  Jerome A. Solinas,  Hyperelliptic Curves with Compact Parameters, Designs, Codes and Cryptography, Volume 36(3), pp. 245 - 261, Springer, 2005.

[Electronic Edition][Cited 1 times ]

Keith M. Martin,  Reihaneh Safavi-Naini,  Huaxiong Wang,  Peter R. Wild,  Distributing the Encryption and Decryption of a Block Cipher, Designs, Codes and Cryptography, Volume 36(3), pp. 263 - 287, Springer, 2005.

[Electronic Edition][Cited 12 times ]

Juan Manuel González Nieto,  Colin Boyd,  Ed Dawson,  A Public Key Cryptosystem Based On A Subgroup Membership Problem, Designs, Codes and Cryptography, Volume 36(3), pp. 301 - 316, Springer, 2005.

[Electronic Edition][Cited 16 times ]

Volume 36(2)
 
Philippe Langevin,  Jean-Pierre Zanotti,  Nonlinearity of Some Invariant Boolean Functions, Designs, Codes and Cryptography, Volume 36(2), pp. 131 - 146, Springer, 2005.

[Electronic Edition][Cited 3 times ]

Volume 36(1)
 
Susan G. Barwick,  Wen-Ai Jackson,  Keith M. Martin,  A General Approach to Robust Web Metering, Designs, Codes and Cryptography, Volume 36(1), pp. 5 - 27, Springer, 2005.

[Electronic Edition][Cited 2 times ]

Mathieu Ciet,  Marc Joye,  Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults, Designs, Codes and Cryptography, Volume 36(1), pp. 33 - 43, Springer, 2005.

[Electronic Edition][Cited 44 times ]

Iuon-Chang Lin,  Min-Shiang Hwang,  Chin-Chen Chang,  The General Pay-Word: A Micro-payment Scheme Based on , Designs, Codes and Cryptography, Volume 36(1), pp. 53 - 67, Springer, 2005.

[Electronic Edition][Cited 3 times ]

Jacob Löfvenberg,  Binary Fingerprinting Codes, Designs, Codes and Cryptography, Volume 36(1), pp. 69 - 81, Springer, 2005.

[Electronic Edition][Cited 2 times ]

Volume 35(3)
 
Stelvio Cimato,  Roberto De Prisco,  Alfredo De Santis,  Optimal Colored Threshold Visual Cryptography Schemes, Designs, Codes and Cryptography, Volume 35(3), pp. 311 - 335, Springer, 2005.

[Electronic Edition][Cited 13 times ]

Volume 35(2)
 
Tran van Trung,  Sosina Martirosyan,  New Constructions for IPP Codes, Designs, Codes and Cryptography, Volume 35(2), pp. 227 - 239, Springer, 2005.

[Electronic Edition][Cited 18 times ]

Volume 35(1)
 
Jovan Dj. Golic,  Philip Hawkes,  Vectorial Approach to Fast Correlation Attacks, Designs, Codes and Cryptography, Volume 35(1), pp. 5 - 19, Springer, 2005.

[Electronic Edition][Cited 5 times ]

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]

Thierry P. Berger,  Pierre Loidreau,  How to Mask the Structure of Codes for a Cryptographic Use, Designs, Codes and Cryptography, Volume 35(1), pp. 63 - 79, Springer, 2005.

[Electronic Edition][Cited 6 times ]

Volume 34(1)
 
Jaume MartĂ­-FarrĂ©,  Carles PadrĂł,  Secret Sharing Schemes with Three or Four Minimal Qualified Subsets, Designs, Codes and Cryptography, Volume 34(1), pp. 17 - 34, Springer, 2005.

[Electronic Edition][Cited 16 times ]

Volume 33(3)
 
Cunsheng Ding,  Xiaojian Tian,  Three Constructions of Authentication Codes with Perfect Secrecy, Designs, Codes and Cryptography, Volume 33(3), pp. 227 - 239, Springer, 2004.

[Electronic Edition][Cited 4 times ]

Carlo Blundo,  SebastiĂ  MartĂ­n MollevĂ­,  Barbara Masucci,  Carles PadrĂł,  A Linear Algebraic Approach to Metering Schemes, Designs, Codes and Cryptography, Volume 33(3), pp. 241 - 260, Springer, 2004.

[Electronic Edition][Cited 7 times ]

Alfred Menezes,  Nigel P. Smart,  Security of Signature Schemes in a Multi-User Setting, Designs, Codes and Cryptography, Volume 33(3), pp. 261 - 274, Springer, 2004.

[Electronic Edition][Cited 31 times ]

Volume 33(2)
 
Wilfried Meidl,  How Many Bits have to be Changed to Decrease the Linear Complexity?, Designs, Codes and Cryptography, Volume 33(2), pp. 109 - 122, Springer, 2004.

[Electronic Edition][Cited 10 times ]

Mark Goresky,  Andrew Klapper,  Periodicity and Correlation Properties of , Designs, Codes and Cryptography, Volume 33(2), pp. 123 - 148, Springer, 2004.

[Electronic Edition][Cited 3 times ]

Volume 33(1)
 
Tor Helleseth,  Johannes Mykkeltveit,  A Proof of Simmons' Conjecture, Designs, Codes and Cryptography, Volume 33(1), pp. 39 - 43, Springer, 2004.

[Electronic Edition][Cited 1 times ]

Volume 32(1)
 
Carlo Blundo,  Paolo D'Arco,  Alfredo De Santis,  Massimiliano Listo,  Design of Self-Healing Key Distribution Schemes, Designs, Codes and Cryptography, Volume 32(1), pp. 15 - 44, Springer, 2004.

[Electronic Edition][Cited 34 times ]

Alfredo De Santis,  Barbara Masucci,  Anonymous Membership Broadcast Schemes, Designs, Codes and Cryptography, Volume 32(1), pp. 135 - 151, Springer, 2004.

[Electronic Edition][Cited 2 times ]

Maria Isabel Gonzalez Vasco,  Dennis Hofheinz,  Consuelo MartĂ­nez,  Rainer Steinwandt,  On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups, Designs, Codes and Cryptography, Volume 32(1), pp. 207 - 216, Springer, 2004.

[Electronic Edition][Cited 2 times ]

X. Ma,  Ruizhong Wei,  On a Bound of Cover-Free Families, Designs, Codes and Cryptography, Volume 32(1), pp. 303 - 321, Springer, 2004.

[Electronic Edition][Cited 1 times ]

Tanya E. Seidel,  Daniel Socek,  Michal Sramka,  Parallel Symmetric Attack on NTRU using Non-Deterministic Lattice Reduction, Designs, Codes and Cryptography, Volume 32(1), pp. 369 - 379, Springer, 2004.

[Electronic Edition][Cited 5 times ]

Volume 31(3)
 
Andrew Klapper,  Jinzhong Xu,  Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes, Designs, Codes and Cryptography, Volume 31(3), pp. 227 - 250, Springer, 2004.

[Electronic Edition][Cited 18 times ]

Gloria Rinaldi,  Key Distribution Patterns Using Tangent Circle Structures, Designs, Codes and Cryptography, Volume 31(3), pp. 289 - 300, Springer, 2004.

[Electronic Edition][Cited 1 times ]

Siguna MĂĽller,  On the Computation of Square Roots in Finite Fields, Designs, Codes and Cryptography, Volume 31(3), pp. 301 - 312, Springer, 2004.

[Electronic Edition][Cited 9 times ]

Volume 31(2)
 
Ingrid Biehl,  Sachar Paulus,  Tsuyoshi Takagi,  Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders, Designs, Codes and Cryptography, Volume 31(2), pp. 99 - 123, Springer, 2004.

[Electronic Edition][Cited 16 times ]

Tran van Trung,  Sosina Martirosyan,  On a Class of Traceability Codes, Designs, Codes and Cryptography, Volume 31(2), pp. 125 - 132, Springer, 2004.

[Electronic Edition][Cited 18 times ]

Pantelimon Stanica,  Soo Hak Sung,  Boolean Functions with Five Controllable Cryptographic Properties, Designs, Codes and Cryptography, Volume 31(2), pp. 147 - 157, Springer, 2004.

[Electronic Edition][Cited 6 times ]

Volume 31(1)
 
Jovan Dj. Golic,  Renato Menicocci,  Correlation Analysis of the Alternating Step Generator, Designs, Codes and Cryptography, Volume 31(1), pp. 51 - 74, Springer, 2004.

[Electronic Edition][Cited 8 times ]

Volume 30(3)
 
Detlef HĂĽhnlein,  Michael J. Jacobson Jr.,  Damian Weber,  Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders, Designs, Codes and Cryptography, Volume 30(3), pp. 281 - 299, Springer, 2003.

[Electronic Edition][Cited 17 times ]

Volume 30(2)
 
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]

Volume 30(1)
 
Siaw-Lynn Ng,  A Representation of a Family of Secret Sharing Matroids, Designs, Codes and Cryptography, Volume 30(1), pp. 5 - 19, Springer, 2003.

[Electronic Edition][Cited 4 times ]

Shengli Liu,  Henk C. A. van Tilborg,  Marten van Dijk,  A Practical Protocol for Advantage Distillation and Information Reconciliation, Designs, Codes and Cryptography, Volume 30(1), pp. 39 - 62, Springer, 2003.

[Electronic Edition][Cited 6 times ]

Volume 28(3)
 
Mida Guillermo,  Keith M. Martin,  Christine M. O'Keefe,  Providing Anonymity in Unconditionally Secure Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 28(3), pp. 227 - 245, Springer, 2003.

[Electronic Edition][Cited 3 times ]

Volume 28(2)
 
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]

Sergei Konyagin,  Tanja Lange,  Igor Shparlinski,  Linear Complexity of the Discrete Logarithm, Designs, Codes and Cryptography, Volume 28(2), pp. 135 - 146, Springer, 2003.

[Electronic Edition][Cited 20 times ]

Sheng-Bo Xu,  Jeroen Doumen,  Henk C. A. van Tilborg,  On the Security of Digital Signature Schemes Based on Error-Correcting Codes, Designs, Codes and Cryptography, Volume 28(2), pp. 187 - 199, Springer, 2003.

[Electronic Edition][Cited 4 times ]

Volume 28(1)
 
David Pointcheval,  Guillaume Poupard,  A New NP-Complete Problem and Public-Key Identification, Designs, Codes and Cryptography, Volume 28(1), pp. 5 - 31, Springer, 2003.

[Electronic Edition][Cited 4 times ]

Xiang-dong Hou,  On Binary Resilient Functions, Designs, Codes and Cryptography, Volume 28(1), pp. 93 - 112, Springer, 2003.

[Electronic Edition][Cited 2 times ]

Volume 27(3)
 
Wen-Guey Tzeng,  Chi-Ming Hu,  A New Approach for Visual Cryptography, Designs, Codes and Cryptography, Volume 27(3), pp. 207 - 227, Springer, 2002.

[Electronic Edition][Cited 15 times ]

Sean Murphy,  Matthew J. B. Robshaw,  Key-Dependent S-Boxes and Differential Cryptanalysis, Designs, Codes and Cryptography, Volume 27(3), pp. 229 - 255, Springer, 2002.

[Electronic Edition][Cited 7 times ]

Volume 26(1)
 
Ian F. Blake,  Theodoulos Garefalakis,  On the Security of the Digital Signature Algorithm, Designs, Codes and Cryptography, Volume 26(1), pp. 87 - 96, Springer, 2002.

[Electronic Edition][Cited 3 times ]

Carlo Blundo,  Barbara Masucci,  Douglas R. Stinson,  Ruizhong Wei,  Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes, Designs, Codes and Cryptography, Volume 26(1), pp. 97 - 110, Springer, 2002.

[Electronic Edition][Cited 15 times ]

Chris Charnes,  Martin Rötteler,  Thomas Beth,  Homogeneous Bent Functions, Invariants, and Designs, Designs, Codes and Cryptography, Volume 26(1), pp. 139 - 154, Springer, 2002.

[Electronic Edition][Cited 14 times ]

Michael Drmota,  Daniel Panario,  A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem, Designs, Codes and Cryptography, Volume 26(1), pp. 229 - 241, Springer, 2002.

[Electronic Edition][Cited 8 times ]

Volume 25(3)
 
Ingrid Biehl,  Johannes Buchmann,  Safuat Hamdy,  Andreas Meyer,  A Signature Scheme Based on the Intractability of Computing Roots, Designs, Codes and Cryptography, Volume 25(3), pp. 223 - 236, Springer, 2002.

[Electronic Edition][Cited 11 times ]

Claude Carlet,  Yuriy Tarannikov,  Covering Sequences of Boolean Functions and Their Cryptographic Significance, Designs, Codes and Cryptography, Volume 25(3), pp. 263 - 279, Springer, 2002.

[Electronic Edition][Cited 11 times ]

Carles PadrĂł,  Ignacio Gracia,  SebastiĂ  MartĂ­n MollevĂ­,  Paz Morillo,  Linear Key Predistribution Schemes, Designs, Codes and Cryptography, Volume 25(3), pp. 281 - 298, Springer, 2002.

[Electronic Edition][Cited 6 times ]

Volume 25(2)
 
Sergio Cabello,  Carles PadrĂł,  Germán Sáez,  Secret Sharing Schemes with Detection of Cheaters for a General Access Structure, Designs, Codes and Cryptography, Volume 25(2), pp. 175 - 188, Springer, 2002.

[Electronic Edition][Cited 11 times ]

Jorge Guajardo,  Christof Paar,  Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes, Designs, Codes and Cryptography, Volume 25(2), pp. 207 - 216, Springer, 2002.

[Electronic Edition][Cited 49 times ]

Volume 25(1)
 
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]

Arne Winterhof,  Polynomial Interpolation of the Discrete Logarithm, Designs, Codes and Cryptography, Volume 25(1), pp. 63 - 72, Springer, 2002.

[Electronic Edition][Cited 25 times ]

Volume 24(3)
 
Carlo Blundo,  Annalisa De Bonis,  Alfredo De Santis,  Improved Schemes for Visual Cryptography, Designs, Codes and Cryptography, Volume 24(3), pp. 255 - 278, Springer, 2001.

[Electronic Edition][Cited 38 times ]

Igor Shparlinski,  Joseph H. Silverman,  On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves, Designs, Codes and Cryptography, Volume 24(3), pp. 279 - 289, Springer, 2001.

[Electronic Edition][Cited 18 times ]

Horacio Tapia-Recillas,  Gerardo Vega,  An Upper Bound on the Number of Iterations for Transforming a Boolean Function of Degree Greater or Equal Than 4 to a Function of Degree 3, Designs, Codes and Cryptography, Volume 24(3), pp. 305 - 312, Springer, 2001.

[Electronic Edition][Cited 1 times ]

Wenbo Mao,  Verifiable Partial Escrow of Integer Factors, Designs, Codes and Cryptography, Volume 24(3), pp. 327 - 342, Springer, 2001.

[Electronic Edition][Cited 2 times ]

Volume 24(1)
 
Siaw-Lynn Ng,  Michael Walker,  On the Composition of Matroids and Ideal Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 24(1), pp. 49 - 67, Springer, 2001.

[Electronic Edition][Cited 11 times ]

Volume 23(3)
 
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]

Marc Joye,  Jean-Jacques Quisquater,  Tsuyoshi Takagi,  How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves, Designs, Codes and Cryptography, Volume 23(3), pp. 297 - 316, Springer, 2001.

[Electronic Edition][Cited 1 times ]

Volume 23(2)
 
Igor Shparlinski,  On Some Properties of the Shrinking Generator, Designs, Codes and Cryptography, Volume 23(2), pp. 147 - 156, Springer, 2001.

[Electronic Edition][Cited 37 times ]

Volume 23(1)
 
Igor Shparlinski,  On the Linear Complexity of the Power Generator, Designs, Codes and Cryptography, Volume 23(1), pp. 5 - 10, Springer, 2001.

[Electronic Edition][Cited 22 times ]

Tadashi Wadayama,  Toru Hada,  Koichiro Wakasugi,  Masao Kasahara,  Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function, Designs, Codes and Cryptography, Volume 23(1), pp. 23 - 34, Springer, 2001.

[Electronic Edition][Cited 5 times ]

Andreas Enge,  The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems, Designs, Codes and Cryptography, Volume 23(1), pp. 53 - 74, Springer, 2001.

[Electronic Edition][Cited 15 times ]

Volume 22(3)
 
Renate Scheidler,  Cryptography in Quadratic Function Fields, Designs, Codes and Cryptography, Volume 22(3), pp. 239 - 264, Springer, 2001.

[Electronic Edition][Cited 7 times ]

Kaoru Kurosawa,  Satoshi Obana,  Combinatorial Bounds on Authentication Codes with Arbitration, Designs, Codes and Cryptography, Volume 22(3), pp. 265 - 281, Springer, 2001.

[Electronic Edition][Cited 16 times ]

Karl Brincat,  On the Use of RSA as a Secret Key Cryptosystem, Designs, Codes and Cryptography, Volume 22(3), pp. 317 - 329, Springer, 2001.

[Electronic Edition][Cited 4 times ]

Volume 22(2)
 
Douglas R. Stinson,  Something About All or Nothing (Transforms), Designs, Codes and Cryptography, Volume 22(2), pp. 133 - 138, Springer, 2001.

[Electronic Edition][Cited 19 times ]

Volume 22(1)
 
Satoshi Obana,  Kaoru Kurosawa,  Bounds and Combinatorial Structure of Multi-Receiver-Codes, Designs, Codes and Cryptography, Volume 22(1), pp. 47 - 63, Springer, 2001.

[Electronic Edition][No citation]

Joan Daemen,  Lars R. Knudsen,  Vincent Rijmen,  Linear Frameworks for Block Ciphers, Designs, Codes and Cryptography, Volume 22(1), pp. 65 - 87, Springer, 2001.

[Electronic Edition][Cited 16 times ]

Volume 20(3)
 
Ari Juels,  Marcus Peinado,  Hiding Cliques for Cryptographic Security, Designs, Codes and Cryptography, Volume 20(3), pp. 269 - 280, Springer, 2000.

[Electronic Edition][Cited 21 times ]

Satoshi Obana,  Kaoru Kurosawa,  Combinatorial Classification of Optimal Authentication Codes with Arbitration, Designs, Codes and Cryptography, Volume 20(3), pp. 281 - 305, Springer, 2000.

[Electronic Edition][Cited 1 times ]

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]

Volume 20(2)
 
Alper Halbutogullari,  Ă‡etin Kaya Koç,  Parallel Multiplication in using Polynomial Residue Arithmetic, Designs, Codes and Cryptography, Volume 20(2), pp. 155 - 173, Springer, 2000.

[Electronic Edition][No citation]

Jacques Patarin,  Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98, Designs, Codes and Cryptography, Volume 20(2), pp. 175 - 209, Springer, 2000.

[Electronic Edition][Cited 4 times ]

Volume 20(1)
 
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]

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]

Volume 19(2)
 
Simon Blake-Wilson,  Information Security, Mathematics, and Public-Key Cryptography, Designs, Codes and Cryptography, Volume 19(2), pp. 77 - 99, Springer, 2000.

[Electronic Edition][Cited 1 times ]

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]

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]

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]

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]

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]

Volume 19(1)
 
Xian-Mo Zhang,  Yuliang Zheng,  Hideki Imai,  Relating Differential Distribution Tables to Other Properties of of Substitution Boxes, Designs, Codes and Cryptography, Volume 19(1), pp. 45 - 63, Springer, 2000.

[Electronic Edition][Cited 11 times ]

Volume 18(1)
 
Shuhong Gao,  Jason Howell,  A General Polynomial Sieve, Designs, Codes and Cryptography, Volume 18(1), pp. 149 - 157, Springer, 1999.

[Electronic Edition][Cited 4 times ]

Volume 17(1)
 
Hans Dobbertin,  Another Proof of Kasami's Theorem, Designs, Codes and Cryptography, Volume 17(1), pp. 177 - 180, Springer, 1999.

[Electronic Edition][Cited 20 times ]

Qing Xiang,  Maximally Nonlinear Functions and Bent Functions, Designs, Codes and Cryptography, Volume 17(1), pp. 211 - 218, Springer, 1999.

[Electronic Edition][Cited 6 times ]

Volume 16(3)
 
Sebastian Egner,  Thomas Beth,  How to Play M13?, Designs, Codes and Cryptography, Volume 16(3), pp. 243 - 247, Springer, 1999.

[Electronic Edition][No citation]

John Friedlander,  Michael Larsen,  Daniel Lieman,  Igor Shparlinski,  On The Correlation of Binary Sequences, Designs, Codes and Cryptography, Volume 16(3), pp. 249 - 256, Springer, 1999.

[Electronic Edition][Cited 3 times ]

Volume 16(2)
 
Paul Camion,  Anne Canteaut,  Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography, Designs, Codes and Cryptography, Volume 16(2), pp. 121 - 149, Springer, 1999.

[Electronic Edition][Cited 18 times ]

Volume 16(1)
 
Kaoru Kurosawa,  Wakaha Ogata,  Efficient Rabin-type Digital Signature Scheme, Designs, Codes and Cryptography, Volume 16(1), pp. 53 - 64, Springer, 1999.

[Electronic Edition][Cited 12 times ]

Carles PadrĂł,  Germán Sáez,  Jorge Luis Villar,  Detection of Cheaters in Vector Space Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 16(1), pp. 75 - 85, Springer, 1999.

[Electronic Edition][Cited 25 times ]

Volume 15(3)
 
Marten van Dijk,  Wen-Ai Jackson,  Keith M. Martin,  A General Decomposition Construction for Incomplete Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 15(3), pp. 301 - 321, Springer, 1998.

[Electronic Edition][Cited 5 times ]

Volume 15(2)
 
Ross J. Anderson,  Cunsheng Ding,  Tor Helleseth,  Torleiv Kløve,  How to Build Robust Shared Control Systems, Designs, Codes and Cryptography, Volume 15(2), pp. 111 - 124, Springer, 1998.

[Electronic Edition][Cited 10 times ]

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]

Volume 15(1)
 
Christian Gehrmann,  Multiround Unconditionally Secure Authentication, Designs, Codes and Cryptography, Volume 15(1), pp. 67 - 86, Springer, 1998.

[Electronic Edition][Cited 4 times ]

Volume 14(3)
 
He Jingmin,  Ed Dawson,  Shared Secret Reconstruction, Designs, Codes and Cryptography, Volume 14(3), pp. 221 - 237, Springer, 1998.

[Electronic Edition][Cited 2 times ]

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]

Marten van Dijk,  Christian Gehrmann,  Ben J. M. Smeets,  Unconditionally Secure Group Authentication, Designs, Codes and Cryptography, Volume 14(3), pp. 281 - 296, Springer, 1998.

[Electronic Edition][Cited 6 times ]

Volume 14(2)
 
Claude Carlet,  Philippe Guillot,  An Alternate Characterization of the Bentness of Binary Functions, with Uniqueness, Designs, Codes and Cryptography, Volume 14(2), pp. 133 - 140, Springer, 1998.

[Electronic Edition][Cited 15 times ]

Volker MĂĽller,  Scott A. Vanstone,  Robert J. Zuccherato,  Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2, Designs, Codes and Cryptography, Volume 14(2), pp. 159 - 178, Springer, 1998.

[Electronic Edition][Cited 16 times ]

Volume 14(1)
 
Marc Joye,  Jean-Jacques Quisquater,  Reducing the Elliptic Curve Cryptosystem of Meyer-MĂĽuller to the Cryptosystem of Rabin-Williams, Designs, Codes and Cryptography, Volume 14(1), pp. 53 - 56, Springer, 1998.

[Electronic Edition][No citation]

Çetin Kaya Koç,  Tolga Acar,  Montgomery Multplication in GF(2, Designs, Codes and Cryptography, Volume 14(1), pp. 57 - 69, Springer, 1998.

[Electronic Edition][Cited 5 times ]

Volume 13(3)
 
J. J. Brennan,  Bruce Geist,  Analysis of Iterated Modular Exponentiation: The Orbits of x, Designs, Codes and Cryptography, Volume 13(3), pp. 229 - 245, Springer, 1998.

[Electronic Edition][Cited 15 times ]

Reihaneh Safavi-Naini,  Three Systems for Threshold Generation of Authenticators, Designs, Codes and Cryptography, Volume 13(3), pp. 299 - 312, Springer, 1998.

[Electronic Edition][No citation]

Volume 13(2)
 
L. R. A. Casse,  Keith M. Martin,  Peter R. Wild,  Bounds and Characterizations of Authentication/Secrecy Schemes, Designs, Codes and Cryptography, Volume 13(2), pp. 107 - 129, Springer, 1998.

[Electronic Edition][Cited 10 times ]

Volume 12(3)
 
Evangelos Kranakis,  Paul C. van Oorschot,  Special Issue: Selected Areas in Cryptography - Introduction, Designs, Codes and Cryptography, Volume 12(3), pp. 213 - 0, Springer, 1997.

[Electronic Edition][No citation]

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]

N. Rogier,  Pascal Chauvaud,  MD2 Is not Secure without the Checksum Byte, Designs, Codes and Cryptography, Volume 12(3), pp. 245 - 251, Springer, 1997.

[Electronic Edition][Cited 8 times ]

Vincent Rijmen,  Bart Preneel,  Erik De Win,  On Weaknesses of Non-surjective Round Functions, Designs, Codes and Cryptography, Volume 12(3), pp. 253 - 266, Springer, 1997.

[Electronic Edition][Cited 28 times ]

J. Lee,  Howard M. Heys,  Stafford E. Tavares,  Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis, Designs, Codes and Cryptography, Volume 12(3), pp. 267 - 282, Springer, 1997.

[Electronic Edition][Cited 9 times ]

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]

Volume 12(2)
 
Marten van Dijk,  A Linear Construction of Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 12(2), pp. 161 - 201, Springer, 1997.

[Electronic Edition][Cited 19 times ]

Volume 12(1)
 
Mike Burmester,  Yvo Desmedt,  Fred Piper,  Michael Walker,  A General Zero-Knowledge Scheme, Designs, Codes and Cryptography, Volume 12(1), pp. 13 - 37, Springer, 1997.

[Electronic Edition][Cited 16 times ]

Leo Storme,  Normal Rational Curves over Prime Fields, Designs, Codes and Cryptography, Volume 12(1), pp. 89 - 96, Springer, 1997.

[Electronic Edition][No citation]

Volume 11(3)
 
JĂĽrgen Bierbrauer,  Universal Hashing and Geometric Codes, Designs, Codes and Cryptography, Volume 11(3), pp. 207 - 221, Springer, 1997.

[Electronic Edition][Cited 28 times ]

Carlo Blundo,  Antonio Giorgio Gaggia,  Douglas R. Stinson,  On the Dealer's Randomness Required in Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 11(3), pp. 235 - 259, Springer, 1997.

[Electronic Edition][Cited 35 times ]

Volume 11(2)
 
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]

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]

Volume 10(3)
 
Diane Erdmann,  Sean Murphy,  An Approximate Distribution for the Maximum Order Complexity, Designs, Codes and Cryptography, Volume 10(3), pp. 325 - 339, Springer, 1997.

[Electronic Edition][Cited 7 times ]

Volume 9(3)
 
Simon R. Blackburn,  A Note on Sequences with the Shift and Add Property, Designs, Codes and Cryptography, Volume 9(3), pp. 251 - 256, Springer, 1996.

[Electronic Edition][Cited 7 times ]

Wen-Ai Jackson,  Keith M. Martin,  Perfect Secret Sharing Schemes on Five Participants, Designs, Codes and Cryptography, Volume 9(3), pp. 267 - 286, Springer, 1996.

[Electronic Edition][Cited 30 times ]

Wen-Ai Jackson,  Keith M. Martin,  Christine M. O'Keefe,  A Construction for Multisecret Threshold Schemes, Designs, Codes and Cryptography, Volume 9(3), pp. 287 - 303, Springer, 1996.

[Electronic Edition][Cited 39 times ]

Ueli M. Maurer,  Yacov Yacobi,  A Non-interactive Public-Key Distribution System, Designs, Codes and Cryptography, Volume 9(3), pp. 305 - 316, Springer, 1996.

[Electronic Edition][Cited 41 times ]

Volume 8(3)
 
Josep Domingo-Ferrer,  Achieving Rights Untransferability with Client-Independent Servers, Designs, Codes and Cryptography, Volume 8(3), pp. 263 - 271, Springer, 1996.

[Electronic Edition][Cited 3 times ]

Heeralal Janwa,  Oscar Moreno,  McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes, Designs, Codes and Cryptography, Volume 8(3), pp. 293 - 307, Springer, 1996.

[Electronic Edition][Cited 12 times ]

Volume 8(1)
 
Thomas Beth,  Designs, Codes and Crypts - A Puzzle Altogether, Designs, Codes and Cryptography, Volume 8(1), pp. 91 - 101, Springer, 1996.

[Electronic Edition][Cited 1 times ]

Volume 7(3)
 
Rolf S. Rees,  Douglas R. Stinson,  Combinatorial Characterizations of Authentication Codes II, Designs, Codes and Cryptography, Volume 7(3), pp. 239 - 259, Springer, 1996.

[Electronic Edition][Cited 22 times ]

Volume 7(1)
 
Thomas Beth,  Whitfield Diffie,  Special Issue Dedicated to Gustavus J. Simmons - Foreword to this issue, Designs, Codes and Cryptography, Volume 7(1), pp. 7 - 9, Springer, 1996.

[Electronic Edition][No citation]

Whitfield Diffie,  The National Security Establishment and the Development of Public-Key Cryptography, Designs, Codes and Cryptography, Volume 7(1), pp. 9 - 12, Springer, 1996.

[Electronic Edition][Cited 1 times ]

Mary Fischer,  ``And Now For Something Completely Different'' (The Egyptologist and the Cryptographer: A Personal Reminiscence), Designs, Codes and Cryptography, Volume 7(1), pp. 13 - 15, Springer, 1996.

[Electronic Edition][No citation]

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]

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]

Reihaneh Safavi-Naini,  L. Tombak,  Authentication Codes in Plaintext and Chosen-Content Attacks, Designs, Codes and Cryptography, Volume 7(1), pp. 83 - 99, Springer, 1996.

[Electronic Edition][Cited 3 times ]

Chris J. Mitchell,  Fred Piper,  Michael Walker,  Peter R. Wild,  Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes, Designs, Codes and Cryptography, Volume 7(1), pp. 101 - 110, Springer, 1996.

[Electronic Edition][Cited 34 times ]

Xian-Mo Zhang,  Yuliang Zheng,  Characterizing the Structures of Cryptographic Functions Satisfying the Propagation Criterion for Almost All Vectors, Designs, Codes and Cryptography, Volume 7(1), pp. 111 - 134, Springer, 1996.

[Electronic Edition][Cited 30 times ]

Dieter Gollmann,  Yongfei Han,  Chris J. Mitchell,  Redundant Integer Representations and Fast Exponentiation, Designs, Codes and Cryptography, Volume 7(1), pp. 135 - 151, Springer, 1996.

[Electronic Edition][Cited 22 times ]

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]

Volume 6(3)
 
Thomas Johansson,  Authentication Codes for Nontrusting Parties Obtained from Rank Metric Codes, Designs, Codes and Cryptography, Volume 6(3), pp. 205 - 218, Springer, 1995.

[Electronic Edition][Cited 13 times ]

Volume 6(2)
 
Renate Scheidler,  Hugh C. Williams,  A Public-Key Cryptosystem Utilizing Cyclotomic Fields, Designs, Codes and Cryptography, Volume 6(2), pp. 117 - 131, Springer, 1995.

[Electronic Edition][Cited 18 times ]

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]

Volume 6(1)
 
J. K. Gibson,  Severely Denting the Gabidulin Version of the McEliece Public Key Cryptosystem, Designs, Codes and Cryptography, Volume 6(1), pp. 37 - 45, Springer, 1995.

[Electronic Edition][Cited 22 times ]

Volume 5(3)
 
Marco Carpentieri,  A Perfect Threshold Secret Sharing Scheme to Identify Cheaters, Designs, Codes and Cryptography, Volume 5(3), pp. 183 - 187, Springer, 1995.

[Electronic Edition][Cited 46 times ]

K. Gopalakrishnan,  Douglas R. Stinson,  Three Characterizations of Non-binary Correlation-Immune and Resilient Functions, Designs, Codes and Cryptography, Volume 5(3), pp. 241 - 251, Springer, 1995.

[Electronic Edition][Cited 41 times ]

Christine M. O'Keefe,  Key Distribution Patterns Using Minkowski Planes, Designs, Codes and Cryptography, Volume 5(3), pp. 261 - 267, Springer, 1995.

[Electronic Edition][Cited 13 times ]

Tran van Trung,  On the Construction of Authentication and Secrecy Codes, Designs, Codes and Cryptography, Volume 5(3), pp. 269 - 280, Springer, 1995.

[Electronic Edition][Cited 7 times ]

Volume 5(1)
 
David Naccache,  David M'RaĂŻhi,  Dan Raphaeli,  Can Montgomery Parasites Be Avoided? A Design Methodology Based on Key and Cryptosystem Modifications, Designs, Codes and Cryptography, Volume 5(1), pp. 73 - 80, Springer, 1995.

[Electronic Edition][Cited 5 times ]

Volume 4(4)
 
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]

Gilles ZĂ©mor,  Hash Functions and Cayley Graphs, Designs, Codes and Cryptography, Volume 4(4), pp. 381 - 394, Springer, 1994.

[Electronic Edition][Cited 19 times ]

Volume 4(2)
 
Kathleen A. S. Quinn,  Some Constructions for Key Distribution Patterns, Designs, Codes and Cryptography, Volume 4(2), pp. 177 - 191, Springer, 1994.

[Electronic Edition][Cited 21 times ]

Volume 4(1)
 
Thomas Johansson,  A Shift Register Construction of Unconditionally Secure Authentication Codes, Designs, Codes and Cryptography, Volume 4(1), pp. 69 - 81, Springer, 1994.

[Electronic Edition][Cited 10 times ]

Wen-Ai Jackson,  Keith M. Martin,  Geometric Secret Sharing Schemes and Their Duals, Designs, Codes and Cryptography, Volume 4(1), pp. 83 - 95, Springer, 1994.

[Electronic Edition][Cited 44 times ]

Volume 3(3)
 
Josep RifĂ -Coma,  How to Avoid the Cheaters Succeeding in the Key Sharing Scheme, Designs, Codes and Cryptography, Volume 3(3), pp. 221 - 228, Springer, 1993.

[Electronic Edition][Cited 10 times ]

Volume 3(2)
 
Albrecht Beutelspacher,  Ferenc Wettl,  On 2-Level Secret Sharing, Designs, Codes and Cryptography, Volume 3(2), pp. 127 - 134, Springer, 1993.

[Electronic Edition][Cited 14 times ]

Claude Carlet,  Partially-Bent Functions, Designs, Codes and Cryptography, Volume 3(2), pp. 135 - 145, Springer, 1993.

[Electronic Edition][Cited 98 times Red Star]

Volume 2(4)
 
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]

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]

Volume 2(3)
 
Michael R. Fellows,  Neal Koblitz,  Self-Witnessing Polynomial-Time Complexity and Prime Factorization, Designs, Codes and Cryptography, Volume 2(3), pp. 231 - 235, Springer, 1992.

[Electronic Edition][Cited 44 times ]

K. T. Arasu,  Qing Xiang,  On the Existence of Periodic Complementary Binary Sequences, Designs, Codes and Cryptography, Volume 2(3), pp. 257 - 262, Springer, 1992.

[Electronic Edition][Cited 6 times ]

Volume 2(2)
 
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]

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]

Volume 1(4)
 
JĂĽrgen Bierbrauer,  Tran van Trung,  Some Highly Symmetric Authentication Perpendicular Arrays, Designs, Codes and Cryptography, Volume 1(4), pp. 307 - 319, Springer, 1991.

[Electronic Edition][Cited 9 times ]

Volume 1(1)
 
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]

 

IEEE Transactions on Information Theory

 
Volume 39(3)
 
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]

Volume 30(5)
 
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]

Volume 22(6)
 
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]

 

Communications of the ACM

 
Volume 28(6)
 
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]

Volume 24(2)
 
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]

Volume 22(11)
 
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]

Volume 21(2)
 
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]

 

SIAM Journal on Computing

 
Volume 17(2)
 
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]

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]

 

Journal of the ACM

 
Volume 38(3)
 
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]

Volume 33(4)
 
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]

 

Journal of Computer and System Sciences

 
Volume 61(3)
 
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]

Volume 28(2)
 
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]

 

Mathematische Annalen

 
Volume 261(4)
 
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]



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