論文

査読有り
2015年1月

Adaptively and Unconditionally Secure Conversion Protocols between Ramp and Linear Secret Sharing

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
  • Ryo Kikuchi
  • ,
  • Dai Ikarashi
  • ,
  • Koki Hamada
  • ,
  • Koji Chida

E98A
1
開始ページ
223
終了ページ
231
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.1587/transfun.E98.A.223
出版者・発行元
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

Secret sharing (SS) has been extensively studied as for both secure data storage and a fundamental building block for multiparty computation (MPC). Recently, Kikuchi et al. proposed a passively and unconditionally secure conversion protocol that converts from a share of a ramp scheme to another of homomorphic SS scheme. The share-size of the ramp scheme is small, and the homomorphic SS scheme is a class of SS schemes that includes Shamir's and replicated SS schemes, which are convenient for MPC. Therefore, their protocol is a conversion from an SS scheme whose share-size is small to MPC-friendly SS schemes, and can be applied to reduce the amount of data storage while maintaining extendibility to MPC. We propose five unconditionally and actively secure protocols in the honest majority. In this paper, we consider a privacy and correctness as security requirement and does not consider a robustness: A cheat caused by an active adversary must be detected. These protocols consist of two conversion protocols, two reveal protocols and a protocol generating specific randomness. Main protocols among them are two conversion protocols for bilateral conversion between a ramp scheme and linear SS scheme, and the others are building blocks of the main protocols. Linear SS scheme is a subset of homomorphic SS scheme but includes both Shamir's and replicated SS schemes. Therefore, these main protocols are conversions between an SS scheme whose share-size is small to MPC-friendly SS schemes. These main protocols are unconditionally and actively secure so if MPC protocols used after the conversion are actively secure, the whole system involving SS scheme, conversion, and MPC protocols can be unconditionally and actively secure by using our main protocols. One of our two main protocols is the first to convert from MPC-friendly SS schemes to the ramp scheme. This enhances applications, such as secure backup, of the conversion protocol. Other than the two main protocols, we propose a protocol for generating specific randomnesses and two reveal protocols as building blocks. The latter two reveal protocols are actively and unconditionally secure in the honest majority and requires O(n parallel to F parallel to)-bit communication per revealing, and we believe that it is independently interest.

リンク情報
DOI
https://doi.org/10.1587/transfun.E98.A.223
DBLP
https://dblp.uni-trier.de/rec/journals/ieicet/KikuchiIHC15
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000359464100022&DestApp=WOS_CPL
URL
http://search.ieice.org/bin/summary.php?id=e98-a_1_223
URL
http://dblp.uni-trier.de/db/journals/ieicet/ieicet98a.html#journals/ieicet/KikuchiIHC15
ID情報
  • DOI : 10.1587/transfun.E98.A.223
  • ISSN : 1745-1337
  • DBLP ID : journals/ieicet/KikuchiIHC15
  • Web of Science ID : WOS:000359464100022

エクスポート
BibTeX RIS