{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:32Z","timestamp":1772164052948,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,9]],"date-time":"2012-09-09T00:00:00Z","timestamp":1347148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,9,9]]},"DOI":"10.1145\/2364527.2364556","type":"proceedings-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T09:01:27Z","timestamp":1347440487000},"page":"189-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficient lookup-table protocol in secure multiparty computation"],"prefix":"10.1145","author":[{"given":"John","family":"Launchbury","sequence":"first","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iavor S.","family":"Diatchki","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"DuBuisson","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Adams-Moran","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.FIPS.197"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000988"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_1_5_1","unstructured":"E. Barker and J. Kelsey. Recommendation for Random Number Generation Using Deterministic Random Bit Generators. NIST Special Publication 800--90A. http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-90A\/SP800-90A.pdf  E. Barker and J. Kelsey. Recommendation for Random Number Generation Using Deterministic Random Bit Generators. NIST Special Publication 800--90A. http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-90A\/SP800-90A.pdf"},{"key":"e_1_3_2_1_6_1","volume-title":"Invited Talk. In Foundations of Software Technology and Theoretical Computer Science","author":"Bain A.M.","year":"2011","unstructured":"A.M. Bain , J.C. Mitchell , R. Sharma , D. Stefan and J. Zimmerman . A domain-specific language for computing on encrypted data . Invited Talk. In Foundations of Software Technology and Theoretical Computer Science , 2011 . A.M. Bain, J.C. Mitchell, R. Sharma, D. Stefan and J. Zimmerman. A domain-specific language for computing on encrypted data. Invited Talk. In Foundations of Software Technology and Theoretical Computer Science, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_31"},{"key":"e_1_3_2_1_8_1","volume-title":"Cryptographic Hardware and Embedded Systems (CHES","author":"Rijndael Two Methods","year":"2001","unstructured":"Two Methods of Rijndael Implementation in Reconfigurable Hardware , V. Fischer and M. Drutarovsk . Cryptographic Hardware and Embedded Systems (CHES 2001 ). LNCS Vol. 2162. Spring-Verlag 2001. Two Methods of Rijndael Implementation in Reconfigurable Hardware, V. Fischer and M. Drutarovsk. Cryptographic Hardware and Embedded Systems (CHES 2001). LNCS Vol. 2162. Spring-Verlag 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_10_1","volume-title":"Implementing Gentry's fully-homomorphic encryption scheme. Advances in Cryptology (Eurocrypt","author":"Gentry C.","year":"2011","unstructured":"C. Gentry and S. Halevi . Implementing Gentry's fully-homomorphic encryption scheme. Advances in Cryptology (Eurocrypt 2011 ), LNCS Voli. 6632, Springer-Verlag , 2011. C. Gentry and S. Halevi. Implementing Gentry's fully-homomorphic encryption scheme. Advances in Cryptology (Eurocrypt 2011), LNCS Voli. 6632, Springer-Verlag, 2011."},{"key":"e_1_3_2_1_11_1","volume-title":"Vol 2: Basic Applications","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich , Foundations of Cryptography , Vol 2: Basic Applications . Cambridge University Press , 2004 . O. Goldreich, Foundations of Cryptography, Vol 2: Basic Applications. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_12_1","volume-title":"Faster Secure Two-Party Computation Using Garbled Circuits. In 20th USENIX Security Symposium","author":"Huang Y.","year":"2011","unstructured":"Y. Huang . D. Evans , J. Katz , L. Malka , Faster Secure Two-Party Computation Using Garbled Circuits. In 20th USENIX Security Symposium , San Francisco , 2011 . Y. Huang. D. Evans, J. Katz, L. Malka, Faster Secure Two-Party Computation Using Garbled Circuits. In 20th USENIX Security Symposium, San Francisco, 2011."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 13th conference on USENIX Security Symposium -","volume":"13","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella , FairPlay - a secure two party computation system . Proceedings of the 13th conference on USENIX Security Symposium - Vol. 13 , 2004 . D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, FairPlay - a secure two party computation system. Proceedings of the 13th conference on USENIX Security Symposium - Vol. 13, 2004."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_15_1","volume-title":"Fully homomorphic SIMD operations. Manuscript at http:\/\/eprint.iacr.org\/2011\/133","author":"Smart N. P.","year":"2011","unstructured":"N. P. Smart and F. Vercauteren . Fully homomorphic SIMD operations. Manuscript at http:\/\/eprint.iacr.org\/2011\/133 , 2011 . N. P. Smart and F. Vercauteren. Fully homomorphic SIMD operations. Manuscript at http:\/\/eprint.iacr.org\/2011\/133, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"ICFP'12: ACM SIGPLAN International Conference on Functional Programming","location":"Copenhagen Denmark","acronym":"ICFP'12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 17th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2364527.2364556","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2364527.2364556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:34:00Z","timestamp":1750224840000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2364527.2364556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,9]]},"references-count":16,"alternative-id":["10.1145\/2364527.2364556","10.1145\/2364527"],"URL":"https:\/\/doi.org\/10.1145\/2364527.2364556","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2398856.2364556","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,9,9]]},"assertion":[{"value":"2012-09-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}