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

DOI10.1007/978-3-030-55874-1_112zbMath1475.94015OpenAlexW3157182317MaRDI QIDQ3379536

Lisa Steverink, Martin B. van Gijzen, Thijs Veugen

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)

Uses Software

• FairplayMP

Cites Work

• Unnamed Item
• Encrypted integer division and secure comparison
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Secure Distributed Computation of the Square Root and Applications
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

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