P4P: Practical large-scale privacy-preserving distributed computation robust against malicious users

Proceedings of the 19th USENIX Security Symposium

Volumn , Issue , 2010, Pages 207-221

  Duan, Yitao ^a   Canny, John ^b   Zhan, Justin ^c  

^a NetEase Youdao ^*  (China)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c National Center for the Protection of Financial Infrastructure South Dakota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA MINING; K-MEANS CLUSTERING; LEARNING ALGORITHMS; MACHINE LEARNING;

DATA MINING ALGORITHM; DISTRIBUTED COMPUTATIONS; HETEROGENEOUS ARCHITECTURES; ORDERS OF MAGNITUDE; PRIVATE COMPUTATION; STATISTICAL LEARNING; STATISTICAL QUERY MODELS; VERIFIABLE SECRET SHARING;

SINGULAR VALUE DECOMPOSITION;

EID: 84883298285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (52)

1. ALDERMAN, E., AND KENNEDY, C. The Right to Privacy. DIANE Publishing Co., 1995.
2. BEAVER, D., AND GOLDWASSER, S. Multiparty computation with faulty majority. In CRYPTO’89.
3. BEERLIOVÁ-TRUBÍNIOVÁ, Z., AND HIRT, M. Perfectly-secure mpc with linear communication complexity. In TCC2008(2008), Springer-Verlag, pp. 213–230.
4. BEIMEL, A., NISSIMI, K., AND OMRI, E. Distributed private data analysis: Simultaneously solving how and what. In CRYPTO 2008.
5. BEN-DAVID, A., NISAN, N., AND PINKAS, B. Fairplaymp: a system for secure multi-party computation. In CCS’08 (2008), ACM, pp. 257–266.
6. BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC’88 (1988), ACM, pp. 1–10.
7. BLUM, A., DWORK, C., MCSHERRY, F., AND NISSIM, K. Practical privacy: the SuLQ framework. In PODS’05 (2005), ACM Press, pp. 128–138.
8. BLUM, A., LIGETT, K., AND ROTH, A. A learning theory approach to non-interactive database privacy. In STOC 08.
9. BOAZ BARAK, E. A. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In PODS’07.
10. CANNY, J. Collaborative filtering with privacy via factor analysis. In SIGIR’02.
11. CANNY, J. Collaborative filtering with privacy. In IEEE Symposium on Security and Privacy (2002), pp. 45–57.
12. CHEN, H., AND CRAMER, R. Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In CRYPTO2006.
13. CHU, C.-T., KIM, S. K., LIN, Y.-A., YU, Y., BRADSKI, G., NG, A. Y., AND OLUKOTUN, K. Map-reduce for machine learning on multicore. In NIPS 2006 (2006).
14. COHEN, W. W. Enron email dataset. http://www2.cs.cmu.edu/enron/.
15. CRAMER, R., AND DAMGARD, I. Zero-knowledge proof for finite field arithmetic, or: Can zero-knowledge be for free? In CRYPTO’98 (1998), Springer-Verlag.
16. DAMGÅRD, I., ISHAI, Y., KRØIGAARD, M., NIELSEN, J. B., AND SMITH, A. Scalable multiparty computation with nearly optimal work and resilience. In CRYPTO 2008 (Berlin, Heidelberg, 2008), Springer-Verlag, pp. 241–261.
17. DAS, A. S., DATAR, M., GARG, A., AND RAJARAM, S. Google news personalization: scalable online collaborative filtering. In WWW’07 (2007), ACM Press, pp. 271–280.
18. DHANJANI, N. Amazon’s elastic compute cloud [ec2]: Initial thoughts on security implications. http://www.dhanjani.com/archives/2008/04/.
19. DINUR, I., AND NISSIM, K. Revealing information while preserving privacy. In PODS’03 (2003), pp. 202–210.
20. DUAN, Y. Privacy without noise. In CIKM’09.
21. DUAN, Y., AND CANNY, J. Practical private computation and zero-knowledge tools for privacy-preserving distributed data mining. In SDM’08 (2008).
22. DUAN, Y., WANG, J., KAM, M., AND CANNY, J. A secure online algorithm for link analysis on weighted graph. In Proc. of the Workshop on Link Analysis, Counterterrorism and Security, SDM 05, pp. 71–81.
23. DWORK, C. Ask a better question, get a better answer a new approach to private data analysis. In ICDT 2007 (2007), Springer, pp. 18–27.
24. DWORK, C., KENTHAPADI, K., MCSHERRY, F., MIRONOV, I., AND NAOR, M. Our data, ourselves: Privacy via distributed noise generation. In EUROCRYPT 2006 (2006), Springer.
25. DWORK, C., MCSHERRY, F., NISSIM, K., AND SMITH, A. Calibrating noise to sensitivity in private data analysis. In TCC 2006 (2006), Springer, pp. 265–284.
26. FEIGENBAUM, J., NISAN, N., RAMACHANDRAN, V., SAMI, R., AND SHENKER, S. Agents’ privacy in distributed algorithmic mechanisms. In Workshop on Economics and Information Securit (Berkeley, CA, May 2002).
27. FIAT, A., AND SHAMIR, A. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO 86.
28. FITZI, M., HIRT, M., AND MAURER, U. General adversaries in unconditional multi-party computation. In ASIACRYPT’ 99.
29. GENNARO, R., RABIN, M. O., AND RABIN, T. Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In PODC’98, pp. 101–111.
30. GOLDREICH, O. Foundations of Cryptography: Volume 2 – Basic Applications. Cambridge University Press, 2004.
31. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. How to play any mental game. In STOC’87.
32. GOLDREICH, O., AND OREN, Y. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology 7, 1 (1994), 1–32.
33. GOLDWASSER, S., AND LEVIN, L. Fair computation of general functions in presence of immoral majority. In CRYPTO’90 (1991), Springer-Verlag, pp. 77–93.
34. HIRT, M., AND MAURER, U. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In PODC’97.
35. HIRT, M., AND MAURER, U. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology 13, 1 (2000), 31–60.
36. KEARNS, M. Efficient noise-tolerant learning from statistical queries. In STOC’93 (1993), pp. 392–401.
37. LEHOUCQ, R. B., SORENSEN, D. C., AND YANG, C. ARPACK Users’ Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, 1998.
38. LINDELL, Y., AND PINKAS, B. Privacy preserving data mining. Journal of cryptology 15, 3 (2002), 177–206.
39. LINDELL, Y., PINKAS, B., AND SMART, N. P. Implementing two-party computation efficiently with security against malicious adversaries. In SCN’08.
40. MALKHI, D., NISAN, N., PINKAS, B., AND SELLA, Y. Fairplay—a secure two-party computation system. In SSYM’04: Proceedings of the 13th conference on USENIX Security Symposium (Berkeley, CA, USA, 2004), USENIX Association, pp. 20–20.
41. MCSHERRY, F., AND MIRONOV, I. Differentially private recommender systems: Building privacy into the netflix prize contenders. In KDD’09.
42. MCSHERRY, F., AND TALWAR, K. Mechanism design via differential privacy. In FOCS’07.
43. NISSIM, K., RASKHODNIKOVA, S., AND SMITH, A. Smooth sensitivity and sampling in private data analysis. In STOC’07 (2007), ACM, pp. 75–84.
44. PAILLIER, P. Trapdooring discrete logarithms on elliptic curves over rings. In ASIACRYPT’00.
45. PEDERSEN, T. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO’91.
46. PINKAS, B., SCHNEIDER, T., SMART, N., AND WILLIAMS, S. Secure two-party computation is practical. Cryptology ePrint Archive, Report 2009/314, 2009.
47. STEWART, G. W., AND SUN, J.-G. Matrix Perturbation Theory. Academic Press, 1990.
48. TREFETHEN, L. N., AND III, D. B. Numerical Linear Algebra. SIAM, 1997.
49. VAIDYA, J., AND CLIFTON, C. Privacy-preserving k-means clustering over vertically partitioned data. In KDD’03.
50. WRIGHT, R., AND YANG, Z. Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In KDD’04 (2004), pp. 713–718.
51. YANG, Z., ZHONG, S., AND WRIGHT, R. N. Privacy-preserving classification of customer data without loss of accuracy. In SDM 2005 (2005).
52. YAO, A. C.-C. Protocols for secure computations. In FOCS’82 (1982), IEEE, pp. 160–164.