A rewriting strategy for protocol verification

MaRDI QIDQ2844070zbMATH OpenFDO

Authors Monica Nesi, Giuseppina Rucci, Massimo Verdesca

Publication date 27 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105826167

Mathematics Subject Classification ID

Network protocols (68M12) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting
• scientific article; zbMATH DE number 1614701
• Rewriting-based verification of authentication protocols
• scientific article; zbMATH DE number 5141412
• Applications of term rewriting to cryptographic protocol analysis. (Overview of the invited talk)

Cited in

(10)

• Applications of term rewriting to cryptographic protocol analysis. (Overview of the invited talk)
• scientific article; zbMATH DE number 1614701 (Why is no real title available?)
• scientific article; zbMATH DE number 1722694 (Why is no real title available?)
• Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting
• Rewriting-based verification of authentication protocols
• scientific article; zbMATH DE number 4022620 (Why is no real title available?)
• An algorithmic technique for protocol verification
• A proof of protocol correctness
• scientific article; zbMATH DE number 1956518 (Why is no real title available?)
• Ping-pong protocols as prefix grammars: modelling and verification via program transformation

This page was built for publication: A rewriting strategy for protocol verification

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