Locally random reductions: Improvements and applications

DOI10.1007/s001459900017zbMath0873.94013OpenAlexW2012882416MaRDI QIDQ676825

Joan Feigenbaum, Donald Beaver, Phillip Rogaway, Joe Kilian

Publication date: 28 May 1997

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459900017

zbMATH Keywords

computational complexityzero-knowledge protocolsbit commitment schemesrandom reducibility

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Secure outsourcing of modular exponentiations under single untrusted programme model ⋮ Communication-efficient distributed oblivious transfer ⋮ Hypercubes and Private Information Retrieval ⋮ Locally random reductions: Improvements and applications ⋮ General constructions for information-theoretic private information retrieval

Cites Work

• Locally random reductions: Improvements and applications
• Non-deterministic exponential time has two-prover interactive protocols
• On the power of two-local random reductions
• On hiding information from an oracle
• The Knowledge Complexity of Interactive Proof Systems
• Algebraic methods for interactive proof systems
• IP = PSPACE
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item