Universally composable and statistically secure verifiable secret sharing scheme based on pre-distributed data

Rafael Dowsley, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai, Anderson C.A. Nascimento

Research output: Contribution to journalArticleResearchpeer-review

13 Citations (Scopus)


This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data predistributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure protocols for performing multiplication of shares based on pre-distributed data which generalize twoparty computations based on linear pre-distributed bit commitments. The main results of this paper are a non-interactive VSS, 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 is proved using the UC framework.

Original languageEnglish
Pages (from-to)725-734
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number2
Publication statusPublished - 2011
Externally publishedYes


  • Dishonest majority
  • Pre-distributed data
  • Unconditional security
  • Universal composable
  • Verifiable secret sharing

Cite this