Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing

DOI10.1007/978-3-031-68388-6_10MaRDI QIDQ6652971FDOQ6652971

Authors: Hai H. Nguyen 

Publication date: 13 December 2024

zbMATH Keywords

character sumshigher order Fourier analysisleakage resilienceShamir's secret sharingleakage attacksrepairing Reed-Solomon codes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Additive combinatorics
• How to share a secret
• Network Coding for Distributed Storage Systems
• A new proof of Szemerédi's theorem
• The true complexity of a system of linear equations
• Linear equations in primes
• Equations over finite fields. An elementary approach
• Advances in Cryptology - CRYPTO 2003
• Rational approximations to algebraic numbers
• 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
• On character sums and exponential sums over generalized arithmetic progressions
• 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
• 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)