Advances in Cryptology
EuroCrypt '89
Edited by Jean-Jacques Quisquater and Joos Vandewalle
- The adolescence of public-key cryptography (invited), Diffie, W.
- A secure public-key authentication scheme, Galil, Z., Haber, S. and Yung, M.
- How to improve signature schemes, Brassard, G.
- A generalization of ElGamal's public key cryptosystem, Jaburek, W. J. and Vienna, G.
- An identity-based key-exchange protocol, Guenther, C. G.
- How to keep authenticity alive in a computer network, Bauspiess, F. and Knobloch, H.-J.
- The use of fractions in public-key cryptosystems, Isselhorst, H.
- A practical protocol for large group oriented networks, Frankel, Y.
- Counting functions satisfying a higher order strict avalanche criterion, Lloyd, S.
- A key distribution system based on any one-way function (extended abstract), Davida, G. I., Desmedt, Y. and Peralta, R.
- Non-linearity of exponent permutations, Pieprzyk, J.
- Informational divergence bounds for authentication codes, Sgarro, A.
- 2n-BIT hash-functions using n-BIT symmetric block cipher algorithms, Quisquater, J. J. and Girault, M.
- A simple technique for diffusing cryptoperiods, Mjoelsnes, S. F.
- A general zero-knowledge scheme, Burmester, M. V. D., Desmedt, Y., Piper, F. and Walker, M.
- Divertible zero knowledge interactive proofs and commutative random self-reducibility, Okamoto, T. and Ohta, K.
- Verifiable disclose for secrets and applications (abstract), Crépeau, C.
- Practical zero-knowledge proofs: Giving hints and using deficiencies, Boyar, J., Friedl, K. and Lund, C.
- An alternative to the Fiat-Shamir protocol, Stern, J.
- Sorting out zero-knowledge, Brassard, G. and Crépeau, C.
- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract), Brassard, G., Crépeau, C. and Yung, M.
- Zero-knowledge proofs of computational power (extended summary), Yung, M.
- More efficient match-making and satisfiability, den Boer, B.
- A single chip 1024 bits RSA processor, Vandemeulebroecke, A., Vanzieleghem, E., Jespers, P. G. A. and Denayer, T.
- Cryptel---the practical protection of an existing electronic mail system, Cnudde, H.
- Technical security: The starting point, Van Auseloos, J.
- Security in open distributed processing, Siuda, C.
- A European call for cryptographic algorithms: RIPE; Race Integrity Primitives Evaluation, Vandewalle, J., Chaum, D., Fumy, W., Jansen, C. J. A., Landrock, P. and Roelofsen, G.
- Legal requirements facing new signature technology (invited), Antoine, M., Brakeland, Jean-Franc, Eloy, M. and Poullet, Y.
- Online cash checks, Chaum, D.
- Efficient offline electronic checks (extended abstract), Chaum, D., den Boer, B., van Heyst, E., Mjoelsnes, S. F. and Steenbeek, A.
- Unconditional sender and recipient untraceability in spite of active attacks, Waidner, M.
- Detection of disrupters in the DC protocol, Bos, J. N. E. and den Boer, B.
- Random mapping statistics (invited), Flajolet, P. and Odlyzko, A. M.
- Factoring by electronic mail, Lenstra, A. K. and Manasse, M. S.
- Cryptanalysis of short RSA secret exponents, Wiener, M. J.
- How to break the direct RSA-implementation of MIXes, Pfitzmann, B. and Pfitzmann, A.
- An information-theoretic treatment of homophonic substitution, Jendal, H. N., Kuhn, Y. J. B. and Massey, J. L.
- Cryptanalysis of a modified rotor machine, Wichmann, P.
- Cryptanalysis of video encryption based on space-filling curves, Bertilsson, M., Brickell, E. F. and Ingemarsson, I.
- Impossibility and optimally results on constructing pseudorandom permutations (extended abstract), Zheng, Y., Matsumoto, T. and Imai, H.
- On the security of Schnorr's pseudo random generator, Rueppel, R. A.
- How easy is collision search? Application to DES, Quisquater, J. J. and Delescaille, J. P.
- Prepositioned shared secret and/or shared control schemes (invited), Simmons, G. J.
- Some ideal secret sharing schemes, Brickell, E. F.
- Cartesian authentication schemes, De Soete, M., Vedder, K. and Walker, M.
- How to say "no", Beutelspacher, A.
- Key minimal authentication systems for unconditional secrecy, Godlewski, P. and Mitchell, C.
- Parallel generation of recurring sequences, Guenther, C. G.
- Keystream sequences with a good linear complexity profile for every starting point, Niederreiter, H.
- On the Complexity of Pseudo-Random Sequences - or: If you Can Describe a Sequence It Can't be Random, Beth, T. and Dai, Z.
- Feedforward functions defined by de Brujin sequences, Dai, Z. and Zeng, K.
- Nonlinearity criteria for cryptographic functions, Meier, W. and Staffelbach, O.
- On the linear complexity of feedback registers (extended abstract), Chan, A. H., Goresky, M. and Klapper, A.
- Linear complexity profiles and continued fractions, Wang, M.
- A fast correlation attack on nonlinearly feed-forward filtered shift-register sequences, Forre, R.
- On the complexity and efficiency of a new key exchange system, Buchmann, J. A., Duellmann, S. and Williams, H. C.
- A new multiple key cipher and an improved voting scheme, Boyd, C.
- Atkin's test: News from the front, Morain, F.
- Fast generation of secure RSA-moduli with almost maximal diversity, Maurer, U. M.
- Deciphering bronze age scripts of Crete. The case of Linear A (invited), Duhoux, Y.
- Faster primality testing (extended abstract), Bosma, W. and van der Hulst, M. P.
- Private-key algebraic-code cryptosystems with high information rates, Hwang, T. and Rao, T. R. N.
- Zero-knowledge procedures for confidential access to medical records, Quisquater, J. J. and Bouckaert, A.
- Full secure key exchange and authentication with no previously shared secrets, Domingo-Ferrer, J. and Huguet i Rotger, L.
- Varying feedback shift registers, Roggeman, Y.
- A cryptanalysis of Stepk,m-cascades, Gollmann, D. and Chambers, W. G.
- Efficient identification and signatures for smart cards, Schnorr, C. P.
- The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability, Waidner, M. and Pfitzmann, B.
- Some conditions on the linear complexity profiles of certain binary sequences, Carter, G.
- On the design of permutation P in DES type cryptosystems, Brown, L. and Seberry, J.
- A fast elliptic curve cryptosystem, Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
Copyright © 1998, Springer-Verlag.