Theory of Cryptography

DOI10.1007/11681878zbMath1112.94029OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898358

David P. Woodruff, Piotr Indyk

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11681878

zbMATH Keywords

communication complexitynearest neighborsecure multiparty computationprivate approximations

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

Structure-aware private set intersection, with applications to fuzzy matching ⋮ Arithmetic sketching ⋮ How should we solve search problems privately? ⋮ Fast Private Norm Estimation and Heavy Hitters ⋮ A communication-efficient private matching scheme in client-server model ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Two Party Distribution Testing: Communication and Security

This page was built for publication: Theory of Cryptography