{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:56:22Z","timestamp":1769046982028,"version":"3.49.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"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":[[2014,3]]},"DOI":"10.1109\/tit.2014.2300113","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:50:19Z","timestamp":1391190619000},"page":"1652-1664","source":"Crossref","is-referenced-by-count":20,"title":["Natural Generalizations of Threshold Secret Sharing"],"prefix":"10.1109","volume":"60","author":[{"given":"Oriol","family":"Farras","sequence":"first","affiliation":[]},{"given":"Carles","family":"Padro","sequence":"additional","affiliation":[]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[]},{"given":"An","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9027-9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0334-8"},{"key":"ref33","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02410779"},{"key":"ref31","first-page":"286","article-title":"On the complexity of Matroid isomorphism problems","author":"rao","year":"2009","journal-title":"Proc 4th Int Comput Sci Symp Russia Comput Sci Theory Appl"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.887867"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF00125203"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_30"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1990-0993933-0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46885-4_45"},{"key":"ref40","author":"welsh","year":"1976","journal-title":"Matroid Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196772"},{"key":"ref12","author":"collins","year":"2002","journal-title":"A note on ideal tripartite access structures"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9101-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-011-9552-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182034"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.11.040"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1049\/ip-ifs:20060081"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021852421716"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050073"},{"key":"ref4","first-page":"11","author":"beimel","year":"2011","journal-title":"Secret-Sharing Schemes A Survey"},{"key":"ref27","first-page":"33","author":"massey","year":"1995","journal-title":"Codes and Ciphers Cryptography and Coding IV"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/120886960"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_3"},{"key":"ref29","author":"oxley","year":"1992","journal-title":"Matroid Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104445654"},{"key":"ref8","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc AFIPS Conf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388411"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9658-6"},{"key":"ref9","author":"bloom","year":"1981","journal-title":"A note on superfast threshold schemes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/316"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60693-9_7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388562"},{"key":"ref21","first-page":"99","article-title":"Secret sharing scheme realizing any access structure","author":"ito","year":"1987","journal-title":"Proc IEEE Globecom"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_19"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"ref26","first-page":"269","article-title":"Minimal codewords and secret sharing","author":"massey","year":"1993","journal-title":"Proc 6th Joint Swedish-Russian Workshop Inf Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1515\/jmc.2010.004"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6739111\/06712124.pdf?arnumber=6712124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:50Z","timestamp":1642004990000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6712124\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2300113","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}