Secure binary embeddings for privacy preserving nearest neighbors

2011 IEEE International Workshop on Information Forensics and Security, WIFS 2011

Volumn , Issue , 2011, Pages

  Boufounos, Petros ^a   Rane, Shantanu ^a  

^a MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; EMBEDDING PARAMETERS; EMBEDDINGS; EXPERIMENTAL JUSTIFICATION; LOCALITY SENSITIVE HASHING; LOWER COMPLEXITY; MUTUAL INFORMATIONS; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; PRIVACY PRESERVING; RANDOM PROJECTIONS;

IMAGE RETRIEVAL;

DATA PRIVACY;

EID: 84856462174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIFS.2011.6123149     Document Type: Conference Paper

References (15)

1. R. Duda, P. Hart, and D. Stork, Pattern classification. Wiley New York, 2001, vol. 2.
2. J. Benaloh, "Dense Probabilistic Encryption," in Proc. Workshop on Selected Areas of Cryptography, Kingston, ON, Canada, May 1994, pp. 120-128.
3. P. Paillier, "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes," in Advances in Cryptology, EUROCRYPT 99, vol. 1592. Springer-Verlag, Lecture Notes in Computer Science, 1999, pp. 233-238.
4. th Intl. Workshop on Practice and Theory in Public Key Cryptosystems, Cheju Island, Korea, Feb. 2001, pp. 119-136.
5. M. Shaneck, Y. Kim, and V. Kumar, "Privacy preserving nearest neighbor search," in Proc. of the Sixth IEEE Intl. Conf. Data Mining - Workshops, Washington, DC, USA, 2006, pp. 541-545.
6. Y. Qi and M. J. Atallah, "Efficient privacy-preserving k-nearest neighbor search," Intl. Conference on Distributed Computing Systems, vol. 0, pp. 311-319, 2008.
7. T. Seidl and H. P. Kriegel, "Optimal multi-step k-nearest neighbor search," in Proc. 1998 ACM SIGMOD Intl. Conf. Management of Data, 1998, pp. 154-165.
8. P. T. Boufounos, "Universal rate-efficient scalar quantization," 2010, preprint, http://arxiv.org/abs/1009.3145, Submitted.
9. L. Jacques, J. Laska, P. Boufounos, and R. Baraniuk, "Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors," 2011, preprint, http://arxiv.org/abs/1104.3160.
10. 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.
11. M. Raginsky and S. Lazebnik, "Locality-sensitive binary codes from shift-invariant kernels," The Neural Information Processing Systems, vol. 22, 2009.
12. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a Hilbert space," Contemp. Math, vol. 26, pp. 189-206, 1984.
13. W. Hoeffding, "Probability inequalities for sums of bounded random variables," Journal of the American Statistical Association, vol. 58, no. 301, pp. 13-30, March 1963.
14. M. O. Rabin, "How to exchange secrets with oblivious transfer," Cryptology ePrint Archive, Report 2005/187, 2005, http://eprint.iacr.org/.
15. C. Chu and T. Tzeng, "Efficient k-out-of-n oblivious trans- fer schemes with adaptive and non-adaptive queries," in Intl. Workshop on Practice and Theory in Public Key Cryptography, vol. 3386. Les Diablerets, Switzerland: Springer-Verlag, Lecture Notes in Computer Science, Jan. 2005, pp. 172-183.