{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:25Z","timestamp":1725475825877},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673804"},{"type":"electronic","value":"9783540455684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719994_1","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T20:38:40Z","timestamp":1167511120000},"page":"1-16","source":"Crossref","is-referenced-by-count":4,"title":["On Provable Security for Conventional Cryptography"],"prefix":"10.1007","author":[{"given":"Serge","family":"Vaudenay","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-48405-1_16","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J.H. An","year":"1999","unstructured":"An, J.H., Bellare, M.: Constructing VIL-MACs from FIL-MACs: Message Authentication under Weakened Assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 252\u2013269. Springer, Heidelberg (1999)"},{"key":"1_CR2","unstructured":"Baudron, O., Gilbert, H., Granboulan, L., Handschuh, H., Harley, R., Joux, A., Nguyen, P., Noilhan, F., Pointcheval, D., Pornin, T., Poupard, G., Stern, J., Vaudenay, S.: DFC Update. In: Proceedings from the Second Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology (NIST) (March 1999)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48519-8_17","volume-title":"Fast Software Encryption","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Rogaway, P.: On the Construction of Variable-Input-Length Ciphers. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol.\u00a01636, pp. 231\u2013244. Springer, Heidelberg (1999)"},{"key":"1_CR4","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":"1_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/scientificamerican0573-15","volume":"228","author":"H. Feistel","year":"1973","unstructured":"Feistel, H.: Cryptography and Computer Privacy. Scientific American\u00a0228, 15\u201323 (1973)","journal-title":"Scientific American"},{"key":"1_CR6","unstructured":"Gilbert, H., Girault, M., Hoogvorst, P., Noilhan, F., Pornin, T., Poupard, G., Stern, J., Vaudenay, S.: Decorrelated Fast Cipher: an AES Candidate (Extended Abstract.). In: Proceedings from the First Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology, NIST (August 1998)"},{"key":"1_CR7","unstructured":"Gilbert, H., Girault, M., Hoogvorst, P., Noilhan, F., Pornin, T., Poupard, G., Stern, J., Vaudenay, S.: Decorrelated Fast Cipher: an AES Candidate. Submitted to the Advanced Encryption Standard process. CD-ROM AES CD-1: Documentation, National Institute of Standards and Technology (NIST) (August 1998)"},{"key":"1_CR8","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 from Pseudorandom Functions. SIAM Journal on Computing\u00a017, 373\u2013386 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-60865-6_53","volume-title":"Fast Software Encryption","author":"S. Lucks","year":"1996","unstructured":"Lucks, S.: Faster Luby\u2013Rackoff Ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 189\u2013203. Springer, Heidelberg (1996)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-47555-9_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"U.M. Maurer","year":"1993","unstructured":"Maurer, U.M.: A Simplified and Generalized Treatment of Luby Rackoff Pseudorandom permutation generators. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 239\u2013255. Springer, Heidelberg (1993)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-48405-1_4","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"U.M. Maurer","year":"1999","unstructured":"Maurer, U.M.: Information-Theoretic Cryptography. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 47\u201364. Springer, Heidelberg (1999)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"66","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the Construction of Pseudorandom Permutations: Luby Rackoff Revisited. Journal of Cryptology\u00a066, 29\u201366 (1999)","journal-title":"Journal of Cryptology"},{"key":"1_CR13","unstructured":"Patarin, J.: Etude des G\u00e9n\u00e9rateurs de Permutations Bas\u00e9s sur le Sch\u00e9ma du D.E.S. Th\u00e8se de Doctorat de l\u2019Universit\u00e9 de Paris 6 (1991)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-47555-9_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"J. Patarin","year":"1993","unstructured":"Patarin, J.: How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 256\u2013266. Springer, Heidelberg (1993)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69710-1_8","volume-title":"Fast Software Encryption","author":"J. Patarin","year":"1998","unstructured":"Patarin, J.: About Feistel Schemes with Six (or More) Rounds. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol.\u00a01372, pp. 103\u2013121. Springer, Heidelberg (1998)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-46877-3_12","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"J. Pieprzyk","year":"1991","unstructured":"Pieprzyk, J.: How to Construct Pseudorandom Permutations from a Single Pseudorandom Functions. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 140\u2013150. Springer, Heidelberg (1991)"},{"key":"1_CR17","unstructured":"Sugita, M.: Pseudorandomness of Block Ciphers with Recursive Structures. Technical Report of IEICE. ISEC97\u20139"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0028566","volume-title":"STACS 98","author":"S. Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable Security for Block Ciphers by Decorrelation. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 249\u2013275. Springer, Heidelberg (1998)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: Provable Security for Block Ciphers by Decorrelation (Full Paper). Technical report LIENS-98-8, Ecole Normale Sup\u00e9rieure (1998), ftp:\/\/ftp.ens.fr\/pub\/reports\/liens\/liens-98-8.A4.ps.Z","DOI":"10.1007\/BFb0028566"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48892-8_1","volume-title":"Selected Areas in Cryptography","author":"S. Vaudenay","year":"1999","unstructured":"Vaudenay, S.: Feistel Ciphers with L2-Decorrelation. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 1\u201314. Springer, Heidelberg (1999)"},{"key":"1_CR21","unstructured":"Vaudenay, S.: The Decorrelation Technique Home-Page, http:\/\/www.dmi.ens.fr\/~vaudenay\/decorrelation.html"},{"key":"1_CR22","unstructured":"Vaudenay, S.: Vers une Th\u00e9orie du Chiffrement Sym\u00e9trique. Dissertation for the diploma of habilitation to supervise research from the University of Paris 7, Technical Report LIENS-98-15 of the Laboratoire d\u2019Informatique de l\u2019Ecole Normale Sup\u00e9rieure (1998)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-48910-X_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"S. Vaudenay","year":"1999","unstructured":"Vaudenay, S.: Resistance Against General Iterated Attacks. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 255\u2013271. Springer, Heidelberg (1999)"},{"key":"#cr-split#-1_CR24.1","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: On the Lai-Massey Scheme. Technical report LIENS-99-3, Ecole Normale Sup??rieure (1999);","DOI":"10.1007\/978-3-540-48000-6_2"},{"key":"#cr-split#-1_CR24.2","unstructured":"To appear in Lam, K.-Y., Okamoto, E., Xing, C. (eds.): ASIACRYPT 1999. LNCS, vol.??1716, pp. 8???19. Springer, Heidelberg (1999)"},{"key":"#cr-split#-1_CR25.1","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness. Technical report LIENS-99-2, Ecole Normale Sup??rieure (1999);","DOI":"10.1007\/3-540-46513-8_4"},{"key":"#cr-split#-1_CR25.2","unstructured":"To appear in Heys, H.M., Adams, C.M. (eds.): SAC 1999. LNCS, vol.??1758, p. 49. Springer, Heidelberg (2000), ftp:\/\/ftp.ens.fr\/pub\/reports\/liens\/liens-99-2.A4.ps.Z"},{"key":"1_CR26","unstructured":"Vaudenay, S.: Security of CBC-MAC (submitted)"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/0-387-34805-0_42","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Zheng","year":"1990","unstructured":"Zheng, Y., Matsumoto, T., Imai, H.: On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 461\u2013480. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719994_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T04:56:23Z","timestamp":1628312183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719994_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673804","9783540455684"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/10719994_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}