Pages that link to "Item:Q5738973"
From MaRDI portal
The following pages link to Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973):
Displaying 14 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing (Q5918863) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
