Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Steve Kremer"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 2 (2014)
The design and verification of cryptographic protocols is a notoriously difficult task, even in symbolic models which take an abstract view of cryptography. This is mainly due to the fact that protocols may interact with an arbitrary attacker which y
Externí odkaz:
https://doaj.org/article/d9c711d3fdb549ad94cd29733fee54b9
Autor:
Steve Kremer, Charlie Jacomme
Publikováno v:
2018 IEEE 31st Computer Security Foundations Symposium (CSF)
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.00008⟩
ACM Transactions on Privacy and Security
ACM Transactions on Privacy and Security, ACM, 2021, 24 (2), pp.1-34. ⟨10.1145/3440712⟩
ACM Transactions on Privacy and Security, 2021, 24 (2), pp.1-34. ⟨10.1145/3440712⟩
CSF
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.00008⟩
ACM Transactions on Privacy and Security
ACM Transactions on Privacy and Security, ACM, 2021, 24 (2), pp.1-34. ⟨10.1145/3440712⟩
ACM Transactions on Privacy and Security, 2021, 24 (2), pp.1-34. ⟨10.1145/3440712⟩
CSF
Passwords are still the most widespread means for authenticating users, even though they have been shown to create huge security problems. This motivated the use of additional authentication mechanisms in so-called multi-factor authentication protoco
Autor:
Steve Kremer
Publikováno v:
ACM SIGLOG News. 10:3-3
Differential privacy is nowadays considered the "gold standard" when releasing information, e.g., statistics, on sensitive data. To avoid leaking too much sensitive data noise-adding mechanisms may be used. ϵ-differential privacy measures the amount
Publikováno v:
Journal of Computer Security
Journal of Computer Security, IOS Press, In press, 28 (1), pp.71-127. ⟨10.3233/JCS-191366⟩
Journal of Computer Security, 2020, 28 (1), pp.71-127. ⟨10.3233/JCS-191366⟩
Journal of Computer Security, IOS Press, In press, 28 (1), pp.71-127. ⟨10.3233/JCS-191366⟩
Journal of Computer Security, 2020, 28 (1), pp.71-127. ⟨10.3233/JCS-191366⟩
International audience; Symbolic models for security protocol verification were pioneered by Dolev and Yao in their seminal work. Since then, although inspired by the same ideas, many variants of the original model were developed. In particular, a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5d4886917f60b0051e4747d28fbb714
https://hal.inria.fr/hal-02446910
https://hal.inria.fr/hal-02446910
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:
Sergiu Bursuc, Steve Kremer
Publikováno v:
ESORICS 2019-The 24th European Symposium on Research in Computer Security
ESORICS 2019-The 24th European Symposium on Research in Computer Security, Sep 2019, Luxembourg, Luxembourg
Lecture Notes in Computer Science ISBN: 9783030299583
ESORICS (1)
Computer Security – ESORICS 2019-24th European Symposium on Research in Computer Security, Luxembourg, September 23–27, 2019, Proceedings, Part I
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Computer Security – ESORICS 2019
ESORICS 2019-The 24th European Symposium on Research in Computer Security, Sep 2019, Luxembourg, Luxembourg
Lecture Notes in Computer Science ISBN: 9783030299583
ESORICS (1)
Computer Security – ESORICS 2019-24th European Symposium on Research in Computer Security, Luxembourg, September 23–27, 2019, Proceedings, Part I
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Computer Security – ESORICS 2019
International audience; We study protocols that rely on a public ledger infrastructure, concentrating on protocols for zero-knowledge contingent payment, whose security properties combine diverse notions of fairness and privacy. We argue that rigorou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9466f3df0b918a8763ea779d5222544
https://hal.archives-ouvertes.fr/hal-02269063/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02269063/file/main.pdf
Publikováno v:
CSF2019-32nd IEEE Computer Security Foundations Symposium
CSF2019-32nd IEEE Computer Security Foundations Symposium, Jun 2019, Hoboken, United States. pp.136-13615, ⟨10.1109/CSF.2019.00017⟩
2019 IEEE 32nd Computer Security Foundations Symposium (CSF)
CSF
CSF2019-32nd IEEE Computer Security Foundations Symposium, Jun 2019, Hoboken, United States. pp.136-13615, ⟨10.1109/CSF.2019.00017⟩
2019 IEEE 32nd Computer Security Foundations Symposium (CSF)
CSF
International audience; Code-based game-playing is a popular methodology for proving security of cryptographic constructions and side-channel countermeasures. This methodology relies on treating cryptographic proofs as an instance of relational progr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f54bff51fecd16bcac3647b3b1fda33
https://hal.science/hal-02404701
https://hal.science/hal-02404701
Publikováno v:
2019 IEEE European Symposium on Security and Privacy (EuroS&P)
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
EuroS&P
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
EuroS&P
International audience; Modern e-voting systems deploy cryptographic protocols on a complex infrastructure involving different computing platforms and agents. It is crucial to have appropriate specification and evaluation methods to perform rigorous
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