Abstract

In this paper, three security mechanisms developed to form the UDT (UDP-Data Transfer protocol) Security Architecture are evaluated and analyzed. An approach is utilized to ascertain the applicability and secrecy properties of the selected security mechanisms when implemented with UDT. In this approach, a formal proof of correctness, through formal composition logic is carried out. This approach is modular; it has a separate proof for each protocol section that provides insight into the network environment in which each section can be reliably employed. Moreover, the proof holds for a variety of failure recovery strategies and other implementation and configuration options.This paper is an extension and a revised version of the works published by the author.

Highlights

  • The rapidly increasing use of high-speed networks coincides with the emergence of high speed network protocols

  • (3) temporary predicate requires only until the same nonce used by the peer succeeds in completion InstP0→P[UDT-AO:Server]SMac(P, ˆP.ˆS.PNonce.SNonce.ALGOCRYPTLIST.ALGOCRYPTSEL.enc1,SKEY) ^

  • We focus on how DTLS can be used to mutually authenticate the supplicant and the authenticator, and to derive a shared secret key [1,2,24,25,26,30] to add security in UDT data transmissions

Read more

Summary

INTRODUCTION

The rapidly increasing use of high-speed networks coincides with the emergence of high speed network protocols. In order to reason about the protocols, the proof of properties of one sequence of actions by one agent involves local reasoning about the security goal of that component [37,38,39], and about environmental conditions that prevent destructive interference from other actors that may use the same certificates of key materials, according to [38]. These environmental conditions are generally formulated as protocol invariants.

Method
CONCLUSION
Full Text
Paper version not known

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 call

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