Prerequisites to authentication protocols proved by binding theory

Abstract

The paper proposes a binding theory and security prerequisites proposition to authentication protocols. The binding theory constructs a formal theory model by which can quickly infer some security properties. Binding theory comes from the basic ideas that the key used in cryptographic protocols is the kernel component for the security protocols. Based on binding theory, security prerequisites proposition to authentication protocols is modeled and proved. Binding theory and security prerequisites proposition to authentication protocols can simply and efficiently decide security properties when authentication protocols have security weakness for authentication properties. Some classical security protocols are taken as examples to infer and discover some of their security properties broken by binding theory and security prerequisites proposition.