JHJun Hong

Jun Hong

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jun Hong has a total of 3 co-authors. Here are the top co-authors by number of shared publications:

  • Quan Guo

    Department of Computer Science and Technology, Dalian Neusoft University, Dalian, Liaoning 116023, China

    1 shared publication
  • Tao Wen

    School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning 110819, China

    1 shared publication
  • Zhengwang Ye

    School of Computer Science and Engineering, Northeastern University, Shenyang, China

    1 shared publication

Latest Publications

  • Open Access

    SecurekNNComputation and Integrity Assurance of Data Outsourcing in the Cloud

    by Jun Hong, Tao Wen, Quan Guo, Zhengwang Ye

    As cloud computing has been popularized massively and rapidly, individuals and enterprises prefer outsourcing their databases to the cloud service provider (CSP) to save the expenditure for managing and maintaining the data. The outsourced databases are hosted, and query services are offered to clients by the CSP, whereas the CSP is not fully trusted. Consequently, the security shall be violated by multiple factors. Data privacy and query integrity are perceived as two major factors obstructing enterprises from outsourcing their databases. A novel scheme is proposed in this paper to effectuatek‐nearest neighbors(kNN)query andkNNquery authentication on an encrypted outsourced spatial database. An asymmetric scalar‐product‐preserving encryption scheme is elucidated, in which data points and query points are encrypted with diverse encryption keys, and the CSP can determine the distance relation between encrypted data points and query points. Furthermore, the similarity search tree is extended to build a novel verifiable SS‐tree that supports efficientkNNquery andkNNquery verification. It is indicated from the security analysis and experiment results that our scheme not only maintains the confidentiality of outsourced confidential data and query points but also has a lowerkNNquery processing and verification overhead than the MR‐tree.