CRYPTO 1990 |
|
|---|---|
[Sort by page number] [Sort by citations count] | |
  | Alfred Menezes, Scott A. Vanstone, editors, Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings. Springer, 1991. ISBN 3-540-54508-5. [Papers] Find this book on amazon.com  , amazon.co.uk , amazon.ca , amazon.de , amazon.fr , Google Books or Wikipedia. |
| Eli Biham, Adi Shamir, Differential Cryptanalysis of DES-like Cryptosystems, pp. 2 - 21, CRYPTO 1990. [  Electronic
Edition][ Cited
1262 times
 ] | |
| Henri Gilbert, Guy Chassé, A Statistical Attack of the FEAL-8 Cryptosystem, pp. 22 - 33, CRYPTO 1990. [ Electronic
Edition][Cited
30 times
] | |
| Kencheng Zeng, Chung-Huang Yang, T. R. N. Rao, An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications, pp. 34 - 47, CRYPTO 1990. [ Electronic
Edition][Cited
46 times
] | |
| Gilles Brassard, Claude Crépeau, Quantum Bit Commitment and Coin Tossing Protocols, pp. 49 - 61, CRYPTO 1990. [ Electronic
Edition][Cited
51 times
] | |
| Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway, Security with Low Communication Overhead, pp. 62 - 76, CRYPTO 1990. [ Electronic
Edition][Cited
89 times
] | |
| Shafi Goldwasser, Leonid A. Levin, Fair Computation of General Functions in Presence of Immoral Majority, pp. 77 - 93, CRYPTO 1990. [ Electronic
Edition][Cited
251 times
] | |
| Gilles Brassard, Moti Yung, One-Way Group Actions, pp. 94 - 107, CRYPTO 1990. [ Electronic
Edition][Cited
15 times
] | |
| Brian A. LaMacchia, Andrew M. Odlyzko, Solving Large Sparse Linear Systems over Finite Fields, pp. 109 - 133, CRYPTO 1990. [ Electronic
Edition][Cited
133 times
] | |
| Johannes Buchmann, Stephan Düllmann, On the Computation of Discrete Logarithms in Class Groups, pp. 134 - 139, CRYPTO 1990. [ Electronic
Edition][Cited
20 times
] | |
| Chih-Chwen Chuang, James George Dunham, Matrix Extensions of the RSA Algorithm, pp. 140 - 155, CRYPTO 1990. [ Electronic
Edition][Cited
4 times
] | |
| Neal Koblitz, Constructing Elliptic Curve Cryptosystems in Characteristic 2, pp. 156 - 167, CRYPTO 1990. [ Electronic
Edition][Cited
48 times
] | |
| Thomas Beth, Yvo Desmedt, Identification Tokens - or: Solving the Chess Grandmaster Problem, pp. 169 - 177, CRYPTO 1990. [ Electronic
Edition][Cited
57 times
] | |
| Yvo Desmedt, Moti Yung, Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract), pp. 177 - 188, CRYPTO 1990. [ Electronic
Edition][Cited
27 times
] | |
| Joan Boyar, David Chaum, Ivan Damgard, Torben P. Pedersen, Convertible Undeniable Signatures, pp. 189 - 205, CRYPTO 1990. [ Electronic
Edition][Cited
175 times
] | |
| David Chaum, Sandra Roijakkers, Unconditionally Secure Digital Signatures, pp. 206 - 214, CRYPTO 1990. [ Electronic
Edition][Cited
36 times
] | |
| Gustavus J. Simmons, Geometric Shared Secret and/or Shared Control Schemes, pp. 216 - 241, CRYPTO 1990. [ Electronic
Edition][Cited
17 times
] | |
| Ernest F. Brickell, Douglas R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, pp. 242 - 252, CRYPTO 1990. [ Electronic
Edition][Cited
131 times
] | |
| Silvio Micali, Tal Rabin, Collective Coin Tossing Without Assumptions nor Broadcasting, pp. 253 - 266, CRYPTO 1990. [ Electronic
Edition][Cited
13 times
] | |
| Yacov Yacobi, A Key Distribution "Paradox", pp. 268 - 273, CRYPTO 1990. [ Electronic
Edition][Cited
37 times
] | |
| Walter Fumy, Michael Munzert, A Modular Approach to Key Distribution, pp. 274 - 283, CRYPTO 1990. [ Electronic
Edition][Cited
14 times
] | |
| Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai, Structural Properties of One-way Hash Functions, pp. 285 - 302, CRYPTO 1990. [ Electronic
Edition][Cited
30 times
] | |
| Ronald L. Rivest, The MD4 Message Digest Algorithm, pp. 303 - 311, CRYPTO 1990. [ Electronic
Edition][Cited
3564 times
] | |
| Joe Kilian, Achieving Zero-Knowledge Robustly, pp. 313 - 325, CRYPTO 1990. [ Electronic
Edition][Cited
5 times
] | |
| Donald Beaver, Joan Feigenbaum, Victor Shoup, Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract), pp. 326 - 338, CRYPTO 1990. [ Electronic
Edition][Cited
24 times
] | |
| Kaoru Kurosawa, Shigeo Tsujii, Multi-Language Zero Knowledge Interactive Proof Systems, pp. 339 - 352, CRYPTO 1990. [ Electronic
Edition][Cited
3 times
] | |
| Dror Lapidot, Adi Shamir, Publicly Verifiable Non-Interactive Zero-Knowledge Proofs, pp. 353 - 365, CRYPTO 1990. [ Electronic
Edition][Cited
20 times
] | |
| Alfredo De Santis, Moti Yung, Cryptographic Applications of the Non-Interactive Metaproof and Many-Prover Systems, pp. 366 - 377, CRYPTO 1990. [ Electronic
Edition][Cited
14 times
] | |
| Joe Kilian, Interactive Proofs with Provable Security Against Honest Verifiers, pp. 378 - 392, CRYPTO 1990. [ Electronic
Edition][Cited
2 times
] | |
| A. W. Schrift, Adi Shamir, On the Universality of the Next Bit Test, pp. 394 - 408, CRYPTO 1990. [ Electronic
Edition][Cited
15 times
] | |
| Ueli M. Maurer, A Universal Statistical Test for Random Bit Generators, pp. 409 - 420, CRYPTO 1990. [ Electronic
Edition][Cited
204 times
] | |
| James L. McInnes, Benny Pinkas, On the Impossibility of Private Key Cryptography with Weakly Random Keys, pp. 421 - 435, CRYPTO 1990. [ Electronic
Edition][Cited
20 times
] | |
| Stuart Haber, W. Scott Stornetta, How to Time-Stamp a Digital Document, pp. 437 - 455, CRYPTO 1990. [ Electronic
Edition][Cited
421 times
] | |
| Tatsuaki Okamoto, Kazuo Ohta, How to Utilize the Randomness of Zero-Knowledge Proofs, pp. 456 - 475, CRYPTO 1990. [ Electronic
Edition][Cited
25 times
] | |
| Ralph C. Merkle, Fast Software Encryption Functions, pp. 476 - 501, CRYPTO 1990. [ Electronic
Edition][Cited
90 times
] | |
| Dominique de Waleffe, Jean-Jacques Quisquater, CORSAIR: A SMART Card for Public Key Cryptosystems, pp. 502 - 513, CRYPTO 1990. [ Electronic
Edition][Cited
20 times
] | |
| Kireeti Kompella, Leonard M. Adleman, Fast Checkers for Cryptography, pp. 515 - 529, CRYPTO 1990. [ Electronic
Edition][Cited
5 times
] | |
| Richard Cleve, Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S, pp. 530 - 544, CRYPTO 1990. [ Electronic
Edition][Cited
2 times
] | |
| Thomas W. Cusick, Michael C. Wood, The REDOC II Cryptosystem, pp. 545 - 563, CRYPTO 1990. [ Electronic
Edition][Cited
27 times
] | |
| Kwangjo Kim, Tsutomu Matsumoto, Hideki Imai, A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion, pp. 564 - 574, CRYPTO 1990. [ Electronic
Edition][Cited
10 times
] | |
| Paul C. van Oorschot, A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms, pp. 576 - 581, CRYPTO 1990. [ Electronic
Edition][Cited
26 times
] | |
| Kenji Koyama, Routo Terada, Nonlinear Parity Circuits and their Cryptographic Applications, pp. 582 - 600, CRYPTO 1990. [ Electronic
Edition][Cited
4 times
] | |
| Othmar Staffelbach, Willi Meier, Cryptographic Significance of the Carry for Ciphers Based on Integer Addition, pp. 601 - 614, CRYPTO 1990. [ Electronic
Edition][Cited
26 times
] | |
| Brian A. LaMacchia, Andrew M. Odlyzko, Computation of Discrete Logarithms in Prime Fields (Extended Abstract), pp. 616 - 618, CRYPTO 1990. [ Electronic
Edition][No
citation] | |
| Shimon Even, Systolic Modular Multiplication, pp. 619 - 624, CRYPTO 1990. [ Electronic
Edition][Cited
24 times
] | |
| Ronald L. Rivest, Finding Four Million Large Random Primes, pp. 625 - 626, CRYPTO 1990. [ Electronic
Edition][Cited
19 times
] | |
| Shoji Miyaguchi, The FEAL Cipher Family, pp. 627 - 638, CRYPTO 1990. [ Electronic
Edition][Cited
63 times
] | |
| Yacov Yacobi, Discrete-Log With Compressible Exponents, pp. 639 - 643, CRYPTO 1990. [ Electronic
Edition][Cited
16 times
] | |
|
3755 authors, 5428 conference papers from 177 conference proceedings, 559 journal papers from 8 journals | |
