{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:54:20Z","timestamp":1762505660453,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"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":[[2010,10,4]]},"DOI":"10.1145\/1866307.1866361","type":"proceedings-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:38:23Z","timestamp":1286289503000},"page":"485-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Secure text processing with applications to private DNA matching"],"prefix":"10.1145","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lior","family":"Malka","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"}}\n      W.\n      Aiello Y.\n      Ishai and \n      O.\n      Reingold\n  .\n  Priced oblivious transfer: How to sell digital goods.Advances in Cryptology -- Eurocrypt\n  2001 volume \n  2045\n   of \n  LNCS pages \n  119\n  --\n  135\n  . \n  Springer 2001.   }}W. Aiello Y. Ishai and O. Reingold.Priced oblivious transfer: How to sell digital goods.Advances in Cryptology -- Eurocrypt 2001 volume 2045 of LNCS pages 119--135. Springer 2001.","DOI":"10.1007\/3-540-44987-6_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005140.1005147"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03007-9_6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_20"},{"key":"e_1_3_2_1_7_1","volume-title":"Basic Applications","author":"Goldreich O.","year":"2004","unstructured":"}} O. Goldreich .Foundations of Cryptography , vol. 2 : Basic Applications . Cambridge University Press , Cambridge, UK , 2004 . }}O. Goldreich.Foundations of Cryptography, vol. 2: Basic Applications.Cambridge University Press, Cambridge, UK, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"}}\n      C.\n      Hazay\n     and \n      Y.\n      Lindell\n  .\n  Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries.In 5th Theory of Cryptography Conference -- TCC\n  2008 volume \n  4948\n   of \n  LNCS pages \n  155\n  --\n  175\n  . \n  Springer 2008.   }}C. Hazay and Y. Lindell.Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries.In 5th Theory of Cryptography Conference -- TCC 2008 volume 4948 of LNCS pages 155--175. Springer 2008.","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.34"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"52","volume-title":"Cryptographers' Track -- RSA","author":"Lindell A.","year":"2008","unstructured":"}} A. Lindell .Efficient fully-simulatable oblivious transfer. In Cryptographers' Track -- RSA 2008 , volume 4964 of LNCS , pages 52 -- 70 . Springer , 2008. }}A. Lindell.Efficient fully-simulatable oblivious transfer. In Cryptographers' Track -- RSA 2008, volume 4964 of LNCS, pages 52--70. Springer, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85855-3_2"},{"key":"e_1_3_2_1_16_1","first-page":"287","volume-title":"Proc. 13th USENIX Security Symposium","author":"Malkhi D.","year":"2004","unstructured":"}} D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella . Fairplay -- a secure two-party computation system .In Proc. 13th USENIX Security Symposium , pages 287 -- 302 . USENIX Association , 2004 . }}D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella.Fairplay -- a secure two-party computation system.In Proc. 13th USENIX Security Symposium, pages 287--302. USENIX Association, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0102-6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_6"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315309"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Chicago Illinois USA","acronym":"CCS '10"},"container-title":["Proceedings of the 17th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866361","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866307.1866361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:59Z","timestamp":1750248539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":21,"alternative-id":["10.1145\/1866307.1866361","10.1145\/1866307"],"URL":"https:\/\/doi.org\/10.1145\/1866307.1866361","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}