Advances in Cryptology
Crypto '86
Edited by A. M. Odlyzko
- Structure in the S-boxes of the DES, Brickell, E. F., Moore, J. H. and Purtill, M. R.
- Cycle structure of the DES with weak and semi-weak keys, Moore, J. H. and Simmons, G. J.
- Private-key algebraic-coded cryptosystems, Rao, T. R. N. and Nam, K. H.
- Some variations on RSA signatures and their security, de Jonge, W. and Chaum, D.
- Breaking the Cade cipher, James, N. S., Lidl, R. and Niederreiter, H.
- A modification of a broken public-key cipher, Cade, J. J.
- A pseudo-random bit generator based on elliptic logarithms, Kaliski, B. S.
- Two remarks concerning the Goldwasser-Micali-Rivest signature scheme, Goldreich, O.
- Public-key systems based on the difficulty of tampering (Is there a difference between DES and RSA?), Desmedt, Y. and Quisquater, J. J.
- A secure and privacy-protecting protocol for transmitting personal information between organizations, Chaum, D. and Evertse, J. H.
- How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design, Goldreich, O., Micali, S. and Wigderson, A.
- How to prove yourself: practical solutions to identification and signature problems, Fiat, A. and Shamir, A.
- Demonstrating that a public predicate can be satisfied without revealing any information about how, Chaum, D.
- Demonstrating possession of a discrete logarithm without revealing it, Chaum, D., Evertse, J. H., van de Graaf, J. and Peralta, R.
- Cryptographic capsules: a disjunctive primitive for interactive protocols, Cohen Benaloh, J.
- Zero-knowledge simulation of Boolean circuits, Brassard, G. and Crépeau, C.
- All-or-nothing disclosure of secrets, Brassard, G., Crépeau, C. and Robert, J. M.
- A zero-knowledge poker protocol that achieves confidentiality of the players' strategy or How to achieve an electronic poker face, Crépeau, C.
- Secret sharing homomorphisms: keeping shares of a secret secret, Cohen Benaloh, J.
- How to share a secret with cheaters, Tompa, M. and Woll, H.
- Smallest possible message expansion in threshold schemes, Blakley, G. R. and Dixon, R. D.
- VLSI implementation of public-key encryption algorithms, Orton, G. A., Roy, M. P., Scott, P. A., Peppard, L. E. and Tavares, S. E.
- Architectures for exponentiation in GF(2n), Beth, T., Cook, B. M. and Gollmann, D.
- Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor, Barrett, P.
- A high speed manipulation detection code, Jueneman, R. R.
- Electronic funds transfer point of sale in Australia, Gyoery, R. and Seberry, J.
- The notion of security for probabilistic cryptosystems, Micali, S., Rackoff, C. and Sloan, B.
- Large-scale randomization techniques, Wagner, N. R., Putter, P. S. and Cain, M. R.
- On the linear span of binary sequences obtained from finite geometries, Chan, A. H. and Games, R. A.
- Some constructions and bounds for authentication codes, Stinson, D. R.
- Towards a theory of software protection, Goldreich, O.
- Two observations on probabilistic primality testing, Beauchemin, P., Brassard, G., Crépeau, C. and Goutier, C.
- Public-key registration, Matyas, S. M.
- Is there an ultimate use of cryptography?, Desmedt, Y.
- Smart card, a highly reliable and portable security device, Guillou, L. C. and Ugon, M.
- THOMAS--A complete single chip RSA device, Rankine, G.
Copyright © 1998, Springer-Verlag.