Constructing leakage-resilient Shamir's secret sharing: over composite order fields
From MaRDI portal
Publication:6637528
DOI10.1007/978-3-031-58737-5_11MaRDI QIDQ6637528FDOQ6637528
Authors: Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Xiuyu Ye 
Publication date: 13 November 2024
Recommendations
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Lower bounds for leakage-resilient secret sharing
- New bounds on the local leakage resilience of Shamir's secret sharing scheme
- Tight estimate of the local leakage resilience of the additive secret-sharing scheme \& its consequences
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
local leakage-resilienceMassey secret-sharing schemerandom linear codesShamir's secret-sharing scheme
Cites Work
- A note on simultaneous congruences
- How to share a secret
- Network Coding for Distributed Storage Systems
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- A note on multiple exponential sums in function fields
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Revisiting non-malleable secret sharing
- Leakage resilient secret sharing and applications
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Non-malleable secret sharing
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Repair Optimal Erasure Codes Through Hadamard Designs
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- Unconditionally secure computation against low-complexity leakage
- Repairing Reed-solomon codes
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
- Repairing Reed-Solomon Codes
- Lower bounds for leakage-resilient secret sharing
- Nearly optimal robust secret sharing against rushing adversaries
- The price of active security in cryptographic protocols
- On the local leakage resilience of linear secret sharing schemes
- Robust secret sharing with almost optimal share size and security against rushing adversaries
- Towards optimal robust secret sharing with security against a rushing adversary
- Constructing locally leakage-resilient linear secret-sharing schemes
- On the local leakage resilience of linear secret sharing schemes
- Minimum Storage Regenerating Codes for All Parameters
- Explicit Minimum Storage Regenerating Codes
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Nonlinear Repair of Reed-Solomon Codes
- Short leakage resilient and non-malleable secret sharing schemes
- New bounds on the local leakage resilience of Shamir's secret sharing scheme
Cited In (2)
This page was built for publication: Constructing leakage-resilient Shamir's secret sharing: over composite order fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637528)
