“Research on Dynamic Key Update Mechanism of Cloud Storage Based on Time Series”

DOI: https://doi.org/10.62517/jes.202602309

Author(s)

Jiajin Yu

Affiliation(s)

Department of Integrated Circuit Engineering, Chongqing Polytechnic University of Electronic Technology (CQUET), Chongqing, China

Abstract

Cloud storage has become the core infrastructure of modern data storage, while traditional static key management brings longterm key exposure risks. Interception and cracking attacks easily cause serious data security threats. Conventional dynamic key update schemes have drawbacks including disordered update rhythm, unstable node synchronization and insufficient scalability. This paper proposes a cloud storage dynamic key update mechanism based on time series theory. Quantifiable periodic rotation rules are defined based on time series characteristics, enabling standardized timebased key updates. An anomalytriggered strategy is added to complement the single timedriven mode, addressing its limitation in handling unexpected security events. The complete system framework covers time series scheduling, key generation, secure distribution, synchronous iteration and residual key elimination. Hierarchical key management rules are optimized to adapt to the cyclic key iteration process. Simulation results show that the proposed mechanism reduces average update delay to 31.2 ms, improves node synchronization success rate to 99.98%, and lowers leakage risk rate to 6.8% under bruteforce attacks, outperforming traditional static and hashchain based schemes.

Keywords

Cloud Storage; Dynamic Key Update; Time Series; DualDriven Strategy; Key Management; Cloud Security

References

[1] D. M'Raïhi, S. Machani, M. Pei, and J. Rydell, "TOTP: Time-Based One-Time Password Algorithm," IETF RFC 6238, May 2011. [2] R. N. Calheiros, R. Ranjan, A. Beloglazov, C. A. F. De Rose, and R. Buyya, "CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms," Software: Practice and Experience, vol. 41, no. 1, pp. 23-50, 2011. [3] J. Reardon, D. Basin, and S. Capkun, "SoK: Secure data deletion," in 2013 IEEE Symposium on Security and Privacy, pp. 301-315, 2013. [4] L. Lamport, "Password authentication with insecure communication," Communications of the ACM, vol. 24, no. 11, pp. 770-772, 1981 [5] S. Kamara and K. Lauter, "Cryptographic cloud storage," in Financial Cryptography and Data Security (FC 2010), LNCS 6054, pp. 136-149, 2010. [6] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, "Provable data possession at untrusted stores," in ACM CCS 2007, pp. 598-609, 2007. [7] M. Bellare and S. K. Miner, "A forward-secure digital signature scheme," in Advances in Cryptology-CRYPTO '99, LNCS 1666, pp. 431-448, 1999. [8] R. Canetti and H. Krawczyk, "Analysis of key-exchange protocols and their use for building secure channels," in Advances in Cryptology-EUROCRYPT 2001, LNCS 2045, pp. 453-474, 2001. [9] D. E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd ed., Addison-Wesley, 1997. (Chapter 3, Random Numbers) [10] B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd ed., John Wiley & Sons, 1996. [11] A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996. (Free online version from CRC) [12] L. Lamport, R. Shostak, and M. Pease, "The Byzantine generals problem," ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 4, no. 3, pp. 382-401, 1982. [13] M. Castro and B. Liskov, "Practical Byzantine fault tolerance," in Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI '99), pp. 173-186, 1999. [14] R. Rivest, "The MD5 message-digest algorithm," IETF RFC 1321, April 1992. [15] NIST, "Secure Hash Standard (SHS)," FIPS PUB 180-4, August 2015.