Advances in Cryptology: Crypto, 90 : Proceedings

Cryptanalysis.- Differential Cryptanalysis of DES-like Cryptosystems.- A Statistical Attack of the FEAL-8 Cryptosystem.- An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications.- Protocols.- Quantum Bit Commitment and Coin Tossing Protocols.- Security with Low Communication Overhead.- Fair Computation of General Functions in Presence of Immoral Majority.- One-Way Group Actions.- Algebra and Number Theory.- Solving Large Sparse Linear Systems Over Finite Fields.- On the Computation of Discrete Logarithms in Class Groups.- Matrix Extensions of the RSA Algorithm.- Constructing Elliptic Curve Cryptosystems in Characteristic 2.- Signatures and Authentication.- Identification Tokens - or: Solving The Chess Grandmaster Problem.- Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter's Attacks.- Convertible Undeniable Signatures.- Unconditionally-Secure Digital Signatures.- Secret Sharing.- Geometric Shared Secret and/or Shared Control Schemes.- Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes.- Collective Coin Tossing Without Assumptions nor Broadcasting.- Key Distribution.- A Key Distribution "Paradox".- A Modular Approach to Key Distribution.- Hash Functions.- Structural Properties of One-Way Hash Functions.- The MD4 Message Digest Algorithm.- Zero-Knowledge.- Achieving Zero-Knowledge Robustly.- Hiding Instances in Zero-Knowledge Proof Systems.- Multi-Language Zero Knowledge Interactive Proof Systems.- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs.- Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems.- Interactive Proofs with Provable Security against Honest Verifiers.- Randomness.- On the Universality of the Next Bit Test.- A Universal Statistical Test for Random Bit Generators.- On the Impossibility of Private Key Cryptography with Weakly Random Keys.- Applications.- How to Time-Stamp a Digital Document.- How to Utilize the Randomness of Zero-Knowledge Proofs.- Fast Software Encryption Functions.- CORSAIR: A Smart Card for Public Key Cryptosystems.- Design and Analysis I.- Fast Checkers for Cryptography.- Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S..- The Redoc II Cryptosystem.- A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion.- Design and Analysis II.- A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms.- Nonlinear Parity Circuits and their Cryptographic Applications.- Cryptographic Significance of the Carry for Ciphers Based on Integer Addition.- Impromptu Talks.- Computation of Discrete Logarithms in Prime Fields.- Systolic Modular Multiplication.- Finding Four Million Large Random Primes.- The FEAL Cipher Family.- Discrete-Log With Compressible Exponents.