{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:42:30Z","timestamp":1762504950779,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2003,10,30]],"date-time":"2003-10-30T00:00:00Z","timestamp":1067472000000},"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":[[2003,10,30]]},"DOI":"10.1145\/1005140.1005147","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"39-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":131,"title":["Secure and private sequence comparisons"],"prefix":"10.1145","author":[{"given":"Mikhail J.","family":"Atallah","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN"}]},{"given":"Florian","family":"Kerschbaum","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN"}]},{"given":"Wenliang","family":"Du","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY"}]}],"member":"320","published-online":{"date-parts":[[2003,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321922"},{"key":"e_1_3_2_1_2_1","first-page":"120","volume-title":"Proceedings of the Workshop on Selected Areas of Cryptography","author":"Benaloh J.","year":"1994"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/319709.319726"},{"volume-title":"Proceedings of the 1st ACM Workshop on Security and Privacy in E-Commerce","year":"2000","author":"Du W.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","first-page":"457","article-title":"A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. RSA Security 2001 Cryptographer's Track","author":"Fischlin M.","year":"2020","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_3_2_1_6_1","unstructured":"O. Goldreich. Secure Multi-party Computation (working draft). Available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html (2001).  O. Goldreich. Secure Multi-party Computation (working draft). Available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html (2001)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12152"},{"key":"e_1_3_2_1_9_1","first-page":"4","article-title":"Problems in the Analysis of Molecular Sequences, Bulletin of Mathematical Biology (Special Issue Honoring M","volume":"46","author":"Mathematical H. M.","year":"1984","journal-title":"O. Dayhoff)"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288106"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_13_1","first-page":"308","article-title":"A New Public-Key Cryptosystem as Secure as Factoring. Eurocrypt'98 Lecture Notes","volume":"1403","author":"Okamoto T.","year":"1998","journal-title":"Computer Science"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"e_1_3_2_1_15_1","unstructured":"D. Sankoff and J. B. Kruskal (eds.). Time Warps String Edits and Macromolecules: The Theory and Practice of Sequence Comparison Addison-Wesley Reading PA (1983).  D. Sankoff and J. B. Kruskal (eds.). Time Warps String Edits and Macromolecules: The Theory and Practice of Sequence Comparison Addison-Wesley Reading PA (1983)."},{"key":"e_1_3_2_1_16_1","unstructured":"Bruce Schneier. Applied Cryptography: Protocols Algorithms and Source Code in C (Second Edition) John Wiley & Sons New York NY (1996).   Bruce Schneier. Applied Cryptography: Protocols Algorithms and Source Code in C (Second Edition) John Wiley & Sons New York NY (1996)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90050-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90016-4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90023-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321923"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"}],"event":{"name":"CCS03: Tenth ACM Conference on Computer and Communications Security 2003","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Washington, DC","acronym":"CCS03"},"container-title":["Proceedings of the 2003 ACM workshop on Privacy in the electronic society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1005140.1005147","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1005140.1005147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:38:33Z","timestamp":1750282713000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1005140.1005147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10,30]]},"references-count":22,"alternative-id":["10.1145\/1005140.1005147","10.1145\/1005140"],"URL":"https:\/\/doi.org\/10.1145\/1005140.1005147","relation":{},"subject":[],"published":{"date-parts":[[2003,10,30]]},"assertion":[{"value":"2003-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}