January 01, 2020 conference-paper Open access Aachen paper

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

Lecture notes in computer science, pp. 470–498

DOI: 10.1007/978-3-030-64381-2_17 Full text (OA) OpenAlex

Authors 2

Serge Fehr Aachen Mathematical Institute

Leiden University · Centrum Wiskunde & Informatica

Affiliation as printed

CWI, Amsterdam, The Netherlands

Mathematical Institute, Leiden University, Leiden, The Netherlands
Chen Yuan corresponding

Centrum Wiskunde & Informatica

Affiliation as printed

CWI, Amsterdam, The Netherlands

Cited by 11 stored of 11

Scalable multiparty threshold private set intersection based on additive secret sharing
2026 Journal of Information Security and Applications article Computer Science Cryptography and Data Security

0

citations
Physical-Bit Leakage Resilience of Linear Code-Based Secret Sharing
2025 Lecture notes in computer science conference-paper Computer Science Coding theory and cryptography

3

citations
A Stealthy Communication Model with Blockchain Smart Contract for Bidding Systems
2024 Electronics article Computer Science Blockchain Technology Applications and Security Open access

11

citations
Constructing Leakage-Resilient Shamir’s Secret Sharing: Over Composite Order Fields
2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

8

citations
Towards Breaking the Half-Barrier of Local Leakage-Resilient Shamir’s Secret Sharing
2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

2

citations
The Round Complexity of Statistical MPC with Optimal Resiliency
2023 ACM Symposium on Theory of Computing (STOC) conference-paper Computer Science Cryptography and Data Security Open access

6

citations
Improved Bound on the Local Leakage-resilience of Shamir’s Secret Sharing
2022 IEEE International Symposium on Information Theory (ISIT) conference-paper Computer Science Cryptography and Data Security

17

citations
Fair and Efficient Robust Secret Sharing Scheme against Rushing Adversaries
2022 Security and Communication Networks article Computer Science Cryptography and Data Security Open access

0

citations
Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks
2021 IEEE International Symposium on Information Theory (ISIT) conference-paper Computer Science Cryptography and Data Security

12

citations
Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes
2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

18

citations
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries
2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

13

citations

11 results

No patents citing this paper on Lens.org (checked 2026-10-11).

References 12

Verifiable secret sharing and multiparty protocols with honest majority
1989 ACM Symposium on Theory of Computing (STOC) conference-paper Computer Science Cryptography and Data Security Open access

934

citations
Theory of Randomized Search Heuristics
2011 Theoretical computer science book Computer Science Metaheuristic Optimization Algorithms Research

312

citations
Size of Shares and Probability of Cheating in Threshold Schemes
1994 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

96

citations
Theory of Randomized Search Heuristics
2012 Algorithmica article Computer Science Metaheuristic Optimization Algorithms Research Open access

79

citations
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
2001 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

58

citations
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
2015 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

56

citations
Unconditionally-Secure Robust Secret Sharing with Compact Shares
2012 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

48

citations
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
2016 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

30

citations
Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary
2019 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

14

citations
Robust Secret Sharing Schemes Against Local Adversaries
2016 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

13

citations
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries
2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

13

citations
W3029698825
details pending

0

citations

12 results