The following pages link to Covert two-party computation (Q3581447):
Displaying 10 items.
- Efficient covert two-party computation (Q1749305) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- On the universal steganography of optimal rate (Q2216130) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- On the round complexity of covert computation (Q2875145) (← links)
- Secure computation of the median (and other elements of specified ranks) (Q5962224) (← links)
- Anonymous whistleblowing over authenticated channels (Q6169427) (← links)
- Short concurrent covert authenticated key exchange (short cAKE) (Q6562580) (← links)
- Lower bounds on anonymous whistleblowing (Q6582209) (← links)
