{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:18:40Z","timestamp":1743077920709,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20728-0_2","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T09:45:24Z","timestamp":1304588724000},"page":"6-24","source":"Crossref","is-referenced-by-count":5,"title":["Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity"],"prefix":"10.1007","author":[{"given":"Akinori","family":"Kawachi","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Portmann","sequence":"additional","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-48405-1_33","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Sahai, A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 519\u2013536. Springer, Heidelberg (1999), full version available at \n                  \n                    http:\/\/eprint.iacr.org\/2006\/228"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-48329-2_28","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"J. Bierbrauer","year":"1994","unstructured":"Bierbrauer, J., Johansson, T., Kabatianskii, G.A., Smeets, B.J.M.: On families of hash functions via geometric codes and concatenation. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 331\u2013342. Springer, Heidelberg (1994)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2000); a preliminary version appeared at STOC 1991","journal-title":"SIAM Journal on Computing"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-85093-9_21","volume-title":"Information Theoretic Security","author":"G. Hanaoka","year":"2008","unstructured":"Hanaoka, G.: Some information theoretic arguments for encryption: Non-malleability and chosen-ciphertext security (invited talk). In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, pp. 223\u2013231. Springer, Heidelberg (2008)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11617983_15","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"G. Hanaoka","year":"2006","unstructured":"Hanaoka, G., Hanaoka, Y., Hagiwara, M., Watanabe, H., Imai, H.: Unconditionally secure chaffing-and-winnowing: A relationship between encryption and authentication. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 2006. LNCS, vol.\u00a03857, pp. 154\u2013162. Springer, Heidelberg (2006)"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1093\/comjnl\/bxh149","volume":"49","author":"G. Hanaoka","year":"2006","unstructured":"Hanaoka, G., Shikata, J., Hanaoka, Y., Imai, H.: Unconditionally secure anonymous encryption and group authentication. The Computer Journal\u00a049(3), 310\u2013321 (2006); a preliminary version appeared at Asiacrypt 2002","journal-title":"The Computer Journal"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00145-005-0310-8","volume":"19","author":"J. Katz","year":"2006","unstructured":"Katz, J., Yung, M.: Characterization of security notions for probabilistic private-key encryption. Journal of Cryptology\u00a019(1), 67\u201395 (2006)","journal-title":"Journal of Cryptology"},{"key":"2_CR9","unstructured":"Kawachi, A., Portmann, C., Tanaka, K.: Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity. Cryptology ePrint Archive, Report 2011\/092 (2011); full version of the current paper, \n                  \n                    http:\/\/eprint.iacr.org\/2011\/092"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-27800-9_37","volume-title":"Information Security and Privacy","author":"L. McAven","year":"2004","unstructured":"McAven, L., Safavi-Naini, R., Yung, M.: Unconditionally secure encryption under strong attacks. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108, pp. 427\u2013439. Springer, Heidelberg (2004)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11818175_16","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R. Pass","year":"2006","unstructured":"Pass, R., Shelat, A., Vaikuntanathan, V.: Construction of a non-malleable encryption scheme from any semantically secure one. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 271\u2013289. Springer, Heidelberg (2006)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-76900-2_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R. Pass","year":"2007","unstructured":"Pass, R., Shelat, A., Vaikuntanathan, V.: Relations among notions of non-malleability for encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 519\u2013535. Springer, Heidelberg (2007)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Portmann, C., Tanaka, K.: Information-theoretic secrecy with access to decryption oracles. To appear in IEICE Transactions A, Fundamentals of Electronics, Communications and Computer Sciences (2011)","DOI":"10.1587\/transfun.E94.A.1585"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028(4), 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Universal hashing and authentication codes. Designs, Codes and Cryptography\u00a04(3), 369\u2013380 (1994); a preliminary version appeared at CRYPTO 1991","journal-title":"Designs, Codes and Cryptography"},{"key":"2_CR16","first-page":"7","volume":"114","author":"D.R. Stinson","year":"1996","unstructured":"Stinson, D.R.: On the connections between universal hashing, combinatorial designs and error-correcting codes. Proceedings of Congressus Numerantium\u00a0114, 7\u201327 (1996)","journal-title":"Proceedings of Congressus Numerantium"},{"key":"2_CR17","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice, 2 edn. Chapman & Hall\/CRC (2002)"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences\u00a022(3), 265\u2013279 (1981)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T02:37:41Z","timestamp":1558579061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}