Optimality of Asynchronous Two-Party Secure Data-Exchange Protocols*
Raphael Yahalom · Journal of Computer Security · 1993
The problem of setting up two principals in a distributed asynchronous environment for a secure data-exchange session is examined. A model is presented and a theorem regarding necessary and sufficient conditions for establishing an upper bound on the duration between events is proved. The goals of secure data exchange protocols are motivated and precisely stated. A minimality result – establishing the minimal number of messages that are required to achieve these goals, is derived. Finally, a secure data exchange protocol which contains the minimal number of messages is presented, analyzed, and compared with previously published protocols.