Constructing locally leakage-resilient linear secret-sharing schemes
DOI10.1007/978-3-030-84252-9_26zbMATH Open1487.94157OpenAlexW3192451756MaRDI QIDQ2129019FDOQ2129019
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
discrete Fourier analysislocal leakage-resilienceMassey secret-sharing schemerandom linear codesShamir's secret-sharing scheme
Cryptography (94A60) Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Computational Complexity
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of Boolean Functions
- Advances in Elliptic Curve Cryptography
- An Updated Survey on Secure ECC Implementations: Attacks, Countermeasures and Cost
- Capacity of non-malleable codes
- Pseudorandomness
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- 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
- Cryptography from Learning Parity with Noise
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Learning with Errors over Rings
- MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
- Unconditionally secure computation against low-complexity leakage
- Repairing Reed-solomon codes
- 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
- Repairing Reed-Solomon Codes With Multiple Erasures
- On the local leakage resilience of linear secret sharing schemes
- Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.
- Robust secret sharing with almost optimal share size and security against rushing adversaries
- Towards optimal robust secret sharing with security against a rushing adversary
- Repairing Multiple Failures for Scalar MDS Codes
- Foundations of Security Analysis and Design III
- On the local leakage resilience of linear secret sharing schemes
Cited In (11)
- New bounds on the local leakage resilience of Shamir's secret sharing scheme
- A lower bound on the share size of leakage-resilient secret-sharing schemes
- Stronger lower bounds for leakage-resilient secret sharing
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- 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
- Short leakage resilient and non-malleable secret sharing schemes
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
- On secret sharing, randomness, and random-less reductions for secret sharing
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
- On the local leakage resilience of linear secret sharing schemes
This page was built for publication: Constructing locally leakage-resilient linear secret-sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129019)
