Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Itsaka Rakotonirina"'
Autor:
Jonathan Protzenko, Itsaka Rakotonirina, Jay Bosamiya, Yi Zhou, Joseph Lallemand, Antoine Delignat-Lavaud, Bryan Parno, Tahina Ramananandro, Cédric Fournet
Publikováno v:
IEEE Symposium on Security and Privacy
Drawing on earlier protocol-verification work, we investigate the security of the QUIC record layer, as standardized by the IETF in draft version 30. This version features major differences compared to Google’s original protocol and early IETF draf
Autor:
Véronique Cortier, Itsaka Rakotonirina
Publikováno v:
Protocols, Strands, and Logic-Essays Dedicated to Joshua Guttman on the Occasion of his 66.66th Birthday
Protocols, Strands, and Logic-Essays Dedicated to Joshua Guttman on the Occasion of his 66.66th Birthday, 13066, Springer, pp.112-123, 2021, LNCS, ⟨10.1007/978-3-030-91631-2_6⟩
Protocols, Strands, and Logic-Essays Dedicated to Joshua Guttman on the Occasion of his 66.66th Birthday, 13066, Springer, pp.112-123, In press, LNCS, ⟨10.1007/978-3-030-91631-2_6⟩
Protocols, Strands, and Logic ISBN: 9783030916305
Protocols, Strands, and Logic-Essays Dedicated to Joshua Guttman on the Occasion of his 66.66th Birthday, 13066, Springer, pp.112-123, 2021, LNCS, ⟨10.1007/978-3-030-91631-2_6⟩
Protocols, Strands, and Logic-Essays Dedicated to Joshua Guttman on the Occasion of his 66.66th Birthday, 13066, Springer, pp.112-123, In press, LNCS, ⟨10.1007/978-3-030-91631-2_6⟩
Protocols, Strands, and Logic ISBN: 9783030916305
International audience; Security protocols combine two key components: a logical structure (who answers what, under which conditions?) as well as cryptography (encryption, signature, hash,. . .). It is not so easy to explain their principles and weak
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33de60ac7b098393549abed79fbcd757
https://inria.hal.science/hal-03475731/document
https://inria.hal.science/hal-03475731/document
Publikováno v:
Logic, Language, and Security. Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday
Logic, Language, and Security. Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday, 2020, Philadelphia, United States
Logic, Language, and Security ISBN: 9783030620769
Logic, Language, and Security
Logic, Language, and Security. Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday, 2020, Philadelphia, United States
Logic, Language, and Security ISBN: 9783030620769
Logic, Language, and Security
International audience; Privacy-preserving security properties in cryptographic protocols are typically modelled by observational equivalences in process calculi such as the applied pi-calulus. We survey decidability and complexity results for the au
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8d97e2a710c88b612f26b34b413c6e5
https://inria.hal.science/hal-02961617
https://inria.hal.science/hal-02961617
Publikováno v:
CCS'19-26th ACM Conference on Computer and Communications Security
CCS'19-26th ACM Conference on Computer and Communications Security, Nov 2019, London, United Kingdom
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
CCS
CCS'19-26th ACM Conference on Computer and Communications Security, Nov 2019, London, United Kingdom
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
CCS
International audience; Verification of privacy-type properties for cryptographic protocols in an active adversarial environment, modelled as a behavioural equivalence in concurrent-process calculi, exhibits a high computational complexity. While und
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06300d8b541689173614e69ece2663da
https://hal.science/hal-02269043/document
https://hal.science/hal-02269043/document
Autor:
Boris Köpf, Itsaka Rakotonirina
Publikováno v:
EuroS&P
A key question for characterising a system's vulnerability against timing attacks is whether or not it allows an adversary to aggregate information about a secret over multiple timing measurements. Existing approaches for reasoning about this aggrega
Publikováno v:
39th IEEE Symposium on Security and Privacy
39th IEEE Symposium on Security and Privacy, May 2018, San Francisco, United States
[Research Report] INRIA Nancy. 2018
2018 IEEE Symposium on Security and Privacy (SP)
IEEE Symposium on Security and Privacy
39th IEEE Symposium on Security and Privacy, May 2018, San Francisco, United States
[Research Report] INRIA Nancy. 2018
2018 IEEE Symposium on Security and Privacy (SP)
IEEE Symposium on Security and Privacy
International audience; Automated verification has become an essential part in the security evaluation of cryptographic protocols. Recently, there has been a considerable effort to lift the theory and tool support that existed for reachability proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::799477cc94ebcf5c64f0129520f6f783
https://hal.inria.fr/hal-01763122
https://hal.inria.fr/hal-01763122
Publikováno v:
Computer Aided Verification ISBN: 9783319961415
CAV (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Computer Aided Verification
CAV 2018-30th International Conference on Computer Aided Verification
CAV 2018-30th International Conference on Computer Aided Verification, Jul 2018, Oxford, United Kingdom
30th International Conference on Computer Aided Verification, Part II (CAV18)
30th International Conference on Computer Aided Verification, Part II (CAV'18)
CAV (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Computer Aided Verification
CAV 2018-30th International Conference on Computer Aided Verification
CAV 2018-30th International Conference on Computer Aided Verification, Jul 2018, Oxford, United Kingdom
30th International Conference on Computer Aided Verification, Part II (CAV18)
30th International Conference on Computer Aided Verification, Part II (CAV'18)
International audience; In this paper we describe the DeepSec prover, a tool for security protocol analysis. It decides equivalence properties modelled as trace equivalence of two processes in a dialect of the applied pi calculus.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb8383736aa315c52ad4401ae1b4d912
https://doi.org/10.1007/978-3-319-96142-2_4
https://doi.org/10.1007/978-3-319-96142-2_4
Publikováno v:
ACM Transactions on Privacy & Security; Aug2024, Vol. 27 Issue 3, p1-36, 36p
Autor:
Hana Chockler, Georg Weissenbacher
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented togeth
The open access book set LNCS 14933 + 14934 constitutes the refereed proceedings of the 26th International Symposium on Formal Methods, FM 2024, which took place in Milan, Italy, in September 2024. The 51 full and 4 short papers included in these pro