{"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":1750306786843,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"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.2517875","type":"proceedings-article","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T15:29:36Z","timestamp":1384270176000},"page":"23-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Domain-polymorphic language for privacy-preserving applications"],"prefix":"10.1145","author":[{"given":"Dan","family":"Bogdanov","sequence":"first","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}]},{"given":"Jaak","family":"Randmets","sequence":"additional","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}]}],"member":"320","published-online":{"date-parts":[[2013,11,4]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_3_1","first-page":"223","volume-title":"USENIX Security Symposium","author":"Burkhart M.","year":"2010","unstructured":"M. Burkhart , M. Strasser , D. Many , and X. A. Dimitropoulos . Sepia: Privacy-preserving aggregation of multi-domain network events and statistics . In USENIX Security Symposium , pages 223 -- 240 . USENIX Association , 2010 . M. Burkhart, M. Strasser, D. Many, and X. A. Dimitropoulos. Sepia: Privacy-preserving aggregation of multi-domain network events and statistics. In USENIX Security Symposium, pages 223--240. USENIX Association, 2010."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"I.\n      Damg\u00e5rd\n     and \n      J. B.\n      Nielsen\n  . \n  Universally composable efficient multiparty computation from threshold homomorphic encryption\n  . In D. Boneh editor CRYPTO volume \n  2729\n   of \n  Lecture Notes in Computer Science pages \n  247\n  --\n  264\n  . \n  Springer 2003\n  .  I. Damg\u00e5rd and J. B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In D. Boneh editor CRYPTO volume 2729 of Lecture Notes in Computer Science pages 247--264. Springer 2003.","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Y.\n      Ishai\n     and \n      A.\n      Paskin\n  . \n  Evaluating Branching Programs on Encrypted Data\n  . In S. P. Vadhan editor TCC volume \n  4392\n   of \n  Lecture Notes in Computer Science pages \n  575\n  --\n  594\n  . \n  Springer 2007\n  .   Y. Ishai and A. Paskin. Evaluating Branching Programs on Encrypted Data. In S. P. Vadhan editor TCC volume 4392 of Lecture Notes in Computer Science pages 575--594. Springer 2007.","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"e_1_3_2_1_9_1","volume-title":"Automatic Protocol Selection in Secure Two-Party Computations. In 20th Network and Distributed System Security Symposium (NDSS)","author":"Kerschbaum F.","year":"2013","unstructured":"F. Kerschbaum , T. Schneider , and A. Schr\u00f6pfer . Automatic Protocol Selection in Secure Two-Party Computations. In 20th Network and Distributed System Security Symposium (NDSS) , 2013 . F. Kerschbaum, T. Schneider, and A. Schr\u00f6pfer. Automatic Protocol Selection in Secure Two-Party Computations. In 20th Network and Distributed System Security Symposium (NDSS), 2013."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2362793.2362807"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046787"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292561"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"B.\n      Zhang\n    .\n  Generic Constant-Round Oblivious Sorting Algorithm for MPC\n  . In X. Boyen and X. Chen editors ProvSec volume \n  6980\n   of \n  Lecture Notes in Computer Science pages \n  240\n  --\n  256\n  . \n  Springer 2011\n  .   B. Zhang. Generic Constant-Round Oblivious Sorting Algorithm for MPC. In X. Boyen and X. Chen editors ProvSec volume 6980 of Lecture Notes in Computer Science pages 240--256. Springer 2011.","DOI":"10.1007\/978-3-642-24316-5_17"}],"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.2517875","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2517872.2517875","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.2517875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,4]]},"references-count":13,"alternative-id":["10.1145\/2517872.2517875","10.1145\/2517872"],"URL":"https:\/\/doi.org\/10.1145\/2517872.2517875","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"}}]}}