Paper 2003/222
A Verifiable Secret Sharing Scheme with Statistical zero-knowledge
Chunming Tang, Zhuojun Liu, and Mingsheng Wang
Abstract
In this paper, we first propose a protocol in which the prover can show that a=b holds for two committed integers a and b; also, we present a protocol in which the prover can prove that a\neq 0 holds for committed integer a; then, we construct a protocol to prove that the degree of a polynomial f(x) equals to t-1 exactly, which has been as an open problem(see[21]); finally, we provide a protocol in which the prover proves that a pair (x,y) is generated by a polynomial f(x), i.e., y=f(x)(mod m), where m is a prime. Based on above four protocols, we put forward a verifiable (t,n)-secret sharing scheme, which can avoid all known the dealer's cheats. In particular, all above protocols are statistical zero-knowledge.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- secret sharingverifiable secret sharingstatistical zero-knowledge
- Contact author(s)
- ctang @ mmrc iss ac cn
- History
- 2003-10-13: received
- Short URL
- https://ia.cr/2003/222
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/222,
author = {Chunming Tang and Zhuojun Liu and Mingsheng Wang},
title = {A Verifiable Secret Sharing Scheme with Statistical zero-knowledge},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/222},
year = {2003},
url = {https://eprint.iacr.org/2003/222}
}
