Covert two-party computation

DOI10.1145/1060590.1060668MaRDI QIDQ3581447zbMATH OpenOpenAlexFDO

Authors Luis von Ahn, Nicholas J. Hopper, John Langford

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

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

Recommendations

• Efficient covert two-party computation
• Data and Applications Security XIX
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Secure two-party computation with low communication
• scientific article; zbMATH DE number 2009950
• Towards secure two-party computation from the wire-tap channel
• Covert Communication With Polynomial Computational Complexity
• Two-Party Computing with Encrypted Data
• On the Power of Secure Two-Party Computation
• On the power of secure two-party computation

Cited in

(13)

• Efficient covert two-party computation
• Black-box transformations from passive to covert security with public verifiability
• Covert authentication from lattices
• On the universal steganography of optimal rate
• Security against covert adversaries: Efficient protocols for realistic adversaries
• On the round complexity of covert computation
• Practical covert authentication
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Secure computation of the median (and other elements of specified ranks)
• Anonymous whistleblowing over authenticated channels
• Short concurrent covert authenticated key exchange (short cAKE)
• Lower bounds on anonymous whistleblowing
• Fully anonymous secret sharing

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

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