{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:40Z","timestamp":1751241640063,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223389"},{"type":"electronic","value":"9783642223396"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22339-6_13","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T23:58:48Z","timestamp":1309219128000},"page":"105-113","source":"Crossref","is-referenced-by-count":5,"title":["Embedding Edit Distance to Allow Private Keyword Search in Cloud Computing"],"prefix":"10.1007","author":[{"given":"Julien","family":"Bringer","sequence":"first","affiliation":[]},{"given":"Herv\u00e9","family":"Chabanne","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-10772-6_8","volume-title":"Information Systems Security","author":"M. Adjedj","year":"2009","unstructured":"Adjedj, M., Bringer, J., Chabanne, H., Kindarji, B.: Biometric identification over encrypted data made feasible. In: Prakash, A., Sen Gupta, I. (eds.) ICISS 2009. LNCS, vol.\u00a05905, pp. 86\u2013100. Springer, Heidelberg (2009)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Piotr, I.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM\u00a051(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Song, D.X., Waters, B.: New Constructions and Practical Applications for Private Stream Searching (Extended Abstract). In: IEEE Symposium on Security and Privacy, pp. 132\u2013139 (2006)","key":"13_CR3","DOI":"10.1109\/SP.2006.27"},{"issue":"7","key":"13_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-74143-5_4","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D. Boneh","year":"2007","unstructured":"Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith III, W.E.: Public Key Encryption That Allows PIR Queries. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 50\u201367. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Kindarji, B.: Error-Tolerant Searchable Encryption. In: IEEE ICC 2009 CISS (2009)","key":"13_CR7","DOI":"10.1109\/ICC.2009.5199004"},{"doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Kindarji, B.: Identification with Encrypted Biometric Data. Security Comm. Networks (2010) (to appear)","key":"13_CR8","DOI":"10.1002\/sec.206"},{"issue":"6","key":"13_CR9","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private Information Retrieval. J. ACM\u00a045(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"13_CR10","first-page":"79","volume-title":"CCS 2006: Proceedings of the 13th ACM Conference on Computer and Communications Security","author":"R. Curtmola","year":"2006","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: CCS 2006: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79\u201388. ACM, New York (2006)"},{"unstructured":"Gasarch, W.I.: A Survey on Private Information Retrieval","key":"13_CR11"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting Data Privacy in Private Information Retrieval Schemes. In: STOC, pp. 151\u2013160 (1998)","key":"13_CR13","DOI":"10.1145\/276698.276723"},{"unstructured":"Goh, E.-J.: Secure Indexes. Cryptology ePrint Archive, Report 2003\/216 (2003)","key":"13_CR14"},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIFS.2008.920726","volume":"3","author":"F. Hao","year":"2008","unstructured":"Hao, F., Daugman, J., Zielinski, P.: A Fast Search Algorithm for a Large Fuzzy Database. IEEE Transactions on Information Forensics and Security\u00a03(2), 203\u2013212 (2008)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"doi-asserted-by":"crossref","unstructured":"Kirsch, A., Mitzenmacher, M.: Distance-Sensitive Bloom Filters. Algorithm Engineering & Experiments (2006)","key":"13_CR17","DOI":"10.1137\/1.9781611972863.4"},{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. In: Symposium on the Theory Of Computing, pp. 614\u2013623 (1998)","key":"13_CR18","DOI":"10.1145\/276698.276877"},{"doi-asserted-by":"crossref","unstructured":"Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., Lou, W.: Enabling Efficient Fuzzy Keyword Search over Encrypted Data in Cloud Computing. Cryptology ePrint Archive, Report 2009\/593 (2009)","key":"13_CR19","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H. Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 314\u2013328. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y.: Low distortion embeddings for edit distance. J. ACM\u00a054(5) (2007)","key":"13_CR21","DOI":"10.1145\/1284320.1284322"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y.: Low distortion embeddings for edit distance. In: STOC, pp. 218\u2013224 (2005)","key":"13_CR22","DOI":"10.1145\/1060590.1060623"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private Information Storage (Extended Abstract). In: STOC, pp. 294\u2013303 (1997)","key":"13_CR23","DOI":"10.1145\/258533.258606"},{"unstructured":"Ostrovsky, R., Skeith III, W.E.: Algebraic Lower Bounds for Computing on Encrypted Data. Cryptology ePrint Archive, Report 2007\/064 (2007)","key":"13_CR24"},{"key":"13_CR25","volume-title":"Handbook of Discrete and Computational Geometry","author":"I. Piotr","year":"2004","unstructured":"Piotr, I.: Nearest neighbors in high-dimensional spaces. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., ch. 39. CRC Press, Boca Raton (2004)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Piotr, I., Rajeev, M.: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In: Symposium on the Theory of Computing, pp. 604\u2013613 (1998)","key":"13_CR26","DOI":"10.1145\/276698.276876"}],"container-title":["Communications in Computer and Information Science","Secure and Trust Computing, Data Management and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22339-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T19:21:27Z","timestamp":1741288887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22339-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223389","9783642223396"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22339-6_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}