4.6 Article

Outsourcing computation of modular exponentiations in cloud computing

出版社

SPRINGER
DOI: 10.1007/s10586-013-0252-0

关键词

Modular exponentiation; Outsourcing computation; Security and privacy; Cloud computing

资金

  1. National Natural Science Foundation of China [61070168, 61100224, U1135001]
  2. National Basic Research Program of China (973 Program) [2012CB316100]
  3. Specialized Research Fund for the Doctoral Program of Higher Education
  4. Foundation for Distinguished Young Talents in Higher Education of Guangdong Province [LYM10106]

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

Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. Promising as it is, this paradigm also brings forth new challenges for security when users want to securely outsource the computation of cryptographic operations to the untrusted cloud servers. As we know, modular exponentiation is one of the basic operations among most of current cryptosystems. In this paper, we present the generic secure outsourcing schemes enabling users to securely outsource the computations of exponentiations to the untrusted cloud servers. With our techniques, a batch of exponentiations (e.g. t exponentiations) can be efficiently computed by the user with only O(n+t) multiplications, where n is the number of bits of the exponent. Compared with the state-of-the-art algorithm, the proposed schemes are superior in both efficiency and verifiability. Furthermore, there are not any complicated pre-computations on the user side. Finally, the schemes are proved to be secure under the Subset Sum Problem.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

暂无数据
暂无数据