10. CRYPTO 1990: Santa Barbara, California, USA
Alfred Menezes, Scott A. Vanstone (Eds.): Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings. Springer 1991 Lecture Notes in Computer Science ISBN 3-540-54508-5
Cryptanalysis
- Kencheng Zeng, Chung-Huang Yang, T. R. N. Rao: An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications. 34-47
Protocols
- Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway: Security with Low Communication Overhead. 62-76
- Shafi Goldwasser, Leonid A. Levin: Fair Computation of General Functions in Presence of Immoral Majority. 77-93
Algebra and Number Theory
- Brian A. LaMacchia, Andrew M. Odlyzko: Solving Large Sparse Linear Systems over Finite Fields. 109-133
- Johannes Buchmann, Stephan Düllmann: On the Computation of Discrete Logarithms in Class Groups. 134-139
- Neal Koblitz: Constructing Elliptic Curve Cryptosystems in Characteristic 2. 156-167
Signatures and Authentication
- Thomas Beth, Yvo Desmedt: Identification Tokens - or: Solving the Chess Grandmaster Problem. 169-177
- Yvo Desmedt, Moti Yung: Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract). 177-188
- Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen: Convertible Undeniable Signatures. 189-205
Secret Sharing
- Gustavus J. Simmons: Geometric Shared Secret and/or Shared Control Schemes. 216-241
- Ernest F. Brickell, Douglas R. Stinson: Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. 242-252
Key Distribution
- Yacov Yacobi: A Key Distribution "Paradox". 268-273
Hash Functions
- Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai: Structural Properties of One-way Hash Functions. 285-302
- Ronald L. Rivest: The MD4 Message Digest Algorithm. 303-311
Zero-Knowledge
- Joe Kilian: Achieving Zero-Knowledge Robustly. 313-325
- Donald Beaver, Joan Feigenbaum, Victor Shoup: Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract). 326-338
- Alfredo De Santis, Moti Yung: Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems. 366-377
- Joe Kilian: Interactive Proofs with Provable Security Against Honest Verifiers. 378-392
Randomness
- A. W. Schrift: Adi Shamir: On the Universality of the Next Bit Test. 394-408
- Ueli M. Maurer: A Universal Statistical Test for Random Bit Generators. 409-420
- James L. McInnes, Benny Pinkas: On the Impossibility of Private Key Cryptography with Weakly Random Keys. 421-435
Applications
- Ralph C. Merkle: Fast Software Encryption Functions. 476-501
- Dominique de Waleffe, Jean-Jacques Quisquater: CORSAIR: A SMART Card for Public Key Cryptosystems. 502-513
Design and Analysis I
- Richard Cleve: Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. 530-544
- Kwangjo Kim, Tsutomu Matsumoto, Hideki Imai: A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion. 564-574
Design and Analysis II
- Paul C. van Oorschot: A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms. 576-581
- Othmar Staffelbach, Willi Meier: Cryptographic Significance of the Carry for Ciphers Based on Integer Addition. 601-614
Impromptu Talks
- Brian A. LaMacchia, Andrew M. Odlyzko: Computation of Discrete Logarithms in Prime Fields (Extended Abstract). 616-618
- Shimon Even: Systolic Modular Multiplication. 619-624
- Ronald L. Rivest: Finding Four Million Large Random Primes. 625-626
- Shoji Miyaguchi: The FEAL Cipher Family. 627-638
- Yacov Yacobi: Discrete-Log With Compressible Exponents. 639-643
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team