eprintid: 130 rev_number: 7 eprint_status: archive userid: 29 dir: disk0/00/00/01/30 datestamp: 2011-03-01 10:03:05 lastmod: 2011-07-11 14:33:43 status_changed: 2011-03-01 10:03:05 type: book_section metadata_visibility: show item_issues_count: 0 creators_name: Boreale, Michele creators_name: Buscemi, Maria Grazia creators_id: creators_id: m.buscemi@imtlucca.it title: Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation ispublished: pub subjects: QA75 divisions: CSA full_text_status: none note: The final publication is available at www.springerlink.com abstract: Automatic methods developed so far for analysis of security protocols only model a limited set of cryptographic primitives (often, only encryption and concatenation) and from low-level features of cryptographic algorithms. This paper is an attempt towards closing this gap. We propose a symbolic technique and a decision method for analysis of protocols based on modular exponentiation, such as Diffie-Hellman key exchange. We introduce a protocol description language along with its semantics. Then, we propose a notion of symbolic execution and, based on it, a verification method. We prove that the method is sound and complete with respect to the language semantics. date: 2003 date_type: published series: Lecture Notes in Computer Science volume: 2747 publisher: Springer pagerange: 269-278 id_number: 10.1007/978-3-540-45138-9_21 refereed: TRUE isbn: 3-540-40671-9 book_title: Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS ’03) editors_name: Rovan, Branislav editors_name: Vojtáš, Peter official_url: http://dx.doi.org/10.1007/978-3-540-45138-9_21 funders: This work has been partially supported by EU within the FET - Global Computing initiative, projects MIKADO and PROFUNDIS and by MIUR project NAPOLI. citation: Boreale, Michele and Buscemi, Maria Grazia Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation. In: Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS ’03). Lecture Notes in Computer Science, 2747 . Springer, pp. 269-278. ISBN 3-540-40671-9 (2003)