{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:28:12Z","timestamp":1761708492561},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_3","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"32-47","source":"Crossref","is-referenced-by-count":20,"title":["Eliminating Random Permutation Oracles in the Even-Mansour Cipher"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[]},{"given":"Zulfikar","family":"Ramzan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-24676-3_11","volume-title":"Advances in Cryptology - EUROCRYPT 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: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 171\u2013188. Springer, Heidelberg (2004)"},{"key":"3_CR2","first-page":"514","volume-title":"37th Annual Symposium on Foundations of Computer Science","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom functions revisited: The cascade construction and its concrete security. In: 37th Annual Symposium on Foundations of Computer Science, pp. 514\u2013523. IEEE, Los Alamitos (1996)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 341\u2013358. Springer, Heidelberg (1994)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: First ACM Conference on Computer and Communications Security, Fairfax, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/3-540-45539-6_41","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"Biryukov, A., Wagner, D.: Advanced slide attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 589. Springer, Heidelberg (2000)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: Proc. 30th ACM Symp. on Theory of Computing (1998)","DOI":"10.1145\/276698.276741"},{"key":"3_CR7","first-page":"495","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 1991","author":"J. Daemen","year":"1992","unstructured":"Daemen, J.: Limitations of the Even-Mansour construction. In: ASIACRYPT 1991, vol.\u00a0739, pp. 495\u2013498. Springer, Heidelberg (1992); Initially Presented at the Rump Session"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s001459900025","volume":"10","author":"S. Even","year":"1997","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. Journal of Cryptology\u00a010(3), 151\u2013162 (summer 1997); Earlier version in Proc. ASIACRYPT 1991. LNCS, vol. 739, pp. 210\u2013224. Springer, Heidelberg (1992)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1984","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 792\u2013807 (1984)","journal-title":"Journal of the ACM"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Tauman Kalai, Y.: On the (in)security of the Fiat-Shamir Paradigm. In: Proceedings of FOCS 2003 (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gentry, C., Ramzan, Z.: Eliminating random permutation oracles in the Even-Mansour cipher. Cryptology ePrint archive (2004)","DOI":"10.1007\/978-3-540-30539-2_3"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-68697-5_20","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"J. Kilian","year":"1996","unstructured":"Kilian, J., Rogaway, P.: How to protect against exhaustive search. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 252\u2013267. Springer, Heidelberg (1996)"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J. Computing"},{"key":"#cr-split#-3_CR14.1","unstructured":"National Bureau of Standards. FIPS publication 46: Data encryption standard (1977);"},{"key":"#cr-split#-3_CR14.2","unstructured":"Federal Information Processing Standards Publication 46"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. of Cryptology\u00a012, 29\u201366 (1999); Preliminary version in Proc. STOC 1997","journal-title":"J. of Cryptology"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-36492-7_18","volume-title":"Selected Areas in Cryptography","author":"S. Patel","year":"2003","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.: Luby-Rackoff ciphers: Why XOR is not exclusive. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 271\u2013290. Springer, Heidelberg (2003)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-44598-6_24","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Z. Ramzan","year":"2000","unstructured":"Ramzan, Z., Reyzin, L.: On the Round Security of Symmetric-Key Cryptographic Primitives. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 376. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:59:09Z","timestamp":1605761949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}