Private Multiparty Sampling and Approximation of Vector Combinations

DOI10.1007/978-3-540-73420-8_23MaRDI QIDQ5428813zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Tal Malkin, Rebecca N. Wright, M. Strauss

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_23

Mathematics Subject Classification ID

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

Recommendations

• Private multiparty sampling and approximation of vector combinations
• Near-optimal private approximation protocols via a black box transformation
• Secure sampling with sublinear communication
• Practical private computation of vector addition-based functions
• Theory of Cryptography

Cited in

(5)

• Communication-Efficient Private Protocols for Longest Common Subsequence
• Privacy-preserving distributed algorithm for sparse vector sum
• Private multiparty sampling and approximation of vector combinations
• Secure sampling with sublinear communication
• 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 Q5428813)