Secret sharing schemes for infinite sets of participants: A new design technique

[1]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[2]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[3]  Amos Beimel,et al.  Secret-Sharing Schemes: A Survey , 2011, IWCC.

[4]  Gábor Tardos,et al.  On-line secret sharing , 2012, Des. Codes Cryptogr..

[5]  Anat Paskin-Cherniavsky,et al.  Evolving Secret Sharing: Dynamic Thresholds and Robustness , 2017, TCC.

[6]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[7]  Moni Naor,et al.  How to Share a Secret, Infinitely , 2018, IEEE Trans. Inf. Theory.

[8]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[9]  Alfredo De Santis,et al.  On the Equivalence of 2-Threshold Secret Sharing Schemes and Prefix Codes , 2018, CSS.

[10]  Wenchao Huang,et al.  Constructing Ideal Secret Sharing Schemes based on Chinese Remainder Theorem , 2018, IACR Cryptol. ePrint Arch..

[11]  Moni Naor,et al.  How to Share a Secret, Infinitely , 2016, IEEE Transactions on Information Theory.

[12]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[13]  Hugo Krawczyk,et al.  Secret Sharing Made Short , 1994, CRYPTO.

[14]  Alfredo De Santis,et al.  Probabilistic Secret Sharing , 2018, MFCS.

[15]  Dana Ron,et al.  Chinese remaindering with errors , 2000, IEEE Trans. Inf. Theory.

[16]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .