IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v86y2024i2d10.1007_s11235-024-01166-x.html
   My bibliography  Save this article

Generative adversarial networks-based security and applications in cloud computing: a survey

Author

Listed:
  • Shiyu Wang

    (China Telecom Research Institute)

  • Ming Yin

    (China Telecom Research Institute)

  • Yiwen Liu

    (Donghua University)

  • Guofeng He

    (China Telecom Research Institute)

Abstract

To meet growing business needs and exponentially increasing development and maintenance costs, the concept of cloud computing has been proposed and developed rapidly. Cloud computing is a brand-new computing mode that can meet the needs of on-demand distribution and the rapid deployment of computing resources. It can provide strong scalability and applicability through virtualisation technology and elastic technology, and it can adapt to the needs of users in different environments and resources. Through the use of hardware such as cloud sensors, the data collected by various types of sensors can be directly uploaded to the cloud for processing and analysis, so that applications such as management, medical treatment and human–machine cooperation can be provided. However, applications in the cloud have upended traditional security boundaries and will face some unique security challenges. Due to the advantages of generating real data, generative adversarial networks (GANs) have attracted extensive attention in the field of cloud computing, such as data augmentation and encryption. Therefore, this paper reviews GAN-based security and applications in cloud computing. We compare the role of GANs in security and applications in the cloud from multiple dimensions. In addition, we analyse the research trends and future work prospects from the perspective of the algorithm itself, algorithm performance evaluation and cloud computing hardware.

Suggested Citation

  • Shiyu Wang & Ming Yin & Yiwen Liu & Guofeng He, 2024. "Generative adversarial networks-based security and applications in cloud computing: a survey," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 86(2), pages 305-331, June.
    • Handle: RePEc:spr:telsys:v:86:y:2024:i:2:d:10.1007_s11235-024-01166-x
    DOI: 10.1007/s11235-024-01166-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-024-01166-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-024-01166-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sun, Fuyan & Liu, Shutang, 2009. "Cryptographic pseudo-random sequence from the spatial chaotic map," Chaos, Solitons & Fractals, Elsevier, vol. 41(5), pages 2216-2219.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Everett, Samuel, 2024. "On the use of dynamical systems in cryptography," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
    2. Dmitriy Kvitko & Vyacheslav Rybin & Oleg Bayazitov & Artur Karimov & Timur Karimov & Denis Butusov, 2024. "Chaotic Path-Planning Algorithm Based on Courbage–Nekorkin Artificial Neuron Model," Mathematics, MDPI, vol. 12(6), pages 1-20, March.
    3. Saha, Rahul & G, Geetha, 2017. "Symmetric random function generator (SRFG): A novel cryptographic primitive for designing fast and robust algorithms," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 371-377.
    4. Tutueva, Aleksandra V. & Nepomuceno, Erivelton G. & Karimov, Artur I. & Andreev, Valery S. & Butusov, Denis N., 2020. "Adaptive chaotic maps and their application to pseudo-random numbers generation," Chaos, Solitons & Fractals, Elsevier, vol. 133(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:86:y:2024:i:2:d:10.1007_s11235-024-01166-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.