Advances in Cryptology-CRYPT0’ 90: Proceedings

Eli Biham, Adi Shamir (auth.), Alfred J. Menezes, Scott A. Vanstone (eds.)3540545085, 9783540545088

Crypto ’90 marked the tenth anniversary of the Crypto conferences held at the University of California at Santa Barbara. The conference was held from August 11 to August 15, 1990 and was sponsored by the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Department of Computer Science of the University of California at Santa Barbara. 227 participants from twenty countries around the world. Crypto ’90 attracted Roughly 35% of attendees were from academia, 45% from industry and 20% from government. The program was intended to provide a balance between the purely theoretical and the purely practical aspects of cryptography to meet the needs and diversified interests of these various groups. The overall organization of the conference was superbly handled by the general chairperson Sherry McMahan. All of the outstanding features of Crypto, which we have come to expect over the years, were again present and, in addition to all of this, she did a magnificent job in the preparation of the book of abstracts. This is a crucial part of the program and we owe her a great deal of thanks.

---

Table of contents :
Differential Cryptanalysis of DES-like Cryptosystems….Pages 2-21
A Statistical Attack of the FEAL-8 Cryptosystem….Pages 22-33
An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications….Pages 34-47
Quantum Bit Commitment and Coin Tossing Protocols….Pages 49-61
Security with Low Communication Overhead….Pages 62-76
Fair Computation of General Functions in Presence of Immoral Majority….Pages 77-93
One-Way Group Actions….Pages 94-107
Solving Large Sparse Linear Systems Over Finite Fields….Pages 109-133
On the Computation of Discrete Logarithms in Class Groups….Pages 134-139
Matrix Extensions of the RSA Algorithm….Pages 140-155
Constructing Elliptic Curve Cryptosystems in Characteristic 2….Pages 156-167
Identification Tokens — or: Solving The Chess Grandmaster Problem….Pages 169-176
Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s Attacks….Pages 177-188
Convertible Undeniable Signatures….Pages 189-205
Unconditionally-Secure Digital Signatures….Pages 206-214
Geometric Shared Secret and/or Shared Control Schemes….Pages 216-241
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes….Pages 242-252
Collective Coin Tossing Without Assumptions nor Broadcasting….Pages 253-266
A Key Distribution “Paradox”….Pages 268-273
A Modular Approach to Key Distribution….Pages 274-283
Structural Properties of One-Way Hash Functions….Pages 285-302
The MD4 Message Digest Algorithm….Pages 303-311
Achieving Zero-Knowledge Robustly….Pages 313-325
Hiding Instances in Zero-Knowledge Proof Systems….Pages 326-338
Multi-Language Zero Knowledge Interactive Proof Systems….Pages 339-352
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs….Pages 353-365
Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems….Pages 366-377
Interactive Proofs with Provable Security against Honest Verifiers….Pages 378-392
On the Universality of the Next Bit Test….Pages 394-408
A Universal Statistical Test for Random Bit Generators….Pages 409-420
On the Impossibility of Private Key Cryptography with Weakly Random Keys….Pages 421-435
How to Time-Stamp a Digital Document….Pages 437-455
How to Utilize the Randomness of Zero-Knowledge Proofs….Pages 456-475
Fast Software Encryption Functions….Pages 477-501
CORSAIR: A Smart Card for Public Key Cryptosystems….Pages 503-513
Fast Checkers for Cryptography….Pages 515-529
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S…..Pages 531-544
The Redoc II Cryptosystem….Pages 546-563
A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion….Pages 565-574
A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms….Pages 577-581
Nonlinear Parity Circuits and their Cryptographic Applications….Pages 583-600
Cryptographic Significance of the Carry for Ciphers Based on Integer Addition….Pages 602-614
Computation of Discrete Logarithms in Prime Fields….Pages 617-618
Systolic Modular Multiplication….Pages 620-624
Finding Four Million Large Random Primes….Pages 625-625
The FEAL Cipher Family….Pages 628-638
Discrete-Log With Compressible Exponents….Pages 640-643