Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of eprint 1997
Page
Title
A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
Efficient Cryptographic Protocols Based on Noisy Channels
A note on negligible functions
A Probabilistic Error-Correcting Scheme
Protecting Data Privacy in Private Information Retrieval Schemes
Towards realizing random oracles: Hash functions that hide all partial information
Factoring via Strong Lattice Reduction Algorithms
Collision-Resistant Hashing: Towards Making UOWHFs Practical
CBC MAC for Real-Time Data Sources
Identity Escrow
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop
Visual Authentication and Identification
Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring
Optimistic fair Exchange of Digital Signatures