On the optimal communication complexity of error-correcting multi-server PIR

DOI10.1007/978-3-031-22368-6_3MaRDI QIDQ6169550zbMATH OpenOpenAlexFDO

Authors Reo Eriguchi, Kaoru Kurosawa, Koji Nuida

Publication date 14 August 2023

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22368-6_3

zbMATH Keywords

\(\ell \)-server private information retrieval scheme

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Communication theory (94A05) Cryptography (94A60)

Recommendations

• How to correct errors in multi-server PIR
• Private information retrieval schemes with erasure-correcting or error-correcting properties
• General constructions for information-theoretic private information retrieval

Cites work

• scientific article; zbMATH DE number 1754644 (Why is no real title available?)
• 3-query locally decodable codes of subexponential length
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• Automata, Languages and Programming
• How to correct errors in multi-server PIR
• Lower bounds for linear locally decodable codes and private information retrieval
• On the optimal communication complexity of error-correcting multi-server PIR
• Practical homomorphic MACs for arithmetic circuits
• Private information retrieval
• Query-efficient locally decodable codes of subexponential length
• Robust information-theoretic private information retrieval
• The Capacity of Private Information Retrieval
• The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
• The Capacity of Robust Private Information Retrieval With Colluding Databases
• Towards 3-query locally decodable codes of subexponential length
• Upper bound on the communication complexity of private information retrieval

Cited in

(5)

• On the optimal communication complexity of error-correcting multi-server PIR
• Private information retrieval schemes with erasure-correcting or error-correcting properties
• PIR Array Codes With Optimal Virtual Server Rate
• Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
• How to correct errors in multi-server PIR

This page was built for publication: On the optimal communication complexity of error-correcting multi-server PIR

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