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.

New Ciphertext-Policy Attribute-Based Encryption with Efficient Revocation

Abstract: Attribute-based encryption (ABE) is getting popular for its fine-grained access control in cloud computing. However, dynamic user or attribute revocation is a challenge in original ABE schemes. To address this issue, a new cipher text-policy ABE scheme with efficient revocation is proposed. In the new scheme, the master key is randomly divided into generating the secret key and delegation key, which are sent to the user and the cloud service provider, respectively. In our proposed scheme, the authority removes user's attribute without affecting other users' access privileges with this attribute. Finally, the scheme is proven selectively-structure chosen plaintext attack secure under the decisional q-Parallel Bilinear Diffie-Hellman Exponent (q-PBDHE) assumption. Compared with some existing schemes, our scheme has the lower storage overhead and communication cost.

Cryptanalysis of the Smart-Vercauteren and Gentry-Halevi's Fully Homomorphic Encryption.

Abstract: For the fully homomorphic encryption schemes in [3, 6], this paper presents attacks to solve an equivalent secret key and directly recover plaintext from ciphertext for lattice dimensions n=2048 with lattice reduction algorithm. Given the average-case behavior of LLL in [8] is true, then their schemes are also not secure for n=8192.

Cryptanalysis of a new chaotic cryptosystem based on ergodicity

Abstract: This paper analyzes the security of a recent cryptosystem based on the ergodicity property of chaotic maps. It is shown how to obtain the secret key using a chosen-ciphertext attack. Some other design weaknesses are also shown.

A Synopsis of Format-Preserving Encryption

Abstract: Format-preserving encryption (FPE) encrypts a plaintext of some specified format into a ciphertext of the same format—for example, encrypting a social-security number into a social-security number. In this survey we describe FPE and review known techniques for achieving it. These include FFX, a recent proposal made to NIST.

A ciphertext-policy attribute-based proxy re-encryption scheme for data sharing in public clouds

Abstract: Ciphertext-policy attribute-based proxy re-encryption CP-ABPRE extends the traditional Proxy Re-Encryption PRE by allowing a semi-trusted proxy to transform a ciphertext under an access policy to another ciphertext with the same plaintext under a new access policy ie, attribute-based re-encryption The proxy, however, learns nothing about the underlying plaintext CP-ABPRE has many real world applications, such as fine-grained access control in cloud storage systems and medical records sharing among different hospitals All the existing CP-ABPRE schemes are leaving chosen-ciphertext attack CCA security as an interesting open problem This paper, for the first time, proposes a new CP-ABPRE scheme to tackle the problem The new scheme supports attribute-based re-encryption with any monotonic access structures Despite being constructed in the random oracle model, our scheme can be proven CCA secure under the decisional q-parallel bilinear Diffie-Hellman exponent assumption Copyright © 2014 John Wiley & Sons, Ltd