Pages that link to "Item:Q2948381"
From MaRDI portal
The following pages link to Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware (Q2948381):
Displaying 13 items.
- How to construct a leakage-resilient (stateless) trusted party (Q1690270) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- Survey of information security (Q2385398) (← links)
- Parallel Repetition for Leakage Resilience Amplification Revisited (Q3000532) (← links)
- Deniable Attribute Based Encryption for Branching Programs from LWE (Q3181031) (← links)
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases (Q3563833) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
- On the local leakage resilience of linear secret sharing schemes (Q5918308) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- Leakage-tolerant circuits (Q6637525) (← links)
- Protecting distributed primitives against leakage: equivocal secret sharing and more (Q6639504) (← links)