ASK HERE

15-05-2017, 02:10 PM

can someone please give the source code in matlab for finger print authentication using visual cryptography

jaseela123d · 19-05-2017, 09:17 AM

Visual cryptography is a cryptographic technique that allows visual information (images, text, etc.) to be encrypted in such a way that the decryption becomes the work of the person to be deciphered through visual reading.

One of the best known techniques has been credited to Moni Naor and Adi Shamir, who developed it in 1994. They demonstrated a secret visual exchange scheme, where an image was divided into n actions so that only someone with all n actions could Decrypt The image, while any n - 1 actions did not reveal information about the original image. Each action was printed on a separate transparency, and the decryption was performed by superimposing the actions. When all n actions were overlapped, the original image would appear. There are several generalizations of the basic schema that includes k-out-of-n visual cryptography.

Using a similar idea, transparencies can be used to implement one-time encryption, where one transparency is a shared random pad, and another transparency acts as the ciphertext. Typically, there is an expansion of the space required in visual cryptography. But if one of the two parts is structured recursively, the efficiency of visual cryptography can be increased up to 100%.

Some background of visual cryptography is in patents of the sixties. Other background is in the work on perception and secure communication.

Visual cryptography can be used to protect biometric templates in which decryption does not require any complex computation.

Visual cryptographic schemes can be considered as encryption schemes based on graphical data. In visual cryptography schemes as special instances of secret exchange schemes, secret information is codified by the construction of several fragments, called actions that are secretly distributed to different parts, not necessarily reliable. In order to rebuild the secret image, a qualified subset of these parties has to combine their actions. For example, in the threshold schemes (K, n) there are n different parts and each subset of at least k parts is qualified. The visual cryptographic schemes are perfect, ie the prohibited (ie unqualified) subgroups of the parties do not learn any information about the encrypted image (in the theoretical sense of the information). Unlike conventional cryptographic schemes (Shared Secret Res), visual cryptographic schemes allow decryption to be performed directly by the human visual system, that is, without performing any sophisticated cryptographic computation.

Possibly Related Threads...
Thread		Author	Replies	Views	Last Post
	voice vased email system source code		0	3,124	20-04-2021, 07:59 AM Last Post:
	matlab code		1	3,451	31-01-2019, 02:52 PM Last Post: [email protected]
	underwater optical communication matlab code		0	3,292	02-11-2018, 07:32 PM Last Post: Guest
	ns2 source codes free download for hello flood attack		0	2,832	31-10-2018, 02:42 PM Last Post: Guest
	voice based email for blinds source code		0	713	22-10-2018, 05:12 PM Last Post: Guest
	source code for blood group detection in matlab		0	6,462	22-10-2018, 10:59 AM Last Post: Guest
	voice based email for blinds source code		0	699	21-10-2018, 07:58 PM Last Post: Guest
	voice based email for blinds source code		0	635	21-10-2018, 07:43 PM Last Post: Guest
	source code for hall ticket generation in php		0	2,119	08-10-2018, 10:00 PM Last Post: Guest
	voice based email for blinds source code		0	645	28-09-2018, 02:42 PM Last Post: Guest

Important Note..!

ASK HERE