TY - GEN

T1 - Efficient threshold secret sharing schemes secure against rushing cheaters

AU - Adhikari, Avishek

AU - Morozov, Kirill

AU - Obana, Satoshi

AU - Roy, Partha Sarathi

AU - Sakurai, Kouichi

AU - Xu, Rui

N1 - Funding Information:
S. Obana—Research is partially supported by a Kakenhi Grant-in-Aid for Scientific Research (C) 15K00193 from Japan Society for the Promotion of Science.
Funding Information:
K. Morozov—Research is partially supported by a Kakenhi Grant-in-Aid for Scientific Research (C) 15K00186 from Japan Society for the Promotion of Science. Research is partially supported by JST, CREST.
Funding Information:
A. Adhikari—Research is partially supported by National Board for Higher Mathematics, Department of Atomic Energy, Government of India, Grant No. 2/48(10)/2013/NBHM(R.P.)/R&D II/695. The author is also thankful to DST, Govt. of India and JSPS, Govt. of Japan for providing partial support for this collaborative research work under India Japan Cooperative Science Programme (vide Memo no. DST/INT/JSPS/P-191/2014 dated May 27, 2014.
Publisher Copyright:
© Springer International Publishing AG 2016.

PY - 2016

Y1 - 2016

N2 - In this paper, we consider two very important issues namely detection and identification of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares after observing shares of the honest users in the reconstruction phase. Towards this, we present four different schemes. Among these, first we present two k-out-of-n secret sharing schemes, the first one being capable of detecting (k − 1)/3 cheaters such that |Vi| = |S|/∊3 and the second one being capable of detecting n − 1 cheaters such that |Vi| = |S|/∊k+1, where S denotes the set of all possible secrets, ∊ denotes the successful cheating probability of cheaters and Vi denotes set all possible shares. Next we present two k-out-of-n secret sharing schemes, the first one being capable of identifying (k−1)/3 rushing cheaters with share size |Vi| that satisfies |Vi| = |S|/∊k. This is the first scheme, whose size of shares does not grow linearly with n but only with k, where n is the number of participants. For the second one, in the setting of public cheater identification, we present an efficient optimal cheater resilient k-out-of-n secret sharing scheme against rushing cheaters having the share size |Vi| = (n−t)n+2t|S|/∊n+2t. The proposed scheme achieves flexibility in the sense that the security level (i.e., the cheater(s) success probability) is independent of the secret size. Each of the four proposed schemes has the smallest share size among the existing schemes having the mentioned properties in the respective models.

AB - In this paper, we consider two very important issues namely detection and identification of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares after observing shares of the honest users in the reconstruction phase. Towards this, we present four different schemes. Among these, first we present two k-out-of-n secret sharing schemes, the first one being capable of detecting (k − 1)/3 cheaters such that |Vi| = |S|/∊3 and the second one being capable of detecting n − 1 cheaters such that |Vi| = |S|/∊k+1, where S denotes the set of all possible secrets, ∊ denotes the successful cheating probability of cheaters and Vi denotes set all possible shares. Next we present two k-out-of-n secret sharing schemes, the first one being capable of identifying (k−1)/3 rushing cheaters with share size |Vi| that satisfies |Vi| = |S|/∊k. This is the first scheme, whose size of shares does not grow linearly with n but only with k, where n is the number of participants. For the second one, in the setting of public cheater identification, we present an efficient optimal cheater resilient k-out-of-n secret sharing scheme against rushing cheaters having the share size |Vi| = (n−t)n+2t|S|/∊n+2t. The proposed scheme achieves flexibility in the sense that the security level (i.e., the cheater(s) success probability) is independent of the secret size. Each of the four proposed schemes has the smallest share size among the existing schemes having the mentioned properties in the respective models.

UR - http://www.scopus.com/inward/record.url?scp=84996538951&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84996538951&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-49175-2_1

DO - 10.1007/978-3-319-49175-2_1

M3 - Conference contribution

AN - SCOPUS:84996538951

SN - 9783319491745

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 23

BT - Information Theoretic Security - 9th International Conference, ICITS 2016, Revised Selected Papers

A2 - Barreto, Paulo

A2 - Nascimento, Anderson C.A.

PB - Springer Verlag

T2 - 9th International Conference on Information-Theoretic Security, ICITS 2016

Y2 - 9 August 2016 through 12 August 2016

ER -