Private information retrieval with result verification for more servers

DOI10.1007/978-3-031-33491-7_8MaRDI QIDQ6535117zbMATH OpenFDO

Authors Pengzhen Ke, Liang Feng Zhang

Publication date 10 November 2023

Full work available at URL https://doi.org/10.1007/978-3-031-33491-7_8

zbMATH Keywords

cryptographymalicious serversprivate information retrievalsecurity

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Privacy of data (68P27) Cryptography (94A60)

Recommendations

• Verifiable multi-server private information retrieval
• Committed private information retrieval
• Verifiable single-server private information retrieval
• Verifiable private information retrieval
• Robust information-theoretic private information retrieval

Cites work

• 3-query locally decodable codes of subexponential length
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• General constructions for information-theoretic private information retrieval
• How to correct errors in multi-server PIR
• How to share a secret
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• scientific article; zbMATH DE number 1952910 (Why is no real title available?)
• scientific article; zbMATH DE number 1754644 (Why is no real title available?)
• Lower bounds for constant weight codes
• Towards 3-query locally decodable codes of subexponential length
• Verifiable multi-server private information retrieval
• Verifiable single-server private information retrieval from LWE with binary errors

Cited in

(8)

• Verifiable single-server private information retrieval
• Another Look at Extended Private Information Retrieval Protocols
• A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
• Universal service-providers for private information retrieval
• Verifiable private information retrieval
• Committed private information retrieval
• Efficient information-theoretic distributed point functions with general output groups
• List-decodable Byzantine robust PIR: lower communication complexity, higher Byzantine tolerance, smaller list size

This page was built for publication: Private information retrieval with result verification for more servers

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