Skip to main content
SpringerLink
Log in

Secure Multi-Party Computation Using Pre-distributed Information from an Initializer

  • Conference paper
  • First Online:
Security and Privacy (ICSP 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1497))

Included in the following conference series:

  • 326 Accesses

Abstract

Secure Multi-Party Computation (MPC) is a concept that includes a system of n participants communicating each other securely such that the participants want to compute any given function using their private inputs without giving any information about their inputs. The matter of computing a multiplication gate has raised a security concern. That is, because the multiplication gate rises the degree of the resulted polynomial while there is a limited number of required participants to reconstruct and compute the outcome. In this study, we propose a MPC protocol using a server or a remote computer as an initializer, which has become popular these days to conduct a probabilistic functionality in the circuit. The initializer does not get involved in the actual online computation and it can just share some random pre-computed information at any time prior to it. Our protocol needs only one round of online secret sharing, and the online computation of both the inputs addition and multiplication gates can be executed in parallel. The extension of our protocol can be used for the multiplication gates with different multiplicative depths (intermediate levels). The proposed protocol is information-theoretic secure against a coalition of t passive adversaries with the presence of at least \(n\ge t+1\) participants. The communication complexity of a multiplication gate is linear.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Institutional subscriptions

References

  1. Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420–432. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-46766-1_34

    Chapter  Google Scholar 

  2. Beaver, D.: Commodity-based cryptography. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 446–455 (1997)

    Google Scholar 

  3. Beerliová-Trubíniová, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213–230. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78524-8_13

    Chapter  Google Scholar 

  4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 351–371 (2019)

    Google Scholar 

  5. Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret (Extended Abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251–260. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-47721-7_19

    Chapter  Google Scholar 

  6. Bendlin, R., Damgård, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169–188. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20465-4_11

    Chapter  Google Scholar 

  7. Blier, H., Tapp, A.: A single initialization server for multi-party cryptography. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 71–85. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85093-9_8

    Chapter  Google Scholar 

  8. Chaum, D., Crépeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 11–19 (1988)

    Google Scholar 

  9. Cianciullo, L., Ghodosi, H.: Efficient information theoretic multi-party computation from oblivious linear evaluation. In: Blazy, O., Yeun, C.Y. (eds.) WISTP 2018. LNCS, vol. 11469, pp. 78–90. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-20074-9_7

    Chapter  Google Scholar 

  10. Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority – Or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1–18. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40203-6_1

    Chapter  Google Scholar 

  11. Damgård, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643–662. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32009-5_38

    Chapter  Google Scholar 

  12. Gennaro, R., Rabin, M.O., Rabin, T.: Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 101–111 (1998)

    Google Scholar 

  13. Ghodosi, H., Pieprzyk, J.: Multi-party computation with omnipresent adversary. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 180–195. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00468-1_11

    Chapter  Google Scholar 

  14. Goldreich, O.: Secure multi-party computation. Manuscript. Preliminary version 78 (1998)

    Google Scholar 

  15. Goldwasser, S.: Multi party computations: past and present. In: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pp. 1–6 (1997)

    Google Scholar 

  16. Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143–161. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44448-3_12

    Chapter  Google Scholar 

  17. Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant round multi-party computation combining BMR and SPDZ. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 319–338. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48000-7_16

    Chapter  Google Scholar 

  18. Micali, S., Goldreich, O., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth ACM Symp. on Theory of Computing, STOC, pp. 218–229. ACM (1987)

    Google Scholar 

  19. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, pp. 73–85. ACM (1989)

    Google Scholar 

  20. Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer. Unpublished manuscript (1999)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  22. Smart, N.P., Tanguy, T.: Taas: Commodity mpc via triples-as-a-service. In: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, pp. 105–116 (2019)

    Google Scholar 

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

    Google Scholar 

  24. Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162–167. IEEE (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. James Cook University, Townsville, Australia

    Amirreza Hamidi & Hossein Ghodosi

Authors
  1. Amirreza Hamidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hossein Ghodosi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amirreza Hamidi .

Editor information

Editors and Affiliations

  1. Naval Postgraduate School, Monterey, CA, USA

    Pantelimon Stănică

  2. University of Paris VIII, Paris, France

    Sihem Mesnager

  3. National Institute of Technology Jamshedpur, Jamshedpur, India

    Sumit Kumar Debnath

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hamidi, A., Ghodosi, H. (2021). Secure Multi-Party Computation Using Pre-distributed Information from an Initializer. In: Stănică, P., Mesnager, S., Debnath, S.K. (eds) Security and Privacy. ICSP 2021. Communications in Computer and Information Science, vol 1497. Springer, Cham. https://doi.org/10.1007/978-3-030-90553-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-90553-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-90552-1

  • Online ISBN: 978-3-030-90553-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation