Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
From MaRDI portal
Publication:6114238
DOI10.1007/978-3-031-22318-1_13zbMath1519.94227OpenAlexW4312361114MaRDI QIDQ6114238
Anat Paskin-Cherniavsky, Hemanta K. Maji, Hai H. Nguyen, Mingyuan Wang, Xiuyu Ye, Tom Suad, Albert Siu Cheong Yu
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22318-1_13
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amortized complexity of information-theoretically secure MPC revisited
- Secure computation based on leaky correlations: high resilience setting
- Secure computation with constant communication overhead using multiplication embeddings
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Lower bounds for leakage-resilient secret sharing
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Constructing locally leakage-resilient linear secret-sharing schemes
- Revisiting non-malleable secret sharing
- Leakage resilient secret sharing and applications
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Cryptography from Learning Parity with Noise
- The Arithmetic Codex: Theory and Applications
- How to share a secret
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Repairing Reed-Solomon Codes
- Non-malleable secret sharing
- Computational Complexity
- Repairing Reed-solomon codes
- 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: Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
