Secure sampling with sublinear communication
From MaRDI portal
Publication:6114277
DOI10.1007/978-3-031-22365-5_13zbMATH Open1519.94089MaRDI QIDQ6114277FDOQ6114277
Arkady Yerukhimovich, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Seung Geol Choi
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
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
Communication theory (94A05) Cryptography (94A60) Sampling theory in information and communication theory (94A20)
Cites Work
- Extensions of Lipschitz mappings into a Hilbert space
- Title not available (Why is that?)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- The Probabilistic Communication Complexity of Set Intersection
- An information statistics approach to data stream and communication complexity
- On the distributional complexity of disjointness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal sampling from sliding windows
- Secure multiparty computation of approximations
- Streaming Algorithms via Precision Sampling
- Secure sampling with sublinear communication
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Assisted Common Information With an Application to Secure Two-Party Sampling
- Counting distinct items over update streams
- Title not available (Why is that?)
Cited In (4)
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)
