13 citations · 14 across the 2 of their papers we have counts for
3 papers
Formal Computational Unlinkability Proofs of RFID Protocols
Hubert Comon, Adrien Koutsos
We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributio…
Visibly Tree Automata with Memory and Constraints
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bog…
Deciding security properties for cryptographic protocols. Application to key cycles
Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
There is a large amount of work dedicated to the formal verification of security protocols. In this paper, we revisit and extend the NP-complete decision procedure for a bounded nu…