{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:46Z","timestamp":1750306786828,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T00:00:00Z","timestamp":1383523200000},"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":[[2013,11,4]]},"DOI":"10.1145\/2517872.2517877","type":"proceedings-article","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T15:29:36Z","timestamp":1384270176000},"page":"7-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Lessons learned with PCF"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Kreuter","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"abhi","family":"shelat","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,4]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.40"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"e_1_3_2_1_6_1","volume-title":"A simple value range propagation pass for suif-1","author":"Greskamp B.","year":"2003","unstructured":"B. Greskamp . A simple value range propagation pass for suif-1 , 2003 . B. Greskamp. A simple value range propagation pass for suif-1, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_1_8_1","volume-title":"Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , D. Evans , J. Katz , and L. Malka . Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium , 2011 . Y. Huang, D. Evans, J. Katz, and L. Malka. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.43"},{"key":"e_1_3_2_1_10_1","first-page":"14","volume-title":"Proceedings of the 22nd USENIX conference on Security symposium, Security'13","author":"Kreuter B.","year":"2013","unstructured":"B. Kreuter , B. Mood , a. shelat, and K. Butler . Pcf: A portable circuit format for scalable two-party secure computation . In Proceedings of the 22nd USENIX conference on Security symposium, Security'13 , pages 14 -- 14 . USENIX Association , 2013 . B. Kreuter, B. Mood, a. shelat, and K. Butler. Pcf: A portable circuit format for scalable two-party secure computation. In Proceedings of the 22nd USENIX conference on Security symposium, Security'13, pages 14--14. USENIX Association, 2013."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2362793.2362807"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046787"},{"key":"e_1_3_2_1_14_1","first-page":"287","volume-title":"Fairplay: A Secure Two-Party Computation System. In 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. In 13th Conference on USENIX Security Symposium , volume 13 , pages 287 -- 302 . USENIX Association , 2004 . D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay: A Secure Two-Party Computation System. In 13th Conference on USENIX Security Symposium, volume 13, pages 287--302. USENIX Association, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_30"},{"key":"e_1_3_2_1_17_1","volume-title":"10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16--20, 2007, Proceedings","volume":"4450","author":"Nishide T.","year":"2007","unstructured":"T. Nishide and K. Ohta . Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In Public Key Cryptography - PKC 2007 , 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16--20, 2007, Proceedings , volume 4450 of Lecture Notes in Computer Science, pages 343--360. Springer , 2007 . T. Nishide and K. Ohta. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In Public Key Cryptography - PKC 2007, 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16--20, 2007, Proceedings, volume 4450 of Lecture Notes in Computer Science, pages 343--360. Springer, 2007."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_19_1","volume-title":"Compiling scala to llvm","author":"Reedy G.","year":"2012","unstructured":"G. Reedy . Compiling scala to llvm , 2012 . http:\/\/www.infoq.com\/presentations\/Scala-LLVM. G. Reedy. Compiling scala to llvm, 2012. http:\/\/www.infoq.com\/presentations\/Scala-LLVM."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2088456.1863538"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103669"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2345156.2254078"}],"event":{"name":"CCS'13: 2013 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Berlin Germany","acronym":"CCS'13"},"container-title":["Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517872.2517877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2517872.2517877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:15Z","timestamp":1750232055000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517872.2517877"}},"subtitle":["scaling secure computation"],"short-title":[],"issued":{"date-parts":[[2013,11,4]]},"references-count":19,"alternative-id":["10.1145\/2517872.2517877","10.1145\/2517872"],"URL":"https:\/\/doi.org\/10.1145\/2517872.2517877","relation":{},"subject":[],"published":{"date-parts":[[2013,11,4]]},"assertion":[{"value":"2013-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}