Abstract
Arazi was the first author to propose the integration of a key exchange protocol with a digital signature algorithm. Other authors have subsequently proposed methods to increase the level of security and achieve the necessary properties of authenticated key exchange protocols. However, these proposals exhibit several weaknesses and the majority of these protocols are based only on a single hard problem. In this paper, we propose a new secured key exchange protocol which is based on two hard problems. We then extend this to a signcryption protocol and a deniable signcryption protocol. These protocols represent the first steps in a new direction, but they are designed based on two hard problems. The security proofs for the new protocols confirm their novelty and security.
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.
