Delaune, Stéphanie
349  Ergebnisse:
Personensuche X
?
 
?
2

Tamarin-Based Analysis of Bluetooth Uncovers Two Practical ..:

, In: Computer Security – ESORICS 2023; Lecture Notes in Computer Science,
 
?
3

Proving Unlinkability Using ProVerif Through Desynchronised..:

, In: 2023 IEEE 36th Computer Security Foundations Symposium (CSF),
 
?
4

New Algorithm for Exhausting Optimal Permutations for Gener..:

, In: Lecture Notes in Computer Science; Progress in Cryptology – INDOCRYPT 2022,
 
?
 
?
6

Cracking the Stateful Nut: Computational Proofs of Stateful..:

, In: 2022 IEEE 35th Computer Security Foundations Symposium (CSF),
 
?
7

One Vote Is Enough for Analysing Privacy:

, In: Computer Security – ESORICS 2022; Lecture Notes in Computer Science,
Delaune, Stéphanie ; Lallemand, Joseph - p. 173-194 , 2022
 
?
8

A Simpler Model for Recovering Superpoly on Trivium:

, In: Selected Areas in Cryptography; Lecture Notes in Computer Science,
 
?
9

A small bound on the number of sessions for security protoc..:

, In: 2022 IEEE 35th Computer Security Foundations Symposium (CSF),
 
?
10

An Interactive Prover for Protocol Verification in the Comp..:

, In: 2021 IEEE Symposium on Security and Privacy (SP),
 
?
11

Efficient Methods to Search for Best Differential Character..:

, In: Applied Cryptography and Network Security; Lecture Notes in Computer Science,
Delaune, Stéphanie ; Derbez, Patrick ; Huynh, Paul... - p. 184-207 , 2021
 
?
13

A Method for Proving Unlinkability of Stateful Protocols:

, In: 2020 IEEE 33rd Computer Security Foundations Symposium (CSF),
 
?
15

Automatic Generation of Sources Lemmas in Tamarin: Towards ..:

, In: Computer Security – ESORICS 2020; Lecture Notes in Computer Science,
 
1-15