Advances in Cryptology
EuroCrypt '95
Edited by Louis C. Guillou and Jean-Jacques Quisquater
- Attacking the Chor-Rivest cryptosystem by improved lattice reduction, Schnorr, C. P. and Hoerner, H. H.
- Convergence in differential distributions, O'Connor, L.
- A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma, Harpes, C., Kramer, G. G. and Massey, J. L.
- On the efficiency of group signatures providing information-theoretic anonymity, Chen, L. and Pedersen, T. P.
- Verifiable signature sharing, Franklin, M. K. and Reiter, M. K.
- Server (prover/signer)-aided verification of identity proofs and signatures, Lim, C. H. and Lee, P. J.
- Counting the number of points on elliptic curves over finite fields: strategies and performances, Lercier, R. and Morain, F.
- An implementation of the general number field sieve to compute discrete logarithms mod p, Weber, D.
- A block Lanczos algorithm for finding dependencies over GF(2), Montgomery, P. L.
- How to break another "provably secure" payment system, Pfitzmann, B., Schunter, M. and Waidner, M.
- Quantum oblivious mutual identification, Crépeau, C. and Salvail, L.
- Securing traceability of ciphertexts - Towards a secure software key escrow system, Desmedt, Y.
- Secure multiround authentication protocols, Gehrmann, C.
- Verifiable secret sharing as secure computation, Gennaro, R. and Micali, S.
- Efficient secret sharing without a mutually trusted authority, Jackson, W. A., Martin, K. M. and O'Keefe, C. M.
- General short computational secret sharing schemes, Beguin, P. and Cresti, A.
- Fair blind signatures, Stadler, M. A., Piveteau, J. M. and Camenisch, J. L.
- Ripping coins for a fair exchange, Jakobsson, M.
- Restrictive blinding of secret-key certificates, Brands, S.
- Towards fast correlation attacks on irregularly clocked shift registers, Golic, J. D.
- Large periods nearly de Bruijn FCSR sequences, Klapper, A. and Goresky, M.
- On nonlinear resilient functions, Zhang, X. M. and Zheng, Y.
- Combinatorial bounds for authentication codes with arbitration, Kurosawa, K. and Obana, S.
- New hash functions for message authentication, Krawczyk, H.
- A2-codes from universal hash classes, Bierbrauer, J.
- A new identification scheme based on the perceptrons problem, Pointcheval, D.
- Fast RSA-type schemes based on singular cubic curves y2+axy = x3 (mod n), Koyama, K.
- Relationships among the computational powers of breaking discrete log cryptosystems, Sakurai, K. and Shizuya, H.
- Universal hash functions & hard core bits, Naeslund, M.
- Recycling random bits in composed perfect zero-knowledge, Di Crescenzo, G.
- On the Matsumoto and Imai's human identification scheme, Wang, C. H., Hwang, T. and Tsai, J. J.
- Receipt-free mix-type voting scheme A practical solution to the implementation of a voting booth, Sako, K. and Kilian, J.
- Are crypto-accelerators really inevitable? 20 bit zero-knowledge in less than a second on simple 8-bit microcontrollers, Naccache, D., M'raihi, D., Wolfowicz, W. and Porto, A. di
- Anonymous NIZK proofs of knowledge with preprocessing, D'Amiano, S. and Di Crescenzo, G.
Copyright © 1998, Springer-Verlag.