On the Impossibility of <I>d</I>-Multiplicative Non-perfect Secret Sharing

Maki YOSHIDA; Toru FUJIWARA

doi:10.1587/transfun.E98.A.767

On the Impossibility of d-Multiplicative Non-perfect Secret Sharing

Maki YOSHIDA, Toru FUJIWARA

Full Text Views

0

Share
Cite this

Summary :

A secret sharing scheme is said to be d-multiplicative if the scheme allows the players to multiply shared d secrets by locally converting their shares into an additive sharing of the product. In the previous work, the following negative result for perfect secret sharing has been shown: The d-multiplicative secret sharing for d players is impossible. This paper extends the impossibility result to non-perfect secret sharing. Our main result is a proof that d-multiplicative secret sharing for d players is impossible even if every player has partial information on the secret (e.g., all but one bit). This result means that there is no need to relax the privacy requirement with leakage of partial information only for the purpose of d-multiplication.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.2 pp.767-770

Publication Date: 2015/02/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E98.A.767

Type of Manuscript: LETTER

Category: Cryptography and Information Security

Authors

Maki YOSHIDA
National Institute of Information and Communications Technology
Toru FUJIWARA
Osaka University

Keyword

secret sharing, multiplicative, non-perfect, impossibility

Cite this

Copy

Maki YOSHIDA, Toru FUJIWARA, "On the Impossibility of d-Multiplicative Non-perfect Secret Sharing" in IEICE TRANSACTIONS on Fundamentals, vol. E98-A, no. 2, pp. 767-770, February 2015, doi: 10.1587/transfun.E98.A.767.
Abstract: A secret sharing scheme is said to be d-multiplicative if the scheme allows the players to multiply shared d secrets by locally converting their shares into an additive sharing of the product. In the previous work, the following negative result for perfect secret sharing has been shown: The d-multiplicative secret sharing for d players is impossible. This paper extends the impossibility result to non-perfect secret sharing. Our main result is a proof that d-multiplicative secret sharing for d players is impossible even if every player has partial information on the secret (e.g., all but one bit). This result means that there is no need to relax the privacy requirement with leakage of partial information only for the purpose of d-multiplication.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.767/_p

Copy

@ARTICLE{e98-a_2_767,
author={Maki YOSHIDA, Toru FUJIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Impossibility of d-Multiplicative Non-perfect Secret Sharing},
year={2015},
volume={E98-A},
number={2},
pages={767-770},
abstract={A secret sharing scheme is said to be d-multiplicative if the scheme allows the players to multiply shared d secrets by locally converting their shares into an additive sharing of the product. In the previous work, the following negative result for perfect secret sharing has been shown: The d-multiplicative secret sharing for d players is impossible. This paper extends the impossibility result to non-perfect secret sharing. Our main result is a proof that d-multiplicative secret sharing for d players is impossible even if every player has partial information on the secret (e.g., all but one bit). This result means that there is no need to relax the privacy requirement with leakage of partial information only for the purpose of d-multiplication.},
keywords={},
doi={10.1587/transfun.E98.A.767},
ISSN={1745-1337},
month={February},}

Copy

TY - JOUR
TI - On the Impossibility of d-Multiplicative Non-perfect Secret Sharing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 767
EP - 770
AU - Maki YOSHIDA
AU - Toru FUJIWARA
PY - 2015
DO - 10.1587/transfun.E98.A.767
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2015
AB - A secret sharing scheme is said to be d-multiplicative if the scheme allows the players to multiply shared d secrets by locally converting their shares into an additive sharing of the product. In the previous work, the following negative result for perfect secret sharing has been shown: The d-multiplicative secret sharing for d players is impossible. This paper extends the impossibility result to non-perfect secret sharing. Our main result is a proof that d-multiplicative secret sharing for d players is impossible even if every player has partial information on the secret (e.g., all but one bit). This result means that there is no need to relax the privacy requirement with leakage of partial information only for the purpose of d-multiplication.
ER -