Paper 2026/2079

Period-Aligned Secure Cosine Evaluation Based on Two-Party Computation

Qingyu Mo, Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences
Abstract

The cosine function is widely used in machine-learning applications, but evaluating it on secret-shared data is difficult. Conventional approaches use polynomial approximations or lookup tables, whose costs grow substantially over large input domains. More recent protocols first reduce the private input modulo the cosine period, but securely performing this modular reduction also incurs significant cost. We present a period-aligned two-party cosine protocol. Based on the cosine addition rule, it rescales each share so that a wrap of the input modulus corresponds to a full $2\pi$ period and therefore does not change the recombined cosine. Each party evaluates sine and cosine locally on its share, while the secure computation uses only two cross-party products and one fixed-point output conversion. We evaluate the protocol directly on synthetic inputs and within private RFF-based RBF-SVM prediction. Comparisons with the protocol of Xing et al. (NDSS 2025) and Guo et al. (USENIX Security 2026) demonstrate better efficiency of our proposed protocol.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
secure cosine evaluationmulti-party computation
Contact author(s)
moqingyu @ cigit ac cn
History
2026-09-19: approved
2026-09-18: received
See all versions
Short URL
https://ia.cr/2026/2079
License
Creative Commons Attribution-NonCommercial-NoDerivs
CC BY-NC-ND

BibTeX

@misc{cryptoeprint:2026/2079,
      author = {Qingyu Mo},
      title = {Period-Aligned Secure Cosine Evaluation Based on Two-Party Computation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2079},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2079}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.