The order of communication complexity of PIR-protocols

DOI10.1515/DMA.2008.036MaRDI QIDQ3184562zbMATH OpenOpenAlexFDO

Authors G. A. Maylybaeva

Publication date 21 October 2009

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2008.036

Mathematics Subject Classification ID

Network protocols (68M12) Information storage and retrieval of data (68P20)

Recommendations

• General constructions for information-theoretic private information retrieval
• scientific article; zbMATH DE number 1754644
• scientific article; zbMATH DE number 1559546

Cites work

• Degeneracy bounds for private information retrieval protocols
• Private information retrieval

Cited in

(3)

• Quantum private information retrieval has linear communication complexity
• One-way functions are essential for single-server private information retrieval
• Degeneracy bounds for private information retrieval protocols

This page was built for publication: The order of communication complexity of PIR-protocols

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