Skip to main content

Accelerating the Secure Distributed Computation of the Mean by a Chebyshev Expansion

  • Conference paper
  • 1159 Accesses

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

Abstract

Lindell and Pinkas (2002) have proposed the idea of using the techniques of secure multi-party computations to generate efficient algorithms for privacy preserving data-mining. In this context Kiltz, Leander, and Malone-Lee (2005) have presented a protocol for the secure distributed computation of the mean and related statistics in a two-party setting. Their protocol achieves constant round complexity. As a novel suggestion we use a Chebyshev expansion to accelerate this protocol. This approach considerably reduces the overhead of the protocol in terms of both computation and communication. The proposed technique can be applied to other protocols in the field of privacy preserving data-mining as well.

Keywords

  • Privacy preserving data mining
  • secure two-party computations
  • oblivious polynomial evaluation
  • Chebyshev expansion

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Algesheimer, J., Camenisch, J., Shoup, V.: Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417–432. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  2. Bulirsch, R., Stoer, J.: Darstellung von Funktionen in Rechenautomaten. In: Sauer, R., Szabó, I. (eds.) Mathematische Hilfsmittel des Ingenieurs. Grundlehren der mathematischen Wissenschaften, vol. 141, pp. 352–446. Springer, Berlin (1968)

    Google Scholar 

  3. Chang, Y.-C., Lu, C.-J.: Oblivious Polynomial Evaluation and Oblivious Neural Learning. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 369–384. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  4. Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285–304. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  5. The GNU Multiple Precision Arithmetic Library, Edition 5.0.3 (2012), http://gmplib.org

  6. Kiltz, E., Leander, G., Malone-Lee, J.: Secure Computation of the Mean and Related Statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 283–302. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  7. Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology 15, 177–206 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Mason, J.C., Handscomb, D.C.: Chebyshev Polynomials. Chapman & Hall/CRC, Boca Raton (2003)

    MATH  Google Scholar 

  9. Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Vitter, J.S., Larmore, L., Leighton, T. (eds.) Proceedings of the 31st ACM Symposium on Theory of Computing (STOC 1999), pp. 245–254. ACM Press (1999)

    Google Scholar 

  10. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 448–457. Society for Industrial and Applied Mathematics (2001)

    Google Scholar 

  11. Naor, M., Pinkas, B.: Computationally secure oblivious transfer. Journal of Cryptology 18, 1–35 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM Journal on Computing 35(5), 1254–1281 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lory, P., Liedel, M. (2012). Accelerating the Secure Distributed Computation of the Mean by a Chebyshev Expansion. In: Susilo, W., Mu, Y., Seberry, J. (eds) Information Security and Privacy. ACISP 2012. Lecture Notes in Computer Science, vol 7372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31448-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31448-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31447-6

  • Online ISBN: 978-3-642-31448-3

  • eBook Packages: Computer ScienceComputer Science (R0)