Lucca Hirschi

Orcid: 0000-0003-4572-0581

Affiliations:
  • LORIA, Inria Nancy, France


According to our database1, Lucca Hirschi authored at least 27 papers between 2014 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Comprehensive Formal Security Analysis of OPC UA.
Proceedings of the 34th USENIX Security Symposium, 2025

2024
Election Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility.
Proceedings of the 33rd USENIX Security Symposium, 2024

DY Fuzzing: Formal Dolev-Yao Models Meet Cryptographic Protocol Fuzz Testing.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

2023
DY Fuzzing: Formal Dolev-Yao Models Meet Protocol Fuzz Testing.
IACR Cryptol. ePrint Arch., 2023

Reversing, Breaking, and Fixing the French Legislative Election E-Voting Protocol.
Proceedings of the 32nd USENIX Security Symposium, 2023

Hash Gone Bad: Automated discovery of protocol attacks that exploit hash function weaknesses.
Proceedings of the 32nd USENIX Security Symposium, 2023

2021
Fixing the Achilles Heel of E-Voting: The Bulletin Board.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
Verification of stateful cryptographic protocols with exclusive OR.
J. Comput. Secur., 2020

A Spectral Analysis of Noise: A Comprehensive, Automated, Formal Analysis of Diffie-Hellman Protocols.
Proceedings of the 29th USENIX Security Symposium, 2020

2019
A method for unbounded verification of privacy-type properties.
J. Comput. Secur., 2019

Security Issues in the 5G Standard and How Formal Methods Come to the Rescue.
ERCIM News, 2019

Symbolic Abstractions for Quantum Protocol Verification.
CoRR, 2019

Improving Automated Symbolic Analysis of Ballot Secrecy for E-Voting Protocols: A Method Based on Sufficient Conditions.
Proceedings of the IEEE European Symposium on Security and Privacy, 2019

Symbolic Analysis of Identity-Based Protocols.
Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

2018
New Privacy Threat on 3G, 4G, and Upcoming 5G AKA Protocols.
IACR Cryptol. ePrint Arch., 2018

POR for Security Protocol Equivalences - Beyond Action-Determinism.
Proceedings of the Computer Security, 2018

Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

A Formal Analysis of 5G Authentication.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Automated Verification of Privacy in Security Protocols : Back and Forth Between Theory & Practice. (Vérification automatique de la protection de la vie privée : entre théorie et pratique).
PhD thesis, 2017

A Reduced Semantics for Deciding Trace Equivalence.
Log. Methods Comput. Sci., 2017

A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols.
J. Log. Algebraic Methods Program., 2017

Improving Automated Symbolic Analysis for E-voting Protocols: A Method Based on Sufficient Conditions for Ballot Secrecy.
CoRR, 2017

Mobile Subscriber WiFi Privacy.
Proceedings of the 2017 IEEE Security and Privacy Workshops, 2017

2016
A Method for Verifying Privacy-Type Properties: The Unbounded Case.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Partial Order Reduction for Security Protocols.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014


  Loading...