Advances in Cryptology
EuroCrypt '88
Edited by Christof G. Günther
- Key agreements based on function composition, Rueppel, R. A.
- Security of improved identity-based conference key distribution systems, Koyama, K. and Ohta, K.
- Subliminal-free authentication and signature, Desmedt, Y.
- Zero-knowledge proofs of identity and veracity of transaction receipts, Simmons, G. J. and Purdy, G. B.
- Authentication codes with multiple arbiters, Brickell, E. F. and Stinson, D. R.
- Some constructions for authentication-secrecy codes, De Soete, M.
- Efficient zero-knowledged identification scheme for smart cards, Beth, T.
- A smart card implementation of the Fiat-Shamir identification scheme, Knobloch, H.-J.
- Manipulations and errors, detection and localization, Godlewski, P. and Camion, P.
- Privacy protected payments--realization of a protocol that guarantees payer anonymity, Knapskog, S. J.
- A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory, Guillou, L. C. and Quisquater, J. J.
- A generalized birthday attack, Girault, M.
- An interactive data exchange protocol based on discrete exponentiation, Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
- Anonymous and verifiable registration in databases, Brandt, J., Damgård, I. B. and Landrock, P.
- Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA, Chaum, D.
- Passports and Visas versus IDs, Davida, G. I. and Desmedt, Y.
- The probabilistic theory of linear complexity, Niederreiter, H.
- A probabilistic primality test based on the properties of certain generalized Lucas numbers, Di Porto, A. and Filipponi, P.
- On the construction of a random number generator and random function generators, Schnorr, C. P.
- Factorization of large integers on a massively parallel computer, Davis, J. A. and Holdridge, D. B.
- A fast modular arithmetic algorithm using a residue table, Kawamura, S. and Hirano, K.
- Fast exponentiation in GF(2n), Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
- Fast RSA-hardware: dream or reality, Hoornaert, F., Decroos, M., Vandewalle, J. and Govaerts, R.
- Properties of the Euler totient function modulo 24 and some of its cryptographic implications, Gorgui-Naguib, R. N. and Dlay, S. S.
- An observation on the security of McEliece's public-key cryptosystem, Lee, P. J. and Brickell, E. F.
- How to break Okamoto's cryptosystem by reducing lattice bases, Vallee, B., Girault, M. and Toffin, P.
- Cryptanalysis of F.E.A.L., den Boer, B.
- Fast correlation attacks on stream ciphers, Meier, W. and Staffelbach, O.
- A new class of nonlinear functions for running-key generators, Tezuks, S.
- Windmill generators: A generalization and an observation of how many there are, Smeets, B. and Chambers, W. G.
- Lock-in effect in cascades of clock-controlled shift-registers, Chambers, W. G. and Gollmann, D.
- Proof of Massey's conjectured algorithm, Ding, C.
- Linear recurring m-arrays, Lin, D. and Liu, M.
- Substantial number of cryptographic keys and its application to encryption designs, Okamoto, E.
- A measure of semiequivocation, Sgarro, A.
- Some new classes of geometric threshold schemes, De Soete, M. and Vedder, K.
- A universal algorithm for homophonic coding, Guenther, C. G.
- A new probabilistic encryption scheme, Jingmin, H. and Kaicheng, L.
- Public quadratic polynomial-tuples for efficient signature-verification and message-encryption, Matsumoto, T. and Imai, H.
- Some applications of multiple key ciphers, Boyd, C.
Copyright © 1998, Springer-Verlag.