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

DOI10.1007/978-3-642-13013-7_7zbMath1279.94080OpenAlexW1549397354MaRDI QIDQ3562891

Jens Groth, Helger Lipmaa, Aggelos Kiayias

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

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

Related Items (5)

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

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