Cryptology ePrint Archive: Listing for 1997

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

[ Cryptology ePrint archive ]