Next:
Approximating shortest lattice vectors
Up:
Work and Publications
Previous:
Chinese Remaindering with Errors
Back at Weizmann (1998-2003)
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
Improved Testing Algorithms for Monotonicity
Improved Derandomization of BPP using a Hitting Set Generator
Interleaved Zero-Knowledge in the Public-Key Model
Resettable Zero-Knowledge
Simplified Derandomization of BPP using a Hitting Set Generator
On Pseudorandomness with respect to Deterministic Observers
On Testing Expansion in Bounded-Degree Graphs
Session-Key Generation using Human Passwords Only
Candidate One-Way Functions Based on Expander Graphs
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators
On the (Im)possibility of Software Obfuscation
Three Theorems regarding Testing Graph Properties
On interactive proofs with a laconic provers
Resettably-Sound Zero-Knowledge and its Applications
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
Concurrent Zero-Knowledge With Timing, Revisited
Universal arguments and their applications
Using the FGLSS-reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs
On Chosen Ciphertext Security of Multiple Encryptions
Locally Testable Codes and PCPs of Almost-Linear Length
Derandomization that is rarely wrong from short advice that is typically good
Almost k-wise independence versus k-wise independence
The GGM Construction does NOT yield Correlation Intractable Function Ensembles
Bounds on 2-Query Codeword Testing
On the Implementation of Huge Random Objects
On the random-oracle methodology as applied to length-restricted signature schemes
Oded Goldreich
2003-07-30