From post

Deducibility Constraints, Equational Theory and Electronic Money.

, , и . Rewriting, Computation and Proof, том 4600 из Lecture Notes in Computer Science, стр. 196-212. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions., и . RTA, том 5595 из Lecture Notes in Computer Science, стр. 133-147. Springer, (2009)Constraint solving techniques and enriching the model with equational theories., , и . Formal Models and Techniques for Analyzing Security Protocols, том 5 из Cryptology and Information Security Series, IOS Press, (2011)Computational Soundness of Indistinguishability Properties without Computable Parsing., , , и . ISPEC, том 7232 из Lecture Notes in Computer Science, стр. 63-79. Springer, (2012)A Computationally Complete Symbolic Attacker for Equivalence Properties., и . ACM Conference on Computer and Communications Security, стр. 609-620. ACM, (2014)Computational soundness of observational equivalence., и . ACM Conference on Computer and Communications Security, стр. 109-118. ACM, (2008)Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables., и . Formal to Practical Security, том 5458 из Lecture Notes in Computer Science, стр. 1-20. Springer, (2009)Security Proof with Dishonest Keys., , и . POST, том 7215 из Lecture Notes in Computer Science, стр. 149-168. Springer, (2012)Models and Proofs of Protocol Security: A Progress Report., , и . CAV, том 5643 из Lecture Notes in Computer Science, стр. 35-49. Springer, (2009)Intruder Theories (Ongoing Work).. FoSSaCS, том 2987 из Lecture Notes in Computer Science, стр. 1-4. Springer, (2004)Normal Attacks on Security Protocols.. Abstract State Machines, стр. 70. (2005)