Cheating Detectable Secret Sharing Schemes for Random Bit Strings

Wakaha OGATA; Toshinori ARAKI

doi:10.1587/transfun.E96.A.2230

Cheating Detectable Secret Sharing Schemes for Random Bit Strings

Wakaha OGATA, Toshinori ARAKI

Full Text Views

0

Cite this

Summary :

In secret sharing scheme, Tompa and Woll considered a problem of cheaters who try to make another participant reconstruct an invalid secret. Later, some models of such cheating were formalized and lower bounds of the size of shares were shown in the situation of fixing the minimum successful cheating probability. Under the assumption that cheaters do not know the distributed secret, no efficient scheme is known which can distribute bit strings. In this paper, we propose an efficient scheme for distributing bit strings with an arbitrary access structure. When distributing a random bit string with threshold access structures, the bit length of shares in the proposed scheme is only a few bits longer than the lower bound.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E96-A No.11 pp.2230-2234

Publication Date: 2013/11/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E96.A.2230

Type of Manuscript: PAPER

Category: Cryptography and Information Security

Authors

Wakaha OGATA
Tokyo Institute of Technology
Toshinori ARAKI
Tokyo Institute of Technology,NEC

Keyword

secret sharing, cheating detection

Cite this

Copy

Wakaha OGATA, Toshinori ARAKI, "Cheating Detectable Secret Sharing Schemes for Random Bit Strings" in IEICE TRANSACTIONS on Fundamentals, vol. E96-A, no. 11, pp. 2230-2234, November 2013, doi: 10.1587/transfun.E96.A.2230.
Abstract: In secret sharing scheme, Tompa and Woll considered a problem of cheaters who try to make another participant reconstruct an invalid secret. Later, some models of such cheating were formalized and lower bounds of the size of shares were shown in the situation of fixing the minimum successful cheating probability. Under the assumption that cheaters do not know the distributed secret, no efficient scheme is known which can distribute bit strings. In this paper, we propose an efficient scheme for distributing bit strings with an arbitrary access structure. When distributing a random bit string with threshold access structures, the bit length of shares in the proposed scheme is only a few bits longer than the lower bound.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.2230/_p

Copy

@ARTICLE{e96-a_11_2230,
author={Wakaha OGATA, Toshinori ARAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cheating Detectable Secret Sharing Schemes for Random Bit Strings},
year={2013},
volume={E96-A},
number={11},
pages={2230-2234},
abstract={In secret sharing scheme, Tompa and Woll considered a problem of cheaters who try to make another participant reconstruct an invalid secret. Later, some models of such cheating were formalized and lower bounds of the size of shares were shown in the situation of fixing the minimum successful cheating probability. Under the assumption that cheaters do not know the distributed secret, no efficient scheme is known which can distribute bit strings. In this paper, we propose an efficient scheme for distributing bit strings with an arbitrary access structure. When distributing a random bit string with threshold access structures, the bit length of shares in the proposed scheme is only a few bits longer than the lower bound.},
keywords={},
doi={10.1587/transfun.E96.A.2230},
ISSN={1745-1337},
month={November},}

Copy

TY - JOUR
TI - Cheating Detectable Secret Sharing Schemes for Random Bit Strings
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2230
EP - 2234
AU - Wakaha OGATA
AU - Toshinori ARAKI
PY - 2013
DO - 10.1587/transfun.E96.A.2230
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2013
AB - In secret sharing scheme, Tompa and Woll considered a problem of cheaters who try to make another participant reconstruct an invalid secret. Later, some models of such cheating were formalized and lower bounds of the size of shares were shown in the situation of fixing the minimum successful cheating probability. Under the assumption that cheaters do not know the distributed secret, no efficient scheme is known which can distribute bit strings. In this paper, we propose an efficient scheme for distributing bit strings with an arbitrary access structure. When distributing a random bit string with threshold access structures, the bit length of shares in the proposed scheme is only a few bits longer than the lower bound.
ER -