Advances in Cryptology
Crypto '95
Edited by Don Coppersmith
- MDx-MAC and Building Fast MACs from Hash Functions, Preneel, B. and van Oorschot, P. C.
- XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions, Bellare, M., Guerin, R. and Rogaway, P.
- Bucket Hashing and its Application to Fast Message Authentication, Rogaway, P.
- Fast Key Exchange with Elliptic Curve Systems, Schroeppel, R., Orman, H., O'Malley, S. and Spatscheck, O.
- Fast Server-Aided RSA Signatures Secure Against Active Attacks, Beguin, P. and Quisquater, J. J.
- Security and Performance of Server-Aided RSA Computation Protocols, Lim, C. H. and Lee, P. J.
- Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver, Halevi, S.
- Precomputing Oblivious Transfer, Beaver, D.
- Committed Oblivious Transfer and Private Multi-Party Computation, Crépeau, C., Graaf, J. van de and Tapp, A.
- On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols, Mayers, D.
- How to Break Shamir's Asymmetric Basis, Theobald, T.
- On the Security of the Gollmann Cascades, Park, S. J., Lee, S. J. and Goh, S. C.
- Improving the Search Algorithm for the Best Linear Expression, Ohta, K., Moriai, S. and Aoki, K.
- On Differential and Linear Cryptanalysis of the RC-5 Encryption Algorithm, Kaliski, B. S. and Yin, Y. L.
- A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Key Escrow Systems, Micali, S. and Sidney, R.
- A Key Escrow System with Warrant Bounds, Lenstra, A. K., Winkler, P. and Yacobi, Y.
- Fair Crypto systems, Revisited, Kilian, J. and Leighton, T.
- Escrow Encryption Systems Visited: Attacks, Analysis and Designs, Frankel, Y. and Yung, M.
- Robustness Principles for Public Key Protocols, Anderson, R. and Needham, R.
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt '88, Patarin, J.
- Cryptanalysis Based on 2-Adic Rational Approximation, Klapper, A. and Goresky, M.
- A Key-schedule Weakness in SAFER K-64, Knudsen, L. R.
- Cryptanalysis of the Immunized LL Public Key Systems, Frankel, Y. and Yung, M.
- Secure Signature Schemes based on Interactive Protocols, Cramer, R. and Damgård, I. B.
- Improved Efficient Arguments, Kilian, J.
- Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs, Damgård, I. B., Goldreich, O., Okamoto, T. and Wigderson, A.
- Proactive Secret Sharing Or: How to Cope With Perpetual Leakage, Herzberg, A., Jarecki, S., Krawczyk, H. and Yung, M.
- Secret Sharing with Public Reconstruction, Beimel, A. and Chor, B.
- On General Perfect Secret Sharing Schemes, Blakley, G. R. and Kabatianski, G. A.
- NFS with Four Large Primes: An Explosive Experiment, Dodson, B. and Lenstra, A. K.
- Some Remarks on Lucas-Based Cryptosystems, Bleichenbacher, D., Bosma, W. and Lenstra, A. K.
- Threshold DSS Signatures without a Trusted Party, Langford, S. K.
- t-Cheater Identifiable (k,n) Threshold Secret Sharing Schemes, Kurosawa, K., Obana, S. and Ogata, W.
- Quantum Cryptanalysis of Hidden Linear Functions, Boneh, D. and Lipton, R. J.
- An Efficient Divisible Electronic Cash Scheme, Okamoto, T.
- Collusion-Secure Fingerprinting for Digital Data, Boneh, D. and Shaw, J.
Copyright © 1998, Springer-Verlag.