Secret Sharing with Share-Conversion: Achieving Small Share-Size and Extendibility to Multiparty Computation

Ryo KIKUCHI; Koji CHIDA; Dai IKARASHI; Wakaha OGATA; Koki HAMADA; Katsumi TAKAHASHI

doi:10.1587/transfun.E98.A.213

Secret Sharing with Share-Conversion: Achieving Small Share-Size and Extendibility to Multiparty Computation

Ryo KIKUCHI, Koji CHIDA, Dai IKARASHI, Wakaha OGATA, Koki HAMADA, Katsumi TAKAHASHI

Full Text Views

0

Cite this

Summary :

Secret sharing scheme (SS) has been extensively studied since SSs are important not only for secure data storage but also as a fundamental building block for multiparty computation (MPC). For an application to secure data storage, the share size of SS is an important factor. For an application to a building block for MPC, the extendibility to MPC is needed. Computationally secure SSs and a ramp scheme have a small share size but there have been few studies concerning their MPC. In contrast, there have been many studies about MPC on Shamir's and replicated SSs while their share size is large. We consider an application scenario of SS such as applying SSs to secure data storage service with MPC. In this application, users store their data in servers through SS, and sometimes the servers perform MPC as an optional feature. In this case, the extendibility to MPC is needed and good code-efficiency is preferable. We propose a new computational SS, and show how to convert shares of our SS and a ramp SS to those of multiparty-friendly SS such as Shamir's and replicated SS. This enables one to secretly-share data compactly and extend secretly-shared data to MPC if needed.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.1 pp.213-222

Publication Date: 2015/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E98.A.213

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Foundation

Authors

Ryo KIKUCHI
  NTT Corporation
Koji CHIDA
  NTT Corporation
Dai IKARASHI
  NTT Corporation
Wakaha OGATA
  Tokyo Institute of Technology
Koki HAMADA
  NTT Corporation
Katsumi TAKAHASHI
  NTT Corporation

Keyword

secret sharing scheme, multiparty computation, code-efficiency

Cite this

Copy

Ryo KIKUCHI, Koji CHIDA, Dai IKARASHI, Wakaha OGATA, Koki HAMADA, Katsumi TAKAHASHI, "Secret Sharing with Share-Conversion: Achieving Small Share-Size and Extendibility to Multiparty Computation" in IEICE TRANSACTIONS on Fundamentals, vol. E98-A, no. 1, pp. 213-222, January 2015, doi: 10.1587/transfun.E98.A.213.
Abstract: Secret sharing scheme (SS) has been extensively studied since SSs are important not only for secure data storage but also as a fundamental building block for multiparty computation (MPC). For an application to secure data storage, the share size of SS is an important factor. For an application to a building block for MPC, the extendibility to MPC is needed. Computationally secure SSs and a ramp scheme have a small share size but there have been few studies concerning their MPC. In contrast, there have been many studies about MPC on Shamir's and replicated SSs while their share size is large. We consider an application scenario of SS such as applying SSs to secure data storage service with MPC. In this application, users store their data in servers through SS, and sometimes the servers perform MPC as an optional feature. In this case, the extendibility to MPC is needed and good code-efficiency is preferable. We propose a new computational SS, and show how to convert shares of our SS and a ramp SS to those of multiparty-friendly SS such as Shamir's and replicated SS. This enables one to secretly-share data compactly and extend secretly-shared data to MPC if needed.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.213/_p

Copy

@ARTICLE{e98-a_1_213,
author={Ryo KIKUCHI, Koji CHIDA, Dai IKARASHI, Wakaha OGATA, Koki HAMADA, Katsumi TAKAHASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Secret Sharing with Share-Conversion: Achieving Small Share-Size and Extendibility to Multiparty Computation},
year={2015},
volume={E98-A},
number={1},
pages={213-222},
abstract={Secret sharing scheme (SS) has been extensively studied since SSs are important not only for secure data storage but also as a fundamental building block for multiparty computation (MPC). For an application to secure data storage, the share size of SS is an important factor. For an application to a building block for MPC, the extendibility to MPC is needed. Computationally secure SSs and a ramp scheme have a small share size but there have been few studies concerning their MPC. In contrast, there have been many studies about MPC on Shamir's and replicated SSs while their share size is large. We consider an application scenario of SS such as applying SSs to secure data storage service with MPC. In this application, users store their data in servers through SS, and sometimes the servers perform MPC as an optional feature. In this case, the extendibility to MPC is needed and good code-efficiency is preferable. We propose a new computational SS, and show how to convert shares of our SS and a ramp SS to those of multiparty-friendly SS such as Shamir's and replicated SS. This enables one to secretly-share data compactly and extend secretly-shared data to MPC if needed.},
keywords={},
doi={10.1587/transfun.E98.A.213},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Secret Sharing with Share-Conversion: Achieving Small Share-Size and Extendibility to Multiparty Computation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 213
EP - 222
AU - Ryo KIKUCHI
AU - Koji CHIDA
AU - Dai IKARASHI
AU - Wakaha OGATA
AU - Koki HAMADA
AU - Katsumi TAKAHASHI
PY - 2015
DO - 10.1587/transfun.E98.A.213
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2015
AB - Secret sharing scheme (SS) has been extensively studied since SSs are important not only for secure data storage but also as a fundamental building block for multiparty computation (MPC). For an application to secure data storage, the share size of SS is an important factor. For an application to a building block for MPC, the extendibility to MPC is needed. Computationally secure SSs and a ramp scheme have a small share size but there have been few studies concerning their MPC. In contrast, there have been many studies about MPC on Shamir's and replicated SSs while their share size is large. We consider an application scenario of SS such as applying SSs to secure data storage service with MPC. In this application, users store their data in servers through SS, and sometimes the servers perform MPC as an optional feature. In this case, the extendibility to MPC is needed and good code-efficiency is preferable. We propose a new computational SS, and show how to convert shares of our SS and a ramp SS to those of multiparty-friendly SS such as Shamir's and replicated SS. This enables one to secretly-share data compactly and extend secretly-shared data to MPC if needed.
ER -