{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T10:36:18Z","timestamp":1696847778661},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1016\/j.ipl.2011.10.022","type":"journal-article","created":{"date-parts":[[2011,11,11]],"date-time":"2011-11-11T23:02:48Z","timestamp":1321052568000},"page":"149-152","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of universal access structures"],"prefix":"10.1016","volume":"112","author":[{"given":"Laszlo","family":"Csirmaz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ipl.2011.10.022_br0010","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1008216403325","article-title":"Tight bounds on the information rate of secret sharing schemes","volume":"11","author":"Blundo","year":"1997","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/j.ipl.2011.10.022_br0020","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10623-009-9304-0","article-title":"An impossibility result on graph secret sharing","volume":"53","author":"Csirmaz","year":"2009","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/j.ipl.2011.10.022_br0030","series-title":"Information Theory. Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"1981"},{"key":"10.1016\/j.ipl.2011.10.022_br0040","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10623-003-4192-1","article-title":"Secret sharing schemes with three or four minimal qualified subsets","volume":"34","author":"Mart\u00ed-Farr\u00e9","year":"2005","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/j.ipl.2011.10.022_br0050","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10623-010-9446-0","article-title":"Optimal complexity of secret sharing schemes with four minimal qualified subsets","volume":"61","author":"Mart\u00ed-Farr\u00e9","year":"2011","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/j.ipl.2011.10.022_br0060","author":"Sondow"},{"issue":"1","key":"10.1016\/j.ipl.2011.10.022_br0070","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/18.272461","article-title":"Decomposition constructions for secret-sharing schemes","volume":"40","author":"Stinson","year":"1994","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019011003085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019011003085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T17:22:14Z","timestamp":1543425734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019011003085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["S0020019011003085"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2011.10.022","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.IPL.2011.10.022', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>