{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:58:49Z","timestamp":1743101929250,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289630"},{"type":"electronic","value":"9783540319818"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11555827_22","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:10:29Z","timestamp":1127815829000},"page":"374-396","source":"Crossref","is-referenced-by-count":48,"title":["Soundness of Formal Encryption in the Presence of Key-Cycles"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Ad\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gergei","family":"Bana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Herzog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45500-0_4","volume-title":"Theoretical Aspects of Computer Software","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., J\u00fcrjens, J.: Formal eavesdropping and its computational interpretation. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 82\u201394. Springer, Heidelberg (2001)"},{"key":"22_CR2","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology\u00a015(2), 103\u2013127 (2002); Prelim. version in IFIP TCS 2000"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/CSFW.2005.13","volume-title":"Proc. 18-th IEEE Computer Security Foundations Workshop (CSFW)","author":"P. Ad\u00e3o","year":"2005","unstructured":"Ad\u00e3o, P., Bana, G., Scedrov, A.: Computational and information-theoretic soundness and completeness of formal encryption. In: Proc. 18-th IEEE Computer Security Foundations Workshop (CSFW), pp. 170\u2013184. IEEE Comp. Soc. Press, Los Alamitos (2005)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/3-540-36494-3_59","volume-title":"STACS 2003","author":"M. Backes","year":"2003","unstructured":"Backes, M., Jacobi, C.: Cryptographically sound and machine-assisted verification of security protocols. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 675\u2013686. Springer, Heidelberg (2003)"},{"issue":"10","key":"22_CR5","doi-asserted-by":"crossref","first-page":"2075","DOI":"10.1109\/JSAC.2004.836016","volume":"22","author":"M. Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B.: A cryptographically sound security proof of the Needham-Schr\u00f6eder-Lowe public-key protocol. IEEE J. Selected Areas in Communications\u00a022(10), 2075\u20132086 (2004); Prelim. version in FSTTCS 2003","journal-title":"IEEE J. Selected Areas in Communications"},{"key":"#cr-split#-22_CR6.1","unstructured":"Backes, M., Pfitzmann, B.: Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In: Proc. 17-th IEEE Computer Security Foundations Workshop, CSFW (2004)"},{"key":"#cr-split#-22_CR6.2","doi-asserted-by":"crossref","unstructured":"Full version on ePrint 2004\/059","DOI":"10.1088\/1126-6708\/2004\/03\/059"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Symmetric authentication within a simulatable cryptographic library. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol.\u00a02808, pp. 271\u2013290. Springer, Heidelberg (2003), Extended version on ePrint 2003\/145","DOI":"10.1007\/978-3-540-39650-5_16"},{"key":"22_CR8","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Secure asynchronous reactive systems. ePrint 2004\/082"},{"issue":"2","key":"22_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TDSC.2005.25","volume":"2","author":"M. Backes","year":"2005","unstructured":"Backes, M., Pfitzmann, B.: Relating symbolic and cryptographic secrecy. IEEE Trans. on Dependable and Secure Computing\u00a02(2), 109\u2013123 (2005); Full version on ePrint 2004\/300","journal-title":"IEEE Trans. on Dependable and Secure Computing"},{"key":"#cr-split#-22_CR10.1","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: Proc. 10-th ACM Conf. on Computer and Communications Security (CCS), pp. 220-230. ACM Press, New York (2003)","DOI":"10.1145\/948109.948140"},{"key":"#cr-split#-22_CR10.2","doi-asserted-by":"crossref","unstructured":"Full version on ePrint 2003\/015","DOI":"10.1088\/1126-6708\/2003\/02\/015"},{"key":"22_CR11","unstructured":"Bana, G.: Soundness and Completeness of Formal Logics of Symmetric Encryption. PhD thesis, University of Pennsylvania (2004) Available on ePrint 2005\/101"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Baudet, M., Cortier, V., Kremer, S.: Computationally sound implementations of equational theories against passive adversaries. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 652\u2013663. Springer, Heidelberg (2005) (to appear)","DOI":"10.1007\/11523468_53"},{"key":"22_CR13","doi-asserted-by":"crossref","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, pp. 26\u201345. Springer, Heidelberg (1998); Full version available at, \n                  \n                    http:\/\/www.cs.ucsd.edu\/users\/mihir\/papers\/relations.html","DOI":"10.1007\/BFb0055718"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-36492-7_6","volume-title":"Selected Areas in Cryptography","author":"J. Black","year":"2003","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Encryption-scheme security in the presence of key-dependent messages. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 62\u201375. Springer, Heidelberg (2003)"},{"issue":"2","key":"22_CR15","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 a faulty minority. J. Cryptology\u00a04(2), 75\u2013122 (1991)","journal-title":"J. Cryptology"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 98\u2013118. Springer, Heidelberg (2001)"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"3","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology\u00a03(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"#cr-split#-22_CR18.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42-nd IEEE Symp. on Foundations of Comp. Sci (FOCS), pp. 136-145. IEEE Comp. Soc. Press, Los Alamitos (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-22_CR18.2","unstructured":"Full version on ePrint 2000\/067"},{"key":"22_CR19","unstructured":"Canetti, R., Herzog, J.: Universally composable symbolic analysis of cryptographic protocols (the case of encryption-based mutual authentication and key exchange). ePrint 2004\/334"},{"key":"22_CR20","first-page":"209","volume-title":"Proc. 30-th Annual ACM Symp. on Theory of Computing (STOC)","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: Proc. 30-th Annual ACM Symp. on Theory of Computing (STOC), pp. 209\u2013218. ACM Press, New York (1998)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-31987-0_12","volume-title":"Programming Languages and Systems","author":"V. Cortier","year":"2005","unstructured":"Cortier, V., Warinschi, B.: Computationally sound, automated proofs for security protocols. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 157\u2013171. Springer, Heidelberg (2005)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-30576-7_26","volume-title":"Theory of Cryptography","author":"A. Datta","year":"2005","unstructured":"Datta, A., K\u00fcsters, R., Mitchell, J.C., Ramanathan, A.: On the relationships between notions of simulation-based security. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 476\u2013494. Springer, Heidelberg (2005)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Shmatikov, V., Turuani, M.: Probabilistic polynomial-time semantics for a protocol security logic. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 16\u201329. Springer, Heidelberg (2005) (to appear)","DOI":"10.1007\/11523468_2"},{"issue":"2","key":"22_CR25","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the security of public-key protocols. IEEE Trans. on Information Theory\u00a029(2), 198\u2013208 (1983); Prelim. version in FOCS 1981","journal-title":"IEEE Trans. on Information Theory"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1145\/501983.502009","volume-title":"Proc. 8-th ACM Conf. on Computer and Communications Security (CCS)","author":"J.D. Guttman","year":"2001","unstructured":"Guttman, J.D., Thayer, F.J., Zuck, L.D.: The faithfulness of abstract protocol analysis: Message authentication. In: Proc. 8-th ACM Conf. on Computer and Communications Security (CCS), pp. 186\u2013195. ACM Press, New York (2001)"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology - CRYPTO 1990","author":"S. Goldwasser","year":"1991","unstructured":"Goldwasser, S., Levin, L.: Fair computation of general functions in presence of immoral majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"22_CR28","unstructured":"Herzog, J.: Computational Soundness of Formal Adversaries. Master thesis, MIT (2002)"},{"key":"22_CR29","unstructured":"Herzog, J.: Computational Soundness for Standard Assumptions of Formal Cryptography. PhD thesis, MIT (2004), Available at \n                  \n                    http:\/\/theory.lcs.mit.edu\/jherzog\/papers\/herzog-phd.pdf"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-45146-4_32","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Herzog","year":"2003","unstructured":"Herzog, J., Liskov, M., Micali, S.: Plaintext awareness via key registration. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 548\u2013564. Springer, Heidelberg (2003)"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-540-45146-4_31","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"O. Horvitz","year":"2003","unstructured":"Horvitz, O., Gligor, V.D.: Weak key authenticity and the computational completeness of formal encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 530\u2013547. Springer, Heidelberg (2003)"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/SFCS.2003.1238211","volume-title":"Proc. 44-th IEEE Symp. on Foundations of Comp. Sci. (FOCS)","author":"R. Impagliazzo","year":"2003","unstructured":"Impagliazzo, R., Kapron, B.M.: Logics for reasoning about cryptographic constructions. In: Proc. 44-th IEEE Symp. on Foundations of Comp. Sci (FOCS), pp. 372\u2013381. IEEE Comp. Soc. Press, Los Alamitos (2003)"},{"key":"22_CR33","unstructured":"Laud, P.: Encryption cycles and two views of cryptography. In: Proc. 7-th Nordic Workshop on Secure IT Systems (NORDSEC), Karlstad Univ. Studies No. 31, pp. 85\u2013100 (2002)"},{"key":"22_CR34","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/SECPRI.2004.1301316","volume-title":"Proc. 2004 IEEE Symp. on Security and Privacy","author":"P. Laud","year":"2004","unstructured":"Laud, P.: Symmetric encryption in automatic analyses for confidentiality against active adversaries. In: Proc. 2004 IEEE Symp. on Security and Privacy, pp. 71\u201385. IEEE Comp. Soc. Press, Los Alamitos (2004)"},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-24691-6_5","volume-title":"Information Security and Cryptology - ICISC 2003","author":"P. Laud","year":"2004","unstructured":"Laud, P., Corin, R.: Sound computational interpretation of formal encryption with composed keys. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol.\u00a02971, pp. 55\u201366. Springer, Heidelberg (2004)"},{"key":"22_CR36","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/288090.288117","volume-title":"Proc. 5-th ACM Conf. on Computer and Communications Security (CCS)","author":"P. Lincoln","year":"1998","unstructured":"Lincoln, P., Mitchell, J.C., Mitchell, M., Scedrov, A.: A probabilistic polynomial-time framework for protocol analysis. In: Proc. 5-th ACM Conf. on Computer and Communications Security (CCS), pp. 112\u2013121. ACM Press, New York (1998)"},{"key":"22_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"issue":"2","key":"22_CR38","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1998","unstructured":"Micali, S., Rackoff, C., Sloan, B.: The notion of security for probabilistic cryptosystems. SIAM J. Computing\u00a017(2), 412\u2013426 (1998)","journal-title":"SIAM J. Computing"},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-30576-7_10","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2005","unstructured":"Micciancio, D., Panjwani, S.: Adaptive security of symbolic encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 169\u2013187. Springer, Heidelberg (2005)"},{"issue":"1","key":"22_CR40","doi-asserted-by":"crossref","first-page":"99","DOI":"10.3233\/JCS-2004-12105","volume":"12","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Warinschi, B.: Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. J. Computer Security\u00a012(1), 99\u2013130 (2004); Prelim. version in WITS 2002","journal-title":"J. Computer Security"},{"key":"22_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-24638-1_8","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Warinschi, B.: Soundness of formal encryption in the presence of active adversaries. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 133\u2013151. Springer, Heidelberg (2004)"},{"key":"22_CR42","unstructured":"Mitchell, J.C., Ramanathan, A., Scedrov, A., Teague, V.: A probabilistic polynomial-time calculus for the analysis of cryptographic protocols. Full, revised version available on \n                  \n                    http:\/\/theory.stanford.edu\/people\/jcm\/publications.htm\n                  \n                  \n                . Prelim. report in FOSSACS 2004, LNCS, vol.\u00a02987. Springer, Heidelberg (2004)"},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Schunter, M., Waidner, M.: Cryptographic security of reactive systems. In: DERA\/RHUL Workshop on Secure Architectures and Information Flow, 1999. ENTCS (2000), \n                  \n                    http:\/\/www.elsevier.nl\/cas\/tree\/store\/tcs\/free\/noncas\/pc\/menu.htm","DOI":"10.1016\/S1571-0661(04)00095-7"},{"key":"22_CR44","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proc. 7-th ACM Conf. on Computer and Communications Security, pp. 245\u2013254. ACM Press, New York (2000); Extended version (with M. Schunter) IBM Research Report RZ 3206, 2000, \n                  \n                    http:\/\/www.zurich.ibm.com\/security\/models"},{"key":"22_CR45","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/SECPRI.2001.924298","volume-title":"Proc. 2001 IEEE Symp. on Security and Privacy","author":"B. Pfitzmann","year":"2001","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: Proc. 2001 IEEE Symp. on Security and Privacy, pp. 184\u2013200. IEEE Comp. Soc. Press, Los Alamitos (2001)"},{"key":"22_CR46","first-page":"543","volume-title":"40-th IEEE Symp. on Foundations of Comp. Sci. (FOCS)","author":"A. Sahai","year":"1999","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40-th IEEE Symp. on Foundations of Comp. Sci (FOCS), pp. 543\u2013553. IEEE Comp. Soc. Press, Los Alamitos (1999)"},{"key":"22_CR47","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/CSFW.2003.1212717","volume-title":"Proc. 16-th IEEE Computer Security Foundations Workshop (CSFW)","author":"B. Warinschi","year":"2003","unstructured":"Warinschi, B.: A computational analysis of the Needham-Schr\u00f6eder-(Lowe) protocol. In: Proc. 16-th IEEE Computer Security Foundations Workshop (CSFW), pp. 248\u2013262. IEEE Comp. Soc. Press, Los Alamitos (2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11555827_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:24:46Z","timestamp":1559507086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11555827_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289630","9783540319818"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/11555827_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}