Constructing locally leakage-resilient linear secret-sharing schemes
From MaRDI portal
Publication:2129019
Recommendations
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
- On the local leakage resilience of linear secret sharing schemes
- On the local leakage resilience of linear secret sharing schemes
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Lower bounds for leakage-resilient secret sharing
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1869734 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Advances in Elliptic Curve Cryptography
- An updated survey on secure ECC implementations: attacks, countermeasures and cost
- Analysis of Boolean Functions
- Capacity of non-malleable codes
- Computational Complexity
- Cryptography from learning parity with noise
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Foundations of Security Analysis and Design III
- Higher order Fourier analysis
- Leakage resilient secret sharing and applications
- Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Learning with errors over rings. (Abstract)
- Lower bounds for leakage-resilient secret sharing
- MDS code constructions with small sub-packetization and near-optimal repair bandwidth
- Nearly optimal robust secret sharing against rushing adversaries
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable secret sharing
- On the local leakage resilience of linear secret sharing schemes
- On the local leakage resilience of linear secret sharing schemes
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Pseudorandomness
- Repairing Multiple Failures for Scalar MDS Codes
- Repairing Reed-Solomon Codes
- Repairing Reed-Solomon Codes With Multiple Erasures
- Repairing Reed-solomon codes
- Revisiting non-malleable secret sharing
- Robust secret sharing with almost optimal share size and security against rushing adversaries
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- The price of active security in cryptographic protocols
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Towards optimal robust secret sharing with security against a rushing adversary
- Unconditionally secure computation against low-complexity leakage
Cited in
(12)- On the local leakage resilience of linear secret sharing schemes
- Tight estimate of the local leakage resilience of the additive secret-sharing scheme \& its consequences
- 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
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)
