2022
DOI: 10.1016/j.jksuci.2019.08.004
|View full text |Cite
|
Sign up to set email alerts
|

A new efficient TKHC-based image sharing scheme over unsecured channel

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 47 publications
0
5
0
Order By: Relevance
“…This analysis is applied to image to measure randomness in the image and is considered one of the important analysis to prove the security of the encryption. If the result of entropy is high, then this is an evidence of the safety of the encryption algorithm [16]. We notice from the table (5) that the proposed algorithm has a higher output, which makes the security of the encryption high and is mathematically represented as follows:…”
Section:  Information Entropy Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…This analysis is applied to image to measure randomness in the image and is considered one of the important analysis to prove the security of the encryption. If the result of entropy is high, then this is an evidence of the safety of the encryption algorithm [16]. We notice from the table (5) that the proposed algorithm has a higher output, which makes the security of the encryption high and is mathematically represented as follows:…”
Section:  Information Entropy Analysismentioning
confidence: 99%
“…The output from the first encryption is entered as a new key for the second block of the text to be encrypted and so on, until we obtain the fully encrypted text. Finally, we can say that the proposed algorithm has a key space starting from 2 ^ 64 and ends at 2 ^ 448, this means that there is no opportunity for brute force attack or hackers to break the key of the proposed algorithm [16].…”
Section: Key Spacementioning
confidence: 99%
“…The basic idea behind Recursive threshold visual cryptography is recursive hiding of smaller secrets in shares of larger secrets with secret sizes doubling at every step, and thereby increasing the information, every bit of share conveys to (n-1)/n bit of secret which is nearly 100%again to maintain the good contrast and improve the security, Zhi Zhou, et.al. proposed halftone visual cryptography [4], [9].In halftone visual cryptography a secret binary pixel is encoded into an array of sub pixels, called as halftone cell, in each of the n shares. Mahmoud E. Hodeish et.al proposed an optimized half tone visual cryptography using error diffusion.…”
Section: Related Workmentioning
confidence: 99%
“…They works on binary and gray scale image and improves the pixel expansion, elements the code book requirement but they only works on binary half tone images [6]. Mahmoud E. Hodeish et.al proposed a new efficient TKHC-based image sharing scheme over unsecured channel they proposed the method of RGB and gray scale images encrypted and decrypted by means of TKHC and providing strong security to transmit all the generated shares via one public channel [9]. Chang-Chou Lin et.al.proposed visual cryptography for gray level images [10].…”
Section: Related Workmentioning
confidence: 99%
“…The remarkable progress in the development of data production has made data processing difficult [1]. However, due to the rapid development in environmental technologies, the transmission of sensitive information through the internet has become easy using the new technologies that come under big data today [2], [3]. Where it became an important and modern topic racing towards researchers as a rich field of research areas and come out with the most prominent researches and thoughts and innovative ways to deal with the problem and cover its gaps [4].…”
Section: Introductionmentioning
confidence: 99%