IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v10y2019i5d10.1007_s13198-019-00845-2.html
   My bibliography  Save this article

A new Top-k query processing algorithm to guarantee confidentiality of data and user queries on outsourced databases

Author

Listed:
  • Hyeong-Jin Kim

    (Chonbuk National University)

  • Jae-Woo Chang

    (Chonbuk National University)

Abstract

With the growth of cloud computing, database outsourcing has attracted a lot of interest. Due to the serious privacy threats in cloud computing, databases need to be encrypted before being outsourced to the cloud. Therefore, various Top-k query processing algorithms have been studied for encrypted databases. However, existing algorithms are either insecure or inefficient. Therefore, in this paper we propose a new Top-k query processing algorithm that guarantees confidentiality of both data and user queries while hiding data access patterns. Our algorithm also allows the query issuer to not participate in the query processing. To achieve a high query processing efficiency, we implement new secure protocols using Yao’s garbled circuit and a data packing technique. A performance analysis shows that the proposed algorithm outperforms the existing work in terms of query processing costs.

Suggested Citation

  • Hyeong-Jin Kim & Jae-Woo Chang, 2019. "A new Top-k query processing algorithm to guarantee confidentiality of data and user queries on outsourced databases," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(5), pages 898-904, October.
    • Handle: RePEc:spr:ijsaem:v:10:y:2019:i:5:d:10.1007_s13198-019-00845-2
    DOI: 10.1007/s13198-019-00845-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-019-00845-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-019-00845-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:10:y:2019:i:5:d:10.1007_s13198-019-00845-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.