HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, March 26, 2021 - 2:32:56 PM
Last modification on : Friday, March 26, 2021 - 2:39:18 PM
Long-term archiving on: : Sunday, June 27, 2021 - 6:46:35 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads