TY - GEN

T1 - Evolving secret sharing

T2 - 15th International Conference on Theory of Cryptography, TCC 2017

AU - Komargodski, Ilan

AU - Paskin-Cherniavsky, Anat

N1 - Publisher Copyright:
© 2017, International Association for Cryptologic Research.

PY - 2017

Y1 - 2017

N2 - Threshold secret sharing schemes enable a dealer to share a secret among n parties such that only subsets of parties of cardinality at least k= k(n) can reconstruct the secret. Komargodski, Naor and Yogev (TCC 2016-B) proposed an efficient scheme for sharing a secret among an unbounded number of parties such that only subsets of k parties can recover the secret, where k is any fixed constant. This access structure is known as k-threshold. They left open the possibility of an efficient scheme for the dynamic threshold access structure, in which the qualified sets are of increasing size as the number of parties increases. We resolve this open problem and present a construction in which the share size of the t-th party is O(t4· log t) bits. Furthermore, we show how to generically translate any scheme for k-threshold into a scheme which is robust, where a shared secret can be recovered even if some parties hand-in incorrect shares. This answers another open problem of Komargodski et al. Our construction is based on the construction of robust (classical) secret sharing schemes of Cramer et al. (EUROCRYPT 2008) using algebraic manipulation detection codes.

AB - Threshold secret sharing schemes enable a dealer to share a secret among n parties such that only subsets of parties of cardinality at least k= k(n) can reconstruct the secret. Komargodski, Naor and Yogev (TCC 2016-B) proposed an efficient scheme for sharing a secret among an unbounded number of parties such that only subsets of k parties can recover the secret, where k is any fixed constant. This access structure is known as k-threshold. They left open the possibility of an efficient scheme for the dynamic threshold access structure, in which the qualified sets are of increasing size as the number of parties increases. We resolve this open problem and present a construction in which the share size of the t-th party is O(t4· log t) bits. Furthermore, we show how to generically translate any scheme for k-threshold into a scheme which is robust, where a shared secret can be recovered even if some parties hand-in incorrect shares. This answers another open problem of Komargodski et al. Our construction is based on the construction of robust (classical) secret sharing schemes of Cramer et al. (EUROCRYPT 2008) using algebraic manipulation detection codes.

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

U2 - 10.1007/978-3-319-70503-3_12

DO - 10.1007/978-3-319-70503-3_12

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85033786670

SN - 9783319705026

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

SP - 379

EP - 393

BT - Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings

A2 - Kalai, Yael

A2 - Reyzin, Leonid

Y2 - 12 November 2017 through 15 November 2017

ER -