Graph Crypto-Stego System for Securing Graph Data Using Association Schemes

Anuradha Sabharwal, Pooja Yadav, Kamal Kumar
{"title":"Graph Crypto-Stego System for Securing Graph Data Using Association Schemes","authors":"Anuradha Sabharwal, Pooja Yadav, Kamal Kumar","doi":"10.1155/2024/2084342","DOIUrl":null,"url":null,"abstract":"Cryptography has recently become a critical area to research and advance in order to transmit information safely and securely among various entities, especially when the transmitted data is classified as crucial or important. This is due to the increase in the use of the Internet and other novel communication technology. Many businesses now outsource sensitive data to a third party because of the rise of cloud computing and storage. Currently, the key problem is to encrypt the data such that it may be stored on an unreliable server without sacrificing the ability to use it effectively. In this paper, we propose a graph encryption scheme by using cryptography and steganography. Data is encrypted using association schemes over finite abelian groups and then hiding the encrypted data behind randomly chosen cover image. We implemented and evaluated the efficiency of our constructions experimentally. We provide experimental results, statistical analysis, error analysis, and key analysis that demonstrates the appropriateness and efficiency of the proposed technique.","PeriodicalId":509379,"journal":{"name":"Journal of Applied Mathematics","volume":"37 14","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2024/2084342","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cryptography has recently become a critical area to research and advance in order to transmit information safely and securely among various entities, especially when the transmitted data is classified as crucial or important. This is due to the increase in the use of the Internet and other novel communication technology. Many businesses now outsource sensitive data to a third party because of the rise of cloud computing and storage. Currently, the key problem is to encrypt the data such that it may be stored on an unreliable server without sacrificing the ability to use it effectively. In this paper, we propose a graph encryption scheme by using cryptography and steganography. Data is encrypted using association schemes over finite abelian groups and then hiding the encrypted data behind randomly chosen cover image. We implemented and evaluated the efficiency of our constructions experimentally. We provide experimental results, statistical analysis, error analysis, and key analysis that demonstrates the appropriateness and efficiency of the proposed technique.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用关联方案确保图数据安全的图加密-Stego 系统
为了在不同实体之间安全可靠地传输信息,尤其是当所传输的数据被归类为关键或重要数据时,密码学近来已成为一个需要研究和推进的关键领域。这是由于互联网和其他新型通信技术的使用越来越多。由于云计算和云存储的兴起,许多企业现在都将敏感数据外包给第三方。目前,关键问题是如何加密数据,使其可以存储在不可靠的服务器上,同时又不影响有效使用数据的能力。在本文中,我们利用密码学和隐写术提出了一种图加密方案。使用有限无边群上的关联方案对数据进行加密,然后将加密数据隐藏在随机选择的封面图像后面。我们通过实验实现并评估了我们的构建效率。我们提供了实验结果、统计分析、误差分析和密钥分析,证明了建议技术的适当性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Tensor z-Transform A New Efficient Hybrid Method Based on FEM and FDM for Solving Burgers’ Equation with Forcing Term Graph Crypto-Stego System for Securing Graph Data Using Association Schemes Modelling Hysteresis in Shape Memory Alloys Using LSTM Recurrent Neural Network Modelling Hysteresis in Shape Memory Alloys Using LSTM Recurrent Neural Network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1