English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Many decision problems on security protocols can be reduced to solvingso-called intruder constraints in Dolev Yao model. Most constraint solvingprocedures for protocol security rely on two properties of constraint systemscalled monotonicity and variable origination. In this work we relax theserestrictions by giving a decision procedure for solving general intruderconstraints (that do not have these properties) that stays in NP. Our resultextends a first work by L. Mazar\'e in several directions: we allow non-atomickeys, and an associative, commutative and idempotent symbol (for modelingsets). We also discuss several new applications of the results.

Satisfiability of General Intruder Constraints with and without a Set Constructor