L
Laurent Vigneron
Researcher at French Institute for Research in Computer Science and Automation
Publications - 37
Citations - 2173
Laurent Vigneron is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: Cryptographic protocol & Protocol (science). The author has an hindex of 15, co-authored 37 publications receiving 1993 citations. Previous affiliations of Laurent Vigneron include Centre national de la recherche scientifique & Nancy-Université.
Papers
More filters
Book ChapterDOI
The AVISPA tool for the automated validation of internet security protocols and applications
Alessandro Armando,David Basin,Yohan Boichut,Yannick Chevalier,Luca Compagna,Jorge Cuellar,P. Hankes Drielsma,Pierre-Cyrille Héam,Olga Kouchnarenko,Jacopo Mantovani,Sebastian Mödersheim,D. von Oheimb,Michaël Rusinowitch,J. Santiago,Mathieu Turuani,Luca Viganò,Laurent Vigneron +16 more
TL;DR: AVISPA is a push-button tool for the automated validation of Internet security-sensitive protocols and applications that provides a modular and expressive formal language for specifying protocols and their security properties.
A High Level Protocol Specification Language for Industrial Security-Sensitive Protocols
Yannick Chevalier,Luca Compagna,Jorge Cuellar,Paul Hankes Drielsma,Jacopo Mantovani,Sebastian Moedersheim,Laurent Vigneron +6 more
TL;DR: HLPSL is modular and allows for the specification of control flow patterns, data-structures, alternative intruder models, and complex security properties, yet is sufficiently high-level to be accessible to protocol engineers, yet easily translatable into a lower-level term-rewriting based language well-suited to model-checking tools.
Book ChapterDOI
Compiling and verifying security protocols
TL;DR: This compilation defines non-ambiguous operational semantics for protocols and intruder behavior: they are rewrite systems executed by applying a variant of ac-narrowing, which permitted us to derive security flaws in many classical cryptographic protocols.
Journal ArticleDOI
Abstract Congruence Closure
TL;DR: The concept of an abstract congruence closure is described and equational inference rules for its construction are provided, extended to handle associative and commutative function symbols, thus providing an associative-commutative congruences closure.
Book ChapterDOI
Automated Unbounded Verification of Security Protocols
TL;DR: In this paper, a new model for automated verification of security protocols, permitting the use of an unbounded number of protocol runs, is presented, and it has been implemented and its efficiency is clearly shown by the number of protocols successfully studied.