A proof theory for general unification
A proof theory for general unification
Using temporal logic to specify and verify cryptographic protocols
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Modelling and verifying key-exchange protocols using CSP and FDR
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
Challenges in the Automated Verification of Security Protocols
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Many techniques for protocol analysis use term replacement rules to express the reduction properties of symbolic encryption operations. Some approaches must solve equations in those operators, using sequences of narrowing steps. It is shown that every infinite sequence of narrowing steps for popular abstract encryption operators has a loop, and hence there is a terminating algorithm to solve such equations by searching all sequences of narrowing steps.