{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:28:51Z","timestamp":1725892131787},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341168"},{"type":"electronic","value":"9783642341175"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34117-5_8","type":"book-chapter","created":{"date-parts":[[2012,11,2]],"date-time":"2012-11-02T01:30:45Z","timestamp":1351819845000},"page":"123-137","source":"Crossref","is-referenced-by-count":1,"title":["Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability"],"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","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","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\u00a032(3), 274\u2013289 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"8_CR2","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.: Nonmalleable cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0963548300001917","volume":"5","author":"W.T. Gowers","year":"1996","unstructured":"Gowers, W.T.: An almost m-wise independent random permutation of the cube. Combinatorics, Probability & Computing\u00a05, 119\u2013130 (1996)","journal-title":"Combinatorics, Probability & Computing"},{"key":"8_CR4","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)"},{"issue":"3","key":"8_CR5","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. Comput. J.\u00a049(3), 310\u2013321 (2006)","journal-title":"Comput. J."},{"issue":"2-3","key":"8_CR6","doi-asserted-by":"publisher","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.\u00a0348(2-3), 251\u2013261 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","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\u00a055(1), 113\u2013133 (2009)","journal-title":"Algorithmica"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06673, pp. 6\u201324. Springer, Heidelberg (2011)"},{"key":"8_CR9","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":"8_CR10","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":"8_CR11","doi-asserted-by":"crossref","unstructured":"Rees, E.G.: Notes on geometry. Springer (1983)","DOI":"10.1007\/978-3-642-61777-5"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM\u00a055(4) (2008)","DOI":"10.1145\/1391289.1391291"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TIT.2005.864438","volume":"52","author":"A. Russell","year":"2006","unstructured":"Russell, A., Wang, H.: How to fool an unbounded adversary with a short key. IEEE Transactions on Information Theory\u00a052(3), 1130\u20131140 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1-2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0020-0190(99)00163-5","volume":"73","author":"M.E. Saks","year":"2000","unstructured":"Saks, M.E., Srinivasan, A., Zhou, S., Zuckerman, D.: Low discrepancy sets yield approximate min-wise independent permutation families. Inf. Process. Lett.\u00a073(1-2), 29\u201332 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"8_CR15","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 System Technical Journal\u00a028(4), 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"}],"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-642-34117-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:45:31Z","timestamp":1620132331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34117-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341168","9783642341175"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34117-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}