Performance analysis of key splitting algorithms for Cloud computing
Amar Buchade, Rajesh Ingle · 2016
In cloud computing, it is important to have instant access of resources such as CPU, storage and data. Key management techniques are used to protect the access of resources. In recent years, there is an increase use of threshold cryptography in Cloud computing. In threshold cryptography (k,n), k shares out of n can be used to form the key. Key share management is important in threshold cryptography. It involves key splitting, key shares distribution and key reconstruction. The paper describes key splitting algorithms such as Rabins Information dispersal scheme, Shamirs scheme and Asmuth-Bloom scheme. The paper analyzes key splitting, key reconstruction time and storage requirement of these schemes to study of how it affects characteristics of cloud computing. The analysis shows that Rabins IDA outperforms than the other schemes in terms of storage requirement, key splitting time and key reconstruction. We have also done security analysis of these schemes. Thus finally we analyzed the suitability of the scheme for Cloud computing.