Pages that link to "Item:Q1710615"
From MaRDI portal
The following pages link to How to securely compute with noisy leakage in quasilinear complexity (Q1710615):
Displaying 8 items.
- Unifying leakage models: from probing attacks to noisy leakage (Q1715856) (← links)
- Towards tight random probing security (Q2128995) (← links)
- How to Compute in the Presence of Leakage (Q3449567) (← links)
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases (Q3563833) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5918380) (← links)
- Exploiting algebraic structures in probing security (Q6604876) (← links)
- From random probing to noisy leakages without field-size dependence (Q6637530) (← links)
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing (Q6652995) (← links)