The following pages link to Oded Goldreich (Q178474):
Displayed 50 items.
- (Q234029) (redirect page) (← links)
- On universal learning algorithms (Q287154) (← links)
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- The tensor product of two good codes is not necessarily robustly testable (Q436324) (← links)
- An improved parallel algorithm for integer GCD (Q582082) (← links)
- On the randomness complexity of property testing (Q623502) (← links)
- Lower bounds for sampling algorithms for estimating the average (Q674290) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection (Q803112) (← links)
- On the number of monochromatic close pairs of beads in a rosary (Q807623) (← links)
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
- Session-key generation using human passwords only (Q850503) (← links)
- Lower bounds for linear locally decodable codes and private information retrieval (Q862344) (← links)
- A note on computational indistinguishability (Q910218) (← links)
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (Q916352) (← links)
- Almost \(k\)-wise independence versus \(k\)-wise independence (Q1028993) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- On the power of two-point based sampling (Q1120201) (← links)
- Computational indistinguishability: algorithms vs. circuits (Q1127328) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization (Q1198663) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Modern cryptography, probabilistic proofs and pseudo-randomness (Q1273742) (← links)
- Quantifying knowledge complexity (Q1300608) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- On the security of modular exponentiation with application to the construction of pseudorandom generators (Q1402365) (← links)
- On interactive proofs with a laconic prover (Q1413647) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (Q1606967) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- How to construct constant-round zero-knowledge proof systems for NP (Q1924196) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Computational indistinguishability: A sample hierarchy (Q1961376) (← links)
- A sublinear bipartiteness tester for bounded degree graphs (Q1964592) (← links)
- Preface (to the special issue on general secure multiparty computation) (Q1976001) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Improved bounds on the an-complexity of \(O(1)\)-linear functions (Q2159467) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- Learning Polynomials with Queries: The Highly Noisy Case (Q2706184) (← links)
- (Q2754188) (← links)