Zobrazeno 1 - 10 of 23 pro vyhledávání: '"Mathieu Turuani"'
1
A little more conversation, a little less action, a lot more satisfaction: Global states in ProVerif
Autor: Vincent Cheval, Véronique Cortier, Mathieu Turuani
Publikováno v: CSF'2018-31st IEEE Computer Security Foundations Symposium
CSF'2018-31st IEEE Computer Security Foundations Symposium, Jul 2018, Oxford, United Kingdom
[Research Report] Inria Nancy-Grand Est; LORIA, UMR 7503, Université de Lorraine, CNRS, Vandoeuvre-lès-Nancy. 2018
2018 IEEE 31st Computer Security Foundations Symposium (CSF)
CSF
International audience; ProVerif is a popular tool for the fully automatic analysis of security protocols, offering very good support to detect flaws or prove security. One exception is the case of protocols with global states such as counters, table
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93bf06cac78d380fd3095720d1f00823
https://inria.hal.science/hal-01900088/file/CSF18-GSVerif-long(3).pdf
Zobrazit plný text záznamu
2
A formal analysis of the Neuchâtel e-voting protocol
Autor: Véronique Cortier, David Galindo, Mathieu Turuani
Publikováno v: EuroS&P 2018-3rd IEEE European Symposium on Security and Privacy
EuroS&P 2018-3rd IEEE European Symposium on Security and Privacy, Apr 2018, Londres, United Kingdom
[Research Report] Inria Nancy-Grand Est. 2017
EuroS&P
2018 IEEE European Symposium on Security and Privacy (EuroS&P)
International audience; Remote electronic voting is used in several countries for legally binding elections. Unlike academic voting protocols, these systems are not always documented and their security is rarely analysed rigorously. In this paper, we
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a56b89c8dc52ce239657e74b0719e741
https://hal.inria.fr/hal-01647150/file/EuroSP18(4).pdf
Zobrazit plný text záznamu
3
Intruder deducibility constraints with negation. Decidability and application to secured service compositions
Autor: Mathieu Turuani, Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch
Publikováno v: Journal of Symbolic Computation
Journal of Symbolic Computation, Elsevier, 2017, 80, pp.4-26. ⟨10.1016/j.jsc.2016.07.008⟩
Journal of Symbolic Computation, 2017, 80, pp.4-26. ⟨10.1016/j.jsc.2016.07.008⟩
The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in this paper the mediator s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::827c6c02daef8287bf9d415b49f44005
https://hal.inria.fr/hal-01405851/file/main.pdf
Zobrazit plný text záznamu
4
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
Autor: Ralf Küsters, Michaël Rusinowitch, Yannick Chevalier, Mathieu Turuani
Publikováno v: ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, 2008, 9 (4), pp.Article 24. ⟨10.1145/1380572.1380573⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2008, 9 (4), pp.Article 24. ⟨10.1145/1380572.1380573⟩
International audience; We show that the insecurity problem for protocols with modular exponentiation and arbitrary products allowed in exponents is NP-complete. This result is based on a protocol and intruder model which is powerful enough to uncove
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::100cc39c356167776acc16872514f885
https://doi.org/10.1145/1380572.1380573
Zobrazit plný text záznamu
5
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Autor: Mathieu Turuani, Michaël Rusinowitch
Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2003, Theoretical Computer Science, 1-3 (299), pp.451-475. ⟨10.1016/S0304-3975(02)00490-5⟩
Theoretical Computer Science, 2003, Theoretical Computer Science, 1-3 (299), pp.451-475. ⟨10.1016/S0304-3975(02)00490-5⟩
We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NP-complete with respect to a Dolev–Yao model of intruders. The result does not assume
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20e2f98a8c49df42bdc410b1b36c3634
Zobrazit plný text záznamu
6
On the Synthesis of Secure Services Composition
Autor: Mathieu Turuani, Ernesto Pimentel, Fabio Martinelli, Ilaria Matteucci, José Antonio Martín
Publikováno v: Engineering Secure Future Internet Services and Systems 2014, edited by Maritta Heisel, Wouter Joosen, Javier Lopez, Fabio Martinelli, 2014
info:cnr-pdr/source/autori:Jose A. Martìn, Fabio Martinelli, Ilaria Matteucci, Ernesto Pimentel, Mathieu Turuani/titolo:On the Synthesis of Secure Services Composition/titolo_volume:Engineering Secure Future Internet Services and Systems 2014/curatori_volume:Maritta Heisel, Wouter Joosen, Javier Lopez, Fabio Martinelli/editore:/anno:2014
Engineering Secure Future Internet Services and Systems ISBN: 9783319074511
Engineering Secure Future Internet Services and Systems
Maritta Heisel; Wouter Joosen; Javier Lopez; Fabio Martinelli. Engineering Secure Future Internet Services and Systems, LNCS 8431 (8431), Springer, pp.392, 2014, Lecture Notes in Computer Science, 978-3-319-07451-1
International audience; Web service composition is one of the main research challenges of the last decades. Several frameworks have been developed to compose services in order to meet requirements and constraints imposed by a service consumer. Hereaf
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d5363c06b7b14f4f1f66438223d87ca
https://publications.cnr.it/doc/294274
Zobrazit plný text záznamu
7
Towards the Orchestration of Secured Services under Non-disclosure Policies
Autor: Mathieu Turuani, Yannick Chevalier, Tigran Avanesov, Michaël Rusinowitch
Publikováno v: 6th International Conference on Mathematical Methods, Models and Architectures for Computer Network Security, MMM-ACNS 2012
6th International Conference on Mathematical Methods, Models and Architectures for Computer Network Security, MMM-ACNS 2012, Oct 2012, St. Petersburg, Russia. pp.130-145, ⟨10.1007/978-3-642-33704-8_12⟩
Lecture Notes in Computer Science ISBN: 9783642337031
MMM-ACNS
International audience; The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in t
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a15bc2fdffb5bda5503a763302791138
https://hal.inria.fr/hal-00755947
Zobrazit plný text záznamu
8
Distributed Orchestration of Web Services under Security Constraints
Autor: Tigran Avanesov, Mathieu Turuani, Yannick Chevalier, Mohammed Anis Mekki, Michaël Rusinowitch
Publikováno v: 4th SETOP International Workshop on Autonomous and Spontaneous Security
4th SETOP International Workshop on Autonomous and Spontaneous Security, Sep 2011, Leuven, Belgium
Data Privacy Management and Autonomous Spontaneus Security ISBN: 9783642288784
DPM/SETOP
International audience; We present a novel approach to automated distributed orchestration of Web Services tied with security policies. The construction of an orchestration complying with the policies is based on the resolution of deducibility constr
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e02712c3bf148387a877701394b5082
https://hal.inria.fr/hal-00641321
Zobrazit plný text záznamu
9
Ballot stuffing in a postal voting system
Autor: Emmanuel Thomé, Véronique Cortier, Paul Zimmermann, Frédéric Sur, Jérémie Detrey, Pierrick Gaudry, Mathieu Turuani
Publikováno v: 2011 International Workshop on Requirements Engineering for Electronic Voting Systems (REVOTE 2011)
2011 International Workshop on Requirements Engineering for Electronic Voting Systems (REVOTE 2011), 2011, Trento, Italy. pp.27-36, ⟨10.1109/REVOTE.2011.6045913⟩
REVOTE
International audience; We review a postal voting system used in spring 2011 by the French research institute CNRS and designed by a French company (Tagg Informatique). We explain how the structure of the material can be easily understood out of a fe
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::697d4c6f37192855ea24d0eb12b90d40
https://hal.inria.fr/inria-00612418
Zobrazit plný text záznamu
10
Towards Formal Validation of Trust and Security in the Internet of Services
Autor: Serena Elisa Ponta, Mathieu Turuani, Sebastian Mödersheim, Roberto Carbone, Marius Minea, Luca Viganò
Publikováno v: The Future Internet ISBN: 9783642208973
Future Internet Assembly
Service designers and developers, while striving to meet the requirements posed by application scenarios, have a hard time to assess the trust and security impact of an option, a minor change, a combination of functionalities, etc., due to the subtle
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ccb66d7e314ec51dacd92c8c63ff2b7
https://doi.org/10.1007/978-3-642-20898-0_14
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje