Constructing locally leakage-resilient linear secret-sharing schemes

DOI10.1007/978-3-030-84252-9_26zbMath1487.94157OpenAlexW3192451756MaRDI QIDQ2129019

Hemanta K. Maji, Mingyuan Wang, Tom Suad, Anat Paskin-Cherniavsky

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_26

zbMATH Keywords

discrete Fourier analysislocal leakage-resilienceMassey secret-sharing schemerandom linear codesShamir's secret-sharing scheme

Mathematics Subject Classification ID

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

Related Items (10)

Short leakage resilient and non-malleable secret sharing schemes ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family ⋮ New bounds on the local leakage resilience of Shamir's secret sharing scheme ⋮ Protecting distributed primitives against leakage: equivocal secret sharing and more ⋮ A lower bound on the share size of leakage-resilient secret-sharing schemes ⋮ Stronger lower bounds for leakage-resilient secret sharing ⋮ Constructing leakage-resilient Shamir's secret sharing: over composite order fields ⋮ Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking ⋮ Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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
• Pseudorandomness
• An Updated Survey on Secure ECC Implementations: Attacks, Countermeasures and Cost
• Cryptography from Learning Parity with Noise
• Capacity of non-malleable codes
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
• Repairing Reed-Solomon Codes
• Repairing Reed-Solomon Codes With Multiple Erasures
• Learning with Errors over Rings
• Analysis of Boolean Functions
• Non-malleable extractors and symmetric key cryptography from weak secrets
• Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
• Repairing Multiple Failures for Scalar MDS Codes
• Non-malleable secret sharing
• Computational Complexity
• Repairing Reed-solomon codes
• Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
• Advances in Elliptic Curve Cryptography
• Foundations of Security Analysis and Design III
• 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
• Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.

This page was built for publication: Constructing locally leakage-resilient linear secret-sharing schemes