Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity
From MaRDI portal
Publication:2894321
DOI10.1007/978-3-642-28641-4_10zbMath1353.68069OpenAlexW1882506943MaRDI QIDQ2894321
Myrto Arapinis, Sergiu Bursuc, Mark D. Ryan
Publication date: 29 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28641-4_10
Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (2)
Automated Verification of Dynamic Root of Trust Protocols ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
Uses Software
This page was built for publication: Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity
