Pages that link to "Item:Q5896075"
From MaRDI portal
The following pages link to TinyKeys: a new approach to efficient multi-party computation (Q5896075):
Displaying 10 items.
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head (Q6635752) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks (Q6652985) (← links)
