Advances in Cryptology - Crypto '90

Advances in Cryptology
Crypto '90

Edited by Alfred J. Menezes and Scott A. Vanstone

Differential cryptanalysis of DES-like cryptosystems (Extended abstract), Biham, E. and Shamir, A.
A statistical attack of the FEAL cryptosystem, Gilbert, H. and Chasse, G.
An improved linear syndrome algorithm in cryptanalysis with applications, Zeng, K., Yang, C. H. and Rao, T. R. N.
Quantum bit commitment and coin tossing protocols, Brassard, G. and Crépeau, C.
Security with low communication overhead (Extended abstract), Beaver, D., Feigenbaum, J., Kilian, J. and Rogaway, P.
Fair computation of general functions in presence of immoral majority, Goldwasser, S. and Levin, L.
One-way group actions, Brassard, G. and Yung, M.
Solving large sparse linear systems over finite fields, LaMacchia, B. A. and Odlyzko, A. M.
On the computation of discrete logarithms in class groups (Extended abstract), Buchmann, J. A. and Duellmann, S.
Matrix extensions of the RSA algorithm, Chuang, Chih-Chwen and Dunham, J. George
Constructing elliptic curve cryptosystems in characteristic 2, Koblitz, N.
Identification tokens -- or: Solving the chess grandmaster problem, Beth, T. and Desmedt, Y.
Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter's attacks (Extended abstract), Desmedt, Y. and Yung, M.
Convertible undeniable signatures, Boyar, J., Chaum, D., Damgård, I. B. and Pedersen, T. P.
Unconditionally Secure Digital Signatures, Chaum, D. and Roijakkers, Sandra
Geometric shared secret and/or shared control schemes, Simmons, G. J.
Some improved bounds on the information rate of perfect secret sharing schemes (Extended abstract), Brickell, E. F. and Stinson, D. R.
Collective coin tossing without assumptions nor broadcasting, Micali, S. and Rabin, T.
A key distribution "paradox", Yacobi, Y.
A modular approach to key distribution, Fumy, W. and Munzert, M.
Structural properties of one-way hash functions, Zheng, Y., Matsumoto, T. and Imai, H.
The MD4 message digest algorithm, Rivest, R. L.
Achieving zero-knowledge robustly, Kilian, J.
Hiding instances in zero-knowledge proof systems (Extended abstract), Beaver, D., Feigenbaum, J. and Shoup, V.
Multi-language zero knowledge interactive proof systems, Kurosawa, K. and Tsujii, S.
Publicly verifiable non-interactive zero-knowledge proofs, Lapidot, D. and Shamir, A.
Cryptographic applications of the non-interactive metaproof and many-prover systems (Preliminary version), De Santis, A. and Yung, M.
Interactive proofs with provable security against honest verifiers, Kilian, J.
On the universality of the next bit test, Schrift, A. W. and Shamir, A.
A universal statistical test for random bit generators, Maurer, U. M.
On the impossibility of private key cryptography with weakly random keys, McInnes, J. L. and Pinkas, B.
How to time-stamp a digital document, Haber, S. and Stornetta, W. Scott
How to utilize the randomness of zero-knowledge proofs (Extended abstract), Okamoto, T. and Ohta, K.
Fast software encryption functions, Merkle, R. C.
CORSAIR: A smart card for public key cryptosystems, De Waleffe, D. and Quisquater, J. J.
Fast checkers for cryptography, Kompella, K. and Adleman, L. M.
Complexity theoretic issues concerning block ciphers related to D.E.S., Cleve, R.
The REDOC II cryptosystem, Cusick, T. W. and Wood, M. C.
A recursive construction method of S-boxes satisfying strict avalanche criterion, Kim, K., Matsumoto, T. and Imai, H.
A comparison of practical public-key cryptosystems based on integer factorization and discrete logarithms, van Oorschot, P. C.
Nonlinear parity circuits and their cryptographic applications, Koyama, K. and Terada, R.
Cryptographic significance of the carry for ciphers based on integer addition, Staffelbach, O. and Meier, W.
Computation of discrete logarithms in prime fields (Extended abstract), LaMacchia, B. A. and Odlyzko, A. M.
Systolic modular multiplication, Even, S.
Finding four million large random primes, Rivest, R. L.
The FEAL Cipher Family, Miyaguchi, S.
Discrete-log with compressible exponents, Yacobi, Y.
Copyright © 1998, Springer-Verlag.