{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:54:59Z","timestamp":1725504899343},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540786627"},{"type":"electronic","value":"9783540786634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78663-4_20","type":"book-chapter","created":{"date-parts":[[2008,3,8]],"date-time":"2008-03-08T06:00:01Z","timestamp":1204956001000},"page":"294-311","source":"Crossref","is-referenced-by-count":7,"title":["Application of Dependency Graphs to Security Protocol Analysis"],"prefix":"10.1007","author":[{"given":"Ilja","family":"T\u0161ahhirov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44929-9_1","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"M. Abadi","year":"2000","unstructured":"Abadi, M., Rogaway, P.: Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption). In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 3\u201322. Springer, Heidelberg (2000)"},{"key":"20_CR2","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":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/11555827_22","volume-title":"Computer Security \u2013 ESORICS 2005","author":"P. Ad\u00e3o","year":"2005","unstructured":"Ad\u00e3o, P., Bana, G., Herzog, J., Scedrov, A.: Soundness of formal encryption in the presence of key-cycles. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 374\u2013396. Springer, Heidelberg (2005)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A Composable Cryptographic Library with Nested Operations. In: 10th ACM Conference on Computer and Communications Security (CCS 2003), October 2003, pp. 220\u2013230 (2003)","DOI":"10.1145\/948109.948140"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Backes, M., Laud, P.: Computationally Sound Secrecy Proofs by Mechanized Flow Analysis. In: 13th ACM Conference on Computer and Communications Security (CCS 2006), pp. 370\u2013379 (2006)","DOI":"10.1145\/1180405.1180450"},{"key":"20_CR6","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, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"20_CR7","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, pp. 531\u2013545. Springer, Heidelberg (2000)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006), http:\/\/eprint.iacr.org"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: A computationally sound mechanized prover for security protocols. In: Proc. 27th IEEE Symposium on Security & Privacy (2006)","DOI":"10.1109\/SP.2006.1"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/11818175_32","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"B. Blanchet","year":"2006","unstructured":"Blanchet, B., Pointcheval, D.: Automated Security Proofs with Sequences of Games. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 537\u2013554. Springer, Heidelberg (2006)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: Computationally Sound Mechanized Proofs of Correspondence Assertions. In: Proc. 20th IEEE Computer Security Foundations Symposium (2007)","DOI":"10.1109\/CSF.2007.16"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), October 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"issue":"12","key":"20_CR15","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"IT-29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a0IT-29(12), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Joshua, D., Guttman, F.: Javier Thayer, and Lenore D. Zuck. The Faithfulness of Abstract Protocol Analysis: Message Authentication. In: 8th ACM Conference on Computer and Communications Security (CCS 2001), November 2001, pp. 186\u2013195 (2001)","DOI":"10.1145\/501983.502009"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-36575-3_12","volume-title":"Programming Languages and Systems","author":"P. Laud","year":"2003","unstructured":"Laud, P.: Handling Encryption in Analysis for Secure Information Flow. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 159\u2013173. Springer, Heidelberg (2003)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Laud, P.: Symmetric encryption in automatic analyses for confidentiality against active adversaries. In: 2004 IEEE Symposium on Security and Privacy, May 2004, pp. 71\u201385 (2004)","DOI":"10.1109\/SECPRI.2004.1301316"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Laud, P.: Secrecy Types for a Simulatable Cryptographic Library. In: 12th ACM Conference on Computer and Communications Security (CCS 2005), pp. 26\u201335 (2005)","DOI":"10.1145\/1102120.1102126"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Lowe, G.: A Hierarchy of Authentication Specification. In: 10th Computer Security Foundations Workshop, pp. 31\u201344 (1997)","DOI":"10.1109\/CSFW.1997.596782"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-31987-0_13","volume-title":"Programming Languages and Systems","author":"R. Janvier","year":"2005","unstructured":"Janvier, R., Lakhnech, Y., Mazar\u00e9, L.: Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 172\u2013185. Springer, Heidelberg (2005)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"20_CR23","unstructured":"Micciancio, D., Warinschi, B.: Completeness Theorems for the Abadi-Rogaway Logic of Encrypted Expressions. In: Workshop in Issues in the Theory of Security (WITS 2002), January 2002 (2002)"},{"key":"20_CR24","volume-title":"Semantics with Applications: A Formal Introduction","author":"H. Riis Nielson","year":"1992","unstructured":"Riis Nielson, H., Nielson, F.: Semantics with Applications: A Formal Introduction. Wiley, Chichester (1992)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In: 2001 IEEE Symposium on Security and Privacy (IEEE S&P 2001), pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"20_CR26","first-page":"445","volume-title":"Advances in Languages and Compilers for Parallel Processing","author":"K. Pingali","year":"1991","unstructured":"Pingali, K., Beck, M., Johnson, R., Moudgill, M., Stodghill, P.: Dependence Flow Graphs: an Algebraic Approach to Program Dependencies. In: Advances in Languages and Compilers for Parallel Processing, pp. 445\u2013467. MIT Press, Cambridge (1991)"},{"key":"20_CR27","unstructured":"T\u0161ahhirov, I., Laud, P.: Digital Signature in Automatic Analyses for Confidentiality against Active Adversaries. In: Nordsec 2005 10th Nordic Workshop on Secure IT Systems, Tartu, Estonia, October 20-21, 2005, pp. 29\u201341 (2005)"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and Applications of Trapdoor Functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, November 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78663-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:17:48Z","timestamp":1619522268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78663-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540786627","9783540786634"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78663-4_20","relation":{},"subject":[]}}