{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:59:28Z","timestamp":1780545568286,"version":"3.54.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"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":[[2013,9]]},"DOI":"10.1109\/tit.2013.2264504","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T18:22:44Z","timestamp":1369160564000},"page":"5600-5612","source":"Crossref","is-referenced-by-count":30,"title":["Bounds on the Threshold Gap in Secret Sharing and its Applications"],"prefix":"10.1109","volume":"59","author":[{"given":"Ignacio","family":"Cascudo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronald","family":"Cramer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Chaoping Xing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"516","article-title":"Algebraic geometric secret sharing schemes and secure multi-party computation over small fields","author":"chen","year":"2006","journal-title":"Proc 26th Annu Int Conf Adv Cryptology (CRYPTO)"},{"key":"ref11","first-page":"329","article-title":"Secure computation from random error correcting codes","author":"chen","year":"2007","journal-title":"Proc 26th Int Conf Theory Appl Cryptographic Techniques (EUROCRYPT)"},{"key":"ref12","first-page":"316","article-title":"General secure multi-party computation from any linear secret sharing scheme","author":"cramer","year":"2000","journal-title":"Proc 19th Int Conf Theory Appl Cryptographic Techniques (EUROCRYPT)"},{"key":"ref13","first-page":"272","article-title":"Optimal black-box secret sharing over arbitrary Abelian groups","volume":"2442","author":"cramer","year":"2002","journal-title":"Proc 22nd Annu Int Conf Adv Cryptology (CRYPTO)"},{"key":"ref14","first-page":"301","article-title":"On perfect and adaptive security in exposure-resilient cryptography","volume":"2045","author":"dodis","year":"2001","journal-title":"Proc 10th Annu Int Conf Theory Appl Cryptographic Techniques EUROCRYPT"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"ref16","first-page":"51","article-title":"A combinatorial interpretation of ramp schemes","volume":"14","author":"jackson","year":"1996","journal-title":"Australas J Combin"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00129769"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"ref4","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc AFIPS Nat Comput Conf"},{"key":"ref3","author":"beimel","year":"2012","journal-title":"Personal communications"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56503-5_68"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1995.550475"},{"key":"ref8","first-page":"466","article-title":"Asymptotically good ideal linear secret sharing with strong multiplication over Any finite field","author":"cascudo","year":"2009","journal-title":"Proc 29th Annu Int Conf Adv Cryptology (CRYPTO)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00194-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_14"},{"key":"ref9","first-page":"685","article-title":"The torsion-limit for algebraic function fields and its application to arithmetic secret sharing","author":"cascudo","year":"2011","journal-title":"Proc 31st Annu Int Conf Adv Cryptology (CRYPTO)"},{"key":"ref1","author":"beimel","year":"1996","journal-title":"Secure schemes for secret sharing and key distribution"},{"key":"ref20","author":"kilian","year":"1990","journal-title":"Unpublished Result"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"ref21","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":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-013-0082-1"},{"key":"ref23","first-page":"690","article-title":"Some basic properties of general nonperfect secret sharing schemes","volume":"4","author":"ogata","year":"1998","journal-title":"J Universal Comput Sci"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref25","author":"pless","year":"2003","journal-title":"Fundamentals of Error-Correcting Codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6579681\/06517932.pdf?arnumber=6517932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:48Z","timestamp":1638218868000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6517932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":26,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2264504","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}