| Item type |
SIG Technical Reports(1) |
| 公開日 |
2023-05-04 |
| タイトル |
|
|
タイトル |
Efficient multiplication protocols on the replicated secret sharing |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Efficient multiplication protocols on the replicated secret sharing |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
主題Scheme |
Other |
|
主題 |
CSEC, 暗号 |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
NTT |
| 著者所属 |
|
|
|
NTT |
| 著者所属 |
|
|
|
NTT |
| 著者所属 |
|
|
|
NTT |
| 著者所属(英) |
|
|
|
en |
|
|
NTT |
| 著者所属(英) |
|
|
|
en |
|
|
NTT |
| 著者所属(英) |
|
|
|
en |
|
|
NTT |
| 著者所属(英) |
|
|
|
en |
|
|
NTT |
| 著者名 |
Hiroki, Sudo
Ryo, Kikuchi
Koki, Hamada
Dai, Ikarashi
|
| 著者名(英) |
Hiroki, Sudo
Ryo, Kikuchi
Koki, Hamada
Dai, Ikarashi
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA11235941 |
| 書誌情報 |
研究報告コンピュータセキュリティ（CSEC）
巻 2023-CSEC-101,
号 6,
p. 1-6,
発行日 2023-05-04
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8655 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-CSEC23101006.pdf (1.2 MB)
