{"title":"Secure shortest distance queries over encrypted graph in cloud computing","authors":"","doi":"10.1007/s11276-024-03692-7","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Graph databases have received increased interests as many applications are handled as graph problems. Shortest distance queries are one of the fundamental operations and have been studied for recent years. To ensure the data and query privacy, researchers have introduced some secure graph encryption schemes which support the shortest distance queries on a large-scale graph database. Unfortunately, most of them only provide an approximate result by pre-computing and storing a distance oracle. To provide the exact shortest path, our solution employs a distributed two-trapdoor public-key crypto-system to perform addition and comparison operations over ciphertexts. The detailed security analysis indicates that our scheme achieves semantically secure under DDH assumption and the experiments are performed on various real-world database and random database. The experimental result shows the feasibility of our scheme.</p>","PeriodicalId":23750,"journal":{"name":"Wireless Networks","volume":"18 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11276-024-03692-7","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Graph databases have received increased interests as many applications are handled as graph problems. Shortest distance queries are one of the fundamental operations and have been studied for recent years. To ensure the data and query privacy, researchers have introduced some secure graph encryption schemes which support the shortest distance queries on a large-scale graph database. Unfortunately, most of them only provide an approximate result by pre-computing and storing a distance oracle. To provide the exact shortest path, our solution employs a distributed two-trapdoor public-key crypto-system to perform addition and comparison operations over ciphertexts. The detailed security analysis indicates that our scheme achieves semantically secure under DDH assumption and the experiments are performed on various real-world database and random database. The experimental result shows the feasibility of our scheme.
期刊介绍：
The wireless communication revolution is bringing fundamental changes to data networking, telecommunication, and is making integrated networks a reality. By freeing the user from the cord, personal communications networks, wireless LAN''s, mobile radio networks and cellular systems, harbor the promise of fully distributed mobile computing and communications, any time, anywhere.
Focusing on the networking and user aspects of the field, Wireless Networks provides a global forum for archival value contributions documenting these fast growing areas of interest. The journal publishes refereed articles dealing with research, experience and management issues of wireless networks. Its aim is to allow the reader to benefit from experience, problems and solutions described.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
