How Should We Solve Search Problems Privately?

DOI10.1007/978-3-540-74143-5_3MaRDI QIDQ3612543zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb

Publication date 10 March 2009

Published in Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74143-5_3

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• How should we solve search problems privately?
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Private approximation of search problems
• Private Approximation of Search Problems
• scientific article; zbMATH DE number 1830731

Cited in

(3)

• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Private multiparty sampling and approximation of vector combinations
• How should we solve search problems privately?

This page was built for publication: How Should We Solve Search Problems Privately?

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