On the round complexity of covert computation

DOI10.1145/1806689.1806717zbMath1293.94069OpenAlexW2033989039MaRDI QIDQ2875145

Vipul Goyal, Abhishek Jain

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806717

zbMATH Keywords

cryptographyround complexitycovert computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Network protocols (68M12)

Related Items

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Security levels in steganography -- insecurity does not imply detectability ⋮ On the universal steganography of optimal rate ⋮ Covert authentication from lattices