Pages that link to "Item:Q2829962"
From MaRDI portal
The following pages link to Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962):
Displaying 18 items.
- Separability and the detection of hidden channels (Q910195) (← links)
- A note on computational indistinguishability (Q910218) (← links)
- An independence relation for sets of secrets (Q965899) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- (Q4246732) (← links)
- (Q4551342) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5090431) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- (Q5875514) (← 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)
- Protecting distributed primitives against leakage: equivocal secret sharing and more (Q6639504) (← links)