{"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":1750306786816,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"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.2517874","type":"proceedings-article","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T15:29:36Z","timestamp":1384270176000},"page":"19-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Specifying sharemind's arithmetic black box"],"prefix":"10.1145","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alisa","family":"Pankova","sequence":"additional","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pettai","sequence":"additional","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaak","family":"Randmets","sequence":"additional","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-540-88313-5_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/s10207-012-0177-2"},{"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.","key":"e_1_3_2_1_4_1","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"e_1_3_2_1_5_1","volume-title":"Secure Floating-Point Arithmetic and Private Satellite Collision Analysis","author":"Kamm L.","year":"2013","unstructured":"L. Kamm and J. Willemson . Secure Floating-Point Arithmetic and Private Satellite Collision Analysis . 2013 . Submitted . L. Kamm and J. Willemson. Secure Floating-Point Arithmetic and Private Satellite Collision Analysis. 2013. Submitted."},{"key":"e_1_3_2_1_6_1","first-page":"285","volume-title":"Proceedings of the 21st USENIX conference on Security symposium","author":"Kreuter B.","year":"2012","unstructured":"B. Kreuter , A. Shelat , and C.-H. Shen . Billion-gate secure computation with malicious adversaries . In Proceedings of the 21st USENIX conference on Security symposium , pages 285 -- 300 . USENIX Association , 2012 . B. Kreuter, A. Shelat, and C.-H. Shen. Billion-gate secure computation with malicious adversaries. In Proceedings of the 21st USENIX conference on Security symposium, pages 285--300. USENIX Association, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1314436.1314442"}],"event":{"sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"acronym":"CCS'13","name":"CCS'13: 2013 ACM SIGSAC Conference on Computer and Communications Security","location":"Berlin Germany"},"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.2517874","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2517872.2517874","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.2517874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,4]]},"references-count":6,"alternative-id":["10.1145\/2517872.2517874","10.1145\/2517872"],"URL":"https:\/\/doi.org\/10.1145\/2517872.2517874","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"}}]}}