{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:00:21Z","timestamp":1725555621232},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130120"},{"type":"electronic","value":"9783642130137"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13013-7_24","type":"book-chapter","created":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T02:18:57Z","timestamp":1273803537000},"page":"403-419","source":"Crossref","is-referenced-by-count":6,"title":["Security of Encryption Schemes in Weakened Random Oracle Models"],"prefix":"10.1007","author":[{"given":"Akinori","family":"Kawachi","sequence":"first","affiliation":[]},{"given":"Akira","family":"Numayama","sequence":"additional","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]},{"given":"Keita","family":"Xagawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"CCS 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracle are practical: A paradigm for designing efficient protocols. In: CCS 1993, pp. 62\u201373. ACM, New York (1993)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD5 message-digest algorithm. Internet Request for Comments, RFC 1321 (April 1992)","DOI":"10.17487\/rfc1321"},{"key":"24_CR3","unstructured":"National Institute of Standards and Technology: Secure hash standard. FIPS 180-2 (August 2002)"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. Journal of the ACM\u00a051(4), 557\u2013594 (2004); Preliminary version in STOC 1998 (1998)","journal-title":"Journal of the ACM"},{"key":"24_CR5","first-page":"102","volume-title":"FOCS 2003","author":"S. Goldwasser","year":"2003","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: FOCS 2003, pp. 102\u2013113. IEEE Computer Society, Los Alamitos (2003)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-540-24676-3_11","volume-title":"CRYPTO 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Boldyreva, A., Palacio, A.: An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In: Franklin, M.K. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 171\u2013188. Springer, Heidelberg (2004)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures \u2013 how to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-03356-8_26","volume-title":"CRYPTO 2009","author":"G. Leurent","year":"2009","unstructured":"Leurent, G., Nguyen, P.Q.: How risky is the random-oracle model? In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 445\u2013464. Springer, Heidelberg (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2008\/441"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","first-page":"19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","first-page":"17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","first-page":"103","volume-title":"SAC 2008","author":"K. Aoki","year":"2008","unstructured":"Aoki, K., Sasaki, Y.: Preimage attacks on one-block MD4, 63-step MD5 and more. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 103\u2013119. Springer, Heidelberg (2008)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B.N. Nielsen","year":"2002","unstructured":"Nielsen, J.B.N.: Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Random oracles and auxiliary input. In: [34], pp. 205\u2013223","DOI":"10.1007\/978-3-540-74143-5_12"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-74462-7_25","volume-title":"Selected Areas in Cryptography","author":"M. Liskov","year":"2007","unstructured":"Liskov, M.: Constructing an ideal hash function from weak ideal compression functions. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 358\u2013375. Springer, Heidelberg (2007)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-540-70583-3_50","volume-title":"Automata, Languages and Programming","author":"J.J. Hoch","year":"2008","unstructured":"Hoch, J.J., Shamir, A.: On the strength of the concatenated hash combiner when all the hash functions are weak. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 616\u2013630. Springer, Heidelberg (2008)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-73458-1_25","volume-title":"Information Security and Privacy","author":"S. Pasini","year":"2007","unstructured":"Pasini, S., Vaudenay, S.: Hash-and-sign with weak hashing made secure. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 338\u2013354. Springer, Heidelberg (2007)"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-78440-1_16","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"A. Numayama","year":"2008","unstructured":"Numayama, A., Isshiki, T., Tanaka, K.: Security of digital signature schemes in weakened random oracle models. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 268\u2013287. Springer, Heidelberg (2008)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Fischlin, M., Lehmann, A.: Security-amplifying combiners for collision-resistant hash functions. In: [34], pp. 224\u2013243","DOI":"10.1007\/978-3-540-74143-5_13"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-01001-9_23","volume-title":"EUROCRYPT 2009","author":"E. Kiltz","year":"2009","unstructured":"Kiltz, E., Pietrzak, K.: On the security of padding-based encryption schemes (or: Why we cannot prove OAEP secure in the standard model). In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 389\u2013406. Springer, Heidelberg (2009)"},{"key":"24_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-Uniform Random Variate Generation","author":"L.D. Devroye","year":"1986","unstructured":"Devroye, L.D.: Non-Uniform Random Variate Generation. Springer, Heidelberg (1986)"},{"issue":"3","key":"24_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF02293108","volume":"12","author":"J.H. Ahrens","year":"1974","unstructured":"Ahrens, J.H., Dieter, U.: Computer methods for sampling from Gamma, Beta, Poisson and Binomial distributions. Computing\u00a012(3), 223\u2013246 (1974)","journal-title":"Computing"},{"issue":"3","key":"24_CR24","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02241999","volume":"25","author":"J.H. Ahrens","year":"1980","unstructured":"Ahrens, J.H., Dieter, U.: Sampling from Binomial and Poisson distributions: A method with bounded computation times. Computing\u00a025(3), 193\u2013208 (1980)","journal-title":"Computing"},{"issue":"339","key":"24_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.2307\/2284449","volume":"67","author":"D.A. Relles","year":"1972","unstructured":"Relles, D.A.: A simple algorithm for generating Binomial random variables when N is large. American Statistical Association\u00a067(339), 612\u2013613 (1972)","journal-title":"American Statistical Association"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Kawachi, A., Numayama, A., Tanaka, K., Xagawa, K.: Security of encryption schemes in weakened random oracle models. Cryptology ePrint Archive, Report 2010\/122 (2010)","DOI":"10.1007\/978-3-642-13013-7_24"},{"key":"24_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"24_CR28","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J. Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"24_CR29","unstructured":"Naito, Y., Wang, L., Ohta, K.: How to construct cryptosystems and hash functions in weakenend random oracle models. Cryptology ePrint Archive, Report 2009\/550 (2009)"},{"issue":"2","key":"24_CR30","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00145-002-0204-y","volume":"17","author":"E. Fujisaki","year":"2004","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is secure under the RSA assumption. Journal of Cryptology\u00a017(2), 81\u2013104 (2004)","journal-title":"Journal of Cryptology"},{"key":"24_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U.M. Maurer","year":"2004","unstructured":"Maurer, U.M., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"key":"24_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45353-9_13","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: REACT: Rapid enhanced-security asymmetric cryptosystem transform. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 159\u2013175. Springer, Heidelberg (2001)"},{"key":"24_CR33","series-title":"Lecture Notes in Computer Science","first-page":"175","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"J.S. Coron","year":"2002","unstructured":"Coron, J.S., Handschuh, H., Joye, M., Paillier, P., Pointcheval, D., Tymen, C.: Gem: A Generic chosen-ciphertext secure Encryption Method. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 175\u2013184. Springer, Heidelberg (2002)"},{"key":"24_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2007","year":"2007","unstructured":"Menezes, A. (ed.): CRYPTO 2007. LNCS, vol.\u00a04622. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13013-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:44:39Z","timestamp":1558277079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13013-7_24"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130120","9783642130137"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13013-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}