{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:04:21Z","timestamp":1742965461812,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319174693"},{"type":"electronic","value":"9783319174709"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17470-9_13","type":"book-chapter","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T06:09:35Z","timestamp":1428041375000},"page":"214-235","source":"Crossref","is-referenced-by-count":4,"title":["Limited View Adversary Codes: Bounds, Constructions and Applications"],"prefix":"10.1007","author":[{"given":"Pengwei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-04268-8_14","volume-title":"Information Theoretic Security","author":"H. Ahmadi","year":"2014","unstructured":"Ahmadi, H., Safavi-Naini, R.: Detection of algebraic manipulation in the presence of leakage. In: Padr\u00f3, C. (ed.) ICITS 2013. LNCS, vol.\u00a08317, pp. 238\u2013258. Springer, Heidelberg (2014)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, 2nd edn. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 471\u2013488. Springer, Heidelberg (2008)"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/18.2627","volume":"34","author":"I. Csisz\u00e1r","year":"1988","unstructured":"Csisz\u00e1r, I., Narayan, P.: The capacity of the arbitrarily varying channel revisited: Positivity, constraints. IEEE Transactions on Information Theory\u00a034(2), 181\u2013193 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Dey, B.K., Jaggi, S., Langberg, M.: Codes against online adversaries. In: 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, pp. 1169\u20131176. IEEE (2009)","DOI":"10.1109\/ALLERTON.2009.5394553"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM\u00a040(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/2213977.2214010","volume-title":"Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, STOC 2012","author":"Z. Dvir","year":"2012","unstructured":"Dvir, Z., Lovett, S.: Subspace evasive sets. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, STOC 2012, pp. 351\u2013358. ACM, New York (2012)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/18.61123","volume":"37","author":"P. Elias","year":"1991","unstructured":"Elias, P.: Error-correcting codes for list decoding. IEEE Transactions on Information Theory\u00a037(1), 5\u201312 (1991)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M.K. Franklin","year":"2000","unstructured":"Franklin, M.K., Wright, R.N.: Secure communication in minimal connectivity models. J. Cryptology\u00a013(1), 9\u201330 (2000)","journal-title":"J. Cryptology"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"E.N. Gilbert","year":"1974","unstructured":"Gilbert, E.N., MacWilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell System Technical Journal\u00a053(3), 405\u2013424 (1974)","journal-title":"Bell System Technical Journal"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Guruswami, V.: Linear-algebraic list decoding of folded reed-solomon codes. In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, pp. 77\u201385. IEEE Computer Society (2011)","DOI":"10.1109\/CCC.2011.22"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Rudra, A.: Explicit capacity-achieving list-decodable codes. In: Kleinberg, J.M. (ed.) Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, pp. 1\u201310. ACM (2006)","DOI":"10.1145\/1132516.1132518"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Smith, A.: Codes for computationally simple channels: Explicit constructions with optimal rate. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, Nevada, USA, October 23-26, pp. 723\u2013732. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.74"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell System Technical Journal\u00a029(2), 147\u2013160 (1950)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TIT.2007.911217","volume":"54","author":"M. Langberg","year":"2008","unstructured":"Langberg, M.: Oblivious communication channels and their capacity. IEEE Transactions on Information Theory\u00a054(1), 424\u2013429 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TIT.2007.911217","volume":"54","author":"M. Langberg","year":"2008","unstructured":"Langberg, M.: Oblivious communication channels and their capacity. IEEE Transactions on Information Theory\u00a054(1), 424\u2013429 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Langberg, M., Jaggi, S., Dey, B.K.: Binary causal-adversary channels. In: IEEE International Symposium on Information Theory, ISIT 2009, pp. 2723\u20132727. IEEE (2009)","DOI":"10.1109\/ISIT.2009.5205859"},{"issue":"6","key":"13_CR18","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1109\/18.720535","volume":"44","author":"A. Lapidoth","year":"1998","unstructured":"Lapidoth, A., Narayan, P.: Reliable communication under channel uncertainty. IEEE Transactions on Information Theory\u00a044(6), 2148\u20132177 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/3-540-57785-8_183","volume-title":"STACS 94","author":"R.J. Lipton","year":"1994","unstructured":"Lipton, R.J.: A new approach to information theory. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 699\u2013708. Springer, Heidelberg (1994)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-55719-9_77","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"1992","unstructured":"Dietzfelbinger, M., Gil, J., Matias, Y., Pippenger, N.: Polynomial hash functions are reliable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 235\u2013246. Springer, Heidelberg (1992)"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1504\/IJACT.2010.038309","volume":"2","author":"A. Patra","year":"2010","unstructured":"Patra, A., Choudhury, A., Rangan, C.P., Srinathan, K.: Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. IJACT\u00a02(2), 159\u2013197 (2010)","journal-title":"IJACT"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-31284-7_21","volume-title":"Applied Cryptography and Network Security","author":"R. Safavi-Naini","year":"2012","unstructured":"Safavi-Naini, R., Tuhin, M.A.A., Wang, P.: A general construction for 1-round \u03b4-RMT and (0, \u03b4)-SMT. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS 2012. LNCS, vol.\u00a07341, pp. 344\u2013362. Springer, Heidelberg (2012)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Safavi-Naini, R., Wang, P.: Codes for limited view adversarial channels. In: Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, pp. 266\u2013270. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620229"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Safavi-Naini, R., Wang, P.: Efficient codes for limited view adversarial channels. In: 2013 IEEE Conference on Communications and Network Security (CNS), pp. 215\u2013223 (October 2013)","DOI":"10.1109\/CNS.2013.6682710"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Micali, S., Peikert, C., Sudan, M., Wilson, D.A.: Optimal error correction against computationally bounded noise. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 1\u201316. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30576-7_1"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume-title":"Advances in Cryptology","author":"G.J. Simmons","year":"1985","unstructured":"Simmons, G.J.: Authentication theory\/coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 411\u2013431. Springer, Heidelberg (1985)"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Wang, P., Safavi-Naini, R.: Adversarial wiretap channel with public discussion. CoRR abs\/1403.5598 (2014)","DOI":"10.1109\/CNS.2015.7346838"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Wang, P., Safavi-Naini, R.: An efficient code for adversarial wiretap channel. In: Proceedings of the 2014 IEEE Information Theory Workshop, Hobart, Australia, November 2-5, pp. 40\u201344. IEEE (2014)","DOI":"10.1109\/ITW.2014.6970788"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Wang, P., Safavi-Naini, R.: Efficient codes for adversarial wiretap channels. CoRR abs\/1401.4633 (2014)","DOI":"10.1109\/ITW.2014.6970788"},{"issue":"4","key":"13_CR30","first-page":"29","volume":"17","author":"V. Zyablov","year":"1981","unstructured":"Zyablov, V., Pinsker, M.: List cascade decoding. Problems of Information Transmission\u00a017(4), 29\u201334 (1981)","journal-title":"Problems of Information Transmission"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17470-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:44:53Z","timestamp":1676940293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17470-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319174693","9783319174709"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17470-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}