Abstract
Though much attention has been paid to the research on the security of cryptographic protocols in the last two decades, no perfect solution is a.vailable. In this paper, we firstly present some explicit assumptions, and the properties that a secure protocol should hold, then divide the total security of cryptographic protocols into some partial securities based on those properties, and finally give our protocol which is surprisingly simple and prove its total security based on those assumptions and the capacity of BAN-like of proving the session key safeness of cryptographic 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.
