Stéphanie Delaune

Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

2022

So Near and Yet So Far - Symbolic Verification of Distance-Bounding Protocols.

[BibT_eX]

[DOI]

Cyrille Wiedling

ACM Trans. Priv. Secur., 2022

Automatic generation of sources lemmas in Tamarin: Towards automatic proofs of security protocols.

[BibT_eX]

[DOI]

J. Comput. Secur., 2022

One Vote Is Enough for Analysing Privacy.

[BibT_eX]

[DOI]

Joseph Lallemand

Proceedings of the Computer Security - ESORICS 2022, 2022

A small bound on the number of sessions for security protocols.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

Cracking the Stateful Nut: Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2021

A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties.

[BibT_eX]

[DOI]

Vaishnavi Sundararajan

J. Autom. Reason., 2021

A Simpler Model for Recovering Superpoly onTrivium.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

An Interactive Prover for Protocol Verification in the Computational Model.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

A Simpler Model for Recovering Superpoly on Trivium.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - 28th International Conference, 2021

Efficient Methods to Search for Best Differential Characteristics on SKINNY.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2021

2020

Catching the Fastest Boomerangs Application to SKINNY.

[BibT_eX]

[DOI]

Patrick Derbez

Mathieu Vavrille

IACR Trans. Symmetric Cryptol., 2020

Typing Messages for Free in Security Protocols.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

SKINNY with Scalpel - Comparing Tools for Differential Analysis.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Rewriting in Protocol Verification.

[BibT_eX]

[DOI]

Proceedings of the 34th International Workshop on Unification, 2020

Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols.

[BibT_eX]

[DOI]

Jannik Dreier

Proceedings of the Computer Security - ESORICS 2020, 2020

A Method for Proving Unlinkability of Stateful Protocols.

[BibT_eX]

[DOI]

Solène Moreau

Proceedings of the 33rd IEEE Computer Security Foundations Symposium, 2020

Security Analysis and Implementation of Relay-Resistant Contactless Payments.

[BibT_eX]

[DOI]

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

A method for unbounded verification of privacy-type properties.

[BibT_eX]

[DOI]

J. Comput. Secur., 2019

Symbolic Verification of Distance Bounding Protocols.

[BibT_eX]

[DOI]

Proceedings of the Principles of Security and Trust - 8th International Conference, 2019

Symbolic Analysis of Terrorist Fraud Resistance.

[BibT_eX]

[DOI]

Cyrille Wiedling

Proceedings of the Computer Security - ESORICS 2019, 2019

2018

POPSTAR: so near and yet so far.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2018

Analysing Privacy-Type Properties in Cryptographic Protocols (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

A Symbolic Framework to Analyse Physical Proximity in Security Protocols.

[BibT_eX]

[DOI]

Cyrille Wiedling

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Efficiently Deciding Equivalence for Standard Primitives and Phases.

[BibT_eX]

[DOI]

Proceedings of the Computer Security, 2018

POR for Security Protocol Equivalences - Beyond Action-Determinism.

[BibT_eX]

[DOI]

Proceedings of the Computer Security, 2018

PLAS 2018 - ACM SIGSAC Workshop on Programming Languages and Analysis for Security.

[BibT_eX]

[DOI]

Mário S. Alvim

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

A Reduced Semantics for Deciding Trace Equivalence.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2017

A procedure for deciding symbolic equivalence between sets of constraint systems.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Formal Verification of Protocols Based on Short Authenticated Strings.

[BibT_eX]

[DOI]

Ludovic Robin

Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

SAT-Equiv: An Efficient Tool for Equivalence Properties.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016

A Method for Verifying Privacy-Type Properties: The Unbounded Case.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Security and Privacy, 2016

Bounding the Number of Agents, for Equivalence Too.

[BibT_eX]

[DOI]

Proceedings of the Principles of Security and Trust - 5th International Conference, 2016

2015

From Security Protocols to Pushdown Automata.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2015

Composing Security Protocols: From Confidentiality to Privacy.

[BibT_eX]

[DOI]

Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

Checking Trace Equivalence: How to Get Rid of Nonces?

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2015, 2015

Decidability of Trace Equivalence for Protocols with Nonces.

[BibT_eX]

[DOI]

Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

Partial Order Reduction for Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Deducibility constraints and blind signatures.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Modeling and verifying ad hoc routing protocols.

[BibT_eX]

[DOI]

Mathilde Arnaud

Inf. Comput., 2014

Dynamic Tags for Security Protocols.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Tests for Establishing Security Properties.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Principles of Security and Trust - Third International Conference, 2014

Typing Messages for Free in Security Protocols: The Case of Equivalence Properties.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

YAPA: A Generic Tool for Computing Intruder Knowledge.

[BibT_eX]

[DOI]

Mathieu Baudet

ACM Trans. Comput. Log., 2013

Deciding equivalence-based properties using constraint solving.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Composition of password-based protocols.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

Formal Analysis of Privacy for Routing Protocols in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Security and Trust - Second International Conference, 2013

2012

Formal Security Proofs.

[BibT_eX]

[DOI]

Proceedings of the Software Safety and Security - Tools for Analysis and Verification, 2012

Decidability and Combination Results for Two Notions of Knowledge in Security Protocols.

[BibT_eX]

[DOI]

J. Autom. Reason., 2012

Computing Knowledge in Security Protocols Under Convergent Equational Theories.

[BibT_eX]

[DOI]

Stefan Ciobaca

J. Autom. Reason., 2012

Analysing Routing Protocols: Four Nodes Topologies Are Sufficient.

[BibT_eX]

[DOI]

Jan Degrieck

Proceedings of the Principles of Security and Trust - First International Conference, 2012

Verifying Privacy-Type Properties in a Modular Way.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

Security Protocols, Constraint Systems, and Group Theories.

[BibT_eX]

[DOI]

Daniel Pasaila

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

Formal Analysis of Privacy for Anonymous Location Based Services.

[BibT_eX]

[DOI]

Morten Dahl

Proceedings of the Theory of Security and Applications - Joint Workshop, 2011

Transforming Password Protocols to Compose.

[BibT_eX]

[DOI]

Céline Chevalier

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Formal Analysis of Protocols Based on TPM State Registers.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

Trace equivalence decision: negative tests and non-determinism.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Deciding Security for Protocols with Recursive Tests.

[BibT_eX]

[DOI]

Mathilde Arnaud

Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

Constraint solving techniques and enriching the model with equational theories.

[BibT_eX]

[DOI]

Jonathan K. Millen

Proceedings of the Formal Models and Techniques for Analyzing Security Protocols, 2011

2010

Formal security analysis of PKCS#11 and proprietary extensions.

[BibT_eX]

[DOI]

J. Comput. Secur., 2010

Symbolic bisimulation for the applied pi calculus.

[BibT_eX]

[DOI]

Mark Dermot Ryan

J. Comput. Secur., 2010

Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster.

[BibT_eX]

[DOI]

Proceedings of the Towards Trustworthy Elections, New Directions in Electronic Voting, 2010

A Formal Analysis of Authentication in the TPM.

[BibT_eX]

[DOI]

Proceedings of the Formal Aspects of Security and Trust - 7th International Workshop, 2010

Formal Analysis of Privacy for Vehicular Mix-Zones.

[BibT_eX]

[DOI]

Morten Dahl

Proceedings of the Computer Security, 2010

Automating Security Analysis: Symbolic Equivalence of Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009

Verifying privacy-type properties of electronic voting protocols.

[BibT_eX]

[DOI]

J. Comput. Secur., 2009

Simulation based security in the applied pi calculus.

[BibT_eX]

[DOI]

Olivier Pereira

IACR Cryptol. ePrint Arch., 2009

Safely composing security protocols.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2009

Epistemic Logic for the Applied Pi Calculus.

[BibT_eX]

[DOI]

Rohit Chadha

Proceedings of the Formal Techniques for Distributed Systems, 2009

A Method for Proving Observational Equivalence.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

Deducibility Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2009

2008

Symbolic protocol analysis for monoidal equational theories.

[BibT_eX]

[DOI]

Inf. Comput., 2008

From One Session to Many: Dynamic Tags for Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Automatic Verification of Privacy Properties in the Applied pi Calculus.

[BibT_eX]

[DOI]

Ben Smyth

Proceedings of the Trust Management II, 2008

Formal Analysis of PKCS#11.

[BibT_eX]

[DOI]

Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Composition of Password-Based Protocols.

[BibT_eX]

[DOI]

Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

2007

Associative-Commutative Deducibility Constraints.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Protocol Verification Via Rigid/Flexible Resolution.

[BibT_eX]

[DOI]

Hai Lin

Christopher Lynch

Proceedings of the Logic for Programming, 2007

Deciding Knowledge in Security Protocols for Monoidal Equational Theories.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2007

Safely Composing Security Protocols.

[BibT_eX]

[DOI]

Jérémie Delaitre

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Combining Algorithms for Deciding Knowledge in Security Protocols.

[BibT_eX]

[DOI]

Mathilde Arnaud

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

A Formal Theory of Key Conjuring.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

Deducibility Constraints, Equational Theory and Electronic Money.

[BibT_eX]

[DOI]

Proceedings of the Rewriting, 2007

2006

Vérification des protocoles cryptographiques et propriétés algébriques. (Verification of cryptographic protocols with algebraic properties).

[BibT_eX]

[DOI]

PhD thesis, 2006

An undecidability result for AGh.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

A survey of algebraic properties used in cryptographic protocols.

[BibT_eX]

[DOI]

Pascal Lafourcade

J. Comput. Secur., 2006

Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks.

[BibT_eX]

[DOI]

Florent Jacquemard

J. Autom. Reason., 2006

Easy intruder deduction problems with homomorphisms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Symbolic Protocol Analysis in Presence of a Homomorphism Operator and <i>Exclusive Or</i>.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Coercion-Resistance and Receipt-Freeness in Electronic Voting.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005

The Finite Variant Property: How to Get Rid of Some Algebraic Properties.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004

A Theory of Dictionary Attacks and its Complexity.

[BibT_eX]

[DOI]

Florent Jacquemard

Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

A decision procedure for the verification of security protocols with explicit destructors.

[BibT_eX]

[DOI]