nips nips2006 nips2006-73 nips2006-73-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Shai Avidan, Moshe Butman
Abstract: Bob offers a face-detection web service where clients can submit their images for analysis. Alice would very much like to use the service, but is reluctant to reveal the content of her images to Bob. Bob, for his part, is reluctant to release his face detector, as he spent a lot of time, energy and money constructing it. Secure MultiParty computations use cryptographic tools to solve this problem without leaking any information. Unfortunately, these methods are slow to compute and we introduce a couple of machine learning techniques that allow the parties to solve the problem while leaking a controlled amount of information. The first method is an information-bottleneck variant of AdaBoost that lets Bob find a subset of features that are enough for classifying an image patch, but not enough to actually reconstruct it. The second machine learning technique is active learning that allows Alice to construct an online classifier, based on a small number of calls to Bob’s face detector. She can then use her online classifier as a fast rejector before using a cryptographically secure classifier on the remaining image patches. 1
[1] S. Avidan and M. Butman. Blind vision. In Proc. of European Conference on Computer Vision, 2006.
[2] Y. Baram, R. El-Yaniv, and K. Luz. Online choice of active learning algorithms. Journal of Machine Learning Research, 5:255–291, March 2004.
[3] J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting, 1998.
[4] O. Goldreich. Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, New York, 2001.
[5] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In ACM Symposium on Theory of Computing, pages 218–229, 1987.
[6] I. Guyon and A. Elisseeff. An introduction to variable and feature selection. Journal of Machine Learning Research, 3:1157–1182, 2003.
[7] Y. Lindell and B. Pinkas. Privacy preserving data mining. In CRYPTO: Proceedings of Crypto, 2000.
[8] D. Pelleg and A. Moore. Active learning for anomaly and rare-category detection. In In Advances in Neural Information Processing Systems 18, 2004.
[9] B. Schneier. Applied Cryptography. John Wiley & Sons, New York, 1996.
[10] N. Tishby, F. Pereira, and W. Bialek. The information bottleneck method. In In Proc. of 37th Allerton Conference on communication and computation, 1999.
[11] S. Tong and D. Koller. Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2:45–66, 2001.
[12] P. Viola and M. Jones. Rapid object detection using a boosted cascade of simple features. In Coference on Computer Vision and Pattern Recognition (CVPR), 2001.
[13] R. N. Wright and Z. Yang. ”privacy-preserving bayesian network structure computataion on distributed heterogeneous data”. In KDD ’04: Proceeding of the tenth ACM SIGKDD international conference on Knowledge discovery in data mining, pages 22–25, 2004.
[14] A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 160–164, Chicago, 1982. IEEE.