Paper 2026/1612

DYNAFIX: Dynamic Fixed‑Point Encoding for Arbitrary‑Range MPC

Yuntian Chen
Tianpei Lu
Zhanyong Tang
Bingsheng Zhang
Wenjing Yang
Zhuzhu Wang
Kui Ren
Abstract

Privacy-preserving computation over real numbers typically employs either floating-point or fixed-point arithmetic. While fixed-point methods are highly efficient, they struggle to handle wide dynamic ranges. Conversely, floating-point methods support a much larger numerical scope but incur overheads more than a hundred times higher than their fixed-point counterparts. In this paper, we propose DYNAFIX, a dynamic fixed-point computation scheme that strikes a balance between floating-point and fixed-point arithmetic. Compared to traditional fixed-point approaches, our scheme supports an arbitrary numerical range; compared to floating-point computation, it maintains performance comparable to fixed-point execution. Experimental results demonstrate that our method achieves a $24.1\times$ speedup over the state-of-the-art when evaluating high-precision functions, such as the exponential function.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Contact author(s)
chenyt_x @ 163 com
lutianpei @ zju edu cn
zytang @ nwu edu cn
bingsheng @ zju edu cn
yangwenjing @ nwu edu cn
zzwang @ nwu edu cn
kuiren @ zju edu cn
History
2026-08-06: approved
2026-08-05: received
See all versions
Short URL
https://ia.cr/2026/1612
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/1612,
      author = {Yuntian Chen and Tianpei Lu and Zhanyong Tang and Bingsheng Zhang and Wenjing Yang and Zhuzhu Wang and Kui Ren},
      title = {{DYNAFIX}: Dynamic Fixed‑Point Encoding for Arbitrary‑Range {MPC}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1612},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1612}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.