A formal analysis method for authentication protocols
Shudong Shi
Abstract
Shudong Shi
Abstract
BAN(Burrows,Abadi and Needham)-like logic can aid the design,analysis,and verification of Authentication protocols used over open networks and distributed systems.This paper introduces BAN-like logic and then illustrates the limitations of BAN logic on protocol idealization as a survey of the current state of BAN-like logic.The conclusions are that BAN-like logic is still one of the main tools for analysis of authentication protocols,but protocol idealization is the fatal weakness of BAN-like logic.Suggestions are then made for future work.These conclusions will facilitate the development of formal methods for the analysis and design of authentication protocols.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
BAN(Burrows,Abadi and Needham)-like logic can aid the design,analysis,and verification of Authentication protocols used over open networks and distributed systems.This paper introduces BAN-like logic and then illustrates the limitations of BAN logic on protocol idealization as a survey of the current state of BAN-like logic.The conclusions are that BAN-like logic is still one of the main tools for analysis of authentication protocols,but protocol idealization is the fatal weakness of BAN-like logic.Suggestions are then made for future work.These conclusions will facilitate the development of formal methods for the analysis and design of authentication protocols.
Key concepts: Authentication protocol, Computer science, Authentication (law), Protocol (science), Computer security, Idealization, Formal methods, State (computer science)