Privacy-preserving nearest neighbor methods: Comparing signals without revealing them

IEEE Signal Processing Magazine

Volumn 30, Issue 2, 2013, Pages 18-28

  Rane, Shantanu ^a   Boufounos, Petros ^a  

^a MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY; NEAREST NEIGHBOR SEARCH; SIGNAL PROCESSING;

DISTANCE METRICS; EUCLIDEAN DISTANCE; MANHATTAN DISTANCE; METRIC SPACES; NEAREST NEIGHBOR METHOD; NEAREST NEIGHBORS; PRIVACY PRESERVING; SEARCH PROBLEM;

QUERY PROCESSING;

EID: 85032752211     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2012.2230221     Document Type: Article

References (49)

1. M. Barni, T. Bianchi, D. Catalano, M. Raimondo, R. Labati, P. Failla, D. Fiore, R. Lazzeretti, V. Piuri, F. Scotti, and A. Piva, "Privacy-preserving fingercode authentication," in Proc. ACM Workshop Multimedia and Security (MMSEC2010), Rome, Italy, Sept. 2010, pp. 231-240.
2. M. Blanton and P. Gasti, "Secure and efficient protocols for iris and fingerprint identification," in Proc. European Symp. Research Computer Security (ESORICS), Leuven, Belgium, Sept. 2011, pp. 190-209.
3. A. Sadeghi, T. Schneider, and I. Wehrenberg, "Efficient privacy-preserving face recognition," in Proc. Int. Conf. Information Security and Cryptology (ICISC '09), Seoul, Korea, Dec. 2009, pp. 229-244.
4. Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, R. Lagendijk, and T. Toft, "Privacy-preserving face recognition," in Proc. Int. Symp. Privacy Enhancing Technologies (PET), Seattle, WA, Aug. 2009, pp. 235-253.
5. Z. Erkin, M. Beye, T. Veugen, and R. L. Lagendijk, "Efficiently computing private recommendations," in Proc. Int. Conf. Acoustic, Speech and Signal Processing (ICASSP), Prague, Czech Republic, May 2011, pp. 5864-5867.
6. M. Pathak and B. Raj, "Privacy-preserving speaker verification as password matching," in Proc. Int. Conf. Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, Mar. 2012.
7. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Advances in Cryptology, EUROCRYPT 99 (Lecture Notes in Computer Science, vol. 1592). New York: Springer, 1999, pp. 233-238.
8. J. Benaloh, "Dense probabilistic encryption," in Proc. Workshop Selected Areas of Cryptography, Kingston, ON, Canada, May 1994, pp. 120-128.
9. I. Damgård and M. Jurik, "A generalisation, a simplification and some applications of Paillier's probabilistic public-key system," in Proc. 4th Int. Workshop Practice and Theory Public Key Cryptosystems, Cheju Island, Korea, Feb. 2001, pp. 119-136. (Pubitemid 33232937)
10. T. El-Gamal, "A public-key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inform. Theory, vol. 31, no. 4, pp. 469-472, July 1985.
11. D. Boneh, E.-J. Goh, and K. Nissim, "Evaluating 2-DNF formulas on ciphertexts," in Proc. Theory Cryptography Conf., 2005, pp. 325-341. (Pubitemid 41231172)
12. C. Gentry, "Computing arbitrary functions of encrypted data," Commun. ACM, vol. 53, no. 3, pp. 97-105, Mar. 2010.
13. M. Van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "Fully homomorphic encryption over the integers," in Advances in Cryptology-EUROCRYPT 2010 (Lecture Notes in Computer Science, vol. 6110), H. Gilbert, Ed. New York: Springer, 2010, pp. 24-43.
14. C. Aguilar-Melchor, S. Fau, C. Fontaine, G. Gogniat, and R. Sirdey, "Recent advances in fully homomorphic encryption," IEEE Signal Process. Mag., vol. 30, no. 2, pp. 108-117, 2012.
15. M. Shaneck, Y. Kim, and V. Kumar, "Privacy preserving nearest neighbor search," in Proc. Sixth IEEE Int. Conf. Data Mining Workshops, Washington, DC, 2006, pp. 541-545.
16. Y. Qi and M. J. Atallah, "Efficient privacy-preserving k-nearest neighbor search," Proc. Int. Conf. Distributed Computing Systems, pp. 311-319, 2008.
17. A. C.-C. Yao, "How to generate and exchange secrets," in Proc. 27th Annu. Symp. Foundations Computer Science (SFCS), Washington, DC, 1986, pp. 162-167.
18. J. Kilian, "Founding cryptography on oblivious transfer," in Proc. ACM Symp. Theory Computing, Chicago, IL, May 1988, pp. 20-31.
19. R. Cramer and I. Damgård, "Multiparty computation, an introduction," in Contemp. Cryptol. New York: Springer, pp. 41-87, 2005.
20. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," Soviet Phys. Doklady, vol. 10, no. 8, pp. 707-710, Feb. 1966.
21. M. Atallah, F. Kerschbaum, and W. Du, "Secure and private sequence comparisons," in Proc. 2003 ACM Workshop Privacy Electronic Society, Washington, DC, Oct. 2003, pp. 39-44.
22. D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge, U.K.: Cambridge Univ. Press, 1997.
23. F. Kerschbaum, D. Biswas, and S. de Hoogh, "Performance comparison of secure comparison protocols," in Proc. 20th Int. Workshop Database and Expert Systems Application, 2009, DEXA'09, pp. 133-136.
24. V. Kolesnikov and T. Schneider, "Improved garbled circuit: Free xor gates and applications," in Proc. Int. Colloq. Automata, Languages and Programming (ICALP), Reykjavik, Iceland, July 2008, pp. 486-498.
25. V. Kolesnikov, A. Sadeghi, and T. Schneider, "Improved garbled circuit building blocks and applications to auctions and computing minima," in Proc. Cryptology and Network Security (CANS), Kanazawa, Japan, Dec. 2009, pp. 1-20.
26. I. Lagendijk, Z. Erkin, and M. Barni, "Encrypted signal processing for privacy protection," IEEE Signal Process. Mag., vol. 30, no. 1, pp. 85-102, Jan. 2013.
27. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in Proc. ACM Symp. Theory Computing, 1988, pp. 1-10.
28. D. Chaum, C. Crépeau, and I. Damgard, "Multiparty unconditionally secure protocols," in Proc. ACM Symp. Theory Computing, 1988, pp. 11-19.
29. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
30. G. Asharov and Y. Lindell, "A full proof of the BGW protocol for perfectlysecure multiparty computation," in Advances in Cryptology (CRYPTO 2011), New York: Springer, Santa Barbara, CA, 2011.
31. Y. Wang, P. Ishwar, and S. Rane, "Information-theoretically secure threeparty computation with one active adversary," 2012. [Online]. Available: http://arxiv.org/abs/1206.2669
32. C. Crépeau, "Efficient cryptographic protocols based on noisy channels," in Advances in Cryptology (EUROCRYPT '97). New York: Springer, 1997, pp. 306-317. (Pubitemid 127067809)
33. A. Nascimento and A. Winter, "On the oblivious transfer capacity of noisy correlations," in Proc. IEEE Int. Symp. Information Theory (ISIT), Seattle, WA, July 2006, pp. 1871-1875. (Pubitemid 351244423)
34. R. Ahlswede and I. Csiszár, "On oblivious transfer capacity," in Proc. IEEE Int. Symp. Information Theory (ISIT), Nice, France, June 2007, pp. 2061-2064.
35. Y. Wang and P. Ishwar, "Bootstrapped oblivious transfer and secure two-party function computation," in Proc. IEEE Int. Symp. Information Theory (ISIT), Seoul, Korea, June 2009, pp. 1303-1307.
36. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a Hilbert space, Conference in modern analysis and probability," Contemp. Math, vol. 26, pp. 189-206, 1984.
37. M. Li, S. Rane, and P. Boufounos, "Quantized embeddings of scale-invariant image features for mobile augmented reality," in Proc. IEEE Int. Workshop Multimedia Signal Processing, Banff, AL, Canada, 17-19 Sept. 2012.
38. Y. Plan and R. Vershynin, "Dimension reduction by random hyperplane tessellations," 2011. [Online] Available: http://arxiv.org/abs/1111.4452
39. L. Jacques, J. N. Laska, P. T. Boufounos, and R. G. Baraniuk, "Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors," IEEE Trans. Inform. Theory, to be published.
40. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," Commun. ACM, vol. 51, no. 1, pp. 117-122, 2008.
41. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Locality-sensitive hashing scheme based on p-stable distributions," in Proc. 20th Annu. Symp. Computational Geometry, SCG '04, New York, pp. 253-262.
42. A. Andoni, M. Deza, A. Gupta, P. Indyk, and S. Raskhodnikova, "Lower bounds for embedding edit distance into normed spaces," in Proc. 14th Annu. ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 523-526.
43. Z. Bar-Yossef, T. Jayram, R. Krauthgamer, and R. Kumar, "Approximating edit distance efficiently," in Proc. 45th Annu. IEEE Symp. Foundations Computer Science, 2004, pp. 550-559. (Pubitemid 40575316)
44. R. Ostrovsky and Y. Rabani, "Low distortion embeddings for edit distance," J. ACM, vol. 54, no. 5, pp. 23, 2007.
45. S. Rane, W. Sun, and A. Vetro, "Privacy-preserving approximation of, 1 distance for multimedia applications," in Proc. IEEE Int. Conf. Multimedia and Expo (ICME), Singapore, July 2010, pp. 492-497.
46. P. T. Boufounos and S. Rane, "Secure binary embeddings for privacy preserving nearest neighbors," in Proc. Workshop Information Forensics and Security (WIFS), Foz do Iguaçu, Brazil, Nov. 2011.
47. W. Lu, A. Varna, A. Swaminathan, and M. Wu, "Secure image retrieval through feature protection," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP), Taipei, Taiwan, Mar. 2009, pp. 1533-1536.
48. W. Lu, A. Varna, and M. Wu, "Security analysis for privacy preserving multimedia retrieval," in Proc. IEEE Int. Conf. Image Processing (ICIP), Hong Kong, Sept. 2010, pp. 2093-2096.
49. W. Lu and M. Wu, "Multimedia forensic hash based on visual words," in Proc. IEEE Int. Conf. Image Processing (ICIP), Hong Kong, Sept. 2010, pp. 989-992.