A New Security Scheme for Cloud Storage Systems and Its Performance Evaluation using Avalanche Effect
Hamid R. Sadjadpour, Shivaswarup Manjakuppam Ashok · 2021 55th Asilomar Conference on Signals, Systems, and Computers · 2021
We introduce a new protocol that achieves Shannon perfect secrecy performance using significantly lower key size than the original approach of one-time pad. We achieve this goal by taking advantage of high computational complexity of servers that is available in data centers. We demonstrate that there is a tradeoff between computational complexity and the size of the key. Our approach is based on redefining the perfect secrecy problem by producing keys for multiple packets simultaneously. Then, we use two intermediate keys called temporary keys and common keys. A unique combination of these two keys produces the final keys that are used for encryption. However, when we combine the common and temporary keys, we take advantage of the location of the final keys as a source of uncertainty. Our claim is that we can obtain the required entropy to achieve perfect secrecy from a combination of random bits and other sources of randomness in order to construct uniformly distributed and unique final keys. By doing this, we create the required entropy needed to achieve perfect secrecy. An iterative algorithm is introduced that allows us to reduce the ratio of final keys to the ratio of the information bits. In order to evaluate the performance of this approach, we use the avalanche effect and investigate the effectiveness of our approach in comparison with AES. Our results show that this technique succeeds in maintaining the avalanche effect requirement.