4.4 Article Proceedings Paper

Verifiable Chebyshev maps-based chaotic encryption schemes with outsourcing computations in the cloud/fog scenarios

出版社

WILEY
DOI: 10.1002/cpe.4523

关键词

Chebyshev polynomials; data integrity; IND-CCA security; outsourcing computation; verifiability

资金

  1. National Natural Science Foundation of China [61472091, 61370194]
  2. National Science Foundation of Guangdong Province [2014A030306020]
  3. Guangzhou scholars project for Universities of Guangzhou [1201561613]
  4. Science and Technology Planning Project of Guangdong Province [2015B010129015]
  5. Outstanding Youth Foundation of National Natural Science Foundation of China [61722203]
  6. Japan Society for the Promotion of Science KAKENHI [JP15K00028]

向作者/读者索取更多资源

Based on cloud servers' powerful storage and computing resources, users can store mass encrypted data in the cloud and outsource complex encryption computations to the cloud servers. Since cloud servers cannot be completely trusted, then data privacy and integrity are concerned about hot issues. We focus on the following problems in outsourced encryptions: how to protect the data privacy and how to check the integrity of data and the correctness of cloud server's outsourcing computations. In this paper, we at first propose a verifiable chaotic encryption based on Chebyshev polynomials. The scheme supports verifiable function for data integrity. To further improve the efficiency of the scheme, a corresponding outsourced encryption scheme is constructed, where the heavy overhead evaluations of Chebyshev polynomials are transferred from the user side to the cloud server. The outsourced encryption also provides the checkability for data integrity and correctness of cloud computations. The scheme is suitable for mobile users with limited computing resources. Moreover, the newly proposed scheme no longer depends upon the simple heuristic analysis. It achieves the indistinguishability under chosen-ciphertext attacks (IND-CCA) in the standard model based on the Chebyshev-based Decisional Diffie-Hellman (CDDH) assumption. Thus, we answer a long-term open problem for building a chaotic encryption scheme with provable security in the sense of the IND-CCA.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据