The following pages link to Equivocating Yao (Q4977997):
Displaying 13 items.
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings (Q2874554) (← links)
- Techniques for Efficient Secure Computation Based on Yao’s Protocol (Q4916013) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model (Q6135416) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
