Pages that link to "Item:Q3020005"
From MaRDI portal
The following pages link to Black-Box Constructions of Protocols for Secure Computation (Q3020005):
Displaying 13 items.
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
