2020
DOI: 10.1007/978-3-030-64381-2_17
|View full text |Cite
|
Sign up to set email alerts
|

Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries

Abstract: We show a robust secret sharing scheme for a maximal threshold t < n/2 that features an optimal overhead in share size, offers security against a rushing adversary, and runs in polynomial time. Previous robust secret sharing schemes for t < n/2 either suffered from a suboptimal overhead, offered no (provable) security against a rushing adversary, or ran in superpolynomial time.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…Secure against rushing adversaries [20] m + O(κ) O(n) with a third party Secure against rushing adversaries [21] m…”
Section: Reed-solomon Codementioning
confidence: 99%
See 1 more Smart Citation
“…Secure against rushing adversaries [20] m + O(κ) O(n) with a third party Secure against rushing adversaries [21] m…”
Section: Reed-solomon Codementioning
confidence: 99%
“…However, the algorithm has a high probability of success only if it starts with an honest party. In 2020, Fehr and Yuan [20] designed a new scheme that has the optimal share size, can guarantee safety against rushing adversaries, and can also run in polynomial time.…”
Section: Introductionmentioning
confidence: 99%