Given a ciphertext
CT along with a description of access policy A = ([M.
Then the sender encrypts SK with receiver's ID to generate the ciphertext
C, and the receiver decrypts C with the private key dID issued by the PKG.
In this paper, we build our solution based on a probabilistic public-key cryptosystem that supports rerandomization of a ciphertext
, and the threshold decryption.
Identity-Based Broadcast Encryption with Constant Size Ciphertexts
and Private Keys.
In this case, any possible encryption/decryption oracle is destroyed, and the best that an attacker can do, short of finding a way to recorrelate the data with plaintext by breaking into internal databases, is to examine the ciphertext
We may reason that all the ciphertexts
from A are different, since each of them includes a fresh challenge.
This takes two plaintext vectors and outputs two ciphertext
Thus, users' secret key components generated by CP-ABE scheme cannot be colluded to decrypt the ciphertexts
which beyond the privileges of users.
achieves an efficient access control mechanism using Constant-size Ciphertext
Policy Comparative Attribute-Based Encryption (CCP-CABE) with the support of negative attributes and wildcards.
An AE scheme allows the signer to produce an authenticated ciphertext
such that only the designated recipient has the ability to recover the message and verify its signature.
We should note that unlike the one-time pad model , the receiver does not need to have any knowledge about the random backgrounds in order to decipher the ciphertexts
8] in 2014, where ciphertexts
must be accessed by a data owner's access control policy, and predicate encryption  was a generalized notion for public key encryption that enables one to encrypt attributes as well as a message.