How should we solve search problems privately?

DOI10.1007/S00145-008-9032-ZMaRDI QIDQ2267364zbMATH OpenOpenAlexFDO

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

Publication date 1 March 2010

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.8513

zbMATH Keywords

resemblanceprivacysearch problemssecure computation

Mathematics Subject Classification ID

Cryptography (94A60) 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 4051007

Cites work

• scientific article; zbMATH DE number 5764911 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• A Private Stable Matching Algorithm
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• College Admissions and the Stability of Marriage
• Factoring Polynomials Over Large Finite Fields
• Improved Efficiency for Private Stable Matching
• Min-wise independent permutations
• NP is as easy as detecting unique solutions
• Private Approximation of Clustering and Vertex Cover
• Private approximation of NP-hard functions
• Private approximation of search problems
• Secure multiparty computation of approximations
• The stable marriage problem with restricted pairs.
• Theory of Cryptography

Cited in

(2)

• How Should We Solve Search Problems Privately?
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems

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 Q2267364)