International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings

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