Advances in Cryptology
EuroCrypt '96
Edited by Ueli Maurer
- Low-exponent RSA with related messages, Coppersmith, D., Franklin, M. K., Patarin, J. and Reiter, M. K.
- Generating ElGamal signatures without knowing the secret key, Bleichenbacher, D.
- On the security of two MAC algorithms, Preneel, B. and van Oorschot, P. C.
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms, Patarin, J.
- A public key cryptosystem based on elliptic curves over Z/nZ equivalent to factoring, Meyer, B. and Mueller, V.
- Public key encryption and signature schemes based on polynominals over Zn, Schwenk, J. and Eisfeld, J.
- Multi-authority secret-ballot elections with linear work, Cramer, R., Franklin, M. K., Schoenmakers, B. and Yung, M.
- Asymmetric fingerprinting, Pfitzmann, B. and Schunter, M.
- Homomorphisms of secret sharing schemes: a tool for verifiable signature sharing, Burmester, M. V. D.
- Efficient multiplicative sharing schemes, Blackburn, S. R., Burmester, M. V. D., Desmedt, Y. and Wild, R. P.
- Equivocable oblivious transfer, Beaver, D.
- Short discreet proofs, Boyar, J. and Peralta, R.
- Designated verifier proofs and their applications, Jakobsson, M., Sako, K. and Impagliazzo, R.
- Finding a small root of a univariate modular equation, Coppersmith, D.
- New modular multiplication algorithms for fast modular exponentiation, Hong, S. M., Oh, S. Y. and Yoon, H.
- Finding a small root of a bivariate integer equation; factoring with high bits known, Coppersmith, D.
- Publicly verifiable secret sharing, Stadler, M. A.
- Optimum secret sharing scheme secure against cheating, Ogata, W. and Kurosawa, K.
- The security of the Gabidulin public key cryptosystem, Gibson, J. K.
- Non-linear approximations in linear cryptanalysis, Knudsen, L. R. and Robshaw, M. J. B.
- On the difficulty of software key escrow, Knudsen, L. R. and Pedersen, T. P.
- An efficient pseudo-random generator provably as secure as syndrome decoding, Fischer, J. B. and Stern, J.
- On the existence of secure feedback registers, Klapper, A.
- Fast low order approximation of cryptographic functions, Golic, J. D.
- Construction of t-resilient functions over a finite alphabet, Camion, P. and Canteaut, A.
- Auto-correlations and new bounds on the nonlinearity of boolean functions, Zhang, X. M. and Zheng, Y.
- Foiling birthday attacks in length-doubling transformations, Aiello, W. and Venkatesan, R.
- Session key distribution using smart cards, Shoup, V. and Rubin, A.
- On Diffie-Hellman key agreement with short exponents, van Oorschot, P. C. and Wiener, M. J.
- On the security of a practical identification scheme, Shoup, V.
- Robust threshold DSS signatures, Gennaro, R., Jarecki, S., Krawczyk, H. and Rabin, T.
- New convertible undeniable signature schemes, Damgård, I. B. and Pedersen, T. P.
- Security proofs for signature schemes, Pointcheval, D. and Stern, J.
- The exact security of digital signatures how to sign with RSA and Rabin, Bellare, M. and Rogaway, P.
Copyright © 1998, Springer-Verlag.