Constant-Round Private Database Queries

DOI10.1007/978-3-540-73420-8_24MaRDI QIDQ5428814zbMATH OpenOpenAlexFDO

Authors Nenad Dedić, Payman Mohassel

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_24

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On Private Information Retrieval Supporting Range Queries
• Private information retrieval
• Efficient query protocol for database's privacy
• Practical private range search in depth
• scientific article; zbMATH DE number 1583948

Cited in

(6)

• Secure computation of the \(k^{\text{th}}\)-ranked element in a star network
• Efficient query protocol for database's privacy
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Efficient Negative Databases from Cryptographic Hash Functions
• Automata, Languages and Programming
• Mitigation Techniques for Attacks on 1-Dimensional Databases that Support Range Queries

This page was built for publication: Constant-Round Private Database Queries

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