On the local leakage resilience of linear secret sharing schemes
From MaRDI portal
Publication:5918308
DOI10.1007/s00145-021-09375-2zbMath1467.94030OpenAlexW2954626013MaRDI QIDQ5918308
Tal Rabin, Yuval Ishai, Fabrice Benhamouda, Akshay Degwekar
Publication date: 28 June 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09375-2
Related Items (6)
Constructing locally leakage-resilient linear 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 ⋮ Improved single-round secure multiplication using regenerating codes ⋮ New bounds on the local leakage resilience of Shamir's secret sharing scheme ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- Linear equations in primes
- Self-testing/correcting with applications to numerical problems
- Homomorphic secret sharing from Paillier encryption
- How to construct a leakage-resilient (stateless) trusted party
- Homomorphic secret sharing from lattices without FHE
- Leakage resilient secret sharing and applications
- Spooky Encryption and Its Applications
- Bounded Indistinguishability and the Complexity of Recovering Secrets
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Leakage-Tolerant Computation with Input-Independent Preprocessing
- Leakage-Resilient Circuits without Computational Assumptions
- How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
- Multiparty Computation from Somewhat Homomorphic Encryption
- Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
- How to share a secret
- Leakage Resilient ElGamal Encryption
- Leakage-Resilient Coin Tossing
- How to Compute in the Presence of Leakage
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Leakage-Resilient Storage
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Privacy Amplification by Public Discussion
- Repairing Reed-Solomon Codes
- All-or-nothing encryption and the package transform
- Generalized privacy amplification
- Non-malleable secret sharing
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Advances in Cryptology - CRYPTO 2003
- Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions
- Theory of Cryptography
- The true complexity of a system of linear equations
- Theory of Cryptography
- On the local leakage resilience of linear secret sharing schemes
- A new proof of Szemerédi's theorem
This page was built for publication: On the local leakage resilience of linear secret sharing schemes
