Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary
Serge Fehr,Chen Yuan +1 more
- pp 472-499
TLDR
Robust secret sharing enables the reconstruction of a secret-shared message in the presence of up to t (out of n) incorrect shares when t is the largest t for which the task is still possible.Abstract:
Robust secret sharing enables the reconstruction of a secret-shared message in the presence of up to t (out of n) incorrect shares. The most challenging case is when \(n = 2t+1\), which is the largest t for which the task is still possible, up to a small error probability \(2^{-\kappa }\) and with some overhead in the share size.read more
Citations
More filters
Book ChapterDOI
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs
TL;DR: This main fully secure protocol builds on a new intermediate honest-majority protocol for verifying the correctness of multiplication triples by making a general use of distributed zeroknowledge proofs, and provides a conceptually simpler, more general, and more efficient alternative to previous protocols from the literature.
Posted Content
SquirRL: Automating Attack Analysis on Blockchain Incentive Mechanisms with Deep Reinforcement Learning
TL;DR: SquirRL as discussed by the authors is a framework for using deep reinforcement learning to analyze attacks on blockchain incentive mechanisms, and it has been shown that selfish mining is not a Nash equilibrium in the multi-agent selfish mining setting.
Book ChapterDOI
Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes
TL;DR: The leakage-resilience of secret-sharing schemes is investigated in this paper, where the authors show that secret sharing schemes underlies nearly all threshold cryptography, which is a fundamental cryptographic primitive and is essential to ensure cryptographic constructions' security even when information leaks via unforeseen avenues.
Proceedings ArticleDOI
Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks
Donald Q. Adams,Hemanta K. Maji,Hai H. Nguyen,Minh Luong Nguyen,Anat Paskin-Cherniavsky,Tom Suad,Mingyuan Wang +6 more
TL;DR: In this paper, the authors studied the local leakage-resilience of Shamir's secret sharing scheme and the additive secret-sharing scheme against probing attacks that leak physical bits from the memory hardware storing the secret shares.
Book ChapterDOI
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries
Serge Fehr,Chen Yuan +1 more
TL;DR: In this article, a robust secret sharing scheme for a maximal threshold (t < n/2) was proposed, which features an optimal overhead in share size, offers security against a rushing adversary and runs in polynomial time.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Proceedings ArticleDOI
Safeguarding cryptographic keys
TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.
BookDOI
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Anne Auger,Benjamin Doerr +1 more
TL;DR: This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence.
Proceedings Article
Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)
Tal Rabin,Michael Ben-Or +1 more
TL;DR: A verifiable secret sharing protocol is presented, and it is shown that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest.
Journal ArticleDOI
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
Venkatesan Guruswami,Atri Rudra +1 more
TL;DR: This paper presents an explicit construction of error-correcting codes of rate that can be list decoded in polynomial time up to a fraction of worst-case errors, and their methods directly yield better decoding algorithms for RS codes when errors occur in phased bursts.