Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Lucca Hirschi"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 2 (2017)
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without repli
Externí odkaz:
https://doaj.org/article/b4282260beab4542839361085ec07261
Publikováno v:
IEEE 34th Computer Security Foundations Symposium (CSF)
IEEE 34th Computer Security Foundations Symposium (CSF), Jun 2021, Dubrovnik/Virtual, Croatia. pp.1-17, ⟨10.1109/CSF51468.2021.00016⟩
CSF
CSF 2021-34th IEEE Computer Security Foundations Symposium
CSF 2021-34th IEEE Computer Security Foundations Symposium, Jun 2021, Dubrovnik/Virtual, Croatia. pp.1-17, ⟨10.1109/CSF51468.2021.00016⟩
IEEE 34th Computer Security Foundations Symposium (CSF), Jun 2021, Dubrovnik/Virtual, Croatia. pp.1-17, ⟨10.1109/CSF51468.2021.00016⟩
CSF
CSF 2021-34th IEEE Computer Security Foundations Symposium
CSF 2021-34th IEEE Computer Security Foundations Symposium, Jun 2021, Dubrovnik/Virtual, Croatia. pp.1-17, ⟨10.1109/CSF51468.2021.00016⟩
The results of electronic elections should be verifiable so that any cheating is detected. To support this, many protocols employ an electronic bulletin board (BB) for publishing data that can be read by participants and used for verifiability checks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd14fa7941800a1d2af037ff32b010d9
https://hal.inria.fr/hal-03488741
https://hal.inria.fr/hal-03488741
Publikováno v:
Proceedings on Privacy Enhancing Technologies
Proceedings on Privacy Enhancing Technologies, De Gruyter Open, 2019, 2019 (3), pp.108-127. ⟨10.2478/popets-2019-0039⟩
Proceedings on Privacy Enhancing Technologies, 2019, 2019 (3), pp.108-127. ⟨10.2478/popets-2019-0039⟩
Proceedings on Privacy Enhancing Technologies, Vol 2019, Iss 3, Pp 108-127 (2019)
Proceedings on Privacy Enhancing Technologies, De Gruyter Open, 2019, 2019 (3), pp.108-127. ⟨10.2478/popets-2019-0039⟩
Proceedings on Privacy Enhancing Technologies, 2019, 2019 (3), pp.108-127. ⟨10.2478/popets-2019-0039⟩
Proceedings on Privacy Enhancing Technologies, Vol 2019, Iss 3, Pp 108-127 (2019)
Mobile communications are used by more than two-thirds of the world population who expect security and privacy guarantees. The 3rd Generation Partnership Project (3GPP) responsible for the worldwide standardization of mobile communication has designe
Publikováno v:
Journal of Computer Security
Journal of Computer Security, IOS Press, 2020, 28 (1), pp.1--34. ⟨10.3233/JCS-191358⟩
Journal of Computer Security, 2020, 28 (1), pp.1--34. ⟨10.3233/JCS-191358⟩
Journal of Computer Security, IOS Press, 2020, 28 (1), pp.1--34. ⟨10.3233/JCS-191358⟩
Journal of Computer Security, 2020, 28 (1), pp.1--34. ⟨10.3233/JCS-191358⟩
International audience; In cryptographic protocols, in particular RFID protocols, exclusive-or (XOR) operations are common. Due to the inherent complexity of faithful models of XOR, there is only limited tool support for the verification of cryptogra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::638c12bce704f0ff46a02eb3f640f33e
https://hal.archives-ouvertes.fr/hal-02358878/document
https://hal.archives-ouvertes.fr/hal-02358878/document
Autor:
Cas Cremers, Lucca Hirschi
Publikováno v:
EuroS&P 2019-4th IEEE European Symposium on Security and Privacy
EuroS&P 2019-4th IEEE European Symposium on Security and Privacy, Jun 2019, Stockholm, Sweden. pp.635-650, ⟨10.1109/EuroSP.2019.00052⟩
EuroS&P
EuroS&P 2019-4th IEEE European Symposium on Security and Privacy, Jun 2019, Stockholm, Sweden. pp.635-650, ⟨10.1109/EuroSP.2019.00052⟩
EuroS&P
International audience; We advance the state-of-the-art in automated symbolic analysis of ballot secrecy for e-voting protocols by proposing a method based on analysing three conditions that together imply ballot secrecy. Our approach has two main ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dce44aafb056b1cf0c375adc92419d9
https://hal.inria.fr/hal-02368857/file/EuroSP19_evoting.pdf
https://hal.inria.fr/hal-02368857/file/EuroSP19_evoting.pdf
Publikováno v:
Foundations of Security, Protocols, and Equational Reasoning
Springer. Foundations of Security, Protocols, and Equational Reasoning, Springer (11565), pp.112-134, 2019, LNCS, ⟨10.1007/978-3-030-19052-1_9⟩
Foundations of Security, Protocols, and Equational Reasoning ISBN: 9783030190514
Springer. Foundations of Security, Protocols, and Equational Reasoning, Springer (11565), pp.112-134, 2019, LNCS, ⟨10.1007/978-3-030-19052-1_9⟩
Foundations of Security, Protocols, and Equational Reasoning ISBN: 9783030190514
International audience; We show how the Tamarin tool can be used to model and reason about security protocols using identity-based cryptography, including identity-based encryption and signatures. Although such protocols involve rather different prim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aab17911aedc0c72269bebff7cc722d2
https://hal.inria.fr/hal-02368842
https://hal.inria.fr/hal-02368842
Publikováno v:
ACM CCS 2018-25th ACM Conference on Computer and Communications Security
ACM CCS 2018-25th ACM Conference on Computer and Communications Security, Oct 2018, Toronto, Canada. ⟨10.1145/3243734.3243846⟩
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS'18)
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
ACM CCS 2018-25th ACM Conference on Computer and Communications Security, Oct 2018, Toronto, Canada. ⟨10.1145/3243734.3243846⟩
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS'18)
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
Mobile communication networks connect much of the world's population. The security of users' calls, SMSs, and mobile data depends on the guarantees provided by the Authenticated Key Exchange protocols used. For the next-generation network (5G), the 3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b667b32ec0b7ef738f770e2b018ef6f
https://hal.archives-ouvertes.fr/hal-01898050/file/CCS18_finalcrc2_Fixed-Typo.pdf
https://hal.archives-ouvertes.fr/hal-01898050/file/CCS18_finalcrc2_Fixed-Typo.pdf
Publikováno v:
ESORICS
ESORICS, pp.385-405, 2018, ⟨10.1007/978-3-319-99073-6_19⟩
Computer Security ISBN: 9783319990729
ESORICS (1)
Computer Security-23rd European Symposium on Research in Computer Security
Computer Security-23rd European Symposium on Research in Computer Security, 2018, Barcelone, Spain
ESORICS, pp.385-405, 2018, ⟨10.1007/978-3-319-99073-6_19⟩
Computer Security ISBN: 9783319990729
ESORICS (1)
Computer Security-23rd European Symposium on Research in Computer Security
Computer Security-23rd European Symposium on Research in Computer Security, 2018, Barcelone, Spain
Formal methods have proved effective to automatically analyze protocols. Over the past years, much research has focused on verifying trace equivalence on protocols, which is notably used to model many interesting privacy properties, e.g., anonymity o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8cb27444e0fe042e40354a5394d61fc6
https://hal.archives-ouvertes.fr/hal-02390219
https://hal.archives-ouvertes.fr/hal-02390219
Publikováno v:
CSF'2018-31st IEEE Computer Security Foundations Symposium
CSF'2018-31st IEEE Computer Security Foundations Symposium, Jul 2018, Oxford, United Kingdom. ⟨10.1109/CSF.2018.00033⟩
2018 IEEE 31st Computer Security Foundations Symposium (CSF)
IEEE 31th Computer Security Foundations Symposium: CSF 2018: 9-12 July 2018, Oxford, United Kingdom: Proceedings
CSF
CSF'2018-31st IEEE Computer Security Foundations Symposium, Jul 2018, Oxford, United Kingdom. ⟨10.1109/CSF.2018.00033⟩
2018 IEEE 31st Computer Security Foundations Symposium (CSF)
IEEE 31th Computer Security Foundations Symposium: CSF 2018: 9-12 July 2018, Oxford, United Kingdom: Proceedings
CSF
Exclusive-or (XOR) operations are common in cryptographic protocols, in particular in RFID protocols and electronic payment protocols. Although there are numerous applications, due to the inherent complexity of faithful models of XOR, there is only l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7676a72dba8bdaa7c1ab53407fb2ebae
https://hal.science/hal-01780603/file/paper-final.pdf
https://hal.science/hal-01780603/file/paper-final.pdf
Publikováno v:
Journal of Computer Security
Journal of Computer Security, 2019, 27 (3), pp.277-342. ⟨10.3233/JCS-171070⟩
Journal of Computer Security, IOS Press, 2019, 27 (3), pp.277-342. ⟨10.3233/JCS-171070⟩
Journal of Computer Security, 2019, 27 (3), pp.277-342. ⟨10.3233/JCS-171070⟩
Journal of Computer Security, IOS Press, 2019, 27 (3), pp.277-342. ⟨10.3233/JCS-171070⟩
In this paper, we consider the problem of verifying anonymity and unlinkability in the symbolic model, where protocols are represented as processes in a variant of the applied pi calculus, notably used in the ProVerif tool. Existing tools and techniq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d524a23397ec1fe3e92f6d601fefe99
http://arxiv.org/abs/1710.02049
http://arxiv.org/abs/1710.02049