Accelerating the secure distributed computation of the mean by a Chebyshev expansion

DOI10.1007/978-3-642-31448-3_5MaRDI QIDQ2907362zbMATH OpenOpenAlexFDO

Authors Peter Lory, Manuel Liedel

Publication date 7 September 2012

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31448-3_5

zbMATH Keywords

Chebyshev expansionoblivious polynomial evaluationprivacy preserving data miningsecure two-party computations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Theory of Cryptography
• Secure computation of the median (and other elements of specified ranks)
• Oblivious sampling with applications to two-party k-means clustering
• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• Privacy preserving protocols for eigenvector computation

Cited in

(2)

• Chebyshev Polynomials in Distributed Consensus Applications
• Theory of Cryptography

This page was built for publication: Accelerating the secure distributed computation of the mean by a Chebyshev expansion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907362)