Optimality of Asynchronous Two-Party Secure Data-Exchange Protocols^*

Article type: Research Article

Authors: Yahalom, Raphael

Affiliations: School of Business Administration, The Hebrew University, Jerusalem 91905, Israel

Note: [*] The research was supported in part by grants from the Recanati and Schonbrunn Foundations at the Hebrew University of Jerusalem.

Abstract: 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.

DOI: 10.3233/JCS-1993-22-307

Journal: Journal of Computer Security, vol. 2, no. 2-3, pp. 191-209, 1993