Advances in Cryptology
Crypto '97
Edited by Burt Kaliski
- The Complexity of Computing Hard Core Predicates, Goldmann, M. and Naslund, M.
- Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Fujisaki, E. and Okamoto, T.
- Keeping the SZK-Verifier Honest Unconditionally, Di Crescenzo, G., Okamoto, T. and Yung, M.
- On the Foundations of Modern Cryptography, Goldreich, O.
- Plug and Play Encryption, Beaver, D.
- Deniable Encryption, Canetti, R., Dwork, C., Naor, M. and Ostrovsky, R.
- Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem, Goldreich, O., Goldwasser, S. and Halevi, S.
- Public-Key Cryptosystems from Lattice Reduction Problems, Goldreich, O., Goldwasser, S. and Halevi, S.
- RSA-Based Undeniable Signatures, Gennaro, R., Krawczyk, H. and Rabin, T.
- Security of Blind Digital Signatures, Juels, A., Luby, M. and Ostrovsky, R.
- Digital Signcryption or How to Achieve Cost (Signature & Encryption << Cost (Signature) + Cost (Encryption), Zheng, Y.
- How to Sign Digital Streams, Gennaro, R. and Rohatgi, P.
- Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations, Nguyen, P. and Stern, J.
- Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack, Berson, T. A.
- A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy, Misarsky, J.-F.
- On the Security of the KMOV Public Key Cryptosystem, Bleichenbacher, D.
- A Key Recovery Attack on Discrete Log-Based Schemes Using a Prime Order Subgroup, Lim, C. H. and Lee, P. J.
- The Prevalence of KIeptographic Attacks on Discrete-Log Based Cryptosystems, Young, A. and Yung, M.
- "Pseudo-Random" Number Generation within Cryptographic Algorithms: The DSS Case, Bellare, M., Goldwasser, S. and Micciancio, D.
- Unconditional Security Against Memory-Bounded Adversaries, Cachin, C. and Maurer, U. M.
- Privacy Amplification Secure Against Active Adversaries, Maurer, U. M. and Wolf, S.
- Visual Authentication and Identification, Naor, M. and Pinkas, B.
- Quantum Information Processing: The Good, the Bad and the Ugly, Brassard, G.
- Efficient Algorithms for Elliptic Curve Cryptosystems, Guajardo, J. and Paar, C.
- An Improved Algorithm for Arithmetic on a Family of Elliptic Curves, Solinas, J. A.
- Fast RSA-Type Cryptosystems Using n-adic Expansion, Takagi, T.
- A One Way Function Based on Ideal Arithmetic in Number Fields, Buchmann, J. A. and Paulus, S.
- Efficient Anonymous Multicast and Reception, Dolev, S. and Ostrovsky, R.
- Efficient Group Signature Schemes for Large Groups, Camenisch, J. L. and Stadler, M. A.
- Efficient Generation of Shared RSA Keys, Boneh, D. and Franklin, M. K.
- Proactive RSA, Frankel, Y., Gemmell, P., MacKenzie, P. D. and Yung, M.
- Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information, Canetti, R.
- Collision-Resistant Hashing: Towards Making UOWHFs Practical, Bellare, M. and Rogaway, P.
- Fast and Secure Hashing Based on Codes, Knudsen, L. R. and Preneel, B.
- Edit Distance Correlation Attack on the Alternating Step Generator, Golic, J. D. and Menicocci, R.
- Differential Fault Analysis of Secret Key Cryptosystems, Biham, E. and Shamir, A.
- Cryptanalysis of the Cellular Message Encryption Algorithm, Wagner, D., Schneier, B. and Kelsey, J.
Copyright © 1998, Springer-Verlag.