Dhekra Mahmoud

dblp:379/0166 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
7since 2021 · last 2026
0009-0002-0555-0581ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 7 · 7 since 2021
YearPublicationVenuePosition
2026 Formal Verification of EDHOC-PSK: A Symbolic Approach with SAPIC+
abstract
EDHOC is a lightweight authenticated key exchange protocol designed for constrained IoT devices. It currently supports asymmetric authentication, either using digital signatures or static Diffie-Hellman (DH) keys. Since many IoT deployments rely on Pre-Shared Keys (PSK) for authentication, a new PSK-based authentication method (EDHOC-PSK) is currently under standardization. This paper presents a symbolic analysis EDHOC-PSK (draft version 06) using SAPIC+, which compiles a single formal specification into multiple state-of-the-art verification tools, including Tamarin and ProVerif. Our model extends the typical Dolev-Yao (DY) adversary with additional capabilities, including leakage of ephemeral secrets, leakage of the long-term Pre-Shared Key leakage of the session key and a discrete-logarithm oracle. We verify the confidentiality, authentication, and key-agreement properties stated in the draft, and we refine the specification of identity protection by distinguishing anonymity and unlinkability. We show that EDHOC-PSK achieves anonymity for both parties against active attackers, while unlinkability holds only for the Initiator under passive attackers. Finally, we analyze a post-quantum Store-Now-Decrypt-Later (SNDL) adversary and find that all proven properties remain intact except Perfect Forward Secrecy (PFS), which cannot be preserved once DH secrets are recoverable.
Elsa López Pérez, Thomas Watteyne, Cristina Onete, Dhekra Mahmoud, Pascal Lafourcade 0001, Vaishnavi Sundararajan, Malisa Vucinic
AsiaCCS4
2025 Formal Analysis of SDNsec: Attacks and Corrections for Payload, Route Integrity and Accountability
Ayoub Ben Hassen, Pascal Lafourcade 0001, Dhekra Mahmoud, Maxime Puys
AsiaCCS3
2025 A Tale of Two Worlds, a Formal Story of WireGuard Hybridization
Pascal Lafourcade 0001, Dhekra Mahmoud, Sylvain Ruhault, Abdul Rahman Taleb
USENIX Security Symposium2
2024 Transferable, Auditable and Anonymous Ticketing Protocol
abstract
Digital ticketing systems typically offer ticket purchase, refund, validation, and, optionally, anonymity of users. However, it would be interesting for users to transfer their tickets, as is currently done with physical tickets. We propose Applause, a ticketing system allowing the purchase, refund, validation, and transfer of tickets based on trusted authority, while guaranteeing the anonymity of users, as long as the used payment method provides anonymity. To study its security, we formalise the security of the transferable E-Ticket scheme in the game-based paradigm. We prove the security of Applause computationally in the standard model and symbolically using the protocol verifier ProVerif. Applause relies on standard cryptographic primitives, rendering our construction efficient and scalable, as shown by a proof-of-concept. In order to obtain Spotlight, an auditable version, proved to be secure, users will remain anonymous except for a trusted third party, which will be able to disclose their identity in the event of a disaster.
Pascal Lafourcade 0001, Dhekra Mahmoud, Gaël Marcadet, Charles Olivier-Anclin
AsiaCCS2
2024 A Unified Symbolic Analysis of WireGuard
Pascal Lafourcade 0001, Dhekra Mahmoud, Sylvain Ruhault
NDSS2
2024 Formal Analysis of C-ITS PKI Protocols
abstract
International audience
Mounira Msahli, Pascal Lafourcade 0001, Dhekra Mahmoud
SECRYPT3
2024 Shaken, not Stirred - Automated Discovery of Subtle Attacks on Protocols using Mix-Nets
Jannik Dreier, Pascal Lafourcade 0001, Dhekra Mahmoud
USENIX Security Symposium3