Secure distributed computation of the square root and applications

DOI10.1007/978-3-642-29101-2_19MaRDI QIDQ2894368zbMATH OpenOpenAlexFDO

Authors Manuel Liedel

Publication date 29 June 2012

Published in Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29101-2_19

zbMATH Keywords

fixed-point arithmeticQR-decompositionsecure computationsquare root

Mathematics Subject Classification ID

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

Recommendations

• Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
• scientific article; zbMATH DE number 167875
• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• A High-Speed Square Root Algorithm in Extension Fields
• scientific article; zbMATH DE number 1842488

Cited in

(3)

• The cost of IEEE arithmetic in secure computation
• Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering
• scientific article; zbMATH DE number 1257082 (Why is no real title available?)

This page was built for publication: Secure distributed computation of the square root and applications

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