Deciding security for protocols with recursive tests
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Verification of security protocols with lists: from length one to unbounded length
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Verifying multicast-based security protocols using the inductive method
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Automatic verification of protocols with lists of unbounded length
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Verification of security protocols with lists: From length one to unbounded length
Journal of Computer Security - Security and Trust Principles
| Hi-index | 0.00 |
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroeder very few address the more challenging class of group protocols. We have introduced in previous work a synchronous model for group protocols, that generalizes standardprotocol models by permittingunbounded lists insidemessages. This approach also applies to analyzing Web Services manipulating sequences of items.In this model we propose now a decision procedure for the sub-class of Well-Tagged protocols with Autonomous Keys.