The following pages link to (Q2778842):
Displayed 4 items.
- Polynomial representation is tricky: maliciously secure private set intersection revisited (Q2148772) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Homomorphic Encryptions of Sums of Groups (Q5386117) (← links)
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials (Q6168401) (← links)