Securely solving privacy preserving minimum spanning tree algorithms in semi-honest model Online publication date: Sun, 31-May-2020
by C.H. Koteswara Rao; Kunwar Singh
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 34, No. 1, 2020
Abstract: Yao introduced secure 2PC for the so-called millionaire's problem. It is about two millionaires Alice and Bob, interested to determine who is wealthier without revealing their values. Goldreich generalised the secure 2PC and formalised the MPC. Suppose two telephone companies wish to merge to provide better services to end users. Each company has a cost function for connecting any pair of houses. They want to connect every house with minimum cost in merged company. Before merging both companies want to know whether merging will benefit them or not without revealing cost function. Based on the MPC paradigm, we propose new algorithms for privacy-preserving computation of MST. We also investigate how to solve the classical MST problem with the help of ABB operations. We propose two more algorithms for solving MST in semi-honest model with secure ABB in the secretly shared data environment. Our protocols offer perfect security against semi-honest adversaries.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook