Research on Identity-Based Encryption Scheme for Grid Computing System

2014 ◽  
Vol 543-547 ◽  
pp. 3156-3159
Author(s):  
Qing Hai Bai ◽  
Ying Zheng ◽  
Qing Hu Wang ◽  
Guo Li Wei ◽  
Hai Chun Zhao ◽  
...  
Keyword(s):  
Grid Computing ◽  
Data Transmission ◽  
Computing System ◽  
Grid Service ◽  
Encryption Scheme ◽  
Grid System ◽  
Identity Based Encryption ◽  
Diffie Hellman ◽  
Long Run ◽  
Identity Based

Grid system has secure requirements of confidential communication, data integrity and non-repudiation. According to the secure requirements for Grid service, the paper proposed an identity-based encryption scheme for Grid, which can solve a series of problem: the privacy of data transmission, validation of integrity of data, key update after long run time and non-repudiation. The scheme is constructed by bilinear paring on elliptic cures and its security can be reduced to the computational Bilinear Diffie-Hellman assumption. Finally, the authors analyses the security and efficiency of this scheme.

The Application of IBE Encryption Scheme in Grid Environments

2014 ◽  
Vol 551 ◽  
pp. 686-690
Author(s):  
Qing Hai Bai ◽  
Ying Zheng ◽  
Lin Na Zhao
Keyword(s):  
Data Transmission ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Encryption Scheme ◽  
Grid System ◽  
Transmission Process ◽  
Security Service ◽  
Identity Based Encryption ◽  
Grid Environments ◽  
Identity Based

The computing service and security service are separated in current Grid system, but the data transmission of the system has to cross unsafe public channel. This makes the results computing by the Grid system may be stolen or destroyed by artificial or non-artificial factors in transmission process. So the Grid system has secure requirements of confidential communication, data integrity and non-repudiation. For these requirements, this paper puts forward an identity-based encryption scheme and realizes the function of confidentiality, Integrity, Key Update and non-repudiation. To test the security of the proposed scheme, the authors make a detailed analysis in random oracle model and prove the security of the scheme equivalents to the difficulty of the bilinear Diffle-Hellman problem. So our scheme is proved to be correct.

Sign in / Sign up

Export Citation Format

Share Document