Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
From MaRDI portal
Publication:2056737
Recommendations
- Lower bounds for leakage-resilient secret sharing
- 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 resilient secret sharing and applications
Cites work
- A note on simultaneous congruences
- Advances in Cryptology - CRYPTO 2003
- An elementary proof of Dirichlet's theorem about primes in an arithmetic progression
- Extracting correlations
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1869734 (Why is no real title available?)
- Leakage resilient secret sharing and applications
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.
- Lower bounds for leakage-resilient secret sharing
- Nearly optimal robust secret sharing against rushing adversaries
- Non-malleable secret sharing
- On character sums and exponential sums over generalized arithmetic progressions
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On the local leakage resilience of linear secret sharing schemes
- OT-Combiners via Secure Computation
- Partial derivatives in arithmetic complexity and beyond
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Repairing Reed-Solomon Codes
- Repairing Reed-solomon codes
- Repairing Reed-Solomon Codes With Multiple Erasures
- Resource-efficient OT combiners with active security
- Revisiting non-malleable secret sharing
- Robuster Combiners for Oblivious Transfer
- Secure computation based on leaky correlations: high resilience setting
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- The price of active security in cryptographic protocols
- Unconditionally secure computation against low-complexity leakage
- Unifying leakage models: from probing attacks to noisy leakage.
Cited in
(23)- Novel leakage against realistic masking and shuffling countermeasures -- case study on PRINCE and SEED
- 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
- A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
- Tamper and Leakage Resilience in the Split-State Model
- On the local leakage resilience of linear secret sharing schemes
- On the local leakage resilience of 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
- Tight estimate of the local leakage resilience of the additive secret-sharing scheme \& its consequences
- A lower bound on the share size of leakage-resilient secret-sharing schemes
- Stronger lower bounds for leakage-resilient secret sharing
- 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
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
- IP masking with generic security guarantees under minimum assumptions, and applications
- Physical-bit leakage resilience of linear code-based secret sharing
- 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: Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056737)
