| Opacity generalised to transition systems JW Bryans, M Koutny, L Mazaré, PYA Ryan International Journal of Information Security 7, 421-435, 2008 | 402 | 2008 |
| Using unification for opacity properties L Mazaré Proceedings of the 4th IFIP WG1 7, 165-176, 2004 | 224 | 2004 |
| Completing the picture: Soundness of formal encryption in the presence of active adversaries R Janvier, Y Lakhnech, L Mazaré Programming Languages and Systems: 14th European Symposium on Programming …, 2005 | 93 | 2005 |
| Towards group communication for mobile participants MO Killijian, R Cunningham, R Meier, L Mazare, V Cahill Proceedings of the 1st ACM Workshop on Principles of Mobile Computing (POMC …, 2001 | 76 | 2001 |
| 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 | 61 | 2018 |
| 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 | 52 | 2007 |
| Adaptive soundness of static equivalence S Kremer, L Mazaré Computer Security–ESORICS 2007: 12th European Symposium On Research In …, 2007 | 38 | 2007 |
| Decidability of opacity with non-atomic keys L Mazaré IFIP World Computer Congress, TC 1, 71-84, 2004 | 32 | 2004 |
| Probabilistic opacity for a passive adversary and its application to Chaum's voting scheme Y Lakhnech, L Mazaré Cryptology ePrint Archive, 2005 | 27 | 2005 |
| 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 |
| Moshi: a speech-text foundation model for real-time dialogue A Défossez, L Mazaré, M Orsini, A Royer, P Pérez, H Jégou, E Grave, ... | 17* | |
| Computationally sound analysis of protocols using bilinear pairings S Kremer, L Mazaré Journal of Computer Security 18 (6), 999-1033, 2010 | 16 | 2010 |
| 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 | 10 | 2005 |
| Concurrent construction of proof-nets JM Andreoli, L Mazaré Computer Science Logic: 17th International Workshop CSL 2003, 12th Annual …, 2003 | 10 | 2003 |
| 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 | 7 | 2011 |
| Separating trace mapping and reactive simulatability soundness: The case of adaptive corruption L Mazaré, B Warinschi Foundations and Applications of Security Analysis: Joint Workshop on …, 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 |
| 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 |
