{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T20:10:40Z","timestamp":1792440640093,"version":"4.5.0"},"reference-count":20,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T00:00:00Z","timestamp":1730332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Comput. Sci."],"abstract":"<jats:p>In the contemporary technological landscape, ensuring confidentiality is a paramount concern addressed through various skillsets. Cryptography stands out as a scientific methodology for safeguarding communication against unauthorized access. Within the realm of cryptography, numerous encryption algorithms have been developed to enhance data security. Recognizing the imperative for nonstandard encryption algorithms to counter traditional attacks, this paper puts forth novel encryption techniques. These methods leverage special corona graphs, star graphs, and complete bipartite graphs, incorporating certain algebraic properties to bolster the secure transmission of messages. The introduction of these proposed encryption schemes aims to elevate the level of security in confidential communication, some of the applications of these schemes are given in the later section.<\/jats:p>","DOI":"10.3389\/fcomp.2024.1454094","type":"journal-article","created":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T00:40:12Z","timestamp":1730335212000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Secure communication in the digital age: a new paradigm with graph-based encryption algorithms"],"prefix":"10.3389","volume":"6","author":[{"given":"Nasir","family":"Ali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayesha","family":"Sadiqa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muhammad Amir","family":"Shahzad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muhammad","family":"Imran Qureshi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hafiz Muhammad Afzal","family":"Siddiqui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suhad Ali Osman","family":"Abdallah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nashaat S.","family":"Abd El-Gawaad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1965","published-online":{"date-parts":[[2024,10,31]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","first-page":"72","DOI":"10.56578\/atams020202","article-title":"A mathematical analysis of concealed non-Kekulean benzenoids and subdivided networks in associated line graphs","volume":"2","author":"Ali","year":"","journal-title":"Acadlore Trans. Appl Math. Stat"},{"key":"ref2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2023\/8975497","article-title":"Mapping connectivity patterns: degree-based topological indices of Corona product graphs","volume":"2023","author":"Ali","year":"2023","journal-title":"J. Appl. Math."},{"key":"ref3","article-title":"The cartesian product graph for encryption schemes","author":"Ali","year":"2023"},{"key":"ref4","article-title":"Exploring ring structures: multiset dimension analysis in compressed zero-divisor graphs","author":"Ali","year":"","journal-title":"arXiv preprint arXiv:2405.06187"},{"key":"ref6","first-page":"7","article-title":"Applications of bipartite graph in diverse fields including cloud computing","volume":"5","author":"Arunkumar","year":"2015","journal-title":"Int. J. Modern Engin. Res."},{"key":"ref8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BF01844162","article-title":"On the corona of two graphs","volume":"4","author":"Frucht","year":"1970","journal-title":"Aequationes Math."},{"key":"ref9","article-title":"The tensor product bipartite graph for symmetric encryption scheme","volume-title":"AIP conference proceedings","author":"Hashem","year":"2023"},{"key":"ref10","first-page":"12","article-title":"A bipartite graph propagation approach for mobile advertising fraud detection","author":"Hu","year":"2017","journal-title":"Mob. Inf. Syst."},{"key":"ref11","first-page":"94","article-title":"Encryption using Venn-diagrams and graph","volume":"4","author":"Kedia","year":"2015","journal-title":"Int. J. Advanced Comp. Technol."},{"key":"ref12","doi-asserted-by":"crossref","first-page":"2519","DOI":"10.9734\/JSRR\/2014\/11804","article-title":"Encryption algorithm using graph theory","volume":"3","author":"Mahmoud","year":"2014","journal-title":"J. Sci. Res. Rep."},{"key":"ref15","volume-title":"Elementary number theory and its applications","author":"Rosen","year":"2005"},{"key":"ref16","doi-asserted-by":"publisher","first-page":"2084342","DOI":"10.1155\/2024\/2084342","article-title":"Graph crypto-Stego system for securing graph data using association schemes","volume":"2024","author":"Sabharwal","year":"2024","journal-title":"J. Appl. Math."},{"key":"ref17","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1080\/17445760.2018.1550771","article-title":"How to encrypt a graph","volume":"35","author":"Selim","year":"2020","journal-title":"Int. J. Parallel Emergent Distributed Syst."},{"key":"ref18","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"ref19","article-title":"The triple vertex path graph for hill encryption schemes","volume-title":"AIP conference proceedings","author":"Shathir","year":"2023"},{"key":"ref20","doi-asserted-by":"publisher","first-page":"6","DOI":"10.5120\/ijca2016908780","article-title":"Encryption using network and matrices through signed graphs","volume":"138","author":"Sinha","year":"2016","journal-title":"Int. J. Comp. Appl."},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1201\/9781315282497","volume-title":"Cryptography: Theory and practice","author":"Stinson","year":"2018"},{"key":"ref23","volume-title":"Introduction to graph theory","author":"West","year":"2001"},{"key":"ref24","article-title":"Data transfer using fundamental circuits","volume":"2","author":"Yamuna","year":"2015","journal-title":"Int. J. Comp. Modern Technol."},{"key":"ref25","first-page":"128","article-title":"Data transfer using bipartite graphs","volume":"4","author":"Yamuna","year":"2015","journal-title":"Int. J. Advance Res. Sci. Engin."}],"container-title":["Frontiers in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2024.1454094\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T10:12:13Z","timestamp":1730455933000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2024.1454094\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,31]]},"references-count":20,"alternative-id":["10.3389\/fcomp.2024.1454094"],"URL":"https:\/\/doi.org\/10.3389\/fcomp.2024.1454094","relation":{},"ISSN":["2624-9898"],"issn-type":[{"value":"2624-9898","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,31]]},"article-number":"1454094"}}