Pages that link to "Item:Q2412886"
From MaRDI portal
The following pages link to Maliciously secure oblivious linear function evaluation with constant overhead (Q2412886):
Displayed 13 items.
- Finite interval-time transition system for real-time actors (Q1997268) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- Polynomial representation is tricky: maliciously secure private set intersection revisited (Q2148772) (← links)
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Two-Round Oblivious Linear Evaluation from Learning with Errors (Q5087264) (← links)
- Actively secure arithmetic computation and VOLE with constant computational overhead (Q6061358) (← links)
- Private polynomial commitments and applications to MPC (Q6067356) (← links)
- Half-tree: halving the cost of tree expansion in COT and DPF (Q6178790) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)