Pages that link to "Item:Q3457060"
From MaRDI portal
The following pages link to Constant-Round MPC with Fairness and Guarantee of Output Delivery (Q3457060):
Displaying 19 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Offline witness encryption with semi-adaptive security (Q2229274) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
