Image encryption by random grids

Shyu, Shyong Jian

doi:10.1016/j.patcog.2006.02.025

Cited by 260 publications

(102 citation statements)

References 8 publications

Supporting

Mentioning

101

Contrasting

Unclassified

Order By: Relevance

“…The permutation and substitution processes can be used in spatial based image encryption algorithms like Data Encryption Standard (DES) [15], Advanced Encryption Standard (AES) [23], Rivest, Shamir and Adleman (RSA) [24], P-Fibonacci transform [25], wave transmission [26], elliptic curve ElGamal [27], gray code [28], random grids [29], Latin squares [30] and chaotic mapping [31].…”

Section: Related Workmentioning

confidence: 99%

Image Encryption Technique based on the Entropy Value of a Random Block

Al-Husainy¹,

Uliyan²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-The use of digital images in most fields of information technology systems makes these images usually contain confidential information. When these images transmitted via the Internet especially in the Cloud, it becomes necessary to protect these images in a way that ensure putting the confidential information that are contained far away from the attackers. A proposed image encryption technique has been presented in this work. This technique used a secret key that is extracted from the image content itself. Therefore, there is no need to find a secret channel to exchange any key where, sender and receiver authenticate each other with regards to a shared secret key extracted from the image. The technique constructs its secret key that is used to encrypt the image, based on the entropy values of a set of randomly selected blocks from the image itself. Vairous experiments have been conducted to evaluate the strength and performance of the technique. The experimental results shows that the proposed technique can be used effectively in the field of image security to protect and authenticate images.

show abstract

Section: Related Workmentioning

confidence: 99%

Image Encryption Technique based on the Entropy Value of a Random Block

Al-Husainy¹,

Uliyan²

2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…Random grid visual secret sharing was first proposed by Kefri and Keren [12], and over the years a number of random grid approaches have been investigated [8,25]. Using a random grid visual cryptography scheme, it is possible to produce shares with no pixel expansion.…”

Section: Practical Issuesmentioning

confidence: 99%

“…S 1 can be used in conjunction with the secret image S sk to generate the corresponding challenge image S 2 . Algorithm 1 gives an example of a random grid visual secret sharing method that was adapted from Shyu [25], which can be used in the proposed visual OTP scheme. In this approach, black pixels in S sk are reproduced at 100% in S ′ sk and white pixels (i.e.…”

Section: Practical Issuesmentioning

confidence: 99%

A Visual One-Time Password Authentication Scheme Using Mobile Devices

Chow

Susilo

et al. 2015

Information and Communications Security

View full text Add to dashboard Cite

The use of passwords for user authentication has become ubiquitous in our everyday lives. However, password theft is becoming a common occurrence due to a variety of security problems associated with passwords. As such, many organizations are moving towards adopting alternative solutions like one-time passwords, which are only valid for a single session. Nevertheless, various one-time password schemes also suffer from a number of drawbacks in terms of their method of generation or delivery. This paper presents the design of a challengeresponse visual one-time password authentication scheme that is to be used in conjunction with the camera on a mobile device. The main purpose of the proposed scheme is to be able to send a challenge over a public channel for a user to obtain a session key, while safeguarding the user's long-term secret key. In this paper, we present the authentication protocol, the various design considerations and the advantages provided by the scheme. Abstract. The use of passwords for user authentication has become ubiquitous in our everyday lives. However, password theft is becoming a common occurrence due to a variety of security problems associated with passwords. As such, many organizations are moving towards adopting alternative solutions like one-time passwords, which are only valid for a single session. Nevertheless, various one-time password schemes also suffer from a number of drawbacks in terms of their method of generation or delivery. This paper presents the design of a challenge-response visual one-time password authentication scheme that is to be used in conjunction with the camera on a mobile device. The main purpose of the proposed scheme is to be able to send a challenge over a public channel for a user to obtain a session key, while safeguarding the user's long-term secret key. In this paper, we present the authentication protocol, the various design considerations and the advantages provided by the scheme. Disciplines Engineering | Science and Technology Studies

show abstract

“…Stacking them is the only way to restore the hidden secret. Random grid-based VSS, invented by Kafri and Keren [2], received more attention in recent years, such as [3][4][5][6][7][8][9]. This method takes each pixel as a grid on the image and applies the concept of random variables to encrypt images.…”

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion

2016

View full text Add to dashboard Cite

Abstract:Visual cryptography encrypts a secret image into two meaningless random images, called shares, such that it can be decrypted by human vision without any calculations. However, there would be problems in alignment when these two shares are staked by hand in practice. Therefore, this paper presents the fault-tolerant schemes of stacking two shares that are acquired from secret image encryption without pixel expansion. The main idea of these schemes is to combine several pixels as a unit and then to encrypt each unit into a specific combination of pixels. Both theoretical analysis and simulation results demonstrate the effectiveness and practicality of the proposed schemes.

show abstract

Image encryption by random grids

Cited by 260 publications

References 8 publications

Image Encryption Technique based on the Entropy Value of a Random Block

Image Encryption Technique based on the Entropy Value of a Random Block

A Visual One-Time Password Authentication Scheme Using Mobile Devices

Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion

Contact Info

Product

Resources

About