Paper Info
Title
Homomorphisms and Minimality for Enrich-by-Need Security Analysis.
Abstract
Cryptographic protocols are used in different environments, but existing methods for protocol analysis focus only on the protocols, without being sensitive to assumptions about their environments. LPA is a tool which analyzes protocols in context. LPA uses two programs, cooperating with each other: CPSA, a well-known system for protocol analysis, and Razor, a model-finder based on SMT technology. Our analysis follows the enrich-by-need paradigm, in which models of protocol execution are generated and examined. The choice of which models to generate is important, and we motivate and evaluate LPAu0027s strategy of building minimal models. Minimality can be defined with respect to either of two preorders, namely the homomorphism preorder and the embedding preorder (i.e. the preorder of injective homomorphisms); we discuss the merits of each. Our main technical contributions are algorithms for building homomorphism-minimal models and for generating a set-of-support for the models of a theory, in each case by scripting interactions with an SMT solver.
Year
Venue
Field
2018
arXiv: Cryptography and Security
Minimal models,Embedding,Cryptographic protocol,Protocol analysis,Computer science,Preorder,Theoretical computer science,Security analysis,Homomorphism,Satisfiability modulo theories
DocType
Volume
Citations 
Journal
abs/1804.07158
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Daniel J. Dougherty141332.13
Joshua D. Guttman21577115.55
John D. Ramsdell321918.96