Next:
Incremental Cryptography: the Case
Up:
Work and Publications
Previous:
Knowledge Complexity and Computational
The First 1.5 Years at Weizmann (1994-96)
Incremental Cryptography: the Case of Hashing and Signing
A Combinatorial Consistency Lemma with application to the PCP Theorem
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
On Yao's XOR-Lemma
On Constructing 1-1 One-way Functions
Incremental Cryptography and Application to Virus Protection
Private Information Retrieval
Free Bits, PCPs and Non-Approximability - Towards Tight Results
Learning polynomials with queries: the highly noisy case
Adaptively Secure Multi-party Computation
Oded Goldreich
2003-07-30
