Advances in Cryptology
EuroCrypt '90
Edited by Ivan B. Damgård
- All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions (extended abstract), Burmester, M. V. D. and Desmedt, Y.
- On the importance of memory resources in the security of key exchange protocols (extended abstract), Davida, G. I., Desmedt, Y. and Peralta, R.
- Provably secure key-updating schemes in identity-based systems, Shinozaki, S., Itoh, T., Fujioka, A. and Tsujii, S.
- Oblivious transfer protecting secrecy, den Boer, B.
- Public-randomness in public-key cryptography (extended abstract), De Santis, A. and Persiano, G.
- An interactive identification scheme based on discrete logarithms and factoring (extended abstract), Brickell, E. F. and McCurley, K. S.
- Factoring with two large primes (extended abstract), Lenstra, A. K. and Manasse, M. S.
- Which new RSA signatures can be computed from some given RSA signatures? (extended abstract), Evertse, J. H. and van Heyst, E.
- Implementation of a key exchange protocol using real quadratic fields (extended abstract), Scheidler, R., Buchmann, J. A. and Williams, H. C.
- Distributed primality proving and the primality of (23539+1)/3, Morain, F.
- Properties of binary functions, Lloyd, S.
- How to construct pseudorandom permutations from single pseudorandom functions, Pieprzyk, J.
- Constructions of bent functions and difference sets, Nyberg, K.
- Propagation characteristics of Boolean functions, Preneel, B., Van Leekwijck, W., Van Linden, L., Govaerts, R. and Vandewalle, J.
- The linear complexity profile and the jump complexity of keystream sequences, Niederreiter, H.
- Lower bounds for the linear complexity of sequences over residue rings, Dai, Z., Beth, T. and Gollmann, D.
- On the construction of run permuted sequences, Jansen, C. J. A.
- Correlation properties of combiners with memory in stream ciphers (extended abstract), Meier, W. and Staffelbach, O.
- Correlation functions of geometric sequences, Chan, A. H., Goresky, M. and Klapper, A.
- Exponentiating faster with addition chains, Yacobi, Y.
- A cryptographic library for the Motorola DSP 56000, Dusse, S. R. and Kaliski, B. S.
- VICTOR - an efficient RSA hardware implementation, Orup, H., Svendsen, E. and Andreasen, E.
- Experimental quantum cryptography, Bennett, C. H., Bessette, F., Brassard, G., Salvail, L. and Smolin, J.
- A protocol to set up shared secret schemes without the assistance of mutually trusted party, Ingemarsson, I. and Simmons, G. J.
- Lower bounds for authentication codes with splitting, Sgarro, A.
- Essentially l-fold secure authentication systems, Beutelspacher, A. and Rosenbaum, U.
- On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L>=2, Smeets, B., Vanroose, P. and Wan, Z.
- Cryptanalysis of a public-key cryptosystem based on approximations by rational numbers, Stern, J. and Toffin, P.
- A known-plaintext attack on two-key triple encryption, van Oorschot, P. C. and Wiener, M. J.
- Confirmation that some hash functions are not collision free, Miyaguchi, S., Ohta, K. and Iwata, M.
- Inverting the pseudo exponentiation, Bauspiess, F., Knobloch, H.-J. and Wichmann, P.
- Cryptosystem for group oriented cryptography, Hwang, T.
- A provably-secure strongly-randomized cipher, Maurer, U. M.
- General public key residue cryptosystems and mental poker protocols, Kurosawa, K., Katayama, Y., Ogata, W. and Tsujii, S.
- A proposal for a new block encryption standard, Lai, X. and Massey, J. L.
- A new trapdoor in knapsacks, Niemi, V.
- On the design of provably-secure cryptographic hash functions, De Santis, A. and Yung, M.
- Fast signature generation with a Fiat Shamir - like scheme, Ong, H. and Schnorr, C. P.
- A remark on signature scheme where forgery can be proved, Bleumer, G., Pfitzmann, B. and Waidner, M.
- Membership authentication for hierarchical multigroups using the extended Fiat-Shamir scheme, Ohta, K., Okamoto, T. and Koyama, K.
- Zero-knowledge undeniable signatures (extended abstract), Chaum, D.
- Precautions taken against various potential attacks in ISO/IEC DIS 9796, Guillou, L. C., Quisquater, J. J., Walker, M., Landrock, P. and Shaer, C.
- Software run-time protection: A cryptographic issue, Domingo-Ferrer, J.
- An identity-based identification scheme based on discrete logarithms modulo a composite number, Girault, M.
- A noisy clock-controlled shift register cryptanalysis concept based on sequence comparison approach, Golic, J. D. and Mihaljevic, M. J.
- The MD4 message digest algorithm, Kaliski, B. S.
- A remark on efficiency of identification schemes, Burmester, M. V. D.
- On an implementation of the Mohan-Adiga algorithm, Meister, G.
Copyright © 1998, Springer-Verlag.