@techreport{oai:ipsj.ixsq.nii.ac.jp:00225682,
 author = {Hiroki, Sudo and Ryo, Kikuchi and Koki, Hamada and Dai, Ikarashi and Hiroki, Sudo and Ryo, Kikuchi and Koki, Hamada and Dai, Ikarashi},
 issue = {6},
 month = {May},
 note = {As the use of data analysis becomes increasingly widespread, protecting confidential information has become a growing concern. To address this, secure multiparty computation (MPC) has gained attention as a useful and secure method. In this work, we propose a new technique to reduce total communication in specific cases (by one-third in the best case) compared to the state-of-the-art multiplication protocol for the (2, 3) replicated secret sharing scheme, despite the fact that the known protocol has already achieved the communication cost of one element per party. Additionally, we demonstrate that multiplication protocol can be extended to product-sum protocols by presenting a concrete protocol based on a general observation by Genkin et al., As the use of data analysis becomes increasingly widespread, protecting confidential information has become a growing concern. To address this, secure multiparty computation (MPC) has gained attention as a useful and secure method. In this work, we propose a new technique to reduce total communication in specific cases (by one-third in the best case) compared to the state-of-the-art multiplication protocol for the (2, 3) replicated secret sharing scheme, despite the fact that the known protocol has already achieved the communication cost of one element per party. Additionally, we demonstrate that multiplication protocol can be extended to product-sum protocols by presenting a concrete protocol based on a general observation by Genkin et al.},
 title = {Efficient multiplication protocols on the replicated secret sharing},
 year = {2023}
}