Secure multiparty computation of approximations

DOI10.1145/1159892.1159900zbMath1321.68464OpenAlexW2152590851MaRDI QIDQ2944525

Rebecca N. Wright, Yuval Ishai, Kobbi Nissim, Joan Feigenbaum, Tal Malkin, Martin J. Strauss

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1159892.1159900

zbMATH Keywords

privacysublinear communicationdistributed data processing

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (10)

The communication complexity of the Hamming distance problem ⋮ Secure sampling with sublinear communication ⋮ Arithmetic sketching ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Matching with don't-cares and a small number of mismatches ⋮ How should we solve search problems privately? ⋮ Fast Private Norm Estimation and Heavy Hitters ⋮ Quantum state secure transmission in network communications ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Two Party Distribution Testing: Communication and Security

This page was built for publication: Secure multiparty computation of approximations