Protecting data privacy in private information retrieval schemes

DOI10.1006/jcss.1999.1689zbMath0958.68059MaRDI QIDQ1577014

Yuval Ishai, Eyal Kushilevitz, Tal Malkin, Yael Gertner

Publication date: 27 August 2000

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

Full work available at URL: https://doi.org/10.1006/jcss.1999.1689

zbMATH Keywords

private information retrieval

Mathematics Subject Classification ID

68P20: Information storage and retrieval of data

Related Items

Selling multiple secrets to a single buyer, Private multiparty sampling and approximation of vector combinations, Quantum symmetrically-private information retrieval, New Communication-Efficient Oblivious Transfer Protocols Based on Pairings, PRIVATE DATABASE QUERIES USING QUANTUM STATES WITH LIMITED COHERENCE TIMES

Cites Work

• A minimal model for secure computation (extended abstract)
• Improved upper bounds on information-theoretic private information retrieval (extended abstract)
• One-way functions are essential for single-server private information retrieval
• Oblivious transfer and polynomial evaluation
• How to share a secret
• Oblivious transfers and intersecting codes
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Privacy and Communication Complexity
• Upper bound on the communication complexity of private information retrieval
• A Zero-One Law for Boolean Privacy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item