A Distributed Process Model of Cryptographic Protocols
This work addresses the need for mathematical methods to prevent errors in cryptographic protocols, which are critical for secure applications like electronic payments and voting.
The paper tackles the problem of verifying cryptographic protocols by presenting a distributed process model that formally describes them and their properties, enabling verification to ensure correctness and safety.
Cryptographic Protocols (CP) are distributed algorithms intended for secure communication in an insecure environment. They are used, for example, in electronic payments, electronic voting procedures, systems of confidential data processing, etc. Errors in CPs can bring to great financial and social damage, therefore it is necessary to use mathematical methods to substantiate the correctness and safety of CPs. In this paper, a distributed process model of CPs is presented, which allows one to formally describe CPs and their properties. It is shown how to solve the problems of verification of CPs on the base of this model.