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

doi:10.1587/transfun.E94.A.725

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 journal › Article › Research › peer-review

11 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	725-734
Number of pages	10
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E94-A
Issue number	2
DOIs	https://doi.org/10.1587/transfun.E94.A.725
Publication status	Published - 2011
Externally published	Yes

Keywords

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

Access to Document

10.1587/transfun.E94.A.725

Link to publication in Scopus

Cite this

@article{949aa6e848b74306a8338d6e0cdddf34,

title = "Universally composable and statistically secure verifiable secret sharing scheme based on pre-distributed data",

abstract = "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.",

keywords = "Dishonest majority, Pre-distributed data, Unconditional security, Universal composable, Verifiable secret sharing",

author = "Rafael Dowsley and J{\"o}rn M{\"u}ller-Quade and Akira Otsuka and Goichiro Hanaoka and Hideki Imai and Nascimento, {Anderson C.A.}",

year = "2011",

doi = "10.1587/transfun.E94.A.725",

language = "English",

volume = "E94-A",

pages = "725--734",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Institute of Electronics, Information and Communications Engineers (IEICE)",

number = "2",

}

Universally composable and statistically secure verifiable secret sharing scheme based on pre-distributed data. / Dowsley, Rafael; Müller-Quade, Jörn; Otsuka, Akira; Hanaoka, Goichiro; Imai, Hideki; Nascimento, Anderson C.A.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E94-A, No. 2, 2011, p. 725-734.

Research output: Contribution to journal › Article › Research › peer-review

TY - JOUR

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

AU - Dowsley, Rafael

AU - Müller-Quade, Jörn

AU - Otsuka, Akira

AU - Hanaoka, Goichiro

AU - Imai, Hideki

AU - Nascimento, Anderson C.A.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Dishonest majority

KW - Pre-distributed data

KW - Unconditional security

KW - Universal composable

KW - Verifiable secret sharing

UR - http://www.scopus.com/inward/record.url?scp=79951505511&partnerID=8YFLogxK

U2 - 10.1587/transfun.E94.A.725

DO - 10.1587/transfun.E94.A.725

M3 - Article

AN - SCOPUS:79951505511

VL - E94-A

SP - 725

EP - 734

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 2

ER -