Pages that link to "Item:Q2096540"
From MaRDI portal
The following pages link to Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540):
Displaying 6 items.
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Shielded computations in smart contracts overcoming forks (Q2145367) (← links)
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)