Pages that link to "Item:Q2412895"
From MaRDI portal
The following pages link to Amortizing randomness complexity in private circuits (Q2412895):
Displayed 8 items.
- Side-channel masking with pseudo-random generator (Q2055660) (← links)
- Secure wire shuffling in the probing model (Q2128997) (← links)
- Private circuits with quasilinear randomness (Q2170088) (← links)
- Cryptanalysis of masked ciphers: a not so random idea (Q2692369) (← links)
- Packed multiplication: how to amortize the cost of side-channel masking? (Q2692370) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)