{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T03:08:51Z","timestamp":1730344131624,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.23919\/isita.2018.8664271","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T19:49:11Z","timestamp":1552333751000},"page":"331-333","source":"Crossref","is-referenced-by-count":1,"title":["Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding Theory"],"prefix":"10.23919","author":[{"given":"Ryutaroh","family":"Matsumoto","sequence":"first","affiliation":[]}],"member":"263","reference":[{"journal-title":"Quantum Computation and Quantum Information","year":"2000","author":"nielsen","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.032318"},{"article-title":"Quantum computing and the entanglement frontier","year":"2012","author":"preskill","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"journal-title":"Cryptography Theory and Practice","year":"2006","author":"stinson","key":"ref14"},{"key":"ref4","first-page":"291","article-title":"Secure computation from random error correccting codes","volume":"4515","author":"chen","year":"2007","journal-title":"Advances in Cryptology-CRYPTO 2007 Ser Lecture Notes in Computer Science"},{"article-title":"Improved bounds on the threashold gap in ramp secret sharing","year":"2018","author":"cascudo","key":"ref3"},{"article-title":"Bounds on the minimum distance of linear codes and quantum codes","year":"0","author":"grassl","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.83.648"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E100.A.2738"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.042332"},{"key":"ref2","first-page":"471","article-title":"Threshold secret sharing requires a linear size alphabet","author":"bogdanov","year":"2016","journal-title":"Theory of Cryptography"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0470-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-017-1656-1"}],"event":{"name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","start":{"date-parts":[[2018,10,28]]},"location":"Singapore","end":{"date-parts":[[2018,10,31]]}},"container-title":["2018 International Symposium on Information Theory and Its Applications (ISITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8660385\/8664205\/08664271.pdf?arnumber=8664271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T01:26:12Z","timestamp":1643246772000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8664271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.23919\/isita.2018.8664271","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}