{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:26:05Z","timestamp":1743096365096,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445236"},{"type":"electronic","value":"9783319445243"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44524-3_12","type":"book-chapter","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T11:32:52Z","timestamp":1473334372000},"page":"195-211","source":"Crossref","is-referenced-by-count":1,"title":["Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes"],"prefix":"10.1007","author":[{"given":"Akinori","family":"Kawachi","sequence":"first","affiliation":[]},{"given":"Hirotoshi","family":"Takebe","sequence":"additional","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,9]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. Cryptol. 12(1), 29\u201366 (1999)","journal-title":"J. Cryptol."},{"issue":"2\u20133","key":"12_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.tcs.2005.09.016","volume":"348","author":"S Hoory","year":"2005","unstructured":"Hoory, S., Magen, A., Myers, S., Rackoff, C.: Simple permutations mix well. Theor. Comput. Sci. 348(2\u20133), 251\u2013261 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR3","first-page":"611","volume-title":"Handbook of Combinatorics","author":"PJ Cameron","year":"1995","unstructured":"Cameron, P.J.: Permutation groups. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol. 1, pp. 611\u2013645. MIT Press, Cambridge (1995)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Kuperberg, G., Lovett, S., Peled, R.: Probabilistic existence of rigid combinatorial structures. In: Karloff, H.J., Pitassi, T. (eds.) STOC, pp. 1091\u20131106. ACM (2012)","DOI":"10.1145\/2213977.2214075"},{"issue":"2","key":"12_CR5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR6","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1002\/rsa.20194","volume":"32","author":"A Brodsky","year":"2008","unstructured":"Brodsky, A., Hoory, S.: Simple permutations mix even better. Random Struct. Algorithms 32(3), 274\u2013289 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"12_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00453-008-9267-y","volume":"55","author":"E Kaplan","year":"2009","unstructured":"Kaplan, E., Naor, M., Reingold, O.: Derandomized constructions of k-wise (almost) independent permutations. Algorithmica 55(1), 113\u2013133 (2009)","journal-title":"Algorithmica"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-34117-5_8","volume-title":"Advances in Information and Computer Security","author":"A Kawachi","year":"2012","unstructured":"Kawachi, A., Takebe, H., Tanaka, K.: Symmetric-key encryption scheme with multi-ciphertext non-malleability. In: Hanaoka, G., Yamauchi, T. (eds.) IWSEC 2012. LNCS, vol. 7631, pp. 123\u2013137. Springer, Heidelberg (2012)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-642-32284-6_6","volume-title":"Information Theoretic Security","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y.: Shannon impossibility. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 100\u2013110. Springer, Heidelberg (2012). Revisited"},{"issue":"4","key":"12_CR10","doi-asserted-by":"crossref","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 Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/978-3-642-20728-0_2","volume-title":"Information Theoretic Security","author":"A Kawachi","year":"2011","unstructured":"Kawachi, A., Portmann, C., Tanaka, K.: Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol. 6673, pp. 6\u201324. Springer, Heidelberg (2011)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 5155, pp. 223\u2013231. Springer, Heidelberg (2008)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 773, pp. 331\u2013342. Springer, Heidelberg (1994)"},{"issue":"3","key":"12_CR14","doi-asserted-by":"crossref","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. Comput. J. 49(3), 310\u2013321 (2006)","journal-title":"Comput. J."},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3108, pp. 427\u2013439. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44524-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:14:59Z","timestamp":1498328099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44524-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445236","9783319445243"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44524-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}