Next:
On the Time-Complexity of
Up:
Work and Publications
Previous:
Everything Provable is Provable
The Technion Period (1986-94)
On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection
How to Solve any Protocol Problem - An Efficiency Improvement
On Completeness and Soundness in Interactive Proof Systems
A Trade-off between Information and Communication in Broadcast Protocols
Definitions and Properties of Zero-Knowledge Proof Systems
On the Existence of Pseudorandom Generators
A Perfect Zero-Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm
On-line/Off-line Digital signatures
Hard-core Predicates for any One-Way Function
On the Theory of Average Case Complexity
The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols
On the Composition of Zero-Knowledge Proof Systems
A Note on Computational Indistinguishability
Quantifying Knowledge Complexity
On Sparse Pseudorandom Ensembles
How to Construct Constant-Round Zero-Knowledge Proof Systems for NP
Source to Destination Communication in the Presence of Faults
A Uniform Complexity Treatment of Encryption and Zero-Knowledge
A Quantitative Approach to Dynamic Networks
Security Preserving Amplification of Hardness
Simple Constructions of Almost k-wise Independent Random Variables
Bounds on Tradeoffs between Randomness and Communication Complexity
Randomness in Interactive Proofs
The Random Oracle Hypothesis is False
Fault-tolerant Computations without Assumptions: the Two-party Case
Approximations of General Independent Distributions
Towards a Computational Theory of Statistical Tests
On the Complexity of Global Computation in the Presence of Link Failures: the case of Unidirectional Faults
On Defining Proofs of Knowledge
Proofs of Computational Ability
Asynchronous Secure Computation
Lower Bounds for Sampling Algorithms for Estimating the Average
Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing
Knowledge Complexity and Computational Complexity
Oded Goldreich
2003-07-30
