The following pages link to (Q4434901):
Displayed 8 items.
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- Efficient integer span program for hierarchical threshold access structure (Q2444853) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Generic Constant-Round Oblivious Sorting Algorithm for MPC (Q3092362) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)