Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems

Do Viet Binh, Nguyen Hieu Minh, Nguyen Nam Hai, Junbeom Hur, Dang Hoang Minh, Ho Sy Tan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017
EditorsKoichiro Ishibashi, Josef Kung, Lam-Son Le, Nam Thoai, Tran Khanh Dang
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages16-22
Number of pages7
ISBN (Electronic)9781538606070
DOIs
Publication statusPublished - 2018 Jun 21
Event2017 International Conference on Advanced Computing and Applications, ACOMP 2017 - Ho Chi Minh City, Viet Nam
Duration: 2017 Nov 292017 Dec 1

Publication series

NameProceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017

Conference

Conference2017 International Conference on Advanced Computing and Applications, ACOMP 2017
CountryViet Nam
CityHo Chi Minh City
Period17/11/2917/12/1

Fingerprint

Electronic document identification systems

Keywords

  • Authentication
  • deniable
  • hard problem
  • key exchange
  • signcryption

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Cite this

Binh, D. V., Minh, N. H., Hai, N. N., Hur, J., Minh, D. H., & Tan, H. S. (2018). Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems. In K. Ishibashi, J. Kung, L-S. Le, N. Thoai, & T. K. Dang (Eds.), Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017 (pp. 16-22). (Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ACOMP.2017.12

Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems. / Binh, Do Viet; Minh, Nguyen Hieu; Hai, Nguyen Nam; Hur, Junbeom; Minh, Dang Hoang; Tan, Ho Sy.

Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017. ed. / Koichiro Ishibashi; Josef Kung; Lam-Son Le; Nam Thoai; Tran Khanh Dang. Institute of Electrical and Electronics Engineers Inc., 2018. p. 16-22 (Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Binh, DV, Minh, NH, Hai, NN, Hur, J, Minh, DH & Tan, HS 2018, Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems. in K Ishibashi, J Kung, L-S Le, N Thoai & TK Dang (eds), Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017. Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017, Institute of Electrical and Electronics Engineers Inc., pp. 16-22, 2017 International Conference on Advanced Computing and Applications, ACOMP 2017, Ho Chi Minh City, Viet Nam, 17/11/29. https://doi.org/10.1109/ACOMP.2017.12
Binh DV, Minh NH, Hai NN, Hur J, Minh DH, Tan HS. Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems. In Ishibashi K, Kung J, Le L-S, Thoai N, Dang TK, editors, Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017. Institute of Electrical and Electronics Engineers Inc. 2018. p. 16-22. (Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017). https://doi.org/10.1109/ACOMP.2017.12
Binh, Do Viet ; Minh, Nguyen Hieu ; Hai, Nguyen Nam ; Hur, Junbeom ; Minh, Dang Hoang ; Tan, Ho Sy. / Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems. Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017. editor / Koichiro Ishibashi ; Josef Kung ; Lam-Son Le ; Nam Thoai ; Tran Khanh Dang. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 16-22 (Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017).
@inproceedings{87b49430360b4b41ae9d3838566efc9e,
title = "Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems",
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.",
keywords = "Authentication, deniable, hard problem, key exchange, signcryption",
author = "Binh, {Do Viet} and Minh, {Nguyen Hieu} and Hai, {Nguyen Nam} and Junbeom Hur and Minh, {Dang Hoang} and Tan, {Ho Sy}",
year = "2018",
month = "6",
day = "21",
doi = "10.1109/ACOMP.2017.12",
language = "English",
series = "Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "16--22",
editor = "Koichiro Ishibashi and Josef Kung and Lam-Son Le and Nam Thoai and Dang, {Tran Khanh}",
booktitle = "Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017",

}

TY - GEN

T1 - Authenticated Key Exchange, Signcryption and Deniable Signcryption Protocols Based on Two Hard Problems

AU - Binh, Do Viet

AU - Minh, Nguyen Hieu

AU - Hai, Nguyen Nam

AU - Hur, Junbeom

AU - Minh, Dang Hoang

AU - Tan, Ho Sy

PY - 2018/6/21

Y1 - 2018/6/21

N2 - 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.

AB - 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.

KW - Authentication

KW - deniable

KW - hard problem

KW - key exchange

KW - signcryption

UR - http://www.scopus.com/inward/record.url?scp=85050552920&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050552920&partnerID=8YFLogxK

U2 - 10.1109/ACOMP.2017.12

DO - 10.1109/ACOMP.2017.12

M3 - Conference contribution

T3 - Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017

SP - 16

EP - 22

BT - Proceedings - 2017 International Conference on Advanced Computing and Applications, ACOMP 2017

A2 - Ishibashi, Koichiro

A2 - Kung, Josef

A2 - Le, Lam-Son

A2 - Thoai, Nam

A2 - Dang, Tran Khanh

PB - Institute of Electrical and Electronics Engineers Inc.

ER -