General constructions for information-theoretic private information retrieval

DOI10.1016/j.jcss.2005.03.002zbMath1076.68027OpenAlexW2007208840MaRDI QIDQ2485285

Amos Beimel, Eyal Kushilevitz, Yuval Ishai

Publication date: 3 August 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2005.03.002

zbMATH Keywords

Locally decodable codesPrivate information retrievalInformation-theoretic cryptographyMultiparty communication complexitySimultaneous messages protocols

Mathematics Subject Classification ID

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

Related Items

Selling multiple secrets to a single buyer, CNF-FSS and Its Applications, On locally decodable codes, self-correctable codes, and \(t\)-private PIR, Quadratic multiparty randomized encodings beyond honest majority and their applications, Query-efficient locally decodable codes of subexponential length, Communication-efficient distributed oblivious transfer, Протокол конфиденциального получения информации, Information hiding using matroid theory, Multi-value private information retrieval with colluding databases via trace functions, Reed-Muller Codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locally random reductions: Improvements and applications
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Improved upper bounds on information-theoretic private information retrieval (extended abstract)
• How to share a secret
• Short Locally Testable Codes and Proofs
• On the efficiency of local decoding procedures for error-correcting codes
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• Communication Complexity of Simultaneous Messages
• Upper bound on the communication complexity of private information retrieval
• Simultaneous messages vs. communication
• On secret sharing systems
• Some Applications of Coding Theory in Computational Complexity
• Theory of Cryptography
• Automata, Languages and Programming
• Exponential lower bound for 2-query locally decodable codes via a quantum argument
• Universal service-providers for private information retrieval