Private multiparty sampling and approximation of vector combinations

DOI10.1016/j.tcs.2008.12.062zbMath1172.68017OpenAlexW2083671567MaRDI QIDQ1014646

Tal Malkin, Yuval Ishai, Rebecca N. Wright, Martin J. Strauss

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

zbMATH Keywords

approximation algorithmssecure multiparty computationsublinear-communication algorithms

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Tight bounds on the randomness complexity of secure multiparty computation ⋮ Arithmetic sketching ⋮ Two Party Distribution Testing: Communication and Security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tracking join and self-join sizes in limited storage
• Probabilistic encryption
• Size-estimation framework with applications to transitive closure and reachability
• Protecting data privacy in private information retrieval schemes
• Security and composition of multiparty cryptographic protocols
• Oblivious transfer and polynomial evaluation
• Private approximation of search problems
• Secure multiparty computation of approximations
• Private information retrieval
• Stable distributions, pseudorandom generators, embeddings, and data stream computation
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-optimal sparse fourier representations via sampling
• Fast, small-space algorithms for approximate histogram maintenance
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Private Approximation of Clustering and Vertex Cover
• How Should We Solve Search Problems Privately?
• Foundations of Cryptography
• Private approximation of NP-hard functions
• Communication preserving protocols for secure function evaluation
• Randomized interpolation and approximation of sparse polynomials stPreliminary version
• Advances in Cryptology - EUROCRYPT 2004
• Multi-party Indirect Indexing and Applications
• Private Multiparty Sampling and Approximation of Vector Combinations
• Information Security
• Automata, Languages and Programming
• Algorithms - ESA 2003
• Theory of Cryptography
• Theory of Cryptography
• Privacy preserving data mining

This page was built for publication: Private multiparty sampling and approximation of vector combinations