Advances in Cryptology
Crypto '92
Edited by Ernest F. Brickell
- Provably unforgeable signatures, Bos, J. N. E. and Chaum, D.
- New constructions of fail-stop signatures and lower bounds, van Heijst, E., Pedersen, T. P. and Pfitzmann, B.
- Provably secure and practical identification schemes and corresponding signature schemes, Okamoto, T.
- An efficient digital signature scheme based on an elliptic curve over the ring Zn, Okamoto, T., Fujioka, A. and Fujisaki, E.
- Designing and detecting trapdoors for discrete log cryptosystems, Gordon, D. M.
- Response to comments on the NIST proposed Digital Signature Standard, Smid, M. E. and Branstad, D. K.
- Wallet databases with observers, Chaum, D. and Pedersen, T. P.
- Making electronic refunds safer, Hirschfeld, R.
- Fair public-key cryptosystems, Micali, S.
- Pricing via processing or combatting junk mail, Dwork, C. and Naor, M.
- On the information rate of secret sharing schemes, Blundo, C., De Santis, A., Gargano, L. and Vaccaro, U.
- New general lower bounds on the information rate of secret sharing schemes, Stinson, D. R.
- Universally ideal secret sharing schemes (preliminary version), Beimel, A. and Chor, B.
- Perfect zero-knowledge arguments for NP can be based on general complexity assumptions, Naor, M., Ostrovsky, R., Venkatesan, R. and Yung, M.
- Low communication 2-prover zero-knowledge proofs for NP, Dwork, C., Feige, U., Kilian, J., Naor, M. and Safra, M.
- Invariant signatures and non-interactive zero-knowledge proofs are equivalent, Goldwasser, S. and Ostrovsky, R.
- On the discrepancy between serial and parallel of zero-knowledge protocols, Sakurai, K. and Itoh, T.
- On the design of SP networks from an information theoretic point of view, Sivabalan, M., Tavares, S. E. and Peppard, L. E.
- Partially-bent functions, Carlet, C.
- Practical approaches to attaining security against adaptively chosen ciphertext attacks (extended abstract), Zheng, Y. and Seberry, J.
- On the security of the permuted kernel identification scheme, Baritaud, T., Campana, M., Chauvaud, P. and Gilbert, H.
- Massively parallel computation of discrete logarithms, Gordon, D. M. and McCurley, K. S.
- A quadratic sieve on the n-dimensional cube, Peralta, R.
- Efficient multiplication on certain nonsupersingular elliptic curves, Meier, W. and Staffelbach, O.
- Speeding up elliptic cryptosystems by using a signed binary window method, Koyama, K. and Tsuruoka, Y.
- On generation of probable primes by incremental search, Brandt, J. and Damgård, I. B.
- Kid Krypto, Fellows, M. and Koblitz, N.
- On defining proofs of knowledge, Bellare, M. and Goldreich, O.
- Public randomness in cryptography, Herzberg, A. and Luby, M.
- Necessary and sufficient conditions for collision-free hashing, Russell, A.
- Certifying cryptographic tools: The case of trapdoor permutations, Bellare, M. and Yung, M.
- Protocols for secret key agreement by public discussion based on common information, Maurer, U. M.
- Perfectly-secure key distribution for dynamic conferences, Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U. and Yung, M.
- Differential cryptanalysis of the full 16-round DES, Biham, E. and Shamir, A.
- Iterative characteristics of DES and s2-DES, Knudsen, L. R.
- DES is not a group, Campbell, K. W. and Wiener, M. J.
- A high-speed DES implementation for network applications, Eberle, H.
- Threshold schemes with disenrollment, Blakley, B., Blakley, G. R., Chan, A. H. and Massey, J. L.
- Non-existence of homomorphic general sharing schemes for some key spaces, Frankel, Y., Desmedt, Y. and Burmester, M. V. D.
- An l-span generalized secret sharing scheme, Harn, L. and Lin, Hung-Yu
- Provable security against differential cryptanalysis, Nyberg, K. and Knudsen, L. R.
- Content-addressable search engines and DES-like systems, Wayner, P. C.
- FFT-Hash-II is not yet collision-free, Vaudenay, S.
Copyright © 1998, Springer-Verlag.