default search action
IACR Cryptology ePrint Archive, Volume 1997
Volume 1997, 1997
- Mihir Bellare, Daniele Micciancio:
A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost. 1 - Mihir Bellare, Markus Jakobsson, Moti Yung:
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function. 2 - Claude Crépeau:
Efficient Cryptographic Protocols Based on Noisy Channels. 3 - Mihir Bellare:
A note on negligible functions. 4 - Scott E. Decatur, Oded Goldreich, Dana Ron:
A Probabilistic Error-Correcting Scheme. 5 - Yuval Ishai, Eyal Kushilevitz:
Protecting Data Privacy in Private Information Retrieval Schemes. 6 - Ran Canetti:
Towards realizing random oracles: Hash functions that hide all partial information. 7 - Harald Ritter, Carsten Rössner:
Factoring via Strong Lattice Reduction Algorithms. 8 - Mihir Bellare, Phillip Rogaway:
Collision-Resistant Hashing: Towards Making UOWHFs Practical. 9 - Erez Petrank, Charles Rackoff:
CBC MAC for Real-Time Data Sources. 10 - Joe Kilian, Erez Petrank:
Identity Escrow. 11 - Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest:
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. 12 - Moni Naor, Benny Pinkas:
Visual Authentication and Identification. 13 - Eli Biham, Dan Boneh, Omer Reingold:
Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring. 14 - N. Asokan, Victor Shoup, Michael Waidner:
Optimistic fair Exchange of Digital Signatures. 15
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.