{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:31:37Z","timestamp":1763811097018,"version":"3.37.3"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","award":["99025148"],"award-info":[{"award-number":["99025148"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tit.2023.3265093","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T17:29:55Z","timestamp":1680802195000},"page":"5364-5385","source":"Crossref","is-referenced-by-count":3,"title":["Partial Secret Sharing Schemes"],"prefix":"10.1109","volume":"69","author":[{"given":"Amir","family":"Jafari","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2493-8840","authenticated-orcid":false,"given":"Shahram","family":"Khazaei","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran"}]}],"member":"263","reference":[{"article-title":"Secret sharing and algorithmic information theory. (Partage de secret et the’orie algorithmique de l’information)","year":"2012","author":"kaced","key":"ref13"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"ref12","article-title":"Secret sharing and duality","author":"csirmaz","year":"2019","journal-title":"arXiv 1909 13663"},{"key":"ref56","first-page":"126","article-title":"Nonperfect secret sharing schemes and matroids","author":"kurosawa","year":"1993","journal-title":"Adv Cryptology"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1677"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_17"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03807-6_12"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1689"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2823328"},{"key":"ref55","first-page":"242","article-title":"Security of ramp schemes","author":"blakley","year":"1984","journal-title":"Proc Workshop Theory Appl Cryptograph Techn"},{"key":"ref10","first-page":"188","article-title":"On the power of nonlinear secret-sharing","author":"beimel","year":"2001","journal-title":"Proc 16th Annu IEEE Conf Comput Complex"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"ref17","first-page":"48","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csisz\u00e1r","year":"1996","journal-title":"Problemy Peredachi Inf"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2694-0_27"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_24"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.825796"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384293"},{"key":"ref46","first-page":"4","article-title":"Placing conditional disclosure of secrets in the communication complexity universe","volume":"124","author":"applebaum","year":"2019","journal-title":"Proc 10th Innov Theor Comput Sci Conf (ITCS)"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF00129769"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_21"},{"key":"ref47","first-page":"627","article-title":"Upslices, downslices, and secret-sharing with complexity of 1.5n","volume":"12827","author":"applebaum","year":"2021","journal-title":"Advances Cryptology CRYPTO'99"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2018014"},{"article-title":"On the complexity of perfect secret sharing schemes","year":"2013","author":"gharahi","key":"ref41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF01398012"},{"article-title":"A systematic approach for determining the linear CONVEC set of small access structures (in persian)","year":"2019","author":"bahariyan","key":"ref43"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_15"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013138"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-021-09410-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.08.032"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02451112"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430720906"},{"key":"ref6","first-page":"65","article-title":"New secret sharing schemes from old","volume":"14","author":"martin","year":"1993","journal-title":"J Combinat Math Combinat Comput"},{"key":"ref5","first-page":"1","article-title":"Graph decompositions and secret sharing schemes","author":"blundo","year":"1992","journal-title":"Proc Workshop Theory Appl Cryptograph Techn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2012-0026"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008381427667"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.272461"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2421905"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033894"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_14"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0217-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref32","first-page":"64","article-title":"Probabilistic secret sharing","author":"d\u2019arco","year":"2018","journal-title":"Proc 43rd Int Symp Math Found Comput Sci (MFCS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.01.016"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_25"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887090"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921708"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF00198463"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849341"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_12"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00004-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351812"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90007-K"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196772"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.11.007"},{"key":"ref66","first-page":"745","article-title":"Convexity\/concavity of Renyi entropy and ?-mutual information","author":"ho","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(01)00328-5"},{"key":"ref65","first-page":"249","article-title":"Combinatorial models for perfect secret sharing schemes","volume":"28","author":"jackson","year":"1998","journal-title":"J Combinat Math Combinat Comput"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849309"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_22"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388562"},{"key":"ref60","first-page":"67","article-title":"A construction of practical secret sharing schemes using linear block codes","author":"bertilsson","year":"1992","journal-title":"Proc Workshop Theory Appl Cryptograph Techn"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref61"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10183383\/10093987.pdf?arnumber=10093987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T18:00:31Z","timestamp":1691431231000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10093987\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":70,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3265093","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}