Two Party Distribution Testing: Communication and Security
From MaRDI portal
Publication:5091163
DOI10.4230/LIPIcs.ICALP.2019.15OpenAlexW2966654298MaRDI QIDQ5091163
Tal Malkin, Alexandr Andoni, Negev Shekel Nosatzki
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1811.04065
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Private approximation of clustering and vertex cover
- Private multiparty sampling and approximation of vector combinations
- The space complexity of approximating the frequency moments
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Secure multiparty computation of approximations
- On Testing Expansion in Bounded-Degree Graphs
- Testing Symmetric Properties of Distributions
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Private Approximation of Search Problems
- Hypothesis testing with multiterminal data compression
- Asymptotically optimal classification for multiple tests with empirically observed statistics
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Statistical inference under multiterminal data compression
- Hypothesis testing with communication constraints
- An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
- Time-space hardness of learning sparse parities
- Inference Under Information Constraints II: Communication Constraints and Shared Randomness
- Fully homomorphic encryption using ideal lattices
- Private approximation of NP-hard functions
- Communication preserving protocols for secure function evaluation
- Communication complexity of estimating correlations
- Extractor-based time-space lower bounds for learning
- Quantum Algorithms for Testing Properties of Distributions
- Communication lower bounds for statistical estimation problems via a distributed data processing inequality
- Introduction to Property Testing
- Optimal Algorithms for Testing Closeness of Discrete Distributions
- Testing Closeness of Discrete Distributions
- Fast Private Norm Estimation and Heavy Hitters
- Hypothesis Testing with Finite Statistics
- Learning with Finite Memory
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Theory of Cryptography
This page was built for publication: Two Party Distribution Testing: Communication and Security
