{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:52Z","timestamp":1765113052099,"version":"3.40.5"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"project SERICS","award":["PE00000014"],"award-info":[{"award-number":["PE00000014"]}]},{"name":"NRRP MUR program"},{"name":"EU-NGEU"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tcomm.2024.3493802","type":"journal-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:52:52Z","timestamp":1731009172000},"page":"3240-3253","source":"Crossref","is-referenced-by-count":1,"title":["Constructions and Lower Bounds for Evolving Two-Threshold Secret Sharing Schemes"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9271-4240","authenticated-orcid":false,"given":"Paolo","family":"D'Arco","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Salerno, Fisciano, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0559-6897","authenticated-orcid":false,"given":"Roberto","family":"De Prisco","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Salerno, Fisciano, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8962-1919","authenticated-orcid":false,"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Salerno, Fisciano, Italy"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/mark.1979.8817296"},{"key":"ref3","first-page":"108","volume-title":"Thomas Elements of Information Theory","author":"Thomas","year":"2007"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01689-0_13"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.01.019"},{"key":"ref6","first-page":"1","article-title":"Probabilistic secret sharing","volume-title":"Proc. MFCS","volume":"117","author":"D\u2019Arco"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3261239"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2022.3213790"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37586-6_4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430720906"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"volume-title":"Unpublished result explained by Joe Kilian in an email dated Jan. 4, 1991 and addressed to Eyal Kushilevitz","year":"1990","author":"Kilian","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_19"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2779121"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_12"},{"issue":"1","key":"ref16","first-page":"31","article-title":"Some equivalence between Shannon entropy and Kolmogorov complexity","volume":"IT-24","author":"Sik","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"volume-title":"How To Infinitely Share a Secret More Efficiently","year":"2016","author":"Paskin-Cherniavsky","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264504"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3253720"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028194"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1201\/9781315282497"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11006303\/10746556.pdf?arnumber=10746556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T05:12:32Z","timestamp":1747458752000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10746556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":22,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3493802","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}