On the round complexity of covert computation

DOI10.1145/1806689.1806717MaRDI QIDQ2875145zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Efficient covert two-party computation
• Efficient Concurrent Covert Computation of String Equality and Set Intersection
• Covert two-party computation
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Practical covert authentication

Cited in

(8)

• On the universal steganography of optimal rate
• Short concurrent covert authenticated key exchange (short cAKE)
• Security levels in steganography -- insecurity does not imply detectability
• Efficient covert two-party computation
• The Exact Round Complexity of Secure Computation
• Practical covert authentication
• On non-black-box simulation and the impossibility of approximate obfuscation
• Covert authentication from lattices

This page was built for publication: On the round complexity of covert computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875145)