Private multiparty sampling and approximation of vector combinations
From MaRDI portal
Recommendations
- Private Multiparty Sampling and Approximation of Vector Combinations
- Secure multiparty computation of approximations
- scientific article; zbMATH DE number 1754645
- Secure sampling with sublinear communication
- Secure random sampling in differential privacy
- Efficient secure multiparty computation of sparse vector dot products
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- Bounds on the sample complexity for private learning and private data release
- Bounds on the sample complexity for private learning and private data release
- Private approximation of NP-hard functions
Cites work
- scientific article; zbMATH DE number 1583780 (Why is no real title available?)
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 5009196 (Why is no real title available?)
- scientific article; zbMATH DE number 5604104 (Why is no real title available?)
- scientific article; zbMATH DE number 5764869 (Why is no real title available?)
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 1302806 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 2009981 (Why is no real title available?)
- scientific article; zbMATH DE number 1842491 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Algorithms - ESA 2003
- Automata, Languages and Programming
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Communication preserving protocols for secure function evaluation
- Fast, small-space algorithms for approximate histogram maintenance
- Foundations of Cryptography
- How Should We Solve Search Problems Privately?
- Information Security
- Multi-party Indirect Indexing and Applications
- Near-optimal sparse fourier representations via sampling
- Oblivious transfer and polynomial evaluation
- Privacy preserving data mining
- Private Approximation of Clustering and Vertex Cover
- Private Multiparty Sampling and Approximation of Vector Combinations
- Private approximation of NP-hard functions
- Private approximation of search problems
- Private information retrieval
- Probabilistic encryption
- Protecting data privacy in private information retrieval schemes
- Randomized interpolation and approximation of sparse polynomials stPreliminary version
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Secure multiparty computation of approximations
- Security and composition of multiparty cryptographic protocols
- Size-estimation framework with applications to transitive closure and reachability
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Theory of Cryptography
- Theory of Cryptography
- Tracking join and self-join sizes in limited storage
Cited in
(8)- Arithmetic sketching
- Privacy-preserving distributed algorithm for sparse vector sum
- Optimal lower bound for differentially private multi-party aggregation
- Secure sampling with sublinear communication
- Practical private computation of vector addition-based functions
- Private Multiparty Sampling and Approximation of Vector Combinations
- Tight bounds on the randomness complexity of secure multiparty computation
- Two Party Distribution Testing: Communication and Security
This page was built for publication: Private multiparty sampling and approximation of vector combinations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014646)
