A (restricted) quantifier elimination for security protocols

DOI10.1016/j.tcs.2006.08.037zbMath1153.94008OpenAlexW2126994166WikidataQ115036551 ScholiaQ115036551MaRDI QIDQ860909

N. E. Zubov

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.037

zbMATH Keywords

verificationdecidabilitysecurity protocols

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Authentication, digital signatures and secret sharing (94A62) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (1)

Distributed temporal logic for the analysis of security protocol models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure protocol composition
• Authentication and delegation with smart-cards
• Authentication tests and the structure of bundles.
• A new logic for electronic commerce protocols
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Computer science today. Recent trends and developments
• Information based reasoning about security protocols
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• A semantics for a logic of authentication (extended abstract)

This page was built for publication: A (restricted) quantifier elimination for security protocols