Skip to main content

Privacy Assurances in Multiple Data-Aggregation Transactions

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 8565))

Abstract

In this paper, we propose a privacy-preserving algorithm for aggregating data in multiple transactions from a large number of users at a third-party application. The aggregation is performed using the most commonly used weighted sum function. The new algorithm has several novel features. First, we propose a method to generate a privacy-assurance certificate that can be easily verified by all users without significant computation effort. In particular, the computational complexity of verification does not grow with the number of users. Second, the proposed approach has a very desirable feature that users do not have to directly communicate with each other. Instead, they only communicate with the application. These features distinguish our approach from the existing research in literature.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: A system for secure multi-party computation. In: Proceedings of the ACM Conference on Computer and Communications Security, pp. 257–266. ACM, New York (2008)

    Google Scholar 

  2. Bogetoft, P., Christensen, D.L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325–343. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Chin, F.: Security problems in inference control for SUM, MAX, and MIN queries. J. ACM 33(3), 451–464 (1986)

    Article  MathSciNet  Google Scholar 

  4. Choi, S.G., Hwang, K.-W., Katz, J., Malkin, T., Rubenstein, D.: Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 416–432. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Gentry, C.: A fully homomorphic encryption scheme. Ph.D. Thesis, Stanford University (2009)

    Google Scholar 

  6. Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, New York (2004)

    Book  Google Scholar 

  7. Groat, M.M., He, W., Foreest, S.: KIPDA: k-Indistinguishable privacy-preserving data aggregation in wireless sensor networks. In: 2010 Proceedings IEEE on INFOCOM, pp. 2024–2032. IEEE (2011)

    Google Scholar 

  8. Halevi, S., Lindell, Y., Pinkas, B.: Secure Computation on the Web: Computing without Simultaneous Interaction. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 132–150. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. He, W., et al.: PDA: Privacy-preserving data aggregation in wireless sensor networks. In: INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp. 2045–2053. IEEE (2007)

    Google Scholar 

  10. Kentapadi, K.: Models and algorithms for data privacy, Ph.D. Thesis, Stanford University (2006)

    Google Scholar 

  11. L´opez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 1219–1234 (2012)

    Google Scholar 

  12. Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of ACM Conference on Electronic Commerce, pp. 129–139 (1999)

    Google Scholar 

  13. Paillier, P.: Public-Key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Sheikh, R., Kumar, B., Mishra, D.K.: Privacy preserving k-secure sum protocol. Int. J. Comput. Sci. Inf. Secur. 6(2), 68–72 (2009)

    Google Scholar 

  15. Sheikh, R., Kumar, B., Mishra, D.K.: A modified k-secure sum protocol for multi-party computation. Int. J. Comput. 2(2), 62–66 (2010)

    Google Scholar 

  16. Shi, J., et al.: Prisense: privacy-preserving data aggregation in people-centric urban sensing systems. In: 2010 Proceedings IEEE on INFOCOM. IEEE (2010)

    Google Scholar 

  17. Toft, T.: Primitives and applications of secure multi-party computation. Ph.D. Thesis, University of Aarhus, Denmark (2007)

    Google Scholar 

  18. Yao, A.C.-C.: How to generate and exchange secrets. In: Proceedings of Foundations of Computer Science (FOCS), pp. 162–167, October 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kim Le .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Le, K., Ramanathan, P., Saluja, K.K. (2014). Privacy Assurances in Multiple Data-Aggregation Transactions. In: Lee, HS., Han, DG. (eds) Information Security and Cryptology -- ICISC 2013. ICISC 2013. Lecture Notes in Computer Science(), vol 8565. Springer, Cham. https://doi.org/10.1007/978-3-319-12160-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12160-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12159-8

  • Online ISBN: 978-3-319-12160-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics