Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
From MaRDI portal
Publication:6652971
DOI10.1007/978-3-031-68388-6_10MaRDI QIDQ6652971
Publication date: 13 December 2024
character sumshigher order Fourier analysisleakage resilienceShamir's secret sharingleakage attacksrepairing Reed-Solomon codes
Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- A note on multiple exponential sums in function fields
- Linear equations in primes
- Equations over finite fields. An elementary approach
- Lower bounds for leakage-resilient secret sharing
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Nearly optimal robust secret sharing against rushing adversaries
- The price of active security in cryptographic protocols
- Robust secret sharing with almost optimal share size and security against rushing adversaries
- Constructing locally leakage-resilient linear secret-sharing schemes
- Revisiting non-malleable secret sharing
- Towards optimal robust secret sharing with security against a rushing adversary
- Leakage resilient secret sharing and applications
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Explicit Minimum Storage Regenerating Codes
- Repair Optimal Erasure Codes Through Hadamard Designs
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
- How to share a secret
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Minimum Storage Regenerating Codes for All Parameters
- Repairing Reed-Solomon Codes
- On character sums and exponential sums over generalized arithmetic progressions
- Network Coding for Distributed Storage Systems
- Nonlinear Repair of Reed-Solomon Codes
- Non-malleable secret sharing
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- Repairing Reed-solomon codes
- Advances in Cryptology - CRYPTO 2003
- Rational approximations to algebraic numbers
- The true complexity of a system of linear equations
- On the local leakage resilience of linear secret sharing schemes
- On the local leakage resilience of linear secret sharing schemes
- Unconditionally secure computation against low-complexity leakage
- A new proof of Szemerédi's theorem
- Short leakage resilient and non-malleable secret sharing schemes
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
- 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
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields
This page was built for publication: Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652971)
