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.
Original language | English |
---|---|
Title of host publication | Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017 |
Editors | Koichiro Ishibashi, Josef Kung, Lam-Son Le, Nam Thoai, Tran Khanh Dang |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 16-22 |
Number of pages | 7 |
ISBN (Electronic) | 9781538606070 |
DOIs | |
Publication status | Published - 2018 Jun 21 |
Event | 2017 International Conference on Advanced Computing and Applications, ACOMP 2017 - Ho Chi Minh City, Viet Nam Duration: 2017 Nov 29 → 2017 Dec 1 |
Publication series
Name | Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017 |
---|
Conference
Conference | 2017 International Conference on Advanced Computing and Applications, ACOMP 2017 |
---|---|
Country/Territory | Viet Nam |
City | Ho Chi Minh City |
Period | 17/11/29 → 17/12/1 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.
Keywords
- Authentication
- deniable
- hard problem
- key exchange
- signcryption
ASJC Scopus subject areas
- Computer Networks and Communications
- Computer Science Applications
- Hardware and Architecture