Pages that link to "Item:Q2875145"
From MaRDI portal
The following pages link to On the round complexity of covert computation (Q2875145):
Displaying 7 items.
- Efficient covert two-party computation (Q1749305) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- On the universal steganography of optimal rate (Q2216130) (← links)
- Security levels in steganography -- insecurity does not imply detectability (Q2401760) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- The Exact Round Complexity of Secure Computation (Q5739211) (← links)
- Short concurrent covert authenticated key exchange (short cAKE) (Q6562580) (← links)