Advances in Cryptology
Crypto '88
Edited by Shafi Goldwasser
- Weakening security assumptions and oblivious transfer, Crépeau, C. and Kilian, J.
- Limits on the provable consequences of one-way permutations (invited talk), Impagliazzo, R. and Rudich, S.
- Generalized secret sharing and monotone functions, Benaloh, J. and Leichter, J.
- Everything provable is provable in zero-knowledge, Ben-Or, M., Goldreich, O., Goldwasser, S., Hastad, J., Kilian, J., Micali, S. and Rogaway, P.
- A perfect zero-knowledge proof for a problem equivalent to discrete logarithm, Goldreich, O. and Kushilevitz, E.
- Zero-knowledge with finite state verifiers (invited talk), Dwork, C. and Stockmeyer, L.
- Intractable problems in number theory (invited talk), Bach, E.
- A family of Jacobians suitable for discrete log cryptosystems, Koblitz, N.
- Computation of approximate L-th roots modulo n and application to cryptography, Girault, M., Toffin, P. and Vallee, B.
- On the McEliece public-key cryptosystem, van Tilburg, J.
- A constraint satisfaction algorithm for the automated decryption of simple substitution ciphers, Lucks, M.
- On the existence of pseudorandom generators, Goldreich, O., Krawczyk, H. and Luby, M.
- On the randomness of Legendre and Jacobi sequences, Damgård, I. B.
- Efficient, perfect random number generators, Micali, S. and Schnorr, C. P.
- How to sign given any trapdoor function, Bellare, M. and Micali, S.
- A "paradoxical" identity-based signature scheme resulting from zero-knowledge, Guillou, L. C. and Quisquater, J. J.
- A modification of the Fiat-Shamir scheme, Ohta, K. and Okamoto, T.
- An improvement of the Fiat-Shamir identification and signature scheme, Micali, S. and Shamir, A.
- A basic theory of public and private cryptosystems (invited talk), Rackoff, C.
- Proving security against chosen cyphertext attacks, Blum, M., Feldman, P. and Micali, S.
- Non-interactive zero-knowledge with preprocessing, De Santis, A., Micali, S. and Persiano, G.
- The noisy oracle problem, Feige, U., Shamir, A. and Tennenholtz, M.
- On generating solved instances of computational problems, Abadi, M., Allender, E., Broder, A., Feigenbaum, J. and Hemachandra, L. A.
- Bounds and Constructions for Authentication-Secrecy Codes with Splitting, De Soete, M.
- Untraceable electronic cash, Chaum, D., Fiat, A. and Naor, M.
- Payment systems and credential mechanisms with provable security against abuse by individuals, Damgård, I. B.
- A universal problem in secure and verifiable distributed computation, Huang, M. and Teng, S. H.
- An abstract theory of computer viruses (invited talk), Adleman, L. M.
- Abuses in cryptography and how to fight them, Desmedt, Y.
- How to (really) share a secret, Simmons, G. J.
- The strict avalanche criterion: spectral properties of boolean functions and an extended definition, Forre, R.
- On the linear syndrome method in cryptoanalysis, Zeng, K. and Huang, M.
- Aperiodic linear complexities of de Bruijn sequences, Kwok, R. T. C. and Beale, M.
- The application of smart cards for RSA digital signatures in a network comprising both interactive and store-and-forward facilities, Sherwood, J. R. and Gallo, V. A.
- Speeding up secret computations with insecure auxiliary devices, Matsumoto, T., Kato, K. and Imai, H.
- Developing Ethernet Enhanced-Security System, Herbison, B. J.
- A secure audio teleconference system, Steer, D. G., Strawczynski, L., Diffie, W. and Wiener, M. J.
- Diffie-Hellman is as strong as discrete log for certain primes, den Boer, B.
- Secret error-correcting codes (SECC), Hwang, T. and Rao, T. R. N.
- The detection of cheaters in threshold schemes, Brickell, E. F. and Stinson, D. R.
- On the power of 1-way functions, Kurtz, S. A., Mahaney, S. R. and Royer, J. S.
- "Practical IP" < MA, Brassard, G. and Damgård, I. B.
- Zero-knowledge authentication scheme with secret key exchange, Brandt, J., Damgård, I. B., Landrock, P. and Pedersen, T. P.
Copyright © 1998, Springer-Verlag.