An Efficient Key Distribution Scheme in Cloud Computing

被引:0
作者
Tang, Chumming [1 ,2 ]
Wong, Duncan S. [3 ]
Hu, Xing [1 ,2 ]
Pei, Dingyi [1 ,2 ]
机构
[1] Guangzhou Univ, Sch Math & Informat Sci, Guangzhou, Guangdong, Peoples R China
[2] Guangzhou Univ, Guangdong Higher Educ Inst, Key Lab Math & Interdisciplinary Sci, Guangzhou, Guangdong, Peoples R China
[3] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
来源
2012 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM) | 2012年
基金
中国国家自然科学基金; 新加坡国家研究基金会;
关键词
Cloud Computing; outsourcing computation; key agreement; modular exponentiation; FULLY HOMOMORPHIC ENCRYPTION; COMPUTATIONS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. It also brings forth new challenges for security when clients want to securely outsource the computation of operations to the untrusted cloud servers. In cloud computing, it is difficult to implement most of cryptographic protocols among clients for this reason that all clients are possibly weaker than computationally powerful players. Hence, clients have to appeal to cloud servers for assistance. However, cloud servers are untrusted so that cryptographic protocols cannot be realized securely. In this paper, we design a secure key agreement scheme for two weaker clients who delegate cloud server to compute modular exponentiation. In our scheme, two clients can get same key for symmetric cryptosystem even that cloud server is untrusted.
引用
收藏
页数:5
相关论文
共 16 条
[1]  
[Anonymous], 2009, STANFORD U
[2]   Locally random reductions: Improvements and applications [J].
Beaver, D ;
Feigenbaum, J ;
Kilian, J ;
Rogaway, P .
JOURNAL OF CRYPTOLOGY, 1997, 10 (01) :17-36
[3]  
Bogdanov D, 2008, LECT NOTES COMPUT SC, V5283, P192
[4]  
Chunming T., 2012, SECURE OUTSOUR UNPUB
[5]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[6]  
Gennaro R, 2010, LECT NOTES COMPUT SC, V6223, P465, DOI 10.1007/978-3-642-14623-7_25
[7]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178
[8]  
Hohenbergera S., TCC 2005
[9]  
Kamara S., 2011, CLOUD CRYPTOGRAPHY
[10]  
Kamara S., 2011, SECURE OUTSOUR UNPUB