Multi-query Computationally-Private Information Retrieval with Constant Communication Rate

DOI10.1007/978-3-642-13013-7_7MaRDI QIDQ3562891zbMATH OpenOpenAlexFDO

Authors Jens Groth, Aggelos Kiayias, Helger Lipmaa

Publication date 28 May 2010

Published in Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13013-7_7

zbMATH Keywords

computationally private information retrievallower bound on communicationmulti-query CPIR

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• scientific article; zbMATH DE number 1304086
• Towards doubly efficient private information retrieval
• scientific article; zbMATH DE number 1559546
• Multi-Server Weakly-Private Information Retrieval
• Multiround Private Information Retrieval: Capacity and Storage Overhead
• Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes
• Upper bound on the communication complexity of private information retrieval
• scientific article; zbMATH DE number 2090941

Cited in

(7)

• Cuckoo hashing in cryptography: optimal parameters, robustness and applications
• Verifiable single-server private information retrieval from LWE with binary errors
• A simpler rate-optimal CPIR protocol
• Протокол конфиденциального получения информации
• Lower bounds for (batch) PIR with private preprocessing
• Automata, Languages and Programming
• Single-server private information retrieval with sublinear amortized time

This page was built for publication: Multi-query Computationally-Private Information Retrieval with Constant Communication Rate

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