{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:22:07Z","timestamp":1770268927453,"version":"3.49.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/tit.2011.2162183","type":"journal-article","created":{"date-parts":[[2011,9,12]],"date-time":"2011-09-12T19:28:06Z","timestamp":1315855686000},"page":"5634-5649","source":"Crossref","is-referenced-by-count":21,"title":["Secret Sharing and Non-Shannon Information Inequalities"],"prefix":"10.1109","volume":"57","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Ilan","family":"Orlov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887090"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928963"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820037"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013138"},{"key":"ref31","first-page":"41","article-title":"Infinitely many information inequalities","author":"mat","year":"2007","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref30","author":"dougherty","year":"2009","journal-title":"Linear Rank Inequalities on Five or More Variables"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.10.014"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0061075"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1677"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261840"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2003.v3.n1.a4"},{"key":"ref29","first-page":"2116","article-title":"A projection method for derivation of non-Shannon-type information inequalities","author":"xu","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref2","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc AFIPS 1979 Nat Computer Conf"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00065-8"},{"key":"ref22","first-page":"429","article-title":"The dealer's random bits in perfect secret sharing schemes","volume":"32","author":"csirmaz","year":"1996","journal-title":"Studia Sci Math Hung"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01398012"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s000370100001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050058"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2002.v2.n2.a3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00194-4"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/BF02620136"},{"key":"ref55","author":"beimel","year":"1996","journal-title":"Secure schemes for secret sharing and key distribution"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)91063-X"},{"key":"ref53","first-page":"172","article-title":"Robust computational secret sharing and a unified account of classical secret-sharing goals","author":"bellare","year":"2007","journal-title":"Proc 14th ACM Conf Comput Commun Secur"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/18.335890"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180418"},{"key":"ref11","author":"waters","year":"2008","journal-title":"Ciphertext-Policy Attribute-Based Encryption An Expressive Efficient and Provably Secure Realization"},{"key":"ref40","author":"riis","year":"2007","journal-title":"Graph Entropy Network Coding and Guessing Games"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_3"},{"key":"ref13","first-page":"105","article-title":"Some ideal secret sharing schemes","volume":"6","author":"brickell","year":"1989","journal-title":"J Combin Math and Combin Comput"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BFb0053421","article-title":"A linear construction of perfect secret sharing schemes","volume":"950","author":"dijk","year":"1995","journal-title":"Advances in Cryptology Proc Of EUROCRYPT"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"ref16","first-page":"71","article-title":"The geometry of shared secret schemes","volume":"1","author":"simmons","year":"1991","journal-title":"Bull ICA"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0053420","article-title":"The size of a share must be large","volume":"950","author":"csirmaz","year":"1995","journal-title":"Advances in Cryptology Proc Of EUROCRYPT"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00198463"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"ref3","first-page":"99","article-title":"Secret sharing schemes realizing general access structure","author":"ito","year":"1987","journal-title":"Proc IEEE Global Telecomm Conf GLOBECOM"},{"key":"ref6","first-page":"11","article-title":"Multiparty unconditionally secure protocols","author":"chaum","year":"1988","journal-title":"Proc ACM Symp Theory of Computers"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_37"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","article-title":"General secure multi-party computation from any linear secret-sharing scheme","volume":"1807","author":"cramer","year":"2000","journal-title":"Advances in Cryptology ? EUROCRYPT 2000"},{"key":"ref49","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/71.722223"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492669"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57220-1_53"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00334-X"},{"key":"ref42","author":"metcalf-burton","year":"2008","journal-title":"Improved Upper Bounds for the Information Rates of the Secret Sharing Schemes Induced by the Vamos Matroid"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_12"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_14"},{"key":"ref43","author":"oxley","year":"1992","journal-title":"Matroid Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6006569\/06006590.pdf?arnumber=6006590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:42Z","timestamp":1633909662000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6006590\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":55,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2162183","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}