{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T17:10:04Z","timestamp":1746205804575,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642552199"},{"type":"electronic","value":"9783642552205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55220-5_38","type":"book-chapter","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T11:47:50Z","timestamp":1398858470000},"page":"695-712","source":"Crossref","is-referenced-by-count":5,"title":["Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Morten","family":"Dahl","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","first-page":"104","volume-title":"Symposium on Principles of Programming Languages (POPL 2001)","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115. ACM Press, New York (2001)"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology\u00a015, 103\u2013127 (2002)","journal-title":"Journal of Cryptology"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated Verification of Selected Equivalences for Security Protocols. In: Symposium on Logic in Computer Science (LICS 2005), pp. 331\u2013340. IEEE (2005)","DOI":"10.1109\/LICS.2005.8"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R. Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 169\u2013188. Springer, Heidelberg (2011)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G. Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., B\u00e9guelin, S.Z.: Computer-aided security proofs for the working cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 71\u201390. Springer, Heidelberg (2011)"},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TDSC.2007.1005","volume":"5","author":"B. Blanchet","year":"2008","unstructured":"Blanchet, B.: A computationally sound mechanized prover for security protocols. IEEE Transactions on Dependable and Secure Computing\u00a05(4), 193\u2013207 (2008)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"38_CR7","unstructured":"Backes, M., Maffei, M., Mohammadi, E.: Computationally sound abstraction and verification of secure multi-party computations. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). LIPIcs, vol.\u00a08, pp. 352\u2013363. Schloss Dagstuhl (2010)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24597-1_1","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B.: A cryptographically sound security proof of the needham-schroeder-lowe public-key protocol. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 1\u201312. Springer, Heidelberg (2003)"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: Symmetric encryption in a simulatable dolev-yao style cryptographic library. In: Computer Security Foundations Workshop (CSFW 2004), pp. 204\u2013218. IEEE (2004)","DOI":"10.1109\/CSFW.2004.1310742"},{"key":"38_CR10","series-title":"IFIP","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/0-387-33406-8_20","volume-title":"Security and Privacy in Dynamic Environments","author":"M. Backes","year":"2006","unstructured":"Backes, M., Pfitzmann, B.: On the cryptographic key secrecy of the strengthened yahalom protocol. In: Fischer-H\u00fcbner, S., Rannenberg, K., Yngstr\u00f6m, L., Lindskog, S. (eds.) Security and Privacy in Dynamic Environments. IFIP, vol.\u00a0201, pp. 233\u2013245. Springer, Boston (2006)"},{"key":"38_CR11","first-page":"220","volume-title":"Computer and Communications Security (CCS 2003)","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: Computer and Communications Security (CCS 2003), pp. 220\u2013230. ACM, New York (2003)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"B\u00f6hl, F., Unruh, D.: Symbolic universal composability. In: Computer Security Foundations (CSF 2013), pp. 257\u2013271. IEEE (2013)","DOI":"10.1109\/CSF.2013.24"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Foundations of Computer Science (FOCS 2001), pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70583-3_1","volume-title":"Automata, Languages and Programming","author":"R. Canetti","year":"2008","unstructured":"Canetti, R.: Composable formal security analysis: Juggling soundness, simplicity and efficiency. 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. 1\u201313. Springer, Heidelberg (2008)"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Cortier, V.: Computational soundness of observational equivalence. In: Computer and Communications Security (CCS 2008), pp. 109\u2013118. ACM (2008)","DOI":"10.1145\/1455770.1455786"},{"key":"38_CR16","unstructured":"Canetti, R., Gajek, S.: Universally composable symbolic analysis of diffie-hellman based key exchange. IACR Cryptology ePrint Archive, 2010:303 (2010)"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11681878_20","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2006","unstructured":"Canetti, R., Herzog, J.C.: Universally composable symbolic analysis of mutual authentication and key-exchange protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 380\u2013403. Springer, Heidelberg (2006)"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-29101-2_5","volume-title":"Information Security Practice and Experience","author":"H. Comon-Lundh","year":"2012","unstructured":"Comon-Lundh, H., Hagiya, M., Kawamoto, Y., Sakurada, H.: Computational soundness of indistinguishability properties without computable parsing. In: Ryan, M.D., Smyth, B., Wang, G. (eds.) ISPEC 2012. LNCS, vol.\u00a07232, pp. 63\u201379. Springer, Heidelberg (2012)"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10817-010-9187-9","volume":"46","author":"V. Cortier","year":"2011","unstructured":"Cortier, V., Kremer, S., Warinschi, B.: A survey of symbolic methods in computational analysis of cryptographic systems. Journal of Automated Reasoning\u00a046, 225\u2013259 (2011)","journal-title":"Journal of Automated Reasoning"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.entcs.2007.02.012","volume":"172","author":"A. Datta","year":"2007","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Roy, A.: Protocol composition logic (PCL). Electronic Notes in Theoretical Computer Science\u00a0172, 311\u2013358 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"38_CR21","unstructured":"Delaune, S., Kremer, S., Pereira, O.: Simulation based security in the applied pi calculus. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), vol.\u00a04, pp. 169\u2013180 (2009)"},{"key":"38_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-00730-9_20","volume-title":"Information Security and Cryptology \u2013 ICISC 2008","author":"I. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Orlandi, C.: Essentially optimal universally composable oblivious transfer. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol.\u00a05461, pp. 318\u2013335. Springer, Heidelberg (2009)"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-88733-1_21","volume-title":"Provable Security","author":"P. Laud","year":"2008","unstructured":"Laud, P., Ngo, L.: Threshold homomorphic encryption in the universally composable cryptographic library. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol.\u00a05324, pp. 298\u2013312. Springer, Heidelberg (2008)"},{"issue":"1-3","key":"38_CR24","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2005.10.044","volume":"353","author":"J.C. Mitchell","year":"2006","unstructured":"Mitchell, J.C., Ramanathan, A., Scedrov, A., Teague, V.: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theoretical Computer Science\u00a0353(1-3), 118\u2013164 (2006)","journal-title":"Theoretical Computer Science"},{"key":"38_CR25","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":"38_CR26","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: Proc. of IEEE Symposium on Security and Privacy, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55220-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T16:36:48Z","timestamp":1746203808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55220-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552199","9783642552205"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55220-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}