Pascal Lafourcade
Pascal Lafourcade
Université Clermont Auvergne
Verifierad e-postadress på - Startsida
Citeras av
Citeras av
A survey of algebraic properties used in cryptographic protocols
V Cortier, S Delaune, P Lafourcade
Journal of Computer Security 14 (1), 1-43, 2006
Secure neighborhood discovery: a fundamental element for mobile ad hoc networking
P Papadimitratos, M Poturalski, P Schaller, P Lafourcade, D Basin, ...
IEEE Communications Magazine 46 (2), 132-139, 2008
Comparing state spaces in automatic security protocol analysis
CJF Cremers, P Lafourcade, P Nadeau
Formal to Practical Security, 70-94, 2009
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
P Lafourcade, D Lugiez, R Treinen
International Conference on Rewriting Techniques and Applications, 308-322, 2005
Towards automated proofs for asymmetric encryption schemes in the random oracle model
J Courant, M Daubignard, C Ene, P Lafourcade, Y Lakhnech
Proceedings of the 15th ACM conference on Computer and communications …, 2008
Analysis of AES, SKINNY, and others with constraint programming
S Sun, D Gerault, P Lafourcade, Q Yang, Y Todo, K Qiao, L Hu
Formal verification of e-auction protocols
J Dreier, P Lafourcade, Y Lakhnech
International Conference on Principles of Security and Trust, 247-266, 2013
Survey on electronic voting schemes
L Fouard, M Duclos, P Lafourcade
supported by the ANR project AVOTÉ, 2007
Defining verifiability in e-auction protocols
J Dreier, H Jonker, P Lafourcade
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and …, 2013
Symbolic protocol analysis for monoidal equational theories
S Delaune, P Lafourcade, D Lugiez, R Treinen
Information and Computation 206 (2-4), 312-351, 2008
Intruder deduction for the equational theory of Abelian groups with distributive encryption
P Lafourcade, D Lugiez, R Treinen
Information and Computation 205 (4), 581-623, 2007
A terrorist-fraud resistant and extractor-free anonymous distance-bounding protocol
G Avoine, X Bultel, S Gambs, D Gerault, P Lafourcade, C Onete, ...
Proceedings of the 2017 ACM on Asia Conference on Computer and …, 2017
A formal taxonomy of privacy in voting protocols
J Dreier, P Lafourcade, Y Lakhnech
2012 IEEE International Conference on Communications (ICC), 6710-6715, 2012
Benaloh’s dense probabilistic encryption revisited
L Fousse, P Lafourcade, M Alnuaimi
International Conference on Cryptology in Africa, 348-362, 2011
Comparison of cryptographic verification tools dealing with algebraic properties
P Lafourcade, V Terrade, S Vigier
International Workshop on Formal Aspects in Security and Trust, 173-185, 2009
Formal verification of mobile robot protocols
B Bérard, P Lafourcade, L Millet, M Potop-Butucaru, Y Thierry-Mieg, ...
Distributed Computing 29 (6), 459-487, 2016
Symbolic protocol analysis in presence of a homomorphism operator and exclusive or
S Delaune, P Lafourcade, D Lugiez, R Treinen
International Colloquium on Automata, Languages, and Programming, 132-143, 2006
Revisiting AES related-key differential attacks with constraint programming
D Gérault, P Lafourcade, M Minier, C Solnon
Information Processing Letters 139, 24-29, 2018
SR3: Secure resilient reputation-based routing
K Altisen, S Devismes, R Jamet, P Lafourcade
2013 IEEE International Conference on Distributed Computing in Sensor …, 2013
Defining privacy for weighted votes, single and multi-voter coercion
J Dreier, P Lafourcade, Y Lakhnech
European Symposium on Research in Computer Security, 451-468, 2012
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20