Preliminary Eurocrypt '96 program
The following papers have been accepted for presentation at
Eurocrypt '96, Zaragoza, Spain, May 12-16, 1996. A formal program is being
put together and will appear here at a later date.
- Finding a small root of a univariate modular equation
- D. Coppersmith
- Publicly verifiable secret sharing
- M. Stadler
- Finding a small root of a bivariate integer equation; factoring with high bits known
- D. Coppersmith
- New convertible undeniable signature schemes
- I. Damgard, T. Pedersen
- Multi-authority secret ballot elections with linear work
- R. Cramer, M. Franklin, M. Yung, B. Schoenmakers
- A public key cryptosystem based on elliptic curves over Z/nZ equivalent to factoring
- B. Meyer, V. Mueller
- The security of the Gabidulin public key cryptosystem
- K. Gibson
- On the security of a practical identification scheme
- V. Shoup
- Session key distribution using smart cards
- V. Shoup, A. Rubin
- Public key encryption and signature schemes based on polynominals modulo n
- J. Schwenk, J. Eisfeld
- Optimum secret sharing scheme against cheating
- W. Ogata, K. Kurosawa
- Hidden fields algorithm (HFA): a new asymmetric algorithm for encryption, signatures and authentication
- J. Patarin
- Fast low order approximation of cryptographic functions
- J. Golic
- Security proofs for signatures
- D. Pointcheval, J. Stern
- An efficient pseudo-random generator provably as secure as syndrome decoding
- J.-B. Fischer, J. Stern
- Construction of t-resilient functions over a finite alphabet
- P. Camion, A. Canteaut
- Homomorphisms of sharing schemes: a tool for verifiable signature sharing
- M. Burmester
- Low exponent RSA with related messages
- D. Coppersmith, M. Franklin, J. Patarin, M. Reiter
- Efficient multiplicative sharing schemes
- S. R. Blackburn, M. Burmester, Y. Desmedt, P. R. Wild
- New bounds on the nonlinearity of boolean functions
- X.-M. Zhang, Y. Zheng
- New modular multiplication algorithms for fast modular exponentiation
- H. Seong-Min, O. Sang-Yeop, Y. Hyun-Soo
- On the existence of secure feedback registers
- A. Klapper
- On the security of two MAC algorithms
- B. Preneel, P. van Oorschot
- Non-linear approximations in linear cryptanalysis
- L. R. Knudsen, M. J. B. Robshaw
- Asymmetric fingerprinting
- B. Pfitzmann, M. Schunter
- On the difficulty of software key escrow
- L. R. Knudsen, T. P. Pedersen
- On Diffie-Hellman key agreement with short exponents
- P. C. van Oorschot, M. J. Wiener
- The exact security of digital signatures - how to sign with RSA and Rabin
- M. Bellare, P. Rogaway
- Equivocable oblivious transfer
- D. Beaver
- Generating ElGamal signatures without knowing the secret key
- D. Bleichenbacher
- Short discreet proofs
- J. Boyar, R. Peralta
- Robust threshold DSS signatures
- R. Gennaro, S. Jarecki, H. Krawzyk, T. Rabin
- Foiling birthday attacks in output-doubling transformations
- W. Aiello, R. Venkatesan
- (to be anounced)
- M. Jakobsson, K. Sako
Return to the Eurocrypto 96 page
Return to the IACR home page.