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

The problem of finding a mediator to compose secured services has beenreduced in our former work to the problem of solving deducibility constraintssimilar to those employed for cryptographic protocol analysis. We extend inthis paper the mediator synthesis procedure by a construction for expressingthat some data is not accessible to the mediator. Then we give a decisionprocedure for verifying that a mediator satisfying this non-disclosure policycan be effectively synthesized. This procedure has been implemented in CL-AtSe,our protocol analysis tool. The procedure extends constraint solving forcryptographic protocol analysis in a significative way as it is able to handlenegative deducibility constraints without restriction. In particular it appliesto all subterm convergent theories and therefore covers several interestingtheories in formal security analysis including encryption, hashing, signatureand pairing.

Intruder deducibility constraints with negation. Decidability and application to secured service compositions