Paper 2005/239 Original: eprint.iacr.org/2005/239 ↗
A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment
Abstract
Verifiable secret sharing schemes proposed so far can only allow participants to verify whether their shares are correct or not. In this paper, we propose a new protocol which can allow participants not only to verify the correctness of their shares but also to revise the faulty shares. It is achieved in a cooperative way by participants, but without any assistance from the dealer. This protocol, to the best of our knowledge, is the first one providing such kind of ability. Correcting shares by participants instead of the dealer is important in many situations. In addition, this protocol is also useful for adding new participants without the dealer's assistance.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2005-07-30: last updated
- 2005-07-30: published
- Short URL
- https://ia.cr/2005/239
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/239,
author = {Raylin Tso and Ying Miao and Takeshi Okamoto and Eiji Okamoto},
title = {A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/239},
year = {2005},
url = {https://eprint.iacr.org/2005/239}
}