Passive secure three-party computation with an honest majority
https://doi.org/10.55648/1998-6920-2025-19-1-45-53
Abstract
In 2016, the authors Araki T., Furukawa J., Lindell Y., Of A. and Ohara K. introduced a new information-theoretic protocol (and a computationally-secure variant) for secure three-party computation with an honest majority. The protocol has very minimal computation and communication. The authors did not provide a complete protocols. This paper provides complete protocols for secure multiparty computation.
About the Authors
Sergey Mikhailovich Ratseev
Ulyanovsk State University
Russian Federation
Russian Federation
Olga Ivanovna Cherevatenko
Ulyanovsk State Pedagogical University named after I.N. Ulyanov
Russian Federation
Russian Federation
References
1. Ratseev S. M. Kriptografiya. Bezopasnye mnogostoronnie vychisleniya [Cryptography. Secure multiparty computation]. St. Petersburg: Lan Publishing House, 2024. 468 p.
2. Feng D., Yang K. Concretely efficient secure multi-party computation protocols: survey and more //
3. Security and Safety. 2022. Vol. 1. P. 1–43. DOI: 10.1051/sands/2021001
4. Araki T., Furukawa J., Lindell Y., Nof A., Ohara K. High throughput semi-honest secure three-party computation with an honest majority // 2016. ACM. P. 805–817. DOI: 10.1145/2976749.2978331
5. Ratseev S. M. Kriptograficheskie protokoly. Skhemy razdeleniya sekreta [Cryptographic protocols. Secret sharing schemes]. St. Petersburg: Lan Publishing House, 2024. 336 p.
Supplementary files
Review
For citations:
Ratseev S.M., Cherevatenko O.I. Passive secure three-party computation with an honest majority. The Herald of the Siberian State University of Telecommunications and Information Science. 2025;19(1):45-53. (In Russ.) https://doi.org/10.55648/1998-6920-2025-19-1-45-53
Views:
80
Email this article 