Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
Relating multiset rewriting and process algebras for security protocol analysis
Journal of Computer Security - Special issue on WITS'03
Towards an Independent Semantics and Verification Technology for the HLPSL Specification Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Data access specification and the most powerful symbolic attacker in MSR
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
| Hi-index | 0.01 |
For purposes of security analysis, cryptographic protocols can be translated from a high-level message-list language like CAPSL into a multiset rewriting (MSR) rule language like CIL. The natural translation creates two rules per message or computational action. We show how to optimize the natural rule set by about 50% into a form similar to the result of hand encoding, and prove that the transformation is sound because it is attack preserving, and unique because it is terminating and confluent. The optimization has been implemented in Java.