Paper 2009/273
Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
Rafael Dowsley and Jörn Müller-Quade and Akira Otsuka and Goichiro Hanaoka and Hideki Imai and Anderson C. A. Nascimento
Abstract
This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data pre-distributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure multiparty protocols based on pre-distributed data which generalize two-party computations based on linear pre-distributed bit commitments. The main results of this paper are a non-interactive VSS where the amount of data which needs to be pre-distributed to each player depends on the number of tolerable cheaters only, a simplified multiplication protocol for shared values based on pre-distributed random products, and non-interactive zero knowledge proofs for arbitrary polynomial relations. The security of the schemes are proved using the UC framework.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Verifiable Secret SharingDishonest MajorityPre-distributed DataUnconditional SecurityUniversal Composable
- Contact author(s)
- rafael @ dowsley net
- History
- 2013-02-28: last of 2 revisions
- 2009-06-09: received
- See all versions
- Short URL
- https://ia.cr/2009/273
- License
-
CC BY