Hubert Comon-Lundh

From MaRDI portal
(Redirected from Person:462487)


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A procedure for deciding symbolic equivalence between sets of constraint systems
Information and Computation
2017-08-08Paper
Deciding security properties for cryptographic protocols. application to key cycles
ACM Transactions on Computational Logic
2015-09-17Paper
Deducibility constraints and blind signatures
Information and Computation
2014-10-20Paper
Computational and symbolic anonymity in an unbounded network
JSIAM Letters
2013-11-19Paper
Tractable inference systems: an extension with a deducibility predicate
Automated Deduction – CADE-24
2013-06-14Paper
About models of security protocols
 
2012-10-19Paper
Towards unconditional soundness: computationally complete symbolic attacker
Lecture Notes in Computer Science
2012-06-29Paper
Security proof with dishonest keys
Lecture Notes in Computer Science
2012-06-29Paper
Computational soundness of indistinguishability properties without computable parsing
Information Security Practice and Experience
2012-06-29Paper
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
 
2012-01-23Paper
Automating security analysis: symbolic equivalence of constraint systems
Automated Reasoning
2010-09-14Paper
Easy intruder deductions
Lecture Notes in Computer Science
2010-03-23Paper
Deducibility constraints
Advances in Computer Science - ASIAN 2009. Information Security and Privacy
2010-01-14Paper
Models and Proofs of Protocol Security: A Progress Report
Computer Aided Verification
2009-06-30Paper
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
Rewriting Techniques and Applications
2009-06-30Paper
Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
Formal to Practical Security
2009-06-09Paper
Deducibility Constraints, Equational Theory and Electronic Money
Rewriting, Computation and Proof
2009-03-06Paper
Challenges in the Automated Verification of Security Protocols
Automated Reasoning
2008-11-27Paper
Visibly Tree Automata with Memory and Constraints
Logical Methods in Computer Science
2008-08-07Paper
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science
2007-09-28Paper
Tree Automata with Memory, Visibility and Structural Constraints
Foundations of Software Science and Computational Structures
2007-09-07Paper
Associative-Commutative Deducibility Constraints
STACS 2007
2007-09-03Paper
Term Rewriting and Applications
Lecture Notes in Computer Science
2005-11-11Paper
Security properties: two agents are sufficient
Science of Computer Programming
2004-11-22Paper
scientific article; zbMATH DE number 2043527 (Why is no real title available?)
 
2004-02-16Paper
scientific article; zbMATH DE number 1956548 (Why is no real title available?)
 
2003-07-30Paper


Research outcomes over time


This page was built for person: Hubert Comon-Lundh