The following pages link to (Q4434901):
Displayed 19 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)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes (Q2055621) (← links)
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) (Q2055698) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Efficient integer span program for hierarchical threshold access structure (Q2444853) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← 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)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks (Q6045214) (← links)
- Private simultaneous messages based on quadratic residues (Q6070349) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)