?
Computer Security – ESORICS 2023; Lecture Notes in Computer Science ,
2
Tamarin-Based Analysis of Bluetooth Uncovers Two Practical ..:
, In:
?
2023 IEEE 36th Computer Security Foundations Symposium (CSF) ,
3
Proving Unlinkability Using ProVerif Through Desynchronised..:
, In:
?
Computer Security – ESORICS 2022; Lecture Notes in Computer Science ,
4
One Vote Is Enough for Analysing Privacy:
, In:
?
2022 IEEE 35th Computer Security Foundations Symposium (CSF) ,
5
Cracking the Stateful Nut: Computational Proofs of Stateful..:
, In:
?
Selected Areas in Cryptography; Lecture Notes in Computer Science ,
6
A Simpler Model for Recovering Superpoly on Trivium:
, In:
?
2022 IEEE 35th Computer Security Foundations Symposium (CSF) ,
7
A small bound on the number of sessions for security protoc..:
, In:
?
Lecture Notes in Computer Science; Progress in Cryptology – INDOCRYPT 2022 ,
8
New Algorithm for Exhausting Optimal Permutations for Gener..:
, In:
?
2021 IEEE Symposium on Security and Privacy (SP) ,
10
An Interactive Prover for Protocol Verification in the Comp..:
, In:
?
Applied Cryptography and Network Security; Lecture Notes in Computer Science ,
11
Efficient Methods to Search for Best Differential Character..:
, In:
?
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security ,
12
Security Analysis and Implementation of Relay-Resistant Con..:
, In:
?
2020 IEEE 33rd Computer Security Foundations Symposium (CSF) ,
13
A Method for Proving Unlinkability of Stateful Protocols:
, In:
?
Computer Security – ESORICS 2020; Lecture Notes in Computer Science ,
14