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
01 Sep 2008
TL;DR: The construction for hidden-vector encryption from standard complexity assumptions on bilinear groups of prime order is given, which is both payload-hiding and attribute-h hiding meaning that also the privacy of the attribute vector is guaranteed.
Abstract: Predicate encryption schemes are encryption schemes in which each ciphertext Ct is associated with a binary attribute vector and keys Kare associated with predicates. A key Kcan decrypt a ciphertext if and only if the attribute vector of the ciphertext satisfies the predicate of the key. Predicate encryption schemes can be used to implement fine-grained access control on encrypted data and to perform search on encrypted data.
Hidden vector encryption schemes [Boneh and Waters --- TCC 2007] are encryption schemes in which each ciphertext is associated with a binary vector and each key Kis associated with binary vector with "don't care" entries (denoted with i¾?). Key Kcan decrypt ciphertext if and only if and agree for all ifor which $y_i
e \star$.
Hidden vector encryption schemes are an important type of predicate encryption schemes as they can be used to construct more sophisticated predicate encryption schemes (supporting for example range and subset queries).
We give a construction for hidden-vector encryption from standard complexity assumptions on bilinear groups of prime order. Previous constructions were in bilinear groups of composite orderand thus resulted in less efficient schemes. Our construction is both payload-hiding and attribute-hiding meaning that also the privacy of the attribute vector, besides privacy of the cleartext, is guaranteed.
114 citations
TL;DR: This paper proposes a versatile primitive referred to as conditional identity-based broadcast PRE (CIBPRE) and formalizes its semantic security and shows an application of the CIBPRE to secure cloud email system advantageous over existing secure email systems based on Pretty Good Privacy protocol or identity- based encryption.
Abstract: Recently, a number of extended Proxy Re-Encryptions (PRE), e.g. Conditional (CPRE), identity-based PRE (IPRE) and broadcast PRE (BPRE), have been proposed for flexible applications. By incorporating CPRE, IPRE and BPRE, this paper proposes a versatile primitive referred to as conditional identity-based broadcast PRE (CIBPRE) and formalizes its semantic security. CIBPRE allows a sender to encrypt a message to multiple receivers by specifying these receivers’ identities, and the sender can delegate a re-encryption key to a proxy so that he can convert the initial ciphertext into a new one to a new set of intended receivers. Moreover, the re-encryption key can be associated with a condition such that only the matching ciphertexts can be re-encrypted, which allows the original sender to enforce access control over his remote ciphertexts in a fine-grained manner. We propose an efficient CIBPRE scheme with provable security. In the instantiated scheme, the initial ciphertext, the re-encrypted ciphertext and the re-encryption key are all in constant size, and the parameters to generate a re-encryption key are independent of the original receivers of any initial ciphertext. Finally, we show an application of our CIBPRE to secure cloud email system advantageous over existing secure email systems based on Pretty Good Privacy protocol or identity-based encryption.
113 citations
TL;DR: Several weaknesses of this cryptosystem are pointed out and four successful cryptanalytic attacks are described.
113 citations
TL;DR: A discussion and a cryptanalysis of the optical phase-truncated Fourier-transform-based cryptosystem are presented and it is shown that the computing efficiency of the algorithm is improved and the number of iterations is much less than that by the specific attack, which has two iteration loops.
Abstract: A discussion and a cryptanalysis of the optical phase-truncated Fourier-transform-based cryptosystem are presented in this paper. The concept of an optical asymmetric cryptosystem, which was introduced into the optical image encryption scheme based on phase-truncated Fourier transforms in 2010, is suggested to be retained in optical encryption. A new method of attack is also proposed to simultaneously obtain the main information of the original image, the two decryption keys from its cyphertext, and the public keys based on the modified amplitude-phase retrieval algorithm. The numerical results illustrate that the computing efficiency of the algorithm is improved and the number of iterations is much less than that by the specific attack, which has two iteration loops.
112 citations
03 Mar 2013
TL;DR: This work builds an efficient key-policy attribute-based encryption scheme, and proves its security in the selective sense from learning-with-errors intractability in the standard model.
Abstract: We introduce a broad lattice manipulation technique for expressive cryptography, and use it to realize functional encryption for access structures from post-quantum hardness assumptions.
Specifically, we build an efficient key-policy attribute-based encryption scheme, and prove its security in the selective sense from learning-with-errors intractability in the standard model.
111 citations