{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T13:28:14Z","timestamp":1652102894277},"reference-count":21,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.8.5","type":"journal-article","created":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T20:24:59Z","timestamp":1257971099000},"page":"51-65","source":"Crossref","is-referenced-by-count":3,"title":["Security Theorems via Model Theory"],"prefix":"10.4204","volume":"8","author":[{"given":"Joshua","family":"Guttman","sequence":"first","affiliation":[{"name":"Worcester Polytechnic Institute"}]}],"member":"2720","published-online":{"date-parts":[[2009,11,17]]},"reference":[{"key":"Blanchet04","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/SECPRI.2004.1301317","article-title":"Automatic proof of strong secrecy for security protocols","volume-title":"Security and Privacy, 2004. Proceedings. 2004 IEEE Symposium on","author":"B. Blanchet","year":"2004"},{"key":"Blanchet08","volume-title":"V\u00e9rification automatique de protocoles cryptographiques : mod\u00e8le formel et mod\u00e8le calculatoire. Automatic verification of security protocols: formal model and computational model","author":"Bruno Blanchet","year":"2008"},{"key":"CervesatoEtAl00","doi-asserted-by":"crossref","DOI":"10.1109\/CSFW.2000.856924","article-title":"Relating Strands and Multiset Rewriting for Security Protocol Analysis","volume-title":"Proceedings, 13th IEEE Computer Security Foundations Workshop","author":"I. Cervesato","year":"2000"},{"key":"CheinMugnier92","first-page":"365","article-title":"Conceptual Graphs: fundamental notions","volume":"6","author":"Michel Chein","year":"1992","journal-title":"Revue d'Intelligence Artificielle"},{"issue":"3127","key":"CheinMugnier04","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-540-27769-9_20","article-title":"Concept Types and Coreference in Simple Conceptual Graphs","volume-title":"Conceptual Structures at Work: 12th International Conference on Conceptual Structures, ICCS 2004, Huntsville, AL, USA, July 19-23, 2004. Proceedings","author":"Michel Chein","year":"2004"},{"issue":"3","key":"DattaEtAl05","doi-asserted-by":"crossref","first-page":"423","DOI":"10.3233\/JCS-2005-13304","article-title":"A Derivation System and Compositional Logic for Security Protocols","volume":"13","author":"Anupam Datta","year":"2005","journal-title":"Journal of Computer Security"},{"issue":"4734","key":"DoghmiGuttmanThayer07b","series-title":"LNCS","first-page":"106","article-title":"Completeness of the Authentication Tests","volume-title":"European Symposium on Research in Computer Security (ESORICS)","author":"Shaddin F. Doghmi","year":"2007"},{"issue":"4424","key":"DoghmiGuttmanThayer07","series-title":"LNCS","first-page":"523","article-title":"Searching for Shapes in Cryptographic Protocols","volume-title":"Tools and Algorithms for Construction and Analysis of Systems (TACAS)","author":"Shaddin F. Doghmi","year":"2007"},{"issue":"2","key":"DurginEtAl04","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/JCS-2004-12203","article-title":"Multiset Rewriting and the Complexity of Bounded Security Protocols","volume":"12","author":"Nancy Durgin","year":"2004","journal-title":"Journal of Computer Security"},{"issue":"2","key":"DurginEtAl04a","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/JCS-2004-12203","article-title":"Multiset Rewriting and the Complexity of Bounded Security Protocols","volume":"12","author":"Nancy Durgin","year":"2004","journal-title":"Journal of Computer Security"},{"key":"FioreAbadi01","article-title":"Computing Symbolic Models for Verifying Cryptographic Protocols","volume-title":"Computer Security Foundations Workshop","author":"Marcelo Fiore","year":"2001"},{"key":"Froeschle08","article-title":"Adding Branching to the Strand Space Model","volume-title":"Proceedings of EXPRESS'08","author":"Sibylle Fr\u00f6schle","year":"2008"},{"key":"Guttman01","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-45608-2_4","article-title":"Security Goals: Packet Trajectories and Strand Spaces","volume-title":"Foundations of Security Analysis and Design","volume":"2171","author":"Joshua D. Guttman","year":"2001"},{"issue":"5504","key":"Guttman09","series-title":"LNCS","first-page":"303","article-title":"Cryptographic Protocol Composition via the Authentication Tests","volume-title":"Foundations of Software Science and Computation Structures (FOSSACS)","author":"Joshua D. Guttman","year":"2009"},{"issue":"5511","key":"Guttman09a","series-title":"LNCS","first-page":"107","article-title":"Transformations between Cryptographic Protocols","volume-title":"Automated Reasoning in Security Protocol Analysis, and Workshop on Issues in the Theory of Security (ARSPA-WITS)","author":"Joshua D. Guttman","year":"2009"},{"issue":"3705","key":"GuttmanEtAl05","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/11580850_8","article-title":"Programming Cryptographic Protocols","volume-title":"Trust in Global Computing","author":"Joshua D. Guttman","year":"2005"},{"key":"Lowe97","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/CSFW.1997.596782","article-title":"A Hierarchy of Authentication Specifications","volume-title":"10th Computer Security Foundations Workshop Proceedings","author":"Gavin Lowe","year":"1997"},{"key":"MillenShmatikov01","first-page":"166","article-title":"Constraint Solving for Bounded-Process Cryptographic Protocol Analysis","volume-title":"8th ACM Conference on Computer and Communications Security (CCS '01)","author":"Jonathan K. Millen","year":"2001"},{"key":"Paulson98","article-title":"The Inductive Approach to Verifying Cryptographic Protocols","author":"Lawrence C. Paulson","year":"1998","journal-title":"Journal of Computer Security"},{"key":"RusinowitchTuruani01","first-page":"174","article-title":"Protocol Insecurity with Finite Number of Sessions is NP-Complete","volume-title":"Computer Security Foundations Workshop","author":"Micha\u00ebl Rusinowitch","year":"2001"},{"issue":"1","key":"Selinger01","article-title":"Models for an adversary-centric protocol logic","volume":"55","author":"Peter Selinger","year":"2001","journal-title":"Electr. Notes Theor. Comput. Sci."}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T09:15:19Z","timestamp":1550999719000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/0911.2036v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,17]]},"references-count":21,"URL":"https:\/\/doi.org\/10.4204\/eptcs.8.5","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,17]]}}}