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.

Privacy Preserving Ciphertext Policy Attribute Based Encryption

Abstract: Ciphertext policy attribute based encryption (CP-ABE) allows to encrypt data under an access policy. The access policy can be formed with the logical combination of attributes.. Such ciphertexts can be decrypted by anyone with a set of attributes that satisfy the access policy. In CP-ABE, access policy is sent along with the ciphertext. We propose a method in which the access policy need not be sent along with the ciphertext, by which we are able to preserve the privacy of the encryptor. The proposed construction is provably secure under Decision Bilinear Diffe-Hellman assumption.

Secret Wavelet Packet Decompositions for Jpeg 2000 Lightweight Encryption

Abstract: A lightweight encryption scheme for JPEG 2000 based on the wavelet packet transform is proposed. This scheme significantly reduces the amount of data to be encrypted compared to full encryption and other partial or selective encryption schemes, at the cost of increased computational complexity in the compression pipeline. We investigate the applicability of this approach in two scenarios: for providing full confidentiality and for its utility as a transparent encryption scheme. We evaluate the presented scheme in the context of each scenario with respect to its impact on compression performance, its complexity, the level of security it provides, and its applicability.

The modification of RSA algorithm to adapt fully homomorphic encryption algorithm in cloud computing

Abstract: RSA is Partially homomorphic cryptosystem, based on the features of the RSA algorithm, we design a encryption system, this encryption system firstly discriminates whether the values of the public key and private key generated during the encryption process contain prime number, then combines with the Pascal's triangle theorem and RSA algorithm model and inductive methods to construct a new cryptosystem that meets homomorphic computation of some operations on cihpertexts(e.g., additions, multiplications), Thus the new cryptosystem satisfies fully homomorphic encryption in cloud computing.

Method of a public key encryption and a cypher communication both secure against a chosen-ciphertext attack

Abstract: The public-key encryption method uses the sender-side apparatus (100) by the creator of a ciphertest and creates the ciphertext (y1, y2) of a plaintext x (∈{0, 1}n) in y1 = f (x0klG(r)), y2 = H (x0k1G(r))r with respect to the published trapdoor-equipped unidirectional function f and the random functions G, H. Meanwhile, the receiver of the ciphertext, who has received the ciphertext by the receiver-side apparatus (200) via the communications line (300), performs the decryption processing with the use of f-1, i.e., the secret key, in accordance with the steps inverse to those of the encryption processing.