CRYPTO '97 Accepted Submissions
Updated May 1, 1997
(Author affiliations and session assignments will be provided in a subsequent posting. Contact authors for each submission are listed first.)
- Digital Signcryption or How to Achieve Cost (Signature & Encryption) << Cost (Signature) + Cost (Encryption) (Yuliang Zheng)
- A One Way Function Based on Ideal Arithmetic in Number Fields (Johannes Buchmann, Sachar Paulus)
- Privacy Amplification Secure Against Active Adversaries (Ueli Maurer, Stefan Wolf)
- Fast and Secure Hashing Based on Codes (Lars Knudsen, Bart Preneel)
- A Key Recovery Attack on Discrete Log-Based Schemes Using a Prime Order Subgroup (Chae Hoon Lim, Pil Joong Lee)
- Fast RSA-Type Cryptosystems Using n-Adic Expansion (Tsuyoshi Takagi)
- A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy (Jean-Francois Misarsky)
- Edit Distance Correlation Attack on the Alternating Step Generator (Renato Menicocci, J. Golic)
- Efficient Group Signature Schemes for Large Groups (Jan Camenisch, Markus Stadler)
- Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack (Thomas A. Berson)
- An Improved Algorithm for Arithmetic on a Family of Elliptic Curves (Jerry Solinas)
- Efficient Generation of Shared RSA Keys (Dan Boneh, Matt Franklin)
- Proactive RSA (Moti Yung, Yair Frankel, Peter Gemmell, Philip Mackenzie)
- Cryptanalysis of the Cellular Message Encryption Algorithm (Bruce Schneier, David Wagner, John Kelsey)
- Unconditional Security Against Memory-Bounded Adversaries (Christian Cachin, Ueli Maurer)
- Keeping the SZK-Verifier Honest Unconditionally (Moti Yung, Giovanni Di Crescenzo, Tatsuaki Okamoto)
- A New Key Agreement Protocol Admitting Provable Security (Alfred Menezes, Simon Blake-Wilson, Don Johnson)
- Plug and Play Encryption (Donald Beaver)
- Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorization (Phong Nguyen)
- The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems (Moti Yung, Adam Young)
- Efficient Anonymous Multicast and Reception (Rafail Ostrovsky, Shlomi Dolev)
- Undeniable Signatures as Secure as RSA (Tal Rabin, Hugo Krawczyk)
- Differential Fault Analysis of Secret Key Cryptosystems (Eli Biham, Adi Shamir)
- On the Security of the KMOV Public Key Cryptosystem (Daniel Bleichenbacher)
- Efficient Algorithms for Elliptic Curve Cryptosystems (Jorge Guajardo and
Christof Paar)
- Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information (Ran Canetti)
- Visual Authentication and Identification (Moni Naor, Benny Pinkas)
- The Complexity of Computing Hard Core Predicates (Mats Naslund, Mikael Goldmann)
- Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations (Eiichiro Fujisaki, Tatsuaki Okamoto)
- Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem (Shai Halevi, Shafi Goldwasser, Oded Goldreich)
- Collision-Resistant Hashing: Making UOWHFs Practical (Mihir Bellare, Phillip Rogaway)
- Digital Signature Standard: Why to Use Strong Pseudo Random Number Generators (Daniele Micciancio, Shafi Goldwasser, Mihir Bellare)
- Deniable Encryption (Ran Canetti, Cynthia Dwork, Moni Naor, Rafi Ostrovsky)
- Public-Key Cryptosystems from Lattice Reduction Problems (Shai Halevi, Oded Goldreich, Shafi Goldwasser)
- Security of Blind Digital Signatures (Rafail Ostrovsky, Ari Juels, Michael Luby)
- How to Sign Digital Streams (Rosario Gennaro, Pankaj Rohatgi)