Practical private computation of vector addition-based functions
From MaRDI portal
Publication:5401439
DOI10.1145/1281100.1281155zbMATH Open1283.94063OpenAlexW2113204425MaRDI QIDQ5401439FDOQ5401439
Authors: Yitao Duan, John Canny
Publication date: 13 March 2014
Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1281100.1281155
Recommendations
- How to deal with malicious users in privacy‐preserving distributed data mining
- Sum it up: verifiable additive homomorphic secret sharing
- Private Multiparty Sampling and Approximation of Vector Combinations
- Private multiparty sampling and approximation of vector combinations
- Secure Computation of Inner Product of Vectors with Distributed Entries and Its Applications to SVM
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cited In (6)
- Secure Computation of Inner Product of Vectors with Distributed Entries and Its Applications to SVM
- Privacy-preserving distributed algorithm for sparse vector sum
- Private Multiparty Sampling and Approximation of Vector Combinations
- Privacy preserving protocols for eigenvector computation
- A communication-privacy tradeoff for modular addition
- Privacy-preserving decentralised singular value decomposition
This page was built for publication: Practical private computation of vector addition-based functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401439)