Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Hubert Comon"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 2 (2008)
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main
Externí odkaz:
https://doaj.org/article/0b4168f2e8464adc8a998c74e0ed08c2
Autor:
Hubert Comon, Vitaly Shmatikov
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 4 (2002)
We consider the so called ``cryptographic protocols`` whose aim is to ensure some security properties when communication channels are not reliable. Such protocols usually rely on cryptographic primitives. Even if it is assumed that the cryptographic
Externí odkaz:
https://doaj.org/article/f83439ff4ad449898a535a3aadef9e4a
Autor:
Olivier Coutard, Pierre-Olivier Amblard, Claude Amra, Brigitte Bacroix, Pascal Barone, Yannick Barthe, Isabelle Berbezier, Monique Bernard, Marc Billaud, Gudrun Bornette, Didier Bresch, Philippe Cardin, Philippe Claudin, Hubert Comon-Lundh, Didier Demazière, Claude Diebolt, Philippe Faure, Yves Gaudin, Julie Gavard, Raphael Granier De Cassagnac, Anne-Marie Haghiri-Gosnet, Philippe Hapiot, Nabil Hathout, Philippe Hoffmann, Peter Holdsworth, Laurent Kodjabachian, Catherine Leblanc, Francois Lott, Nathalie Luca, Emmanuel Magnier, Antoine Maignan, Eric Marechal, Françoise Massines, Benoit Mosser, Francois Ozanam, Dimitri Peaucelle, Franck Picard, Laurence Pruvost, Laure Quennouëlle-Corre, Hugues Roest Crollius, Jay Rowell, Véronique Schmitt, Laurent Schneider, Isabelle Théry-Parisot, François Trottein, Boris Vauzeilles, Fabrice Vavre
Publikováno v:
HAL
Conférence des Présidents du Comité National
Conférence des Présidents du Comité National, CNRS, 2021, Paris, France
Conférence des Présidents du Comité National
Conférence des Présidents du Comité National, CNRS, 2021, Paris, France
National audience; Le présent bilan de mandature 2016-2021 de la CPCN (Conférence des présidentes et présidents de sections et de commissions interdisciplinaires du Comité national de la recherche scientifique) a une triple finalité. Il constit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::36dedcc2e9dfaa60dfc89f7f462858a6
https://hal.laas.fr/hal-03413289/document
https://hal.laas.fr/hal-03413289/document
Publikováno v:
CCS
ACM CCS 2020
ACM CCS 2020, Nov 2020, Orlando, United States. pp.1427-1444
ACM CCS 2020
ACM CCS 2020, Nov 2020, Orlando, United States. pp.1427-1444
International audience; We provide a composition framework together with a variety of composition theorems allowing to split the security proof of an unbounded number of sessions of a compound protocol into simpler goals. While many proof techniques
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29d85d7a6325b6df3c5e0cd2fef9822a
https://doi.org/10.1145/3372297.3417229
https://doi.org/10.1145/3372297.3417229
Publikováno v:
Information and Computation
Information and Computation, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
Information and Computation, Elsevier, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
Information and Computation, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
Information and Computation, Elsevier, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability. Infin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1959b8dcc11b54878e5583e4d66896ec
https://inria.hal.science/hal-01584242
https://inria.hal.science/hal-01584242
Autor:
Hubert Comon, Adrien Koutsos
Publikováno v:
CSF
We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributions are: i) To design (and prove sound) axioms reflecting the propertie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7e91c2c10d8017df472ddc5bd464d47
http://arxiv.org/abs/1705.02296
http://arxiv.org/abs/1705.02296
Publikováno v:
Information and Computation. 238:106-127
Deducibility constraints represent in a symbolic way the infinite set of possible executions of a finite protocol. Solving a deducibility constraint amounts to finding all possible ways of filling the gaps in a proof. For finite local inference syste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34f93244f4b88cbf6842dc95941cb45a
https://doi.org/10.1016/j.ic.2014.07.006
https://doi.org/10.1016/j.ic.2014.07.006
Publikováno v:
JSIAM Letters. 1:28-31
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a1e6f18673d9d388e28141069a76506
https://doi.org/10.14495/jsiaml.1.28
https://doi.org/10.14495/jsiaml.1.28
Autor:
Hubert Comon, Florent Jacquemard
Publikováno v:
LICS
Information and Computation
Information and Computation, 2003, 187 (1), pp.123-153
[Research Report] RR-3800, INRIA. 1999, pp.26
Information and Computation, Elsevier, 2003, 187 (1), pp.123-153
Information and Computation
Information and Computation, 2003, 187 (1), pp.123-153
[Research Report] RR-3800, INRIA. 1999, pp.26
Information and Computation, Elsevier, 2003, 187 (1), pp.123-153
We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the computations of an alternating Turing machine whose space is polynomially bounded. It is more difficult to show that ground reducibi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eace98698f1c9370a9548fe8de20809a
https://doi.org/10.1016/s0890-5401(03)00134-2
https://doi.org/10.1016/s0890-5401(03)00134-2
Autor:
Gergei Bana, Hubert Comon-Lundh
Publikováno v:
2014 ACM SIGSAC Conference on Computer and Communications Security
2014 ACM SIGSAC Conference on Computer and Communications Security, Nov 2014, Scottsdale, United States. pp.609-620, ⟨10.1145/2660267.2660276⟩
ACM Conference on Computer and Communications Security
2014 ACM SIGSAC Conference on Computer and Communications Security, Nov 2014, Scottsdale, United States. pp.609-620, ⟨10.1145/2660267.2660276⟩
ACM Conference on Computer and Communications Security
International audience; We consider the problem of computational indistinguishability of protocols. We design a symbolic model, amenable to automated deduction, such that a successful inconsistency proof implies computational indistinguishability. Co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea6af04de61299a4bd49c2a9ee2995b1
https://inria.hal.science/hal-01102216
https://inria.hal.science/hal-01102216