Theory of Cryptography Library: 1996 Records
This web page provides access to recent work on Theory of Cryptography.
Work has been placed here by the authors and did not undergo any
refereeing process other than verifying that the work seems to be
within scope and of some interest to the subscribers.
- 96-00:
O. Goldreich,
An Example of a Library Record, May 1996.
[Abstract]
[full paper
(rev.)]
- 96-01:
R. Canetti, R. Gennaro,
Incoercible Multiparty Computation, May 1996.
[Abstract]
[full paper
(rev.)]
- 96-02:
R. Canetti, C. Dwork, M. Naor, R. Ostrovsky,
Deniable Encryption, May 1996.
[Abstract]
[full
paper (rev. June 1997)]
- 96-03:
R. Cramer and I. Damgaard,
On Monotone Function Closure of Statistical Zero-Knowledge, May 1996.
[Abstract]
[full paper]
- 96-04:
R. Cramer and I. Damgaard,
Linear Zero-Knowledge -
A note on Efficient Zero-Knowledge Proofs and Arguments, May 1996.
[Abstract]
[full paper]
- 96-05:
R. Ostrovsky, V. Shoup,
Private Information Storage, May 1996.
[Abstract]
[full paper]
- 96-06:
A. Ambainis,
Upper bound on the communication complexity
of private information retrieval, May 1996.
[Abstract]
[full paper]
- 96-07:
M. Naor and A. Shamir,
Visual Cryptography II: Improving the Contrast Via the Cover Base,
June 1996.
[Abstract]
[full paper]
- 96-08:
M. Naor and A. Wool,
Access Control and Signatures via Quorum Secret Sharing, July 1996.
[Abstract]
[full paper]
- 96-09:
O. Goldreich, S. Goldwasser, and S. Halevi,
Collision-Free Hashing from Lattice Problems, July 1996.
[Abstract]
[full paper]
- 96-10:
G. Brassard, C. Crepeau, M. Santha,
Oblivious Transfers and Intersecting Codes, July 1996.
[Abstract]
[full paper]
- 96-11:
M. Naor and O. Reingold,
On the Construction of Pseudo-Random Permutations:
Luby-Rackoff Revisited, August 1996.
[Abstract]
[full paper]
- 96-12:
Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung,
Proactive RSA, August 1996.
[Abstract]
[full paper]
- 96-13:
C. Blundo, A. De Santis, and D. R. Stinson,
On the Contrast in Visual Cryptography Schemes, September 1996.
[Abstract]
[full paper]
- 96-14:
O. Goldreich,
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof,
November 1996.
[Abstract]
[full paper]
- 96-15:
M. Bellare and S. Goldwasser,
Verifiable Partial Key Escrow, December 1996.
[Abstract]
[full paper]
- 96-16:
O. Goldreich, S. Goldwasser, and S. Halevi,
Public-Key Cryptosystems from Lattice Reduction Problems, December 1996.
[Abstract]
[full paper]
The library's resides on the web server of
the Theory of Computation Group
at the Laboratory for Computer Science
of MIT.
The library is currently maintained by
Oded Goldreich.
Back to the library's main page
or to the library's Archive.