Abstract
Along with the fast development of wireless technologies, smart devices have become an integral part of our daily life. Authentication is one of the most common and effective methods for these smart devices to prevent unauthorized access. Moreover, smart devices tend to have limited computing power, and they may possess sensitive data. In this paper, we investigate performing graph operations in a privacy-preserving manner, which can be used for anonymous authentication for smart devices. We propose two protocols that allow two parties to jointly compute the intersection and union of their private graphs. Our protocols utilize homomorphic encryption to prevent information leakage during the process, and we provide security proofs of the protocols in the semihonest setting. At last, we implement and evaluate the efficiency of our protocols through experiments on real-world graph data.
Highlights
With the rapid development of IoT technology, we are surrounded by various types of smart devices in our daily life, such as sensors, wearable devices, and smart vehicles [1]
This paper extends the previous work by presenting a private graph union protocol with detailed analysis and experimental results
We formally describe the private graph intersection (PGI) protocol and the private graph union (PGU) protocol
Summary
With the rapid development of IoT technology, we are surrounded by various types of smart devices in our daily life, such as sensors, wearable devices, and smart vehicles [1]. We consider the problem of computing graph operations between two parties while preventing information leakage, which has great potential in smart device authentication. When the mobile devices communicate with cloud servers, they need to first jointly perform identity authentication for security protection. In order to protect the privacies of the mobile devices, the devices can model their identities and properties as graph-structured data, and the cloud servers can model their authentication policies as graph-structured data as well. Wireless Communications and Mobile Computing allows the server and the client to jointly compute the intersection of their input graphs, and the second protocol computes the union of the input graphs. This paper extends the previous work by presenting a private graph union protocol with detailed analysis and experimental results
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
