{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:44Z","timestamp":1766281004051},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060668","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"513-522","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Covert two-party computation"],"prefix":"10.1145","author":[{"given":"Luis","family":"von Ahn","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Hopper","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Langford","sequence":"additional","affiliation":[{"name":"TTI Chicago, Chicago, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"40","volume-title":"Advances in Cryptology - Proceedings of Eurocrypt '04","author":"Aggarwal G.","year":"2004","unstructured":"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 .]] 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.]]"},{"key":"e_1_3_2_1_2_1","first-page":"323","volume-title":"Advances in Cryptology -- Proceedings of Eurocrypt '04","author":"von Ahn L.","year":"2004","unstructured":"L. von Ahn and N. Hopper . Public-Key Steganography . In: Advances in Cryptology -- Proceedings of Eurocrypt '04 , pages 323 -- 341 , 2004 .]] L. von Ahn and N. Hopper. Public-Key Steganography. In: Advances in Cryptology -- Proceedings of Eurocrypt '04, pages 323--341, 2004.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_12"},{"key":"e_1_3_2_1_4_1","first-page":"171","volume-title":"Advances in Cryptology --- Eurocrypt","author":"Bellare M.","year":"2004","unstructured":"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.]] 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.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Non-interactive oblivious transfer and applications. Advances in Cryptology -- Proceedings of CRYPTO '89","author":"Bellare M.","year":"1990","unstructured":"M. Bellare and S. Micali . Non-interactive oblivious transfer and applications. Advances in Cryptology -- Proceedings of CRYPTO '89 , pages 547 -- 557 , 1990 .]] M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. Advances in Cryptology -- Proceedings of CRYPTO '89, pages 547--557, 1990.]]"},{"key":"e_1_3_2_1_6_1","first-page":"156","volume-title":"van de Graaf: Gradual and Verifiable Release of a Secret. Advances in Cryptology -- Proceedings of CRYPTO '87","author":"Brickell E.","year":"1987","unstructured":"E. Brickell , D. Chaum , I. Damg\u00e4rd , J. van de Graaf: Gradual and Verifiable Release of a Secret. Advances in Cryptology -- Proceedings of CRYPTO '87 , pages 156 -- 166 , 1987 .]] E. Brickell, D. Chaum, I. Damg\u00e4rd, J. van de Graaf: Gradual and Verifiable Release of a Secret. Advances in Cryptology -- Proceedings of CRYPTO '87, pages 156--166, 1987.]]"},{"key":"e_1_3_2_1_7_1","first-page":"306","volume-title":"2nd International Workshop","author":"Cachin C.","year":"1998","unstructured":"C. Cachin . An Information-Theoretic Model for Steganography. Information Hiding , 2nd International Workshop , pages 306 -- 318 , 1998 .]] C. Cachin. An Information-Theoretic Model for Steganography. Information Hiding, 2nd International Workshop, pages 306--318, 1998.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276741"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796536"},{"key":"e_1_3_2_1_11_1","first-page":"135","volume-title":"Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model. Advances in Cryptology -- Proceedings of CRYPTO '87","author":"Galil Z.","year":"1987","unstructured":"Z. Galil , 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 .]] Z. Galil, 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.]]"},{"key":"e_1_3_2_1_12_1","unstructured":"O. Goldreich. Secure Multi-Party Computation. Unpublished Manuscript. http:\/\/philby.ucsd.edu\/books.html 1998.]]  O. Goldreich. Secure Multi-Party Computation. Unpublished Manuscript. http:\/\/philby.ucsd.edu\/books.html 1998.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946302"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_17_1","first-page":"77","volume-title":"Provably Secure Steganography. Advances in Cryptology -- Proceedings of CRYPTO '02","author":"Hopper N.","year":"2002","unstructured":"N. Hopper , J. Langford and L. Von Ahn . Provably Secure Steganography. Advances in Cryptology -- Proceedings of CRYPTO '02 , pages 77 -- 92 , 2002 .]] N. Hopper, J. Langford and L. Von Ahn. Provably Secure Steganography. Advances in Cryptology -- Proceedings of CRYPTO '02, pages 77--92, 2002.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"M. Naor. Bit Commitment Using Pseudorandomness. J. Cryptology 4(2): 151--158 (1991)]]  M. Naor. Bit Commitment Using Pseudorandomness. J. Cryptology 4(2): 151--158 (1991)]]","DOI":"10.1007\/BF00196774"},{"key":"e_1_3_2_1_19_1","first-page":"448","volume-title":"Efficient Oblivious Transfer Protocols. In: Proceedings of the 12th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA 2001","author":"Naor M.","year":"2001","unstructured":"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 .]] 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.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_21_1","first-page":"87","volume-title":"Advances in Cryptology -- Eurocrypt '03","author":"Pinkas B.","year":"2003","unstructured":"B. Pinkas . Fair Secure Two-Party Computation . In: Advances in Cryptology -- Eurocrypt '03 , pp 87 -- 105 , 2003 .]] B. Pinkas. Fair Secure Two-Party Computation. In: Advances in Cryptology -- Eurocrypt '03, pp 87--105, 2003.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"STOC05: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Baltimore MD USA","acronym":"STOC05"},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:30:31Z","timestamp":1673166631000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":23,"alternative-id":["10.1145\/1060590.1060668","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060668","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}