Communication-efficient distributed oblivious transfer
From MaRDI portal
(Redirected from Publication:439979)
Recommendations
- scientific article; zbMATH DE number 1583780
- scientific article; zbMATH DE number 5295623
- 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
Cites work
- scientific article; zbMATH DE number 1583780 (Why is no real title available?)
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 5485460 (Why is no real title available?)
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 4101088 (Why is no real title available?)
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 1955807 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- 3-query locally decodable codes of subexponential length
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Efficient oblivious transfer protocols
- Foundations of Cryptography
- General constructions for information-theoretic private information retrieval
- Locally random reductions: Improvements and applications
- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
- On unconditionally secure distributed oblivious transfer
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Strengthening the Security of Distributed Oblivious Transfer
- Theory of Cryptography
- Universal service-providers for database private information retrieval (extended abstract)
- Upper bound on the communication complexity of private information retrieval
Cited in
(9)- Information Security
- Alternative Protocols for Generalized Oblivious Transfer
- Scalar product-based distributed oblivious transfer
- Oblivious transfer in incomplete networks
- Do distributed differentially-private protocols require oblivious transfer?
- scientific article; zbMATH DE number 5295623 (Why is no real title available?)
- Half-tree: halving the cost of tree expansion in COT and DPF
- Secure Distributed Information Exchange
- On Efficient Distribution with Private Information
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)