Covert two-party computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 513-522

  Von Ahn, Luis ^a   Hopper, Nicholas ^b   Langford, John ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

^c TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Covert Computation; Fair two party computation; Steganography; Two Party Computation

Indexed keywords

COVERT COMPUTATION; FAIR TWO-PARTY COMPUTATION; STEGANOGRAPHY; TWO-PARTY COMPUTATION;

FUNCTION EVALUATION; INFORMATION ANALYSIS; MATHEMATICAL MODELS; SECURITY SYSTEMS;

COMPUTATION THEORY;

EID: 34848898460     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060668     Document Type: Conference Paper

References (23)

1. G. Aggarwal, N. Mishra and B. Pinkas. Secure computation of the k'th-ranked element. In: Advances in Cryptology - Proceedings of Eurocrypt '04, pages 40-55, 2004.
2. L. von Ahn and N. Hopper. Public-Key Steganography. In: Advances in Cryptology - Proceedings of Eurocrypt '04, pages 323-341, 2004.
3. M. Backes and C. Cachin. Public-Key Steganography with Active Attacks, in Theory of Cryptography Conference (TCC), pages 210-226, 2005.
4. M. Bellare, A. Boldyreva, and A. Palacio An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. In: Advances in Cryptology - Eurocrypt 2004, pages 171-188, 2004.
5. M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. Advances in Cryptology -Proceedings of CRYPTO '89, pages 547-557, 1990.
6. E. Brickell, D. Chaum, I. Damgärd, J. van de Graaf: Gradual and Verifiable Release of a Secret. Advances in Cryptology - Proceedings of CRYPTO '87, pages 156-166, 1987.
7. C. Cachin. An Information-Theoretic Model for Steganography. Information Hiding, 2nd International Workshop, pages 306-318, 1998.
8. R. Canetti, O. Goldreich, and S. Halevi. The Random Oracle Methodology, revisited. In: Thirtieth Annual ACM Symposium on Theory of Computing, pages 209-218, 1998.
9. N. Dedic, G. Itkis, L. Reyzin and S. Russell. Upper and Lower Bounds on Black-Box Steganography. To appear in Theory of Cryptography Conference (TCC), 2005.
10. C. Dwork, M. Naor, O. Reignold, and L. Stockmeyer. Magic Functions. In: Proceedings of the Fortieth IEEE Symposium, on Foundations of Computer Science, pages 523-534 ,1999
11. Z. Calil, S. Haber, M. Yung. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model. Advances in Cryptology -Proceedings of CRYPTO '87, pages 135-155, 1987.
12. O. Goldreich. Secure Multi-Party Computation. Unpublished Manuscript. http://philby.ucsd.edu/books.html, 1998.
13. O. Goldreich, S. Goldwasser and S. Micali. How to construct pseudorandom functions. Journal of the ACM, vol 33, 1998.
14. O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game. Nineteenth Annual ACM Symposium on Theory of Computing, pages 218-229.
15. S. Goldwasser and Y.T. Kalai. On the (in)security of the Fiat-Shamir paradigm. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 102-113, 2003.
16. J. Hastad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4), pages 1364-1396, 1999.
17. N. Hopper, J. Langford and L. Von Ahn. Provably Secure Steganography. Advances in Cryptology - Proceedings of CRYPTO '02, pages 77-92, 2002.
18. M. Naor. Bit Commitment Using Pseudorandomness. J. Cryptology 4(2): 151-158 (1991)
19. M. Naor and B. Pinkas. Efficient Oblivious Transfer Protocols. In: Proceedings of the 12th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA 2001), pages 448-457. 2001.
20. M. Naor, B. Pinkas and R. Sumner. Privacy Preserving Auctions and Mechanism Design. Proceedings, 1999 ACM Conference on Electronic Commerce.
21. B. Pinkas. Fair Secure Two-Party Computation. In: Advances in Cryptology - Eurocrypt '03, pp 87-105, 2003.
22. A. C. Yao. Protocols for Secure Computation. Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982, pages 160-164.
23. A. C. Yao. How to Generate and Exchange Secrets. Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pages 162-167.