{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:51:24Z","timestamp":1743047484061,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020018"},{"type":"electronic","value":"9783642020025"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02002-5_3","type":"book-chapter","created":{"date-parts":[[2009,5,13]],"date-time":"2009-05-13T16:20:10Z","timestamp":1242231610000},"page":"33-56","source":"Crossref","is-referenced-by-count":2,"title":["Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols"],"prefix":"10.1007","author":[{"given":"Gergei","family":"Bana","sequence":"first","affiliation":[]},{"given":"Koji","family":"Hasebe","sequence":"additional","affiliation":[]},{"given":"Mitsuhiro","family":"Okada","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Website, www.stanford.edu\/~danupam\/logic-derivation.html","key":"3_CR1"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11690634_27","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Baudet, M., Warinschi, B.: Guessing attacks and the computational soundness of static equivalence. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 398\u2013412. Springer, Heidelberg (2006)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","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. Journal of Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"Journal of Cryptology"},{"key":"3_CR4","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":"3_CR5","first-page":"170","volume-title":"Proceedings of CSFW 2005","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: Proceedings of CSFW 2005, Aix-en-Provence, France, June 20\u201322, pp. 170\u2013184. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"3_CR6","first-page":"220","volume-title":"Proceedings of CCS 2003","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: Proceedings of CCS 2003, pp. 220\u2013230. ACM Press, New York (2003)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-76929-3_10","volume-title":"Advances in Computer Science \u2013 ASIAN 2007. Computer and Network Security","author":"G. Bana","year":"2007","unstructured":"Bana, G., Hasebe, K., Okada, M.: Computational semantics for basic protocol logic - a stochastic approach. In: Cervesato, I. (ed.) ASIAN 2007. LNCS, vol.\u00a04846, pp. 86\u201394. Springer, Heidelberg (2007)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/11523468_53","volume-title":"Automata, Languages and Programming","author":"M. Baudet","year":"2005","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)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"key":"3_CR10","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.: 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)"},{"doi-asserted-by":"crossref","unstructured":"Cervesato, I., Meadows, C., Pavlovic, D.: An encapsulated authentication logic for reasoning about key distribution protocols. In: Proceedings of CSFW 2005, pp. 48\u201361 (2005)","key":"3_CR11","DOI":"10.1109\/CSFW.2005.7"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"423","DOI":"10.3233\/JCS-2005-13304","volume":"13","author":"A. Datta","year":"2005","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: A derivation system and compositional logic for security protocols. Journal of Computer Security\u00a013, 423\u2013482 (2005)","journal-title":"Journal of Computer Security"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11523468_2","volume-title":"Automata, Languages and Programming","author":"A. Datta","year":"2005","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)"},{"key":"3_CR14","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). Electron. Notes Theor. Comput. Sci.\u00a0172, 311\u2013358 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"3_CR15","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.C.: On the security of public-key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013208 (1983); Preliminary version presented at FOCS 1981","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"677","DOI":"10.3233\/JCS-2003-11407","volume":"11","author":"N.A. Durgin","year":"2003","unstructured":"Durgin, N.A., Mitchell, J.C., Pavlovic, D.: A compositional logic for proving security properties of protocols. Journal of Computer Security\u00a011, 677\u2013721 (2003)","journal-title":"Journal of Computer Security"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and Systems Sciences\u00a028(2), 270\u2013299 (1984); Preliminary version presented at STOC (1982)","journal-title":"Journal of Computer and Systems Sciences"},{"doi-asserted-by":"crossref","unstructured":"Guttman, J.D., Thayer F\u00e1brega, F.J.: Authentication tests. In: IEEE Symposium on Security and Privacy, pp. 96\u2013109 (2002)","key":"3_CR18","DOI":"10.1109\/SECPRI.2000.848448"},{"key":"3_CR19","first-page":"186","volume-title":"Proceedings of CCS 2001","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: Proceedings of CCS 2001, November 05\u201308, pp. 186\u2013195. ACM Press, New York (2001)"},{"key":"3_CR20","first-page":"73","volume-title":"Proceedings of RULE 2005","author":"K. Hasebe","year":"2005","unstructured":"Hasebe, K., Okada, M.: Completeness and counter-example generations of a basic protocol logic. In: Proceedings of RULE 2005, vol.\u00a0147(1), pp. 73\u201392. Elsevier Science, Amsterdam (2005), http:\/\/dx.doi.org\/10.1016\/j.entcs.2005.06.038"},{"key":"3_CR21","first-page":"71","volume-title":"Proceedings of S&P 2004","author":"P. Laud","year":"2004","unstructured":"Laud, P.: Symmetric encryption in automatic analyses for confidentiality against active adversaries. In: Proceedings of S&P 2004, May 9\u201312, pp. 71\u201385. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"3_CR22","volume-title":"PCSFW: Proceedings of The 10th Computer Security Foundations Workshop","author":"G. Lowe","year":"1997","unstructured":"Lowe, G.: A hierarchy of authentication specifications. In: PCSFW: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","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. Journal of Computer Security\u00a012(1), 99\u2013130 (2004)","journal-title":"Journal of Computer Security"},{"issue":"12","key":"3_CR24","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"R. Needham","year":"1978","unstructured":"Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM\u00a021(12), 993\u2013999 (1978)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Woo, T., Lam, S.: Verifying authentication protocols: Methodology and example. In: Proceedings of the International Conference on Network Protocols (1993)","key":"3_CR25","DOI":"10.1109\/ICNP.1993.340904"}],"container-title":["Lecture Notes in Computer Science","Formal to Practical Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02002-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T11:31:18Z","timestamp":1739100678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02002-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020018","9783642020025"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02002-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}