Private multiparty sampling and approximation of vector combinations
DOI10.1016/J.TCS.2008.12.062zbMATH Open1172.68017OpenAlexW2083671567MaRDI QIDQ1014646FDOQ1014646
Authors: Yuval Ishai, Tal Malkin, M. Strauss, Rebecca N. Wright 
Publication date: 29 April 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.062
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
Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25) Database theory (68P15) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Probabilistic encryption
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-optimal sparse fourier representations via sampling
- Advances in Cryptology - EUROCRYPT 2004
- Security and composition of multiparty cryptographic protocols
- Title not available (Why is that?)
- Oblivious transfer and polynomial evaluation
- Title not available (Why is that?)
- Foundations of Cryptography
- Theory of Cryptography
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Title not available (Why is that?)
- Protecting data privacy in private information retrieval schemes
- Size-estimation framework with applications to transitive closure and reachability
- Fast, small-space algorithms for approximate histogram maintenance
- Randomized interpolation and approximation of sparse polynomials stPreliminary version
- Secure multiparty computation of approximations
- Communication preserving protocols for secure function evaluation
- Privacy preserving data mining
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Private information retrieval
- Title not available (Why is that?)
- Private approximation of search problems
- Private Approximation of Clustering and Vertex Cover
- Private approximation of NP-hard functions
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Title not available (Why is that?)
- Tracking join and self-join sizes in limited storage
- Title not available (Why is that?)
- Information Security
- Theory of Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms - ESA 2003
- How Should We Solve Search Problems Privately?
- Multi-party Indirect Indexing and Applications
- Private Multiparty Sampling and Approximation of Vector Combinations
- Automata, Languages and Programming
Cited In (8)
- Two Party Distribution Testing: Communication and Security
- Tight bounds on the randomness complexity of secure multiparty computation
- Privacy-preserving distributed algorithm for sparse vector sum
- Private Multiparty Sampling and Approximation of Vector Combinations
- Secure sampling with sublinear communication
- Arithmetic sketching
- Optimal lower bound for differentially private multi-party aggregation
- Practical private computation of vector addition-based functions
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)
