An efficient robust secret sharing scheme with optimal cheater resiliency

Partha Sarathi Roy; Avishek Adhikari; Rui Xu; Kirill Morozov; Kouichi Sakurai

doi:10.1007/978-3-319-12060-7_4

An efficient robust secret sharing scheme with optimal cheater resiliency

Partha Sarathi Roy, Avishek Adhikari, Rui Xu, Kirill Morozov, Kouichi Sakurai

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings
Editors	Rajat Subhra Chakraborty, Vashek Matyas, Patrick Schaumont
Publisher	Springer Verlag
Pages	47-58
Number of pages	12
ISBN (Electronic)	9783319120591
DOIs	https://doi.org/10.1007/978-3-319-12060-7_4
Publication status	Published - 2014
Event	4th International Conference on Security, Privacy, and Applied Cryptography Engineering, SPACE 2014 - Pune, India Duration: Oct 18 2014 → Oct 22 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8804
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th International Conference on Security, Privacy, and Applied Cryptography Engineering, SPACE 2014
Country/Territory	India
City	Pune
Period	10/18/14 → 10/22/14

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-12060-7_4

Cite this

Roy, P. S., Adhikari, A., Xu, R., Morozov, K., & Sakurai, K. (2014). An efficient robust secret sharing scheme with optimal cheater resiliency. In R. S. Chakraborty, V. Matyas, & P. Schaumont (Eds.), Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings (pp. 47-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8804). Springer Verlag. https://doi.org/10.1007/978-3-319-12060-7_4

An efficient robust secret sharing scheme with optimal cheater resiliency. / Roy, Partha Sarathi; Adhikari, Avishek; Xu, Rui et al.
Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings. ed. / Rajat Subhra Chakraborty; Vashek Matyas; Patrick Schaumont. Springer Verlag, 2014. p. 47-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8804).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Roy, PS, Adhikari, A, Xu, R, Morozov, K & Sakurai, K 2014, An efficient robust secret sharing scheme with optimal cheater resiliency. in RS Chakraborty, V Matyas & P Schaumont (eds), Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8804, Springer Verlag, pp. 47-58, 4th International Conference on Security, Privacy, and Applied Cryptography Engineering, SPACE 2014, Pune, India, 10/18/14. https://doi.org/10.1007/978-3-319-12060-7_4

Roy PS, Adhikari A, Xu R, Morozov K, Sakurai K. An efficient robust secret sharing scheme with optimal cheater resiliency. In Chakraborty RS, Matyas V, Schaumont P, editors, Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings. Springer Verlag. 2014. p. 47-58. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-12060-7_4

Roy, Partha Sarathi ; Adhikari, Avishek ; Xu, Rui et al. / An efficient robust secret sharing scheme with optimal cheater resiliency. Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings. editor / Rajat Subhra Chakraborty ; Vashek Matyas ; Patrick Schaumont. Springer Verlag, 2014. pp. 47-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a3dff35568424134b3b8a5d50cc79b83,

title = "An efficient robust secret sharing scheme with optimal cheater resiliency",

abstract = "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.",

author = "Roy, {Partha Sarathi} and Avishek Adhikari and Rui Xu and Kirill Morozov and Kouichi Sakurai",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.; 4th International Conference on Security, Privacy, and Applied Cryptography Engineering, SPACE 2014 ; Conference date: 18-10-2014 Through 22-10-2014",

year = "2014",

doi = "10.1007/978-3-319-12060-7_4",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "47--58",

editor = "Chakraborty, {Rajat Subhra} and Vashek Matyas and Patrick Schaumont",

booktitle = "Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Proceedings",

address = "Germany",

}

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

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 -

An efficient robust secret sharing scheme with optimal cheater resiliency

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this