Privacy preserving protocols for eigenvector computation

DOI10.1007/978-3-642-19896-0_10MaRDI QIDQ3003504zbMATH OpenOpenAlexFDO

Authors Manas A. Pathak, B. Raj

Publication date 27 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.3671

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Abstract: In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy constraints. Our proposed protocol is based on secure multi-party computation with a semi-honest arbitrator who deals with data encrypted by the other parties using an additive homomorphic cryptosystem. We augment the protocol with randomization and obfuscation to make it difficult for any party to estimate properties of the data belonging to other parties from the intermediate steps. The previous approaches towards this problem were based on expensive QR decomposition of correlation matrices, we present an efficient algorithm using the power iteration method. We analyze the protocol for correctness, security, and efficiency.

Recommendations

• Practical private computation of vector addition-based functions
• Asynchronous privacy-preserving iterative computation on peer-to-peer networks
• Secure Computation of Inner Product of Vectors with Distributed Entries and Its Applications to SVM
• Theory of Cryptography
• Efficient secure primitive for privacy preserving distributed computations

Cites work

• scientific article; zbMATH DE number 3890413 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• Computational Methods of Linear Algebra
• Eigentaste: A constant time collaborative filtering algorithm
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

Cited in

(5)

• Privacy-preserving inverse distance weighted interpolation
• Asynchronous privacy-preserving iterative computation on peer-to-peer networks
• Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering
• Accelerating the secure distributed computation of the mean by a Chebyshev expansion
• Privacy-preserving decentralised singular value decomposition

Describes a project that uses

Uses Software

• Eigentaste

This page was built for publication: Privacy preserving protocols for eigenvector computation

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