Efficient threshold password-authenticated secret sharing protocols for cloud computing

Xun Yi, Zahir Tari, Feng Hao, Liqun Chen, Joseph K. Liu, Xuechao Yang, Kwok Yan Lam, Ibrahim Khalil, Albert Y. Zomaya

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Abstract

Threshold password-authenticated secret sharing (TPASS) protocols allow a client to distribute a secret s amongst n servers and protect it with a password pw, so that the client can later recover the secret s from any subset of t of the servers using the password pw. In this paper, we present two efficient TPASS protocols, one is built on two-phase commitment and has lower computation complexity, and another is based on zero-knowledge proof and has less communication rounds. Both protocols are in particular efficient for the client, who only needs to send a request and receive a response. In addition, we have provided rigorous proofs of security for the proposed protocols in the standard model. The experimental results have shown that the proposed two TPASS protocols are more efficient than Camenisch et al.’s protocols and save up to 85%–95% total computational time and up to 65%–75% total communication overhead.

Original languageEnglish
Pages (from-to)57-70
Number of pages14
JournalJournal of Parallel and Distributed Computing
Volume128
DOIs
Publication statusPublished - Jun 2019

Keywords

  • Diffie–Hellman problems
  • ElGamal encryption scheme
  • Shamir secret sharing scheme
  • Threshold password-authenticated secret sharing protocol

Cite this

Yi, Xun ; Tari, Zahir ; Hao, Feng ; Chen, Liqun ; Liu, Joseph K. ; Yang, Xuechao ; Lam, Kwok Yan ; Khalil, Ibrahim ; Zomaya, Albert Y. / Efficient threshold password-authenticated secret sharing protocols for cloud computing. In: Journal of Parallel and Distributed Computing. 2019 ; Vol. 128. pp. 57-70.
@article{d3646d3b14984cec9107709534c4eaee,
title = "Efficient threshold password-authenticated secret sharing protocols for cloud computing",
abstract = "Threshold password-authenticated secret sharing (TPASS) protocols allow a client to distribute a secret s amongst n servers and protect it with a password pw, so that the client can later recover the secret s from any subset of t of the servers using the password pw. In this paper, we present two efficient TPASS protocols, one is built on two-phase commitment and has lower computation complexity, and another is based on zero-knowledge proof and has less communication rounds. Both protocols are in particular efficient for the client, who only needs to send a request and receive a response. In addition, we have provided rigorous proofs of security for the proposed protocols in the standard model. The experimental results have shown that the proposed two TPASS protocols are more efficient than Camenisch et al.’s protocols and save up to 85{\%}–95{\%} total computational time and up to 65{\%}–75{\%} total communication overhead.",
keywords = "Diffie–Hellman problems, ElGamal encryption scheme, Shamir secret sharing scheme, Threshold password-authenticated secret sharing protocol",
author = "Xun Yi and Zahir Tari and Feng Hao and Liqun Chen and Liu, {Joseph K.} and Xuechao Yang and Lam, {Kwok Yan} and Ibrahim Khalil and Zomaya, {Albert Y.}",
year = "2019",
month = "6",
doi = "10.1016/j.jpdc.2019.01.013",
language = "English",
volume = "128",
pages = "57--70",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Elsevier",

}

Efficient threshold password-authenticated secret sharing protocols for cloud computing. / Yi, Xun; Tari, Zahir; Hao, Feng; Chen, Liqun; Liu, Joseph K.; Yang, Xuechao; Lam, Kwok Yan; Khalil, Ibrahim; Zomaya, Albert Y.

In: Journal of Parallel and Distributed Computing, Vol. 128, 06.2019, p. 57-70.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Efficient threshold password-authenticated secret sharing protocols for cloud computing

AU - Yi, Xun

AU - Tari, Zahir

AU - Hao, Feng

AU - Chen, Liqun

AU - Liu, Joseph K.

AU - Yang, Xuechao

AU - Lam, Kwok Yan

AU - Khalil, Ibrahim

AU - Zomaya, Albert Y.

PY - 2019/6

Y1 - 2019/6

N2 - Threshold password-authenticated secret sharing (TPASS) protocols allow a client to distribute a secret s amongst n servers and protect it with a password pw, so that the client can later recover the secret s from any subset of t of the servers using the password pw. In this paper, we present two efficient TPASS protocols, one is built on two-phase commitment and has lower computation complexity, and another is based on zero-knowledge proof and has less communication rounds. Both protocols are in particular efficient for the client, who only needs to send a request and receive a response. In addition, we have provided rigorous proofs of security for the proposed protocols in the standard model. The experimental results have shown that the proposed two TPASS protocols are more efficient than Camenisch et al.’s protocols and save up to 85%–95% total computational time and up to 65%–75% total communication overhead.

AB - Threshold password-authenticated secret sharing (TPASS) protocols allow a client to distribute a secret s amongst n servers and protect it with a password pw, so that the client can later recover the secret s from any subset of t of the servers using the password pw. In this paper, we present two efficient TPASS protocols, one is built on two-phase commitment and has lower computation complexity, and another is based on zero-knowledge proof and has less communication rounds. Both protocols are in particular efficient for the client, who only needs to send a request and receive a response. In addition, we have provided rigorous proofs of security for the proposed protocols in the standard model. The experimental results have shown that the proposed two TPASS protocols are more efficient than Camenisch et al.’s protocols and save up to 85%–95% total computational time and up to 65%–75% total communication overhead.

KW - Diffie–Hellman problems

KW - ElGamal encryption scheme

KW - Shamir secret sharing scheme

KW - Threshold password-authenticated secret sharing protocol

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

U2 - 10.1016/j.jpdc.2019.01.013

DO - 10.1016/j.jpdc.2019.01.013

M3 - Article

VL - 128

SP - 57

EP - 70

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

ER -