Next:
How to Construct Random
Up:
Work and Publications
Previous:
On Concurrent Identification Protocols
The Post-Doctoral Period (1983-86)
How to Construct Random Functions
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle is NP-Hard
The Weakest Pseudo-Random Generator Implies the Strongest One
On the Number of Monochromatic and Close Beads in a Rosary
RSA/Rabin Functions: Certain Parts are As Hard As the Whole
On the Cryptographic Applications of Random Functions
On the Power of Two-Point Based Sampling
On the Complexity of Global Computation in the Presence of Link Failures - The Case of a Ring
Electing a Leader in a Ring with Link Failures
Unbiased Bits From Sources of Weak Randomness and Probabilistic Communication Complexity
The Bit Extraction Problem or t-Resilient Functions
An Improved Parallel Algorithm for Integer GCD
A Fair Protocol for Signing Contracts
On the Security of Ping-Pong Protocols when Implemented Using the RSA
The Bit Security of Modular Squaring given Partial Factorization of the Modulus
Two Remarks Concerning the GMR Signature Scheme
Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs
Towards a Theory of Software Protection and Simulation by Oblivious RAMs
How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority
Everything Provable is Provable in Zero-Knowledge
Oded Goldreich
2003-07-30
