The following pages link to Oded Goldreich (Q178474):
Displaying 9 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- On the Cryptographic Applications of Random Functions (Extended Abstract) (Q2974488) (← links)
- Basic Facts about Expander Graphs (Q3088196) (← links)
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions (Q3562902) (← links)
- The minimum-length generator sequence problem is NP-hard (Q3920644) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- On Sample-Based Testers (Q4973851) (← links)
