How Should We Solve Search Problems Privately?

DOI10.1007/978-3-540-74143-5_3zbMath1215.68086OpenAlexW296578011MaRDI QIDQ3612543

Enav Weinreb, Tal Malkin, Amos Beimel, Kobbi Nissim

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) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Related Items (1)

Private multiparty sampling and approximation of vector combinations

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