Abstract
We investigate the adaptation of the spectral clustering algorithm to the privacy preserving domain. Spectral clustering is a data mining technique that divides points according to a measure of connectivity in a data graph. When the matrix data are privacy sensitive, cryptographic techniques can be applied to protect the data. A pivotal part of spectral clustering is the partial eigendecomposition of the graph Laplacian. The Lanczos algorithm is used to approximate the eigenvectors of the Laplacian. Many cryptographic techniques are designed to work with positive integers, whereas the numerical algorithms are generally applied in the real domain. To overcome this problem, the Lanczos algorithm is adapted to be performed with fixed-point arithmetic. Square roots are eliminated and floating-point computations are transformed to fixed-point computations. The effects of these adaptations on the accuracy and stability of the algorithm are investigated using standard datasets. The performance of the original and the adapted algorithm is similar when few eigenvectors are needed. For a large number of eigenvectors loss of orthogonality affects the results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP - a secure multi-party computation system. In: ACM CCS (2008)
Erkin, Z., Veugen, T., Toft, T., Lagendijk, R.L.: Privacy-preserving user clustering in a social network. In: IEEE International Workshop on Information Forensics and Security (2009)
Golub, G., Van Loan, C.: Matrix Computations. Johns Hopkins University Press (1996)
Hoogh de, S.J.A.: Design of large scale applications of secure multiparty computation: secure linear programming. Ph.D. thesis, Eindhoven University of Technology (2012)
Jakobsen, T.: Secure multi-party computation on integers (2006)
Lichman, M.: UCI machine learning repository. http://archive.ics.uci.edu/ml (2013)
Liedel, M.: Secure distributed computation of the square root and applications. In: International Conference on Information Security Practice and Experience, pp. 277–288. Springer (2012)
Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., Boneh, D.: Privacy-preserving matrix factorization. In: Proceedings of the 2013 ACM SIGSAC conference on Computer and communications security, pp. 801–812. ACM (2013)
Paige, C.C.: The computation of eigenvalues and eigenvectors of very large sparse matrices. Ph.D. thesis, University of London (1971)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of Eurocrypt 1999, Lecture Notes in Computer Science, vol. 1592, pp. 223–238. Springer-Verlag (1999). citeseer.ist.psu.edu/article/paillier99publickey.html
Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Journal of computational and applied mathematics 20, 53–65 (1987)
Sharma, S., Chen, K.: Privategraph: a cloud-centric system for spectral analysis of large encrypted graphs. In: IEEE 37th International Conference on Distributed Computing Systems, pp. 2507–2510. IEEE Computer Society (2017)
Sharma, S., Powers, J., Chen, K.: Privacy-preserving spectral analysis of large graphs in public clouds. In: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, pp. 71–82. ACM (2016)
Steverink, M.L.: Secure spectral clustering: the approximation of eigenvectors in the integer domain. Master’s thesis, Delft University of Technology (2017). http://resolver.tudelft.nl/uuid:284fc7f2-440d-4435-ae04-fea83d12c12f
Veugen, T.: Encrypted integer division and secure comparison. International Journal of Applied Cryptography 3, 166–180 (2014)
Von Luxburg, U.: A tutorial on spectral clustering. Statistics and computing 17(4), 395–416 (2007)
Yu, H.J., Huang, D.S.: Graphical representation for DNA sequences via joint diagonalization of matrix pencil. IEEE Journal of Biomedical and Health Informatics 17(3), 503–511 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Steverink, L., Veugen, T., Gijzen, M.B.v. (2021). Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering. In: Vermolen, F.J., Vuik, C. (eds) Numerical Mathematics and Advanced Applications ENUMATH 2019. Lecture Notes in Computational Science and Engineering, vol 139. Springer, Cham. https://doi.org/10.1007/978-3-030-55874-1_112
Download citation
DOI: https://doi.org/10.1007/978-3-030-55874-1_112
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-55873-4
Online ISBN: 978-3-030-55874-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)