Physical-bit leakage resilience of linear code-based secret sharing
From MaRDI portal
Cites work
- Advances in Cryptology - CRYPTO 2003
- An improvement upon the bounds for the local leakage resilience of Shamir's secret sharing scheme
- Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields
- Constructing locally leakage-resilient linear secret-sharing schemes
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Explicit Minimum Storage Regenerating Codes
- Extractors and secret sharing against bounded collusion protocols
- How to share a secret
- Leakage resilient secret sharing and applications
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Leakage-resilient cryptography from the inner-product extractor
- Leakage-resilient secret sharing against colluding parties
- Leakage-resilient storage
- Leakage-Tolerant Interactive Protocols
- Lower bounds for leakage-resilient secret sharing
- Minimum Storage Regenerating Codes for All Parameters
- Nearly optimal robust secret sharing against rushing adversaries
- Network Coding for Distributed Storage Systems
- New bounds on the local leakage resilience of Shamir's secret sharing scheme
- Non-malleable secret sharing
- Nonlinear Repair of Reed-Solomon Codes
- On the local leakage resilience of linear secret sharing schemes
- On the local leakage resilience of linear secret sharing schemes
- Optimal amplification of noisy leakages
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Repair Optimal Erasure Codes Through Hadamard Designs
- Repairing Reed-solomon codes
- Repairing Reed-Solomon Codes
- Revisiting non-malleable secret sharing
- Robust secret sharing with almost optimal share size and security against rushing adversaries
- Short leakage resilient and non-malleable secret sharing schemes
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Stronger lower bounds for leakage-resilient secret sharing
- The price of active security in cryptographic protocols
- Tight estimate of the local leakage resilience of the additive secret-sharing scheme \& its consequences
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
- Towards optimal robust secret sharing with security against a rushing adversary
- Unconditionally secure computation against low-complexity leakage
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
Cited in
(3)- New tight bounds on the local leakage resilience of the additive (n, n)-threshold scheme determined by the eigenvalues of circulant matrices
- Leakage-resilience of Shamir's secret sharing: identifying secure evaluation places
- On the security of linear secret sharing with general noisy side-channel leakage
This page was built for publication: Physical-bit leakage resilience of linear code-based secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891173)
