Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering

DOI10.1007/978-3-030-55874-1_112MaRDI QIDQ3379536zbMATH OpenOpenAlexFDO

Authors Lisa Steverink, Thijs Veugen, Martin B. van Gijzen

Publication date 27 September 2021

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL http://resolver.tudelft.nl/uuid:120436e7-f957-4628-9cc6-dae13c3342e6

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Cryptography (94A60) Computational methods for problems pertaining to information and communication theory (94-08)

Recommendations

• Privacy preserving protocols for eigenvector computation
• Secure Computation of Inner Product of Vectors with Distributed Entries and Its Applications to SVM
• Towards a practical cluster analysis over encrypted data
• A near-optimal algorithm for differentially-private principal components
• Spectral norm of random kernel matrices with applications to privacy
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries

Cites work

• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Encrypted integer division and secure comparison
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secure distributed computation of the square root and applications
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis

Describes a project that uses

Uses Software

• FairplayMP

This page was built for publication: Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering

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