Table of Content

Open Access iconOpen Access

ARTICLE

Verifiable Outsourcing of High-Degree Polynomials and Tts Application in Keyword Search

Jun Yea, Xianlin Zhoub, Zheng Xuc, Yong Dingd

a Key Laboratory of Higher Education of Sichuan Province for Enterprise Informationalization and Internet of Things, Sichuan University of Science & Engineering, Guangxi Key Laboratory of Cryptography and Information Security, Lab of Security Insurance of Cyberspace, China;
b College of Mathematics and Software Science, Sichuan Normal University, Sichuan, China;
c The Third Research Institute of the Ministry of Public Security, Shanghai, China;
d School of Computer Science and Information Security, Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guangxi, China

* Corresponding Author: Yong Ding, email

Intelligent Automation & Soft Computing 2018, 24(1), 41-46. https://doi.org/10.1080/10798587.2016.1267239

Abstract

In big data era, people cannot afford more and more complex computation work due to the constrained computation resources. The high reliability, strong processing capacity, large storage space of cloud computing makes the resource-constrained clients remotely operate the heavy computation task with the help of cloud server. In this paper, a new algorithm for secure outsourcing of high degree polynomials is proposed. We introduce a camouflage technique, which the real polynomial will be disguised to the untrusted cloud server. In addition, the input and output will not be revealed in the computation process and the clients can easily verify the returned result. The application of the secure outsourcing algorithm in keyword search system is also studied. A verification technique for keyword search is generated based on the outsourcing algorithm. The client can easily verify whether the server faithfully implement the search work in the whole ciphertext space. If the server does not implement the search work and returns the client “null” to indicate there is no files with the query keyword, the client can easily verify whether there are some related files in the ciphertext database.

Keywords


Cite This Article

APA Style
Ye, J., Zhou, X., Xu, Z., Ding, Y. (2018). Verifiable outsourcing of high-degree polynomials and tts application in keyword search. Intelligent Automation & Soft Computing, 24(1), 41-46. https://doi.org/10.1080/10798587.2016.1267239
Vancouver Style
Ye J, Zhou X, Xu Z, Ding Y. Verifiable outsourcing of high-degree polynomials and tts application in keyword search. Intell Automat Soft Comput . 2018;24(1):41-46 https://doi.org/10.1080/10798587.2016.1267239
IEEE Style
J. Ye, X. Zhou, Z. Xu, and Y. Ding "Verifiable Outsourcing of High-Degree Polynomials and Tts Application in Keyword Search," Intell. Automat. Soft Comput. , vol. 24, no. 1, pp. 41-46. 2018. https://doi.org/10.1080/10798587.2016.1267239



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1275

    View

  • 996

    Download

  • 0

    Like

Share Link