Pages that link to "Item:Q3179367"
From MaRDI portal
The following pages link to Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367):
Displaying 13 items.
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Cheater Detection in SPDZ Multiparty Computation (Q2953814) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- A Trustless GQ Multi-signature Scheme with Identifiable Abort (Q6488403) (← links)
- On the correlation complexity of MPC with cheater identification (Q6573954) (← links)
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs (Q6581782) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs (Q6653036) (← links)
