{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T01:40:21Z","timestamp":1741225221528,"version":"3.38.0"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1016\/j.tcs.2021.01.019","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T07:21:09Z","timestamp":1610608869000},"page":"149-161","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Secret sharing schemes for infinite sets of participants: A new design technique"],"prefix":"10.1016","volume":"859","author":[{"given":"Paolo","family":"D'Arco","sequence":"first","affiliation":[]},{"given":"Roberto","family":"De Prisco","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2021.01.019_br0010","series-title":"Coding and Cryptology - Third International Workshop, IWCC 2011","first-page":"11","article-title":"Secret-sharing schemes: a survey","author":"Beimel","year":"2011"},{"key":"10.1016\/j.tcs.2021.01.019_br0020","series-title":"CRYPTO","first-page":"27","article-title":"Generalized secret sharing and monotone functions","volume":"vol. 403","author":"Cohen Benaloh","year":"1988"},{"key":"10.1016\/j.tcs.2021.01.019_br0030","series-title":"Proceedings of the 1979 AFIPS National Computer Conference","first-page":"313","article-title":"Safeguarding cryptographic keys","author":"Blakley","year":"1979"},{"issue":"1","key":"10.1016\/j.tcs.2021.01.019_br0040","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10623-011-9540-y","article-title":"On-line secret sharing","volume":"63","author":"Csirmaz","year":"2012","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.tcs.2021.01.019_br0050","series-title":"CSS","first-page":"157","article-title":"On the equivalence of 2-threshold secret sharing schemes and prefix codes","volume":"vol. 11161","author":"D'Arco","year":"2018"},{"key":"10.1016\/j.tcs.2021.01.019_br0060","series-title":"MFCS","first-page":"64:1","article-title":"Probabilistic secret sharing","volume":"vol. 117","author":"D'Arco","year":"2018"},{"issue":"4","key":"10.1016\/j.tcs.2021.01.019_br0070","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1109\/18.850672","article-title":"Chinese remaindering with errors","volume":"46","author":"Goldreich","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2021.01.019_br0080","series-title":"Proc. of the IEEE Global Telecommunication Conf., Globecom 87","first-page":"99","article-title":"Secret sharing schemes realizing general access structure","author":"Ito","year":"1987"},{"key":"10.1016\/j.tcs.2021.01.019_br0090","series-title":"Structure in Complexity Theory Conference","first-page":"102","article-title":"On span programs","author":"Karchmer","year":"1993"},{"key":"10.1016\/j.tcs.2021.01.019_br0100","series-title":"TCC (B2)","first-page":"485","article-title":"How to share a secret, infinitely","volume":"vol. 9986","author":"Komargodski","year":"2016"},{"issue":"6","key":"10.1016\/j.tcs.2021.01.019_br0110","doi-asserted-by":"crossref","first-page":"4179","DOI":"10.1109\/TIT.2017.2779121","article-title":"How to share a secret, infinitely","volume":"64","author":"Komargodski","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2021.01.019_br0120","series-title":"TCC (2)","first-page":"379","article-title":"Evolving secret sharing: dynamic thresholds and robustness","volume":"vol. 10678","author":"Komargodski","year":"2017"},{"key":"10.1016\/j.tcs.2021.01.019_br0130","series-title":"Advances in Cryptology - CRYPTO \u201893, 13th Annual International Cryptology Conference","first-page":"136","article-title":"Secret sharing made short","author":"Krawczyk","year":"1993"},{"key":"10.1016\/j.tcs.2021.01.019_br0140","series-title":"Eurocrypt 1982","first-page":"371","article-title":"How to share a secret","volume":"vol. 149","author":"Mignotte","year":"1983"},{"key":"10.1016\/j.tcs.2021.01.019_br0150","series-title":"Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security","first-page":"310","article-title":"Constructing ideal secret sharing schemes based on Chinese remainder theorem","author":"Ning","year":"2018"},{"author":"Paskin-Cherniavsky","key":"10.1016\/j.tcs.2021.01.019_br0160"},{"key":"10.1016\/j.tcs.2021.01.019_br0170","first-page":"64","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Rosser","year":"1962","journal-title":"Ill. J. Math."},{"issue":"11","key":"10.1016\/j.tcs.2021.01.019_br0180","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/j.tcs.2021.01.019_br0190","article-title":"The geometry of shared secret schemes","volume":"1","author":"Simmons","year":"1991","journal-title":"Bull. Inst. Comb. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397521000347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397521000347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T01:04:23Z","timestamp":1741223063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397521000347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":19,"alternative-id":["S0304397521000347"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2021.01.019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Secret sharing schemes for infinite sets of participants: A new design technique","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2021.01.019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}