Reference : Satisfiability of general intruder constraints with a set constructor
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/3840
Satisfiability of general intruder constraints with a set constructor
English
Avanesov, Tigran mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Chevalier, Yannick [> >]
Rusinowitch, Michael [> >]
Turuani, Mathieu [> >]
2010
CRiSIS 2010, Proceedings of the Fifth International Conference on Risks and Security of Internet and Systems, Montreal, QC, Canada, October 10-13, 2010.
IEEE
1-8
Yes
978-1-4244-8641-0
CRiSIS 2010
October 10-13, 2010
Montreal, QC
Canada
[en] Many decision problems on security protocols can be reduced to solving so-called intruder constraints in Dolev Yao model. Most constraint solving procedures for protocol security rely on two properties of constraint systems called monotonicity and variable-origination. In this work we relax these restrictions by giving an NP decision procedure for solving general intruder constraints (that do not have these properties). Our result extends a first work by L. Mazaré in several directions: we allow non-atomic keys, and an associative, commutative and idempotent symbol (for modeling sets). We also give several new applications of the result.
http://hdl.handle.net/10993/3840
10.1109/CRISIS.2010.5764919
Proceedings of the Fifth International Conference on Risks and Security of Internet and Systems (CRiSIS 2010)

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
crisis2010_submission_11.pdfAuthor preprint436.06 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.