Privacy-Preserving Floating-Point Operations: Optimizing Division in 2PC Frameworks

This paper proposes an optimized floating-point division protocol to address the issues of high communication overhead and computational complexity in existing protocols, while ensuring accuracy and security. The proposed method improves the mantissa computation process, significantly reducing data transmission volume and interaction rounds. Experimental results demonstrate that the proposed protocol outperforms existing mainstream methods in terms of runtime, communication overhead, and efficiency, thus optimizes complex nonlinear functions such as Sigmoid, Tanh, and Softmax. This research provides new insights into optimizing floating-point operations and establishes a solid foundation for the application of privacy-preserving computation in high-precision scenarios.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/iscait64916.2025.11010596
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Privacy-Preserving Floating-Point Operations: Optimizing Division in 2PC Frameworks

Yu Luo
Optimization and Search Problems
article

Privacy-Preserving Floating-Point Operations: Optimizing Division in 2PC Frameworks

Yu Luo
article en

Abstract

This paper proposes an optimized floating-point division protocol to address the issues of high communication overhead and computational complexity in existing protocols, while ensuring accuracy and security. The proposed method improves the mantissa computation process, significantly reducing data transmission volume and interaction rounds. Experimental results demonstrate that the proposed protocol outperforms existing mainstream methods in terms of runtime, communication overhead, and efficiency, thus optimizes complex nonlinear functions such as Sigmoid, Tanh, and Softmax. This research provides new insights into optimizing floating-point operations and establishes a solid foundation for the application of privacy-preserving computation in high-precision scenarios.

East China Normal University (CN)
Openalex Percentile: Top 87%
Optimization and Search Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.