Communication-efficient distributed oblivious transfer

DOI10.1016/J.JCSS.2012.02.002zbMATH Open1244.68010OpenAlexW2142083221MaRDI QIDQ439979FDOQ439979

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

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

Recommendations

• scientific article; zbMATH DE number 1583780
• scientific article
• Efficient oblivious transfer protocols
• On unconditionally secure distributed oblivious transfer
• scientific article; zbMATH DE number 1955807
• A verifiable distributed oblivious transfer protocol
• Strengthening the Security of Distributed Oblivious Transfer
• Efficient oblivious transfers with access control
• scientific article; zbMATH DE number 1030985
• New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

zbMATH Keywords

communication complexitydistributed oblivious transferprivate information retrieval

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Secure Distributed Information Exchange
• Information Security
• Oblivious transfer in incomplete networks
• Title not available (Why is that?)
• Alternative Protocols for Generalized Oblivious Transfer
• On Efficient Distribution with Private Information
• Half-tree: halving the cost of tree expansion in COT and DPF
• Do distributed differentially-private protocols require oblivious transfer?
• Scalar product-based distributed oblivious transfer

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439979)