Advances in Cryptology
Proceedings of Crypto '84
Edited by G. R. Blakley and David Chaum
- A prototype encryption system using public key, Serpell, S. C., Brookson, C. B. and Clark, B. L.
- A public key cryptosystem and a signature scheme based on discrete logarithms, ElGamal, T.
- A public key cryptosystem based on the word problem, Wagner, N. R. and Magyarik, M. R.
- Efficient signature schemes based on polynomial equations, Ong, H., Schnorr, C. P. and Shamir, A.
- Identity-based cryptosystems and signature schemes, Shamir, A.
- A knapsack type public key cryptosystem based on arithmetic in finite fields, Chor, B. and Rivest, R. L.
- Some public key crypto-functions as intractable as factorization, Williams, H. C.
- Computing logarithms in GF(2n), Blake, I. F., Mullin, R. C. and Vanstone, S. A.
- Wyner's analog encryption scheme: results of a simulation, Kaliski, B. S.
- On rotation group and encryption of analog signals, Chen, Su-shing
- The history of book ciphers, Leighton, A. C. and Matyas, S. M.
- An update on factorization at Sandia National Laboratories, Davis, J. A. and Holdridge, D. B.
- An LSI digital encryption processor (DEP), Fairfield, R. C., Matusevich, A and Plany, J
- Efficient hardware and software implementations for the DES, Davio, M., Desmedt, Y., Goubert, J., Hoornaert, F. and Quisquater, J. J.
- Efficient hardware implementation of the DES, Hoornaert, F., Goubert, J. and Desmedt, Y.
- A self-synchronizing cascaded cipher system with dynamic control of error propagation, Proctor, N.
- Efficient and secure pseudo-random number generation, Vazirani, U. V. and Vazirani, V. V.
- An LSI random number generator (RNG), Fairfield, R. C., Mortenson, R. L. and Coulthart, K. B.
- Generalized linear threshold scheme, Kothari, S. C.
- Security of ramp schemes, Blakley, G. R. and Meadows, C.
- A fast pseudo random permutation generator with applications to cryptology, Akl, S. G. and Meijer, H.
- On the cryptographic applications of random functions, Goldreich, O., Goldwasser, S. and Micali, S.
- An efficient probabilistic public key encryption scheme which hides all partial information, Blum, M. and Goldwasser, S.
- RSA/Rabin least significant bits are 1/2 + 1/poly(log N) secure, Chor, B. and Goldreich, O.
- Information theory without the finiteness assumption, I: Cryptosystems as group-theoretic objects, Blakley, G. R.
- Cryptanalysis of ADFGVX encipherment systems, Konheim, A. G.
- Breaking iterated knapsacks, Brickell, E. F.
- Dependence of output on input in DES: small avalanche characteristics, Desmedt, Y., Quisquater, J. J. and Davio, M.
- DES has no per round linear factors, Reeds, J. A. and Manferdelli, J. L.
- A message authenticator algorithm suitable for a mainframe computer, Davies, D. W.
- Key management for secure electronic funds transfer in a retail environment, Beker, H. J. and Walker, M.
- Authentication theory/coding theory, Simmons, G. J.
- New secret codes can prevent a computerized big brother, Chaum, D.
- Fair exchange of secrets, Tedrick, T.
- Cryptoprotocols: Subscription to a public key, the secret blocking and the multi-player mental poker game, Yung, M.
- Poker protocols, Fortune, S. and Merritt, M.
- A "Paradoxical" Solution to the Signature Problem, Shafi Goldwasser
- Sequence complexity as a test for cryptographic systems, Leung, A. K. and Tavares, S. E.
- An update on quantum cryptography, Bennett, C. H. and Brassard, G.
- How to keep a secret alive: extensible partial key, key safeguarding, and threshold systems, Chaum, D.
Copyright © 1998, Springer-Verlag.