A New Clausal Class Decidable by Hyperresolution
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Mechanized proofs for a recursive authentication protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A semantics for web services authentication
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Selecting theories and recursive protocols
CONCUR 2005 - Concurrency Theory
XML signature element wrapping attacks and countermeasures
Proceedings of the 2005 workshop on Secure web services
Automatic verification of correspondences for security protocols
Journal of Computer Security
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
On the Relationship Between Web Services Security and Traditional Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
On the automatic analysis of recursive security protocols with XOR
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Symbolic and cryptographic analysis of the secure WS-ReliableMessaging scenario
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
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
On the security of public key protocols
IEEE Transactions on Information Theory
Key agreement in ad hoc networks
Computer Communications
Automatic verification of protocols with lists of unbounded length
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Automatic verification of protocols with lists of unbounded length
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We present a novel automatic technique for proving secrecy and authentication properties for security protocols that manipulate lists of unbounded length, for an unbounded number of sessions. This result is achieved by extending the Horn clause approach of the automatic protocol verifier ProVerif. We extend the Horn clauses to be able to represent lists of unbounded length. We adapt the resolution algorithm to handle the new class of Horn clauses, and prove the soundness of this new algorithm. We have implemented our algorithm and successfully tested it on several protocol examples, including XML protocols coming from web services.