Pages that link to "Item:Q1690210"
From MaRDI portal
The following pages link to On secure two-party computation in three rounds (Q1690210):
Displaying 7 items.
- On the existence of three round zero-knowledge proofs (Q1653072) (← links)
- Individual simulations (Q2691606) (← links)
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE (Q2829234) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)