Private multiparty sampling and approximation of vector combinations
type: Item
instance of: scholarly article
title: Private multiparty sampling and approximation of vector combinations
zbMATH Open document ID: 1172.68017
author: Yuval Ishai
author: Tal Malkin
author: M. Strauss
author: Rebecca N. Wright
published in: Theoretical Computer Science
publication date: 2009-04-29T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5549394
zbMATH Keywords: secure multiparty computation
zbMATH Keywords: sublinear-communication algorithms
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.062
OpenAlex ID: W2083671567
cites work: Tracking join and self-join sizes in limited storage
cites work: Q4035733
cites work: Private approximation of search problems
cites work: Private Approximation of Clustering and Vertex Cover
cites work: How Should We Solve Search Problems Privately?
cites work: Q4250776
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Security and composition of multiparty cryptographic protocols
cites work: Private information retrieval
cites work: Size-estimation framework with applications to transitive closure and reachability
cites work: Algorithms - ESA 2003
cites work: Q3374904
cites work: Q2724587
cites work: Q3325625
cites work: Secure multiparty computation of approximations
cites work: Q5538132
cites work: Multi-party Indirect Indexing and Applications
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q3395988
cites work: Automata, Languages and Programming
cites work: Protecting data privacy in private information retrieval schemes
cites work: Fast, small-space algorithms for approximate histogram maintenance
cites work: Near-optimal sparse fourier representations via sampling
cites work: Foundations of Cryptography
cites work: Q3787498
cites work: Probabilistic encryption
cites work: Private approximation of NP-hard functions
cites work: Stable distributions, pseudorandom generators, embeddings, and data stream computation
cites work: Theory of Cryptography
cites work: Private Multiparty Sampling and Approximation of Vector Combinations
cites work: Q4434900
cites work: Q3579462
cites work: Q4783725
cites work: Privacy preserving data mining
cites work: Information Security
cites work: Randomized interpolation and approximation of sparse polynomials stPreliminary version
cites work: Communication preserving protocols for secure function evaluation
cites work: Oblivious transfer and polynomial evaluation
cites work: Q2707416
cites work: Bounded-concurrent secure multi-party computation with a dishonest majority
cites work: Q4249279
DOI: 10.1016/J.TCS.2008.12.062
Recommended article: Private Multiparty Sampling and Approximation of Vector Combinations
Recommended article: Secure multiparty computation of approximations
Recommended article: Q4535073
Recommended article: Secure sampling with sublinear communication
Recommended article: Secure random sampling in differential privacy
Recommended article: Efficient secure multiparty computation of sparse vector dot products
Recommended article: Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
Recommended article: Bounds on the sample complexity for private learning and private data release
Recommended article: Bounds on the Sample Complexity for Private Learning and Private Data Release
Recommended article: Private approximation of NP-hard functions
description: scientific article; zbMATH DE number 5549394