{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:34:06Z","timestamp":1761597246836},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240877"},{"type":"electronic","value":"9783540305026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30502-6_2","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:22:20Z","timestamp":1294438940000},"page":"13-32","source":"Crossref","is-referenced-by-count":16,"title":["On the Role Definitions in and Beyond Cryptography"],"prefix":"10.1007","author":[{"given":"Phillip","family":"Rogaway","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple secure unpredictable unpredictable pseudo-random number generator. SIAM J.\u00a0on Computing\u00a015, 364\u2013383 (1986)","journal-title":"SIAM J.\u00a0on Computing"},{"issue":"2","key":"2_CR2","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. JCSS\u00a037(2), 156\u2013189 (1988)","journal-title":"JCSS"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption: analysis of the DES modes of operation. In: FOCS 1997 (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 26. Springer, Heidelberg (1998)"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating faulty minority. J. of Cryptology\u00a04(2), 75\u2013122 (1991)","journal-title":"J. of Cryptology"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48969-X_1","volume-title":"Lectures on Data Security","author":"M. Bellare","year":"1999","unstructured":"Bellare, M.: Practice-oriented provable-security. In: Damg\u00e5rd, I.B. (ed.) EEF School 1998. LNCS, vol.\u00a01561, p. 1. Springer, Heidelberg (1999)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"STOC 1988","author":"M. Ben-or","year":"1988","unstructured":"Ben-or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1\u201310. ACM Press, New York (1988)"},{"issue":"3","key":"2_CR9","first-page":"262","volume":"61","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. JCSS\u00a061(3), 262\u2013399 (2000)","journal-title":"JCSS"},{"key":"2_CR10","unstructured":"Blum, M.: Coin flipping by phone. IEEE Spring COMPCOM, 133\u2013137 (1982)"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J.\u00a0on Computing\u00a013(4), 850\u2013864 (1984); Earlier version in FOCS 1982","journal-title":"SIAM J.\u00a0on Computing"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, p. 531. Springer, Heidelberg (2000)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-45539-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 139. Springer, Heidelberg (2000)"},{"key":"#cr-split#-2_CR14.1","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Secure asynchronous reactive systems. In: Cryptology ePrint report 2004\/082 (2004);"},{"key":"#cr-split#-2_CR14.2","unstructured":"Earlier version by Pfitzmann and Waidner in IEEE Symposium on Security and Privacy (2001)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A universally composable cryptographic library. In: Cryptology ePrint report 2003\/015 (2003)","DOI":"10.1145\/948109.948140"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44448-3_24","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Rogaway, P.: Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 317\u2013330. Springer, Heidelberg (2000)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Provably secure session key distribution: the three party case. In: STOC 1995, pp. 57\u201366 (1995)","DOI":"10.1145\/225058.225084"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracle are practical: a paradigm for designing efficient protocols. In: Conference on Computer and Communications Security, CCS 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret ballot elections. In: STOC 1994, pp. 544\u2013553 (1994)","DOI":"10.1145\/195058.195407"},{"key":"#cr-split#-2_CR21.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Cryptology ePrint report 2000\/67 (2001);","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-2_CR21.2","unstructured":"Earlier version in FOCS??2001"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-30598-9_25","volume-title":"Security in Communication Networks","author":"K. Choo","year":"2005","unstructured":"Choo, K., Boyd, C., Hitchcock, Y., Maitland, G.: On session identifiers in provably secure protocols, the Bellare-Rogaway three-party key distribution protocol revisited. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 351\u2013366. Springer, Heidelberg (2005)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Krawczyk, H.: The random oracle methodology, revisited. In: STOC 1998, pp. 209\u2013218 (1998)","DOI":"10.1145\/276698.276741"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-46035-7_22","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Krawczyk, H.: Universally composable notions of key exchange and secure channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 337\u2013351. Springer, Heidelberg (2002)"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"STOC 1971","author":"S. Cook","year":"1971","unstructured":"Cook, S.: The complexity of theorem-proving procedures. In: STOC 1971, pp. 151\u2013158. ACM Press, New York (1971)"},{"key":"2_CR26","unstructured":"Donescu, P., Gligor, V., Wagner, D.: A note on NSA\u2019s Dual Counter Mode of encryption. Manuscript (2001), Available from Wagner\u2019s webpage"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. on Inf. Th.\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Trans. on Inf. Th."},{"issue":"12","key":"2_CR28","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. on Information Theory\u00a029(12), 198\u2013208 (1983)","journal-title":"IEEE Trans. on Information Theory"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. JACM\u00a033(4), 210\u2013217 (1986)","journal-title":"JACM"},{"key":"2_CR31","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028, 270\u2013299 (1984)","journal-title":"JCSS"},{"issue":"1","key":"2_CR32","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J.\u00a0on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J.\u00a0on Computing"},{"issue":"2","key":"2_CR33","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J.\u00a0on Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J.\u00a0on Computing"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218\u2013229 (1997)","DOI":"10.1145\/28395.28420"},{"key":"#cr-split#-2_CR35.1","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The foundations of modern cryptography. Manuscript (2000);","DOI":"10.1017\/CBO9780511546891"},{"key":"#cr-split#-2_CR35.2","unstructured":"Available from Goldreich???s webpage. Earlier version in Crypto 1997"},{"key":"2_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a01, 2 (2001) Cambridge University Press, Cambridge (2004)"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-44987-6_32","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"C.S. Jutla","year":"2001","unstructured":"Jutla, C.S.: Encryption modes with almost free message integrity. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 529\u2013544. Springer, Heidelberg (2001)"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-44706-7_20","volume-title":"Fast Software Encryption","author":"J. Katz","year":"2001","unstructured":"Katz, J., Yung, M.: Unforgeable encryption and chosen ciphertext secure modes of operation. In: Schneier, B. (ed.) FSE 2000. LNCS, vol.\u00a01978, pp. 284\u2013299. Springer, Heidelberg (2001)"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J.\u00a0on Computing\u00a017(2) (April 1988)","DOI":"10.1137\/0217022"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S. Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 278\u2013296. Springer, Heidelberg (2004)"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC 1989, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"issue":"3","key":"2_CR42","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/937527.937529","volume":"6","author":"P. Rogaway","year":"2003","unstructured":"Rogaway, P., Bellare, M., Black, J.: OCB: a block-cipher mode of operation for efficient authenticated encryption. ACM Transactions on Information and System Security\u00a06(3), 365\u2013403 (2003)","journal-title":"ACM Transactions on Information and System Security"},{"key":"2_CR43","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, 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"key":"2_CR44","unstructured":"Shoup, V.: On formal methods for secure key exchange. Cryptology ePrint report 1999\/012 (1999)"},{"key":"2_CR45","unstructured":"Shamir, A., Rivest, R., Adleman, L.: Mental poker. MIT\/LCS report TM-125 (1979)"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Yao, A.: Theory and applications of trapdoor functions. In: FOCS 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30502-6_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:55Z","timestamp":1605761875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30502-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240877","9783540305026"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30502-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}