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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
