Privacy-preserving data aggregation without secure channel: Multivariate polynomial evaluation

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 2634-2642

  Jung, Taeho ^a   Mao, Xufei ^b   Li, Xiang Yang ^a   Tang, Shao Jie ^a   Gong, Wei ^b   Zhang, Lan ^b  

^a Illinois Institute of Technology   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

aggregation; homomorphic; Privacy; secure channels; SMC

Indexed keywords

ALGEBRAIC STATISTICS; COMPUTATION COMPLEXITY; EAVESDROPPING ATTACKS; HOMOMORPHIC; MULTIVARIATE POLYNOMIAL; PRIVACY PRESERVING; SECURE CHANNELS; SMC;

AGGLOMERATION;

DATA PRIVACY;

EID: 84883089676     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6567071     Document Type: Conference Paper

References (24)

1. D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols," in Proceedings of the twenty-second annual ACM symposium on Theory of computing, 1990, pp. 503-513.
2. A. Ben-David, N. Nisan, and B. Pinkas, "Fairplaymp: a system for secure multi-party computation," in Proceedings of the 15th ACM conference on Computer and communications security, 2008, pp. 257-266.
3. J. Bethencourt, A. Sahai, and B. Waters, "Ciphertext-policy attributebased encryption," in IEEE Symposium on Security and Privacy, 2007, pp. 321-334.
4. D. Boneh, "The decision diffie-hellman problem," Algorithmic Number Theory, pp. 48-63, 1998.
5. C. Castelluccia, A. Chan, E. Mykletun, and G. Tsudik, "Efficient and provably secure aggregation of encrypted data in wireless sensor networks," ACM Transactions on Sensor Networks (TOSN), vol. 5, no. 3, p. 20, 2009.
6. C. Castelluccia, E. Mykletun, and G. Tsudik, "Efficient aggregation of encrypted data in wireless sensor networks," in The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2005, pp. 109-117.
7. C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Zhu, "Tools for privacy preserving distributed data mining," ACM SIGKDD Explorations Newsletter, vol. 4, no. 2, pp. 28-34, 2002.
8. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644-654, 1976.
9. W. Dong, V. Dave, L. Qiu, and Y. Zhang, "Secure friend discovery in mobile social networks," in IEEE INFOCOM, 2011, pp. 1647-1655.
10. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," in Advances in Cryptology, Springer, 1985, pp. 10-18.
11. C. Gentry, "Fully homomorphic encryption using ideal lattices," in Proceedings of the 41st annual ACM symposium on Theory of computing, 2009, pp. 169-178.
12. C. Gentry and S. Halevi, "Implementing gentry's fully-homomorphic encryption scheme," Advances in Cryptology-EUROCRYPT 2011, pp. 129-148, 2011.
13. O. Goldreich, "Secure multi-party computation," Manuscript. Preliminary version, 1998.
14. W. He, X. Liu, H. Nguyen, K. Nahrstedt, and T. Abdelzaher, "Pda: Privacy-preserving data aggregation in wireless sensor networks," in IEEE INFOCOM, 2007, pp. 2045-2053.
15. T. Jung, X. Li, Z. Wan, and M. Wan, "Privacy preserving cloud data access with multi-authorities," in IEEE INFOCOM, 2013.
16. K. Lauter, M. Naehrig, and V. Vaikuntanathan, "Can homomorphic encryption be practical," Preprint, 2011.
17. X. Li and T. Jung, "Search me if you can: privacy-preserving location query service," in IEEE INFOCOM, 2013.
18. A. Menezes, P. Van Oorschot, and S. Vanstone, Handbook of applied cryptography, CRC, 1997.
19. R. Sheikh, B. Kumar, and D. Mishra, "Privacy preserving k secure sum protocol," Arxiv preprint arXiv:0912.0956, 2009.
20. E. Shi, T. Chan, E. Rieffel, R. Chow, and D. Song, "Privacy- preserving aggregation of time-series data," in Proceedings of NDSS, vol. 17, 2011.
21. V. Verykios, E. Bertino, I. Fovino, L. Provenza, Y. Saygin, and Y. Theodoridis, "State-of-the-art in privacy preserving data mining," ACM Sigmod Record, vol. 33, no. 1, pp. 50-57, 2004.
22. A. Yao, "Protocols for secure computations," in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 160-164.
23. -, "How to generate and exchange secrets," in 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 162-167.
24. L. Zhang, X. Li, Y. Liu, and T. Jung, "Verifiable private multi-party computation: ranging and ranking," in IEEE INFOCOM Mini-Conference, 2013.