Theory of Cryptography Library: Archive
This web page provides access to old work on Theory of Cryptography,
which has never been published.
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.
- Arc-01:
O. Goldreich, Three XOR Lemmas - An Exposition, 1991.
[Abstract]
[full paper]
- Arc-02:
R. Canetti, S. Halevi, A. Herzberg,
How to Maintain Authenticated Communication
in the Presence of Break-ins,
major revision done in November 1995.
[Abstract]
[full paper]
- Arc-03:
M. Bellare, O. Goldreich, Proving Computational Ability, August 1992.
[Abstract]
[full paper]
- Arc-04:
I. Damgard, O. Goldreich, A. Wigderson,
Information Theory versus Complexity Theory: Another Test Case,
September 1995.
[Abstract]
[full paper]
- Arc-05:
O. Goldreich, N. Nisan, A. Wigderson,
On Yao's XOR-Lemma, March 1995.
[Abstract]
[full paper]
- Arc-06:
O. Goldreich, L. Levin and N. Nisan,
On Constructing 1-1 One-Way Functions, 1994.
[Abstract]
[full paper]
- Arc-xx:
authors, title, month.
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 list of 1996 records.