Cryptology ePrint Archive: Listing for 1997
- 1997/015 (PDF)
- Optimistic fair Exchange of Digital Signatures
- N. Asokan, V. Shoup, M. Waidner
- 1997/014 (PDF)
- Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring
- Eli Biham, Dan Boneh, Omer Reingold
- 1997/013 (PDF)
- Visual Authentication and Identification
- Moni Naor, Benny Pinkas.
- 1997/012 (PDF)
- Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop.
- Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest
- 1997/011 (PDF)
- Identity Escrow
- Joe Kilian, Erez Petrank
- 1997/010 (PDF)
- CBC MAC for Real-Time Data Sources
- Erez Petrank, Charles Rackoff
- 1997/009 (PDF)
- Collision-Resistant Hashing: Towards Making UOWHFs Practical
- Mihir Bellare, Phillip Rogaway
- 1997/008 (PDF)
- Factoring via Strong Lattice Reduction Algorithms
- Harald Ritter, Carsten Roessner
- 1997/007 (PDF)
- Towards realizing random oracles: Hash functions that hide all partial information
- Ran Canetti
- 1997/006 (PDF)
- Protecting Data Privacy in Private Information Retrieval Schemes
- Yuval Ishai, Eyal Kushilevitz
- 1997/005 (PDF)
- A Probabilistic Error-Correcting Scheme
- S. Decatur, O. Goldreich, D. Ron
- 1997/004 (PDF)
- A note on negligible functions
- Mihir Bellare
- 1997/003 (PDF)
- Efficient Cryptographic Protocols Based on Noisy Channels.
- Claude Crepeau
- 1997/002 (PDF)
- Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
- Mihir Bellare, Markus Jakobsson, Moti Yung
- 1997/001 (PDF)
- A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost
- Mihir Bellare, Daniele Micciancio
[ Cryptology ePrint archive]