Topic
Plaintext-aware encryption
About: Plaintext-aware encryption is a research topic. Over the lifetime, 1980 publications have been published within this topic receiving 101775 citations. The topic is also known as: Plaintext awareness.
Papers published on a yearly basis
Papers
More filters
••
26 Nov 2003TL;DR: It is proved mathematically that the proposed MHT (Multiple Huffman Tables) algorithm is secure against the chosen plaintext attack.
Abstract: Efficient multimedia encryption algorithms play a key role in multimedia security protection. One multimedia encryption algorithm known as the MHT (Multiple Huffman Tables) method was recently developed by Wu and Kuo in [4] and [5]. Even though MHT has many desirable properties, it is vulnerable to the chosen-plaintext attack (CPA). An enhanced MHT algorithm is proposed in this work to overcome this drawback. It is proved mathematically that the proposed algorithm is secure against the chosen plaintext attack.
8 citations
••
TL;DR: A novel idea to anonymize the access policy and a signature scheme to verify the authenticity of data as well as that of the data owner and the signature scheme is able to detect the insider attack on attribute-based encryption scheme.
8 citations
••
12 Dec 2008TL;DR: A new method of image encryption based on bivariate polynomials is proposed; another image is used as the key in which method, and the method can expand to the video encryption field, and has a good perspective.
Abstract: Encryption of image is different from that of texts due to some intrinsic features of images: large amount of data, highly redundancy, strong correlation among pixels and so on. Therefore, the encryption result is not very well if we used the traditional encryption methods to encrypt images. The paper proposes a new method of image encryption based on bivariate polynomials; another image is used as the key in which method. Because the size of the image key could be much smaller than the secret image, we can hold it expediently. And the method can expand to the video encryption field, and has a good perspective.
8 citations
•
TL;DR: In this article, a modification of the ElGamal cryptosystem over a primitive root of a large prime is presented with the help MATLAB Program to be used over Images.
Abstract: The need of exchanging messages and images secretly over unsecure networks promoted the creation of cryptosystems to enable receivers to interpret the exchanged information. In this paper, a particular public key cryptosystem called the ElGamal Cryptosystem is presented considered with the help MATLAB Program to be used over Images. Since the ElGamal cryptosystem over a primitive root of a large prime is used in messages encryption in the free GNU Privacy Guard software, recent versions of PGP, and other cryptosystems. This paper shows a modification of the this cryptosystem by applying it over gray and color images. That would be by transforming an image into its corresponding matrix using MATLAB Program, then applying the encryption and decryption algorithms over it. Actually, this modification gives one of the best image encryptions that have been used since the encryption procedure over any image goes smoothly and transfers the original image to completely undefined image which makes this cryptosystem is really secure and successful over image encryption. As well as, the decryption procedure of the encrypted image works very well since it transfers undefined image to its original. Therefore, this new modification can make the cryptosystem of images more immune against some future attacks since breaking this cryptosystem depends on solving the discrete logarithm problem which is really impossible with large prime numbers .
8 citations
••
14 Oct 2010TL;DR: An image encryption scheme based on high-dimensional multiple chaotic maps are proposed in this paper, and Arnold cat map is utilized to permute the positions of the image pixels in the spatial domain and the experimental results show that it is more efficient than traditional encryption schemes.
Abstract: Encryption is an important technique to give data security against unauthorized access. As a new research direction of cryptography, chaotic encryption has a series of good characteristics such as sensitive to initial value, pseudo-random properties, and ergodicity and so on. However, the traditional low-dimensional chaotic system has been widely analyzed, and the chaotic sequence is truncated because of the limitations of finite precision in computer. Precision degradation has seriously affected the security of encryption. An image encryption scheme based on high-dimensional multiple chaotic maps are proposed in this paper, and Arnold cat map is utilized to permute the positions of the image pixels in the spatial domain. The experimental results show that it is more efficient than traditional encryption schemes. Compared with simple low-dimensional chaotic system, the proposed scheme does not readily lead to precision degradation and it has passed NIST sp800-22 standards, it provides an efficient and secure way for image encryption.
8 citations