Loading...
Formal Analysis of Security Protocols using Theorem Proving
Miramirkhani, Najmeh Sadat | 2011
596
Viewed
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 41865 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Jalili, Rasool
- Abstract:
- Security protocols are mostly verified using tools based on model checking approach. These tools are automatic but they can be used for verifying protocols with low complexity and limited number of participants. The other approach that can be used in these cases is theorem proving. Inductive method is a theorem proving approach which is based on induction in mathematics. Inductive method has been applied for verifying several classical and real-world protocols.
The basic concepts in this method are event and trace. Using the concept of event, the network traffic can be modeled through various events occurring in the network. Atrace is a list of events and model a history of the network. In the Inductive Method, a security protocol is modeled as a set of all possible traces which is defined inductively. Such a definition specifies how to extend a trace belonging to the set of traces using a new event. Accordingly, security properties can be proved by induction on traces. According to the extendibility of the Inductive Method, we represent a model for a well-known e-voting protocol, FOO'92, using the Inductive Method. This is somehow a complex task, as typical e-voting protocols may employ some advanced cryptographic primitives such as blind signature and commitment as well as broadcast communications. Along with modeling of these two primitives, we extend the Inductive Method to support broadcast communications and then prove the related theorems. The FOO protocol is modeled based on this extension and a theorem relevant the model validation is proved - Keywords:
- Formal Analysis ; Electronic Voting ; Theorem Proving ; Security Protocols ; Inductive Method
-
محتواي پايان نامه
- view