Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages

DOI10.1007/978-3-030-77886-6_12zbMath1479.94336OpenAlexW3150549822MaRDI QIDQ2056737

Mingyuan Wang, Anat Paskin-Cherniavsky, Hemanta K. Maji, Hai H. Nguyen, Tom Suad

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_12

zbMATH Keywords

exponential sumsdiscrete Fourier analysisBézout's theoremIrwin-Hall distributionlocal leakage resiliencephysical-bit leakagerandom punctured Reed-Solomon codesrank-\(r\) generalized arithmetic progression

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Constructing locally leakage-resilient linear secret-sharing schemes ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family ⋮ New bounds on the local leakage resilience of Shamir's secret sharing scheme ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages

Cites Work

• Unnamed Item
• Unnamed Item
• Secure computation using leaky correlations (asymptotically optimal constructions)
• Secure computation based on leaky correlations: high resilience setting
• Resource-efficient OT combiners with active security
• A note on simultaneous congruences
• Lower bounds for leakage-resilient secret sharing
• Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
• Nearly optimal robust secret sharing against rushing adversaries
• The price of active security in cryptographic protocols
• Revisiting non-malleable secret sharing
• Leakage resilient secret sharing and applications
• Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
• An elementary proof of Dirichlet's theorem about primes in an arithmetic progression
• Partial Derivatives in Arithmetic Complexity and Beyond
• Private Circuits II: Keeping Secrets in Tamperable Circuits
• Robuster Combiners for Oblivious Transfer
• Repairing Reed-Solomon Codes
• Repairing Reed-Solomon Codes With Multiple Erasures
• On character sums and exponential sums over generalized arithmetic progressions
• Extracting Correlations
• Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
• Non-malleable secret sharing
• Repairing Reed-solomon codes
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
• Advances in Cryptology - CRYPTO 2003
• OT-Combiners via Secure Computation
• 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-resilience of the Shamir secret-sharing scheme against physical-bit leakages