Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Research in Networking

NETWORKING 2012: NETWORKING 2012 pp 198–210Cite as

  1. Home
  2. NETWORKING 2012
  3. Conference paper
Heterogeneous Secure Multi-Party Computation

Heterogeneous Secure Multi-Party Computation

  • Mentari Djatmiko20,21,
  • Mathieu Cunche20,
  • Roksana Boreli20,21 &
  • …
  • Aruna Seneviratne20,21 
  • Conference paper
  • 1074 Accesses

  • 3 Citations

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7290)

Abstract

The increased processing power and storage capacity of inhome and mobile computing devices has motivated their inclusion in distributed and cloud computing systems. The resulting diverse environment creates a strong requirement for secure computations, which can be realised by Secure Multi-Party Computation (MPC). However, MPC most commonly assumes that parties performing the secure computation have the same characteristics and evenly distributes the computation load. In a heterogeneous environment, MPC using the same approach would result in poor performance. In this paper, we propose a mechanism for MPC share distribution in such an environment and present an analysis of the gain in robustness and the corresponding computational and communication complexity. Our results show that the uneven share distribution is a worthwhile approach in diverse computing systems.

Keywords

  • secure multi-party computation
  • distributed computing
  • unequal shares
  • heterogeneous platforms

Download conference paper PDF

References

  1. Alba, E., Cotta, C.: Evolutionary algorithms. In: Handbook of Bioinspired Algorithms and Applications, ch. 2, pp. 3–19. Chapman & Hall (2006)

    Google Scholar 

  2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1–10. ACM, New York (1988)

    Google Scholar 

  3. BOINC author: Boinc, http://boinc.berkeley.edu/wiki/System_requirements

  4. Brickell, E.: Some Ideal Secret Sharing Schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468–475. Springer, Heidelberg (1990)

    Google Scholar 

  5. Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: Proceedings of the 19th USENIX Conference on Security, p. 15. USENIX Association, Berkeley (2010)

    Google Scholar 

  6. Cao, N., Yang, Z., Wang, C., Ren, K., Lou, W.: Privacy-preserving query over encrypted graph-structured data in cloud computing. In: 2011 31st International Conference on ICDCS, pp. 393–402 (June 2011)

    Google Scholar 

  7. Cramer, R., Damgaard, I., Nielsen, J.B.: Multiparty Computation, an Introduction (May 2008)

    Google Scholar 

  8. Cramer, R., Damgård, I., Maurer, U.: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316–334. Springer, Heidelberg (2000)

    CrossRef  Google Scholar 

  9. Damgård, I., Geisler, M., Krøigaard, M., Nielsen, J.B.: Asynchronous Multiparty Computation: Theory and Implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160–179. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  10. Damgård, I., Desmedt, Y., Fitzi, M., Nielsen, J.B.: Secure Protocols with Asymmetric Trust. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 357–375. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  11. Dongara, J.: Linpack for android, http://www.netlib.org/benchmark/linpackjava/

  12. Estrin, D.: Participatory sensing: applications and architecture [internet predictions]. IEEE Internet Computing 14(1), 12–42 (2010)

    CrossRef  Google Scholar 

  13. Goldman, R.: Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling. In: Lagrange Interpolation and Neville’s Algorithm, ch. 2. Morgan Kaufmann (2003)

    Google Scholar 

  14. Kannan, S., Gavrilovska, A., Schwan, K.: Cloud4home – enhancing data services with @home clouds. In: 2011 31st International Conference on Distributed Computing Systems (ICDCS), pp. 539–548 (June 2011)

    Google Scholar 

  15. Michiardi, P., Molva, R.: Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In: Conference on Communications and Multimedia Security, p. 121. Kluwer, BV (2002)

    Google Scholar 

  16. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Verizon: Ip latency statistics (2011), http://www.verizonbusiness.com/about/network/latency/

  18. Wang, C., Ren, K., Wang, J., Urs, K.: Harnessing the cloud for securely solving large-scale systems of linear equations. In: 2011 31st International Conference on ICDCS, pp. 549–558 (June 2011)

    Google Scholar 

  19. Yao, A.C.: Protocols for secure computations. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 160–164 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NICTA, 13 Garden Street, Eveleigh, NSW, 2015, Australia

    Mentari Djatmiko, Mathieu Cunche, Roksana Boreli & Aruna Seneviratne

  2. University of New South Wales, Sydney, NSW, 2052, Australia

    Mentari Djatmiko, Roksana Boreli & Aruna Seneviratne

Authors
  1. Mentari Djatmiko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathieu Cunche
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roksana Boreli
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Aruna Seneviratne
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Telecommunications Engineering, Czech Technical University in Prague, Technicka 2, 166 27, Prague 6, Czech Republic

    Robert Bestak & Lukas Kencl & 

  2. Bell Labs, Alcatel-Lucent, 600 Mountain Avenue, 07974-0636, Murray Hill, NJ, USA

    Li Erran Li

  3. Instituto IMDEA Networks, Avenida del Mar Mediterraneo 22, 28918, Leganes (Madrid), Spain

    Joerg Widmer

  4. Tsinghua-ChinaCache Joint Laboratory, Tsinghua University, FIT 3-429, Haidian District, 100016, Beijing, China

    Hao Yin

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Djatmiko, M., Cunche, M., Boreli, R., Seneviratne, A. (2012). Heterogeneous Secure Multi-Party Computation. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30054-7_16

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30054-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30053-0

  • Online ISBN: 978-3-642-30054-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature