Communication-efficient distributed oblivious transfer

DOI10.1016/j.jcss.2012.02.002zbMath1244.68010OpenAlexW2142083221MaRDI QIDQ439979

Huaxiong Wang, Amos Beimel, Liang Feng Zhang, Yeow Meng Chee

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.02.002

zbMATH Keywords

communication complexitydistributed oblivious transferprivate information retrieval

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Information storage and retrieval of data (68P20) Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locally random reductions: Improvements and applications
• General constructions for information-theoretic private information retrieval
• On unconditionally secure distributed oblivious transfer
• Universal service-providers for database private information retrieval (extended abstract)
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
• Strengthening the Security of Distributed Oblivious Transfer
• Upper bound on the communication complexity of private information retrieval
• Foundations of Cryptography
• 3-query locally decodable codes of subexponential length
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Theory of Cryptography

This page was built for publication: Communication-efficient distributed oblivious transfer