Embedding edit distance to enable private keyword search

Human-centric Computing and Information Sciences

Volumn 2, Issue 1, 2012, Pages 1-12

  Bringer, Julien ^a   Chabanne, Hervé ^b  

^a Morpho   (France)

^b TELECOM PARISTECH   (France)

Author keywords

Edit distance; Embeddings for edit distance; Private Identification schemes

Indexed keywords

EMBEDDINGS; SEARCH ENGINES;

EDIT DISTANCE; ENCRYPTED DATA; IDENTIFICATION SCHEME; KEYWORD SEARCH; SECURITY MODEL;

HAMMING DISTANCE;

EID: 84880026450     PISSN: None     EISSN: 21921962     Source Type: Journal    
DOI: 10.1186/2192-1962-2-2     Document Type: Article

References (29)

1. Boneh D, Kushilevitz E, Ostrovsky R, Skeith WE III: Public Key Encryption That Allows PIR Queries. In CRYPTO, Volume 4622 of Lecture Notes in Computer Science. Edited by: Menezes A. Springer; 2007:50–67.
2. Curtmola R, Garay JA, Kamara S, Ostrovsky R: Searchable symmetric encryption: improved definitions and efficient constructions. In CCS'06: Proceedings of the 13th ACM conference on Computer and communications security. ACM; 2006:79–88.
3. 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, 16.
4. Daugman J: The importance of being random: statistical principles of iris recognition.Pattern Recognit 2003,36(2):279–291.
5. Bringer J, Despiegel V: Binary feature vector fingerprint representation from minutiae vicinities.Biometrics: Theory, Applications, and Systems, 2010. BTAS'10. IEEE 4th International Conference on 2010.
6. Bringer J, Despiegel V, Favre M: Adding localization information in a fingerprint binary feature vector representation.SPIE Defense, Security, Sensing 2011.
7. Bringer J, Chabanne H, Kindarji B: Error-tolerant searchable encryption.IEEE ICC 2009 CISS 2009.
8. Bringer J, Chabanne H, Kindarji B: Identification with encrypted biometric data.Security Comm Networks 2011,4(5):548–562.
9. Adjedj M, Bringer J, Chabanne H, Kindarji B: Biometric Identification over Encrypted Data Made Feasible. In ICISS, Volume 5905 of Lecture Notes in Computer Science. Edited by: Prakash A, Gupta I. Springer; 2009:86–100.
10. Ostrovsky R, Rabani Y: Low distortion embeddings for edit distance. In STOC. Edited by: Gabow HN, Fagin R. ACM; 2005:218–224.
11. Ostrovsky R, Rabani Y: Low distortion embeddings for edit distance.J ACM 2007.,54(5):
12. Chor B, Kushilevitz E, Goldreich O, Sudan M: Private Information Retrieval.J ACM 1998,45(6):965–981.
13. Gertner Y, Ishai Y, Kushilevitz E, Malkin T: Protecting data privacy in private information retrieval schemes.STOC 1998, 151–160.
14. Gentry C, Ramzan Z: Single-database private information retrieval with constant communication rate. In ICALP, Volume 3580 of Lecture Notes in Computer Science. Edited by: Caires L, Italiano GF, Monteiro L, Palamidessi C, Yung M. Springer; 2005:803–815.
15. Lipmaa H: An oblivious transfer protocol with log-squared communication. In ISC, Volume 3650 of Lecture Notes in Computer Science. Edited by: Zhou J, Lopez J, Deng RH, Bao F. Springer; 2005:314–328.
16. Gasarch WI: A Survey on Private Information Retrieval. [http://www.cs.umd.edu/~gasarch/pir/pir.html]
17. Ostrovsky R, Shoup V: Private information storage (extended abstract).STOC 1997, 294–303.
18. Ostrovsky R, Skeith WE III: Algebraic Lower Bounds for Computing on Encrypted Data.Cryptology ePrint Archive, Report 2007/064 2007.
19. Piotr I: Nearest neighbors in high-dimensional spaces. In Handbook of Discrete and Computational Geometry, Chapter 39. 2nd edition. Edited by: Goodman JE, O'Rourke J. CRC Press; 2004.
20. Kushilevitz E, Ostrovsky R, Rabani Y: Efficient Search for approximate nearest neighbor in high dimensional spaces.Symposium on the Theory Of Computing 1998, 614–623.
21. Kirsch A, Mitzenmacher M: Distance-sensitive bloom filters.Algorithm Engineering & Experiments 2006.
22. Piotr I, Rajeev M: Approximate nearest neighbors: towards removing the curse of dimensionality.Symposium on the Theory Of Computing 1998, 604–613.
23. Andoni A, Piotr I: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.Commun ACM 2008, 51:117–122.
24. Hao F, Daugman J, Zielinski P: A Fast Search Algorithm for a Large Fuzzy Database.Inf Forensics Security, IEEE Trans 2008,3(2):203–212.
25. Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G: Public Key Encryption with Keyword Search. In EUROCRYPT, Volume 3027 of LCNS. Edited by: Cachin C, Camenisch J. Springer; 2004:506–522.
26. Goh EJ: Secure indexes.Cryptology ePrint Archive, Report 2003/216 2003.
27. Bethencourt J, Song DX, Waters B: New constructions and practical applications for private stream searching (extended abstract). In IEEE Symposium on Security and Privacy. IEEE Computer Society; 2006:132–139.
28. Bloom BH: Space/time trade-offs in hash coding with allowable errors.Commun ACM 1970,13(7):422–426.
29. Goldwasser S, Micali S: Probabilistic Encryption.J Comput Syst Sci 1984,28(2):270–299.