activity
20072021
most citedRelating two standard notions of secrecy

39 citations · 56 across the 13 of their papers we have counts for

collaborators
Showing cs.CRShow all

5 papers · 1 filter

cs.CR2021

Implementing Security Protocol Monitors

Yannick Chevalier, Michaël Rusinowitch

Cryptographic protocols are often specified by narrations, i.e., finite sequences of message exchanges that show the intended execution of the protocol. Another use of narrations i…

cs.CR2013★ 1 cited

Compiling symbolic attacks to protocol implementation tests

Hatem Ghabri, Ghazi Maatoug, Michael Rusinowitch

Recently efficient model-checking tools have been developed to find flaws in security protocols specifications. These flaws can be interpreted as potential attacks scenarios but th…

cs.CR2012

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

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch +1

The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for c…

cs.CR2011★ 4 cited

Satisfiability of General Intruder Constraints with and without a Set Constructor

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch +1

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 r…

cs.CR2007★ 39 cited

Relating two standard notions of secrecy

Veronique Cortier, Michael Rusinovitch, Eugen Zalinescu

Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never…