Secure sampling with sublinear communication

DOI10.1007/978-3-031-22365-5_13MaRDI QIDQ6114277zbMATH OpenFDO

Authors Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich

Publication date 14 August 2023

Published in Theory of Cryptography (Search for Journal in Brave)

zbMATH Keywords

random samplingsecure 2-party sampling

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60) Sampling theory in information and communication theory (94A20)

Recommendations

• Private multiparty sampling and approximation of vector combinations
• Private Multiparty Sampling and Approximation of Vector Combinations
• Near-optimal private approximation protocols via a black box transformation
• When Random Sampling Preserves Privacy
• Oblivious sampling with applications to two-party \(k\)-means clustering

Cites work

• scientific article; zbMATH DE number 5485440 (Why is no real title available?)
• scientific article; zbMATH DE number 1754645 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• 1-pass relative-error \(L_p\)-sampling with applications
• An information statistics approach to data stream and communication complexity
• Assisted Common Information With an Application to Secure Two-Party Sampling
• Counting distinct items over update streams
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
• Extensions of Lipschitz mappings into a Hilbert space
• On the distributional complexity of disjointness
• Optimal sampling from sliding windows
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Secure multiparty computation of approximations
• Secure sampling with sublinear communication
• Streaming algorithms via precision sampling
• The Probabilistic Communication Complexity of Set Intersection

Cited in

(6)

• Oblivious sampling with applications to two-party \(k\)-means clustering
• Secure sampling with sublinear communication
• On Invertible Sampling and Adaptive Security
• Private multiparty sampling and approximation of vector combinations
• Private Multiparty Sampling and Approximation of Vector Combinations
• Two Party Distribution Testing: Communication and Security

This page was built for publication: Secure sampling with sublinear communication

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