TY - GEN
T1 - An efficient robust secret sharing scheme with optimal cheater resiliency
AU - Roy, Partha Sarathi
AU - Adhikari, Avishek
AU - Xu, Rui
AU - Morozov, Kirill
AU - Sakurai, Kouichi
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2014.
PY - 2014
Y1 - 2014
N2 - In this paper, we consider the problem of (t, δ) robust secret sharing secure against rushing adversary. We design a simple t-out-ofn secret sharing scheme, which can reconstruct the secret in presence of t cheating participants except with probability at most δ, provided t < n/2. The later condition on cheater resilience is optimal for the case of public reconstruction of the secret, on which we focus in this work. Our construction improves the share size of Cevallos et al. (EUROCRYPT-2012) robust secret sharing scheme by applying the “authentication tag compression” technique devised by Carpentieri in 1995. Our improvement is by a constant factor that does not contradict the asymptotic near-optimality of the former scheme. To the best of our knowledge, the proposed scheme has the smallest share size, among other efficient rushing (t, δ) robust secret sharing schemes with optimal cheater resilience.
AB - In this paper, we consider the problem of (t, δ) robust secret sharing secure against rushing adversary. We design a simple t-out-ofn secret sharing scheme, which can reconstruct the secret in presence of t cheating participants except with probability at most δ, provided t < n/2. The later condition on cheater resilience is optimal for the case of public reconstruction of the secret, on which we focus in this work. Our construction improves the share size of Cevallos et al. (EUROCRYPT-2012) robust secret sharing scheme by applying the “authentication tag compression” technique devised by Carpentieri in 1995. Our improvement is by a constant factor that does not contradict the asymptotic near-optimality of the former scheme. To the best of our knowledge, the proposed scheme has the smallest share size, among other efficient rushing (t, δ) robust secret sharing schemes with optimal cheater resilience.
UR - http://www.scopus.com/inward/record.url?scp=84910609058&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84910609058&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-12060-7_4
DO - 10.1007/978-3-319-12060-7_4
M3 - Conference contribution
AN - SCOPUS:84910609058
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 47
EP - 58
BT - Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings
A2 - Chakraborty, Rajat Subhra
A2 - Matyas, Vashek
A2 - Schaumont, Patrick
PB - Springer Verlag
T2 - 4th International Conference on Security, Privacy, and Applied Cryptography Engineering, SPACE 2014
Y2 - 18 October 2014 through 22 October 2014
ER -