Evolution of Visual Cryptography Basis Matrices with Binary Chromosomes

Neil Buckley, A. Nagar, S. Arumugam
{"title":"Evolution of Visual Cryptography Basis Matrices with Binary Chromosomes","authors":"Neil Buckley, A. Nagar, S. Arumugam","doi":"10.1109/EUROSIM.2013.12","DOIUrl":null,"url":null,"abstract":"Visual cryptography is a form of secret sharing requiring only human vision to decrypt a secret image, based on the stacking of seemingly random shadow images, or \"shares\". The main optimization metrics are pixel expansion and recovered image contrast. Maximization of the latter is crucial, as it determines the quality of the decrypted secret. This paper proposes genetic algorithms to evolve basis matrices striving for maximal contrast. They are encoded as binary chromosomes and an objective function is proposed to evaluate their respective fitness values. Evidence for the optimality of GA parameters is demonstrated experimentally, and the success this approach is shown with up to four shares. Furthermore, the algorithm is extended to a generalized graph access for comparison with other research, and the security of this method is analyzed and confirmed.","PeriodicalId":386945,"journal":{"name":"2013 8th EUROSIM Congress on Modelling and Simulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th EUROSIM Congress on Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUROSIM.2013.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Visual cryptography is a form of secret sharing requiring only human vision to decrypt a secret image, based on the stacking of seemingly random shadow images, or "shares". The main optimization metrics are pixel expansion and recovered image contrast. Maximization of the latter is crucial, as it determines the quality of the decrypted secret. This paper proposes genetic algorithms to evolve basis matrices striving for maximal contrast. They are encoded as binary chromosomes and an objective function is proposed to evaluate their respective fitness values. Evidence for the optimality of GA parameters is demonstrated experimentally, and the success this approach is shown with up to four shares. Furthermore, the algorithm is extended to a generalized graph access for comparison with other research, and the security of this method is analyzed and confirmed.
二元染色体视觉密码基矩阵的演化
视觉密码学是一种秘密共享的形式,只需要人类的视觉来解密秘密图像,基于看似随机的阴影图像的堆叠,或“共享”。主要的优化指标是像素扩展和恢复图像对比度。后者的最大化是至关重要的,因为它决定了解密密钥的质量。本文提出了以最大对比度为目标的遗传算法来进化基矩阵。它们被编码为二元染色体,并提出了一个目标函数来评估它们各自的适应度值。实验证明了遗传算法参数最优性的证据,并且该方法的成功表明了多达四个份额。将该算法推广到广义图访问中,并与其他研究进行了比较,分析和验证了该方法的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信