Deducibility Constraints, Equational Theory and Electronic Money

DOI10.1007/978-3-540-73147-4_10zbMath1186.68283OpenAlexW1511053316MaRDI QIDQ3608818

Sergiu Bursuc, Stéphanie Delaune, Hubert Comon-Lundh

Publication date: 6 March 2009

Published in: Rewriting, Computation and Proof (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73147-4_10

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Network protocols (68M12)

Related Items (3)

Challenges in the Automated Verification of Security Protocols ⋮ Intruder deduction problem for locally stable theories with normal forms and inverses ⋮ Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions

This page was built for publication: Deducibility Constraints, Equational Theory and Electronic Money