Statement for the 1980's
Since I moved to Weizmann Institute in 1994,
statements referring to previous periods were not made.
In my erecords, I could only find a report referring to the academic
year 198586 (and written for LCS's progress report to MIT).
The first two paragraphs are reproduced below.
During the past year, Goldreich has been mainly interested
in two topics: zeroknowledge proofs and software protection.
In addition he improved the GoldwasserMicaliRivest signature sheme,
and has been working with Chor on developing better schemes for
extracting unbiased bits from weak sources of randomness.
Together with Prof. S. Micali (MIT) and A. Wigderson (UCBerkeley),
he has demonstrated the generality and wide applicability of
zeroknowledge proofs, a fundamental notion intruduced by Goldwasser,
Micali and Rackoff.
Zeroknowledge proofs are probabilistic and interactive proofs that
efficiently demonstrate membership in a language without conveying any
additional knowledge.
So far, zeroknowledge proofs has been known for some number theoretic
languages in the intersection of NP and CoNP.
Under the assumption that encryption functions exist, it is shown that
all languages in NP possess zeroknowledge proofs.
This result is used to prove two fundamental theorems in the field of
cryptographic protocols.
These theorems consists of standard and efficient transformations
that, given a protocol that is correct with respect to a very weak
adversary, output a protocol correct in the most adversarial scenario.
Using no assumptions, zeroknowledge proofs for both
graph isomorphism and graph nonisomorphism, are presented.
A selected list of publications for the 1980's
would have read as follows:
 O. Goldreich and L.A. Levin,
Hardcore Predicates for any Oneway Function,
in the proceeding of the 21st STOC, 1989.
 O. Goldreich, S. Micali, and A. Wigderson,
How to Solve any Protocol Problem,
in the proceeding of the 19th STOC, 1987.
 O. Goldreich, S. Micali, and A. Wigderson,
Proofs that Yield Nothing but their Validity
and a Methodology of Cryptographic Protocol Design,
in the proceeding of the 27th FOCS, 1986.
(Later published under the title
Proofs that Yield Nothing But their Validity
or All Languages in NP have ZeroKnowledge Proofs,
in JACM, Vol. 38, No. 3, 1991.)
 B. Chor and O. Goldreich,
Unbiased Bits From Sources of Weak
Randomness and Probabilistic Communication Complexity,
in the proceeding of the 26th FOCS, 1985.
(Later published in SIAM J. on Computing, Vol. 17, No. 2, 1988.)
 W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr,
RSA/Rabin Bits Are ((1/2)+(1/poly(log N)))Secure,
in the proceeding of the 25th FOCS, 1984.
(Later published under the title
RSA/Rabin Functions: Certain Parts are As Hard As the Whole,
in SIAM J. on Computing, Vol. 17, No. 2, 1988.)
 O. Goldreich, S. Goldwasser and S. Micali,
How to Construct Random Functions,
in the proceeding of the 25th FOCS, 1984.
(Later published in JACM, Vol. 33, No. 4, 1986.)
 S. Even and O. Goldreich,
On the Security
of MultiParty PingPong Protocols,
in the proceeding of the 24th FOCS, 1983.
I allowed myself a seventh paper
(so to include one work from my graduate studies period)
and ordered the papers by reverse chronological order
(referring to the actual time they were first made public).

