A Fair (t, n)-Threshold Secret Sharing Scheme with Efficient Cheater Identifying - Trust Management XIII Access content directly
Conference Papers Year : 2019

A Fair (t, n)-Threshold Secret Sharing Scheme with Efficient Cheater Identifying


The fairness of secret sharing guarantees that, if either participant obtains the secret, other participants obtain too. The fairness can be threatened by cheaters who was hidden in the participants. To efficiently and accurately identify cheaters with guaranteeing fairness, this paper proposes a fair (t, n)-threshold secret sharing scheme with an efficient cheater identifying ability. The scheme consists of three protocols which correspond to the secret distribution phase, secret reconstruction phase, and cheater identification phase respectively. The scheme’s secret distribution strategy enables the secret reconstruction protocol to detect the occurrence of cheating and trigger the execution of the cheater identification protocol to accurately locate cheaters. Moreover, we prove that the scheme is fair and secure, and show that the cheater identification algorithm has higher efficiency by comparing with other schemes.
Fichier principal
Vignette du fichier
491176_1_En_10_Chapter.pdf (292.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03182602 , version 1 (26-03-2021)





Hua Shen, Daijie Sun, Lan Zhao, Mingwu Zhang. A Fair (t, n)-Threshold Secret Sharing Scheme with Efficient Cheater Identifying. 13th IFIP International Conference on Trust Management (IFIPTM), Jul 2019, Copenhagen, Denmark. pp.122-132, ⟨10.1007/978-3-030-33716-2_10⟩. ⟨hal-03182602⟩
30 View
35 Download



Gmail Facebook X LinkedIn More