{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:51:47Z","timestamp":1743133907286,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030320461"},{"type":"electronic","value":"9783030320478"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32047-8_9","type":"book-chapter","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T05:07:22Z","timestamp":1569301642000},"page":"94-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy\u2013Preserving Text Similarity via Non-Prefix-Free Codes"],"prefix":"10.1007","author":[{"given":"M. O\u011fuzhan","family":"K\u00fclekci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismail","family":"Habib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Aghabaiglou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-20086-6_24","volume-title":"Experimental Algorithms","author":"B Ada\u015f","year":"2015","unstructured":"Ada\u015f, B., Bayraktar, E., K\u00fclekci, M.O.: Huffman codes versus augmented non-prefix-free codes. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 315\u2013326. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_24"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1109\/18.681318","volume":"44","author":"CH Bennett","year":"1998","unstructured":"Bennett, C.H., G\u00e1cs, P., Li, M., Vit\u00e1nyi, P.M., Zurek, W.H.: Information distance. IEEE Trans. Inf. Theory 44(4), 1407\u20131423 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.3233\/JCS-130482","volume":"22","author":"C Blundo","year":"2014","unstructured":"Blundo, C., De Cristofaro, E., Gasti, P.: Espresso: efficient privacy-preserving evaluation of sample set similarity. J. Comput. Secur. 22(3), 355\u2013381 (2014)","journal-title":"J. Comput. Secur."},{"key":"9_CR4","unstructured":"Buttler, D.: A short survey of document structure similarity algorithms. In: International Conference on Internet Computing, pp. 3\u20139 (2004)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-06811-4_12","volume-title":"Secure Data Management","author":"S Buyrukbilen","year":"2014","unstructured":"Buyrukbilen, S., Bakiras, S.: Secure similar document detection with simhash. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2013. LNCS, vol. 8425, pp. 61\u201375. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06811-4_12"},{"issue":"7","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1109\/TIT.2004.830793","volume":"50","author":"X Chen","year":"2004","unstructured":"Chen, X., Francia, B., Li, M., Mckinnon, B., Seker, A.: Shared information and program plagiarism detection. IEEE Trans. Inf. Theory 50(7), 1545\u20131551 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TKDE.2007.48","volume":"19","author":"RL Cilibrasi","year":"2007","unstructured":"Cilibrasi, R.L., Vitanyi, P.: The google similarity distance. IEEE Trans. Knowl. Data Eng. 19(3), 370\u2013383 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Clough, P., Gaizauskas, R., Piao, S.S., Wilks, Y.: Meter: measuring text reuse. In: Proceedings of the 40th Annual Meeting of ACL, pp. 152\u2013159 (2002)","DOI":"10.3115\/1073083.1073110"},{"issue":"4\u20135","key":"9_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF01185434","volume":"12","author":"AS Fraenkel","year":"1994","unstructured":"Fraenkel, A.S., Klein, S.T.: Complexity aspects of guessing prefix codes. Algorithmica 12(4\u20135), 409\u2013419 (1994)","journal-title":"Algorithmica"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, vol. 9, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/18.490558","volume":"42","author":"DW Gillman","year":"1996","unstructured":"Gillman, D.W., Mohtashemi, M., Rivest, R.L.: On breaking a Huffman code. IEEE Trans. Inf. Theory 42(3), 972\u2013976 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1109\/TKDE.2004.58","volume":"16","author":"KM Hammouda","year":"2004","unstructured":"Hammouda, K.M., Kamel, M.S.: Efficient phrase-based document indexing for web document clustering. IEEE Trans. Knowl. Data Eng. 16(10), 1279\u20131296 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR13","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: \u00c9tude comparative de la distribution florale dans une portion des alpes et des jura. Bull. Soc. Vaudoise Sci. Nat. 37, 547\u2013579 (1901)","journal-title":"Bull. Soc. Vaudoise Sci. Nat."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Jiang, W., Murugesan, M., Clifton, C., Si, L.: Similar document detection with limited information disclosure. In: IEEE 24th International Conference on Data Engineering, pp. 735\u2013743 (2008)","DOI":"10.1109\/ICDE.2008.4497482"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-22348-8_19","volume-title":"Data and Applications Security and Privacy XXV","author":"W Jiang","year":"2011","unstructured":"Jiang, W., Samanthula, B.K.: N-gram based secure similar document detection. In: Li, Y. (ed.) DBSec 2011. LNCS, vol. 6818, pp. 239\u2013246. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22348-8_19"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"K\u00fclekci, M.O.: Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees. In: IEEE International Symposium on Information Theory, pp. 1969\u20131973 (2013)","DOI":"10.1109\/ISIT.2013.6620570"},{"issue":"12","key":"9_CR17","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e1nyi, P.: The similarity metric. IEEE Trans. Inf. Theory 50(12), 3250\u20133264 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR18","first-page":"1","volume":"94","author":"U Manber","year":"1994","unstructured":"Manber, U., et al.: Finding similar files in a large file system. Usenix Winter 94, 1\u201310 (1994)","journal-title":"Usenix Winter"},{"key":"9_CR19","unstructured":"Muralidhar, R.B.: Substitution cipher with nonprefix codes. Master\u2019s thesis, San Jose State University (2011)"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s00778-009-0175-9","volume":"19","author":"M Murugesan","year":"2010","unstructured":"Murugesan, M., Jiang, W., Clifton, C., Si, L., Vaidya, J.: Efficient privacy-preserving similar document detection. VLDB J. 19(4), 457\u2013475 (2010)","journal-title":"VLDB J."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1080\/0161-117991854061","volume":"3","author":"F Rubin","year":"1979","unstructured":"Rubin, F.: Cryptographic aspects of data compression codes. Cryptologia 3(4), 202\u2013205 (1979)","journal-title":"Cryptologia"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32047-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:44:47Z","timestamp":1710326687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-32047-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030320461","9783030320478"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32047-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newark, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.88","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-92","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}