Abstract
Techniques that combine and analyze data collected from multiple partners are very useful for distributed collaborative applications. Such collaborative computations could occur between trusted partners, between partially trusted partners, or between competitors. Therefore preserving privacy is an important issue in this context. This paper presents a distributed protocol for privacy-preserving aggregation to enable computing a class of aggregation functions that can be expressed as Abelian group. The aim is to ensure participants privacy such that their inputs are not disclosed to any other entity be it trusted or not. The proposed protocol is based on an overlay structure that enables secret sharing without the need of any central authority or heavyweight cryptography.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the SuLQ framework. In: Proceedings of the Twenty-Fourth Symposium on Principles of Database Systems (PODS 2005), pp. 128–138. ACM, New York (2005)
Castelluccia, C., Mykletun, E., Tsudik, G.: Efficient aggregation of encrypted data in wireless sensor networks. In: Proceedings of The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services (MobiQuitous 2005), July 17-21, pp. 109–117 (2005)
Guerraoui, R., Huguenin, K., Kermarrec, A.M., Monod, M.: Decentralized Polling With Respectable Participants. In: Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS 2009), Nmes, France, December 15-18, pp. 144–158 (2009)
Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: a review and open problems. In: Proceedings of the 2001 Workshop on New Security Paradigms (NSPW 2001), Cloudcroft, New Mexico, September 11-13, pp. 13–22 (2001)
Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), Chicago, Illinois, USA, November 03-05, pp. 160–164 (1982)
Su, B., Wang, T.: Design and analysis for private determination protocol of segment-circle position relation. In: Proceedings of the Industrial Control and Electronics Engineering (ICICEE 2012), August 23-25, pp. 1430–1433 (2012)
Pfitsmann, B., Waidner, M.: Unconditionally Untraceable and Fault-tolerant Broadcast and Secret Ballot Election. Communications of the ACM 21(21) (1992)
Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
Damgård, I., Jurik, M., Nielsen, J.B.: A generalization of Pailliers public-key system with applications to electronic voting. The International Journal of Information Security - Special Issue on Special Purpose Protocols 9, 371–385 (2010)
Malkhi, D., Margo, O., Pavlov, E.: E-voting without Cryptography. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 1–15. Springer, Heidelberg (2003)
Rastogi, V., Nath, S.: Differentially private aggregation of distributed time-series with transformation and encryption. In: Proceedings of the 2010 International Conference on Management of data (SIGMOD 2010), pp. 735–746. ACM, New York (2010)
Bocek, T., Peric, D., Hecht, F.V., Hausheer, D., Stiller, B.: Towards a Decentralized Voting Mechanism for P2P Collaboration Systems. Technical Report, No. ifi-2009.02
Bogetoft, P., et al.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325–343. Springer, Heidelberg (2009)
Gambs, S., Guerraoui, R., Harkous, H., Huc, F., Kermarrec, A.M.: Scalable and Secure Aggregation in Distributed Networks. CoRR (2011)
Bickson, D., Dolev, D., Bezman, G., Pinkas, B.: “Peer-to-Peer Secure Multi-party Numerical Computation. In: Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing (P2P 2008), pp. 257–266. IEEE Computer Society, Washington, DC (2008)
Shi, E., Hubert Chan, T.H., Rieffel, E.G., Chow, R., Song, D.: Privacy-Preserving Aggregation of Time-Series Data. In: Proceedings of the Network and Distributed System Security Symposium (NDSS 2011), San Diego, California, USA, February 6-February 9 (2011)
Goldwasser, S.: Multi party computations: past and present. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 1–6. ACM, New York (1997)
Kreitz, G., Dam, M., Wikström, D.: Practical private information aggregation in large networks. In: Aura, T., Järvinen, K., Nyberg, K. (eds.) NordSec 2010. LNCS, vol. 7127, pp. 89–103. Springer, Heidelberg (2012)
Jung, T., Li, X.Y., Tang, S.J.: Privacy-Preserving Data Aggregation without Secure Channel: Multivariate Polynomial Evaluation. arXiv:1206.2660 [cs.CR] (August 01, 2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benkaouz, Y., Erradi, M. (2013). A Distributed Protocol for Privacy Preserving Aggregation. In: Gramoli, V., Guerraoui, R. (eds) Networked Systems. NETYS 2013. Lecture Notes in Computer Science, vol 7853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40148-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-40148-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40147-3
Online ISBN: 978-3-642-40148-0
eBook Packages: Computer ScienceComputer Science (R0)