Opacity generalised to transition systems JW Bryans, M Koutny, L Mazaré, PYA Ryan International Journal of Information Security 7 (6), 421-435, 2008 | 339 | 2008 |
Using unification for opacity properties L Mazaré Proceedings of the 4th IFIP WG1 7, 165-176, 2004 | 157 | 2004 |
Completing the picture: Soundness of formal encryption in the presence of active adversaries R Janvier, Y Lakhnech, L Mazaré European Symposium on Programming, 172-185, 2005 | 92 | 2005 |
Towards group communication for mobile participants MO Killijian, R Cunningham, R Meier, L Mazare, V Cahill | 73 | 2001 |
A generalization of DDH with applications to protocol analysis and computational soundness E Bresson, Y Lakhnech, L Mazaré, B Warinschi Annual International Cryptology Conference, 482-499, 2007 | 47 | 2007 |
Adaptive soundness of static equivalence S Kremer, L Mazaré European Symposium on Research in Computer Security, 610-625, 2007 | 37 | 2007 |
Massively parallel video networks J Carreira, V Patraucean, L Mazare, A Zisserman, S Osindero Proceedings of the European Conference on Computer Vision (ECCV), 649-666, 2018 | 30 | 2018 |
Decidability of opacity with non-atomic keys L Mazaré IFIP World Computer Congress, TC 1, 71-84, 2004 | 29 | 2004 |
Probabilistic opacity for a passive adversary and its application to Chaum's voting scheme Y Lakhnech, L Mazaré Cryptology ePrint Archive, 2005 | 24 | 2005 |
Computationally sound analysis of protocols using bilinear pairings S Kremer, L Mazaré Journal of Computer Security 18 (6), 999-1033, 2010 | 17 | 2010 |
Computational soundness of symbolic analysis for protocols using hash functions R Janvier, Y Lakhnech, L Mazaré Electronic Notes in Theoretical Computer Science 186, 121-139, 2007 | 17 | 2007 |
Satisfiability of dolev-yao constraints L Mazaré Electronic Notes in Theoretical Computer Science 125 (1), 109-124, 2005 | 15 | 2005 |
Computational Soundness of Symbolic Models for Cryptographic Protocols L Mazaré PhD thesis, Institut National Polytechnique de Grenoble, 2006 | 10 | 2006 |
Computationally sound verification of security protocols using Diffie-Hellman exponentiation Y Lakhnech, L Mazaré Cryptology ePrint Archive, 2005 | 9 | 2005 |
Concurrent construction of proof-nets JM Andreoli, L Mazaré International Workshop on Computer Science Logic, 29-42, 2003 | 9 | 2003 |
Separating trace mapping and reactive simulatability soundness: The case of adaptive corruption L Mazaré, B Warinschi Joint Workshop on Automated Reasoning for Security Protocol Analysis and …, 2009 | 7 | 2009 |
Computationally sound analysis of protocols using bilinear pairings L Mazaré Preliminary Proceedings of the 7th International Workshop on Issues in the …, 2007 | 7 | 2007 |
Computational Soundness-The Case of Diffie-Hellman Keys E Bresson, Y Lakhnech, L Mazaré, B Warinschi Formal Models and Techniques for Analyzing Security Protocols, 277-302, 2011 | 6 | 2011 |
Relating the symbolic and computational models of security protocols using hashes R Janvier, Y Lakhnech, L MazarÈ Joint Workshop on Foundations of Computer Security and Automated Reasoning …, 2006 | 6 | 2006 |
(De) Compositions of Cryptographic Schemes and their Applications to Protocols R Janvier, Y Lakhnech, L Mazare Cryptology ePrint Archive, 2005 | 6 | 2005 |