Abstract
Protocol verification is an area of network security that collaborate both network security and formal methods. Formal techniques study behavior and verify complex and compositional security protocols while its specification, designing and implementation in adversarial environments. Formal methods for security protocols include different techniques for proving protocol correctness by using mathematical reasoning through theorem proving, process calculus, model checker and automated verification tools. In this survey, we particularly address the effectiveness of process calculus in measuring security properties. The basic objective of our paper is to give breadth-first exposition of existing process algebra focusing on different algebraic models based on Dolev Yao assumption of perfect cryptography and computational approaches and also intend to analyze gap in both the approaches. We describe the essence of process algebras developed, since the evolution of theoretical models and analyze them in terms of aim, security properties addressed and tool support. The paper inculcates intended researcher to identify the security properties and formalizing concepts to develop a new and secure cryptographic data communicating process algebra from the existing literature and opens an area for future research.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call