A semantics for a logic of authentication (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Extending cryptographic logics of belief to key agreement protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The Logic of Authentication Protocols
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Protocols for Key Establishment and Authentication
Protocols for Key Establishment and Authentication
Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Efficient network authentication protocols: lower bounds and optimal implementations
Distributed Computing
Fast automatic security protocol generation
Journal of Computer Security
| Hi-index | 0.00 |
The logical correctness of security protocols is important. So are efficiency and cost. This paper shows that meta-heuristic search techniques can be used to synthesise protocols that are both provably correct and satisfy various non-functional efficiency criteria. Our work uses a subset of the SVO logic, which we view as a specification language and proof system and also as a ''protocol programming language''. Our system starts from a set of initial security assumptions, carries out meta-heuristic search in the design space, and ends with a protocol (described at the logic level) that satisfies desired goals.