Cryptology ePrint Archive: Listing for 1996
- 1996/016 (PDF)
- Public-Key Cryptosystems from Lattice Reduction Problems
- Oded Goldreich, Shafi Goldwasser, Shai Halevi
- 1996/015 (PDF)
- Verifiable Partial Key Escrow
- Mihir Bellare, Shafi Goldwasser
- 1996/014 (PDF)
- The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
- Oded Goldreich
- 1996/013 (PDF)
- On the Contrast in Visual Cryptography Schemes
- Carlo Blundo, Alfredo De Santis, Douglas R. Stinson
- 1996/012 (PDF)
- Proactive RSA
- Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung
- 1996/011 (PDF)
- On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited
- Moni Naor, Omer Reingold
- 1996/010 (PDF)
- Oblivious Transfers and Intersecting Codes
- Gilles Brassard, Claude Crepeau, Miklos Santha
- 1996/009 (PDF)
- Collision-Free Hashing from Lattice Problems
- Oded Goldreich, Shafi Goldwasser, Shai Halevi
- 1996/008 (PDF)
- Access Control and Signatures via Quorum Secret Sharing
- Moni Naor, Avishai Wool
- 1996/007 (PDF)
- Visual Cryptography II: Improving the Contrast Via the Cover Base
- Moni Naor, Adi Shamir
- 1996/006 (PDF)
- Upper bound on the communication complexity of private information retrieval
- Andris Ambainis
- 1996/005 (PDF)
- Private Information Storage
- Rafail Ostrovsky, Victor Shoup
- 1996/004 (PDF)
- Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments
- Ronald Cramer, Ivan Damgaard
- 1996/003 (PDF)
- On Monotone Function Closure of Statistical Zero-Knowledge
- Ronald Cramer, Ivan Damgaard
- 1996/002 (PDF)
- Deniable Encryption
- Ran Canetti, Cynthia Dwork, Moni Naor, Rafi Ostrovsky
- 1996/001 (PDF)
- Incoercible Multiparty Computation
- Ran Canetti, Rosario Gennaro
[ Cryptology ePrint archive]