Covert two-party computation

DOI10.1145/1060590.1060668zbMath1192.94111OpenAlexW2126125735MaRDI QIDQ3581447

Nicholas J. Hopper, John Langford, Luis von Ahn

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

Anonymous whistleblowing over authenticated channels ⋮ On the universal steganography of optimal rate ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Covert authentication from lattices

This page was built for publication: Covert two-party computation