Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Laurent Mazaré"'
Publikováno v:
Computer Vision – ECCV 2018 ISBN: 9783030012243
ECCV (4)
ECCV (4)
We introduce a class of causal video understanding models that aims to improve efficiency of video processing by maximising throughput, minimising latency, and reducing the number of clock cycles. Leveraging operation pipelining and multi-rate clocks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b4f398bcbd4707aa130d3f509b61a5e
https://ora.ox.ac.uk/objects/uuid:09a63482-0b82-4764-a999-38158a8be875
https://ora.ox.ac.uk/objects/uuid:09a63482-0b82-4764-a999-38158a8be875
Autor:
Laurent Mazaré, Steve Kremer
Publikováno v:
Journal of Computer Security. 18:999-1033
In this paper, we introduce a symbolic model to analyse protocols that use a bilinear pairing between two cyclic groups. This model consists in an extension of the Abadi-Rogaway logic and we prove that the logic is still computationally sound: symbol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a1ca89d0d75c8995552152341c6f4a3
https://doi.org/10.3233/jcs-2009-0388
https://doi.org/10.3233/jcs-2009-0388
Publikováno v:
International Journal of Information Security. 7:421-435
Recently, opacity has proved a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of opacity to the model of labelled transition systems and generalise opacity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d7d27a234cd1a7a6ebed9258a954b8c
https://doi.org/10.1007/s10207-008-0058-x
https://doi.org/10.1007/s10207-008-0058-x
Publikováno v:
Electronic Notes in Theoretical Computer Science. 186:121-139
In this paper, we consider a Dolev-Yao model with hash functions and establish its soundness with respect to the computational model. Soundness means that the absence of attacks in the Dolev-Yao model implies that the probability for an adversary to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fc1cbcea87f674daceb7a0f0b125e68
https://doi.org/10.1016/j.entcs.2007.01.066
https://doi.org/10.1016/j.entcs.2007.01.066
Autor:
Laurent Mazaré
Publikováno v:
Electronic Notes in Theoretical Computer Science. 125(1):109-124
The secrecy problem, under certain hypothesis, is equivalent to satisfiability of constraints involving Dolev-Yao's operator ⊢. Making some restrictions over these constraints, their satisfiability has been proven to be NP-complete. However, to che
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ce3bd9377b9991129962d4889e198c2
Autor:
Bogdan Warinschi, Laurent Mazaré
Publikováno v:
Foundations and Applications of Security Analysis ISBN: 9783642034589
ARSPA-WITS
ARSPA-WITS
Computational soundness is the research direction that aims to translate security guarantees with respect to Dolev-Yao models into guarantees with resepect to the stronger computational models of modern cryptography. There are essentially two differe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19123fd4d161f7bf306d90891d1a1a68
https://doi.org/10.1007/978-3-642-03459-6_13
https://doi.org/10.1007/978-3-642-03459-6_13
Publikováno v:
Advances in Cryptology-CRYPTO 2007 ISBN: 9783540741428
CRYPTO
CRYPTO
In this paper we identify the (P,Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed generalizations of DDH are instances of the (P,Q)-DDH problem. We prove th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce944bdd85b9e68f23ee0f935e6bb47a
https://doi.org/10.1007/978-3-540-74143-5_27
https://doi.org/10.1007/978-3-540-74143-5_27
Publikováno v:
Formal Aspects in Security and Trust ISBN: 9783540752264
Formal Aspects in Security and Trust
Formal Aspects in Security and Trust
The composition of security definitions is a subtle issue. As most security protocols use a combination of security primitives, it is important to have general results that allow to combine such definitions. We present here a general result of compos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74b7af74c8f090f0d5b5d7e574671914
https://doi.org/10.1007/978-3-540-75227-1_4
https://doi.org/10.1007/978-3-540-75227-1_4
Autor:
Steve Kremer, Laurent Mazaré
Publikováno v:
Computer Security – ESORICS 2007 ISBN: 9783540748342
ESORICS
ESORICS
We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equivalence. We illustrate our framework on several equational theories: symmetric encr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce9d0e1a6b15422118d3bc15049af673
https://doi.org/10.1007/978-3-540-74835-9_40
https://doi.org/10.1007/978-3-540-74835-9_40
Publikováno v:
Formal Aspects in Security and Trust ISBN: 9783540326281
Formal Aspects in Security and Trust
Formal Aspects in Security and Trust
Recently, opacity has proved a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of opacity to the model of labelled transition systems and generalise opacity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce8e2fcc051da8282c3f5b32ca545bc4
https://doi.org/10.1007/11679219_7
https://doi.org/10.1007/11679219_7