Pages that link to "Item:Q2936624"
From MaRDI portal
The following pages link to Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation (Q2936624):
Displayed 16 items.
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security (Q2098172) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Minimizing setup in broadcast-optimal two round MPC (Q6061355) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)