Deducibility Constraints, Equational Theory and Electronic Money

DOI10.1007/978-3-540-73147-4_10MaRDI QIDQ3608818zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Reduction of the intruder deduction problem into equational elementary deduction for electronic purse protocols with blind signatures
• Deciding knowledge in security protocols under equational theories
• Algebraic Intruder Deductions
• Automata, Languages and Programming
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories

Cited in

(6)

• Challenges in the Automated Verification of Security Protocols
• An equation-based classical logic
• 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
• Reduction of the intruder deduction problem into equational elementary deduction for electronic purse protocols with blind signatures
• Automated Deduction – CADE-20

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608818)