Enhancement of security in cloud computing with secure multi-party computation


  • A Vijaya Kumar
  • N J.V.Vineetha
  • P Sai Chakradar
  • K Kalyan Sai






Multi-Party-Computation, Privatedata, Privacy, Security


The N sets of parties which are allowed by unconditionally the secure multiparty computation (MPC) for computing securely with a registered function f with the help of unbounded adversary computational at some specified field. Here one can corrupt t among n parties maliciously corrupt. The Protocols of MPC which are known and efficient are developed for online or offline framework. Coming to the offline process, the private & random multiplication-triples which is sharable can be generated by the parties in this framework. Later on, these are useful for online to evaluate the multiplication of gates securely in a circuit which describes as f. In this, Protocols of the MPC efficiency depends on the how the offline implementation efficiently. Here, we proposed a simple method, for shared & private multiplication-triples which are random in nature generation without any conditions securely & safely. The typical protocols face this issue, when the random values of shared pairs produced initially. And also, in computing the product values which is shared for every pair. After that, protocols of multiplication and values which are considered as communication intensive. In proposed scheme, the multiplication protocols are completely used in different manner. Later on, we observe that the share multiplication-triples verification by parties or they are extracted securely or not. With the use of setting of the hybrid network and asynchronous, linear communication MPC protocols used which are multiplication gate overhead & indicates as f. The above are the improvements on the typical MPC protocols with the help of hybrid networking setting, asynchronous and complexity of the communication, if we give to result of synchronous setting in our system. It results efficient MPC protocols which are rounded.


[1] Abraham, D. Dolev, and J. Y. Halpern. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In R. A. Bazzi and B. Patt- Shamir, editors, Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, pages 405–414. ACM, 2008. https://doi.org/10.1145/1400751.1400804.

[2] V. Dani, V. King, M. Movahedi, and J. Saia. Brief An-nouncement: Breaking the O (nm) Bit Barrier, Secure Multi- party Computation with a Static Adversary. In D. Kowalski and A. Pan-conesi, editors, ACM Symposium on Principles of Distributed Computing, PODC ’12, Funchal, Madeira, Portugal, July 16-18, 2012, pages 227–228. ACM, 2012.

[3] J. A. Garay, C. Givens, R. Ostrovsky, and P. Raykov. Broad-cast (and Round) Efficient Verifiable Secret Sharing. In C. Padro, editor, Information Theoretic Security - 7th International Con-ference, ICITS 2013, Singapore, November 28-30, 2013, Pro-ceedings, volume 8317 of Lecture Notes in Computer Science, pages 200–219. Springer, 2013.

[4] M. Hirt and P. Raykov. On the Complexity of Broadcast Setup. In F. V. Fomin, R. Freivalds, M. Z. Kwiatkowska, and D. Peleg, editors, Automata, Languages, and Programming - 40th Interna-tional Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, volume 7965 of Lecture Notes in Computer Science, pages 552–563. Springer, 2013. https://doi.org/10.1007/978-3-642-39206-1_47.

[5] Z. Beerliova-Trubniova and M. Hirt. Perfectly-Secure MPC with Linear Communication Complexity. In R. Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Confer ence, TCC 2008, New York, USA, March 19-21, 2008, volume 4948 of Lecture Notes in Computer Science, pages 213–230. Springer Verlag, 2008. https://doi.org/10.1007/978-3-540-78524-8_13.

View Full Article: