{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T08:29:29Z","timestamp":1781598569054,"version":"3.54.5"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"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":[[2012,2]]},"DOI":"10.1109\/tit.2011.2170660","type":"journal-article","created":{"date-parts":[[2011,10,11]],"date-time":"2011-10-11T21:26:36Z","timestamp":1318368396000},"page":"1254-1274","source":"Crossref","is-referenced-by-count":38,"title":["Invertible Extractors and Wiretap Protocols"],"prefix":"10.1109","volume":"58","author":[{"given":"Mahdi","family":"Cheraghchi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fredric","family":"Didier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin","family":"Shokrollahi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1990-15918-X"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1054"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9002-x"},{"key":"ref32","first-page":"353","volume":"2","author":"lovsz","year":"1996","journal-title":"Combinatorics Paul Erdos Is Eighty"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90112-F"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a006"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_15"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1007\/978-3-540-30576-7_30","article-title":"Entropic security and the encryption of high-entropy messages","volume":"3378","author":"dodis","year":"2005","journal-title":"Proc Theory of Cryptography Conf (TCC) ser Lecture Notes in Computer Science"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITWTPI.2005.1543961"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.31"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2604-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-007-0593-z"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","author":"van lint","year":"1999","journal-title":"Introduction to Coding Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.27"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1090\/S0025-5718-1990-0993933-0","article-title":"New algorithms for finding irreducible polynomials over finite fields","volume":"54","author":"shoup","year":"1990","journal-title":"Math Comput"},{"key":"ref25","first-page":"1","article-title":"Theory of codes with maximum rank distance (translation)","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inf Transm"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579325"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-39799-X_37","article-title":"How to reduce your enemy's information","volume":"218","author":"bennett","year":"1985","journal-title":"Proc 5th Annu Int Cryptology Conf (CRYPTO) ser Lecture Notes in Computer Science"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref54","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc Annu Allerton Conf Communication Control and Computing"},{"key":"ref53","author":"yeung","year":"2005","journal-title":"Network Coding Theory ser Foundations and Trends in Communications and Information Theory"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref10","first-page":"503","article-title":"Exposure-resilient functions and all-or-nothing transforms","volume":"1666","author":"canetti","year":"1999","journal-title":"Proc 19th Annu Int Cryptology Conf (CRYPTO) ser Lecture Notes in Computer Science"},{"key":"ref11","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Information Theory (ISIT)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.24"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-44987-6_19","article-title":"On perfect and adaptive security in exposure-resilient cryptography","volume":"2045","author":"dodis","year":"2001","journal-title":"Proc Eurocrypt ser Lecture Notes in Computer Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.55"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267760"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/BFb0052348","article-title":"All-or-nothing encryption and the package transform","volume":"1267","author":"rivest","year":"1997","journal-title":"Proc Int Workshop on Fast Software Encryption ser Lecture Notes in Computer Science"},{"key":"ref16","first-page":"105","article-title":"Resilient functions and large set of orthogonal arrays","volume":"92","author":"stinson","year":"1993","journal-title":"Congr Numer"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00150-X"},{"key":"ref18","author":"dodis","year":"2000","journal-title":"Exposure-resilient Cryptography"},{"key":"ref19","first-page":"67","article-title":"Recent developments in explicit constructions of extractors","volume":"77","author":"shaltiel","year":"2002","journal-title":"Bull EATCS"},{"key":"ref4","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19821090103"},{"key":"ref5","first-page":"170","article-title":"Codes on algebraic curves","volume":"24","author":"goppa","year":"1981","journal-title":"Soviet Math Doklady"},{"key":"ref8","article-title":"Security for wiretap networks via rank-metric codes","author":"kschischang","year":"2007"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00145-001-0010-y","article-title":"Almost <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$k$<\/tex><\/formula>-wise independent sample spaces and their cryptologic applications","volume":"14","author":"kurosawa","year":"2001","journal-title":"J Cryptology"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055763"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446846"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref45","author":"bourgain","year":"2008"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1824"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502099"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1059513.1059516"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.010"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6145469\/06035782.pdf?arnumber=6035782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:22Z","timestamp":1633909642000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6035782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":57,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2170660","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}