Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols

Basu, Soumya; Tomescu, Alin; Abraham, Ittai; Malkhi, Dahlia; Reiter, Michael K.; Sirer, Emin Gün

doi:10.1145/3319535.3354207

Cited by 15 publications

(3 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the excessive trust given to the dealer, we cannot guarantee that the dealer will not have malicious behavior. To prevent the dealer from malicious behavior, verifiable secret share (VSS) is proposed [11]. Verifiable secret share is based on secret share, adding a step of share verification.…”

Section: Verifiable Secret Sharementioning

confidence: 99%

Distributed Secure Storage Scheme Based on Sharding Blockchain

Wang¹,

Han²,

Yu³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Distributed storage can store data in multiple devices or servers to improve data security. However, in today's explosive growth of network data, traditional distributed storage scheme is faced with some severe challenges such as insufficient performance, data tampering, and data lose. A distributed storage scheme based on blockchain has been proposed to improve security and efficiency of traditional distributed storage. Under this scheme, the following improvements have been made in this paper. This paper first analyzes the problems faced by distributed storage. Then proposed to build a new distributed storage blockchain scheme with sharding blockchain. The proposed scheme realizes the partitioning of the network and nodes by means of blockchain sharding technology, which can improve the efficiency of data verification between nodes. In addition, this paper uses polynomial commitment to construct a new verifiable secret share scheme called PolyVSS. This new scheme is one of the foundations for building our improved distributed storage blockchain scheme. Compared with the previous scheme, our new scheme does not require a trusted third party and has some new features such as homomorphic and batch opening. The security of VSS can be further improved. Experimental comparisons show that the proposed scheme significantly reduces storage and communication costs.

show abstract

Section: Verifiable Secret Sharementioning

confidence: 99%

Distributed Secure Storage Scheme Based on Sharding Blockchain

Wang¹,

Han²,

Yu³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Existing FSS solutions are not as flexible and versatile as the various secret sharing schemes [15], which provide enhanced privacy [98,96,103,88,23,74,89,94], refreshable shares [84,65,55,110,83], ability to share multiple secrets simultaneously [109,24], verifiable shares and secrets [105,80,44,38,43,19,53,61,87,91,57,14,68,42,12,102], flexibility in sharing/reconstruction procedures and size of the shares [99,66,37,67,101,77,11,22,41,47,48,106]. Its extensive flavors have enabled secret sharing to have applications in a multitude of areas, including threshold cryptography [49], (secure) multiparty computation [19,…”

Section: Future Workmentioning

confidence: 99%

Function-private Conditional Disclosure of Secrets and Multi-evaluation Threshold Distributed Point Functions

Miranda¹,

Yeo²,

Sehrawat³

2021

Preprint

View full text Add to dashboard Cite

Conditional disclosure of secrets (CDS) allows multiple parties to reveal a secret to a third party if and only if some pre-decided condition is satisfied. In this work, we bolster the privacy guarantees of CDS by introducing function-private CDS wherein the pre-decided condition is never revealed to the third party. We also derive a function secret sharing scheme from our function-private CDS solution. The second problem that we consider concerns threshold distributed point functions, which allow one to split a point function such that at least a threshold number of shares are required to evaluate it at any given input. We consider a setting wherein a point function is split among a set of parties such that multiple evaluations do not leak non-negligible information about it. Finally, we present a provably optimal procedure to perform threshold function secret sharing of any polynomial in a finite field. † The is the full version of the paper that will appear in Cryptology and Network Security (CANS), 2021.

show abstract

“…In this setting, it might be better to base security on a large, threshold number of honest players who individually and efficiently verify their own share rather than on a small number of external verifiers who must each do Ω(n) work. Indeed, recent work explores the use of VSS within BFT protocols without external verifiers [44]. Nonetheless, our AMT VSS protocol can be easily modified into a PVSS since an AMT for all n proofs can be batch-verified in Θ(n) time (see §III-C3).…”

Section: Introductionmentioning

confidence: 99%

Towards Scalable Threshold Cryptosystems

Tomescu¹,

Chen²,

Zheng³

et al. 2020

2020 IEEE Symposium on Security and Privacy (SP)

Self Cite

View full text Add to dashboard Cite

The resurging interest in Byzantine fault tolerant systems will demand more scalable threshold cryptosystems. Unfortunately, current systems scale poorly, requiring time quadratic in the number of participants. In this paper, we present techniques that help scale threshold signature schemes (TSS), verifiable secret sharing (VSS) and distributed key generation (DKG) protocols to hundreds of thousands of participants and beyond. First, we use efficient algorithms for evaluating polynomials at multiple points to speed up computing Lagrange coefficients when aggregating threshold signatures. As a result, we can aggregate a 130,000 out of 260,000 BLS threshold signature in just 6 seconds (down from 30 minutes). Second, we show how "authenticating" such multipoint evaluations can speed up proving polynomial evaluations, a key step in communicationefficient VSS and DKG protocols. As a result, we reduce the asymptotic (and concrete) computational complexity of VSS and DKG protocols from quadratic time to quasilinear time, at a small increase in communication complexity. For example, using our DKG protocol, we can securely generate a key for the BLS scheme above in 2.3 hours (down from 8 days). Our techniques improve performance for thresholds as small as 255 and generalize to any Lagrange-based threshold scheme, not just threshold signatures. Our work has certain limitations: we require a trusted setup, we focus on synchronous VSS and DKG protocols and we do not address the worst-case complaint overhead in DKGs. Nonetheless, we hope it will spark new interest in designing large-scale distributed systems.

show abstract

Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols

Cited by 15 publications

References 47 publications

Distributed Secure Storage Scheme Based on Sharding Blockchain

Distributed Secure Storage Scheme Based on Sharding Blockchain

Function-private Conditional Disclosure of Secrets and Multi-evaluation Threshold Distributed Point Functions

Towards Scalable Threshold Cryptosystems

Contact Info

Product

Resources

About