ATTRIBUTE-BASED ENCRYPTION WITH VERIFIABLE OUTSOURCED DECRYPTION PDF
PDF | Outsourced decryption ABE system largely reduces the computation cost for users who intend to access the encrypted files stored in. Request PDF on ResearchGate | Attribute-Based Encryption With Verifiable Outsourced Decryption | Attribute-based encryption (ABE) is a public-key-based. , IRJET | Impact Factor value: | ISO Certified Journal | Page Attribute-Based Encryption with Verifiable Outsourced Decryption.
|Published (Last):||20 July 2016|
|PDF File Size:||5.29 Mb|
|ePub File Size:||2.18 Mb|
|Price:||Free* [*Free Regsitration Required]|
The redundant information is mainly used to design a CP-ABE scheme with verifiable outsourcing decryption from [ 33 ], which has been proven to be selectively CPA-secure. If the adversary is able to distinguish and at nonnegligible advantage, then we find an algorithm which attacks the scheme [ 33 ] under the selective CPA security model at nonnegligible advantage.
If such a tuple exists, it sends the transformation key to. Figure 4 shows that the times of the outsourcing decryption algorithm in PC and mobile phone for two schemes are nearly same. View at Google Scholar Z.
Verifiable Outsourced Decryption of Attribute-Based Encryption with Constant Ciphertext Length
View at Google Scholar R. Briefly speaking, a user interacts with the CSP attribuye-based illustrated in Figure 1. Access Structure Access structure is being referred to in [ 33 ]; we utilize AND gates with respect to multivalued attributes as follows.
Several traceable CP-ABE schemes [ 20 — 22 ] were constructed to trace the identity of a misbehaving user who leaks its decryption key to others and thus reduces the trust assumptions on both users and attribute authorities. Suppose is a generator in.
Security and Communication Networks
The first two elements are ciphertexts for message and random messagerespectively, utilizing the encryption algorithm [ 33 ]. Furthermore, they [ 19 ] proposed a privacy-preserving personal health decrypttion using multiauthority ABE with revocation.
It returns to and keeps secret. In this process, the CSP does not get any information about original plaintext. Similar to the proof in [ 31 ], the verifiability of our scheme reduces to the discrete logarithm assumption.
With the cloud service being more and more popular in modern outsourcee, ABE technology has become a promising orientation.
Lemma 8 shows that the advantage for an adversary in is negligible. Finally, we conclude the paper in Section 6. Security and Communication Networks. The adversary gives a guess for and succeeds in the game if. Compared with the scheme in [ 111231 ], the computational overhead for the decryption and transformation operations in our scheme is much smaller.
As knowsit can answer the queries properly. However, the size of private key, ciphertext, and transform key in [ 111231 ] depends upon the number of attributes.
It outputs transformation key associated with and a corresponding retrieving key. The master secret key is. Outsourced decryption ABE system largely reduces the computation cost for users who intend to access the encrypted files stored in cloud. The computational overhead for the decryption and transformation operations in our scheme is constant, which does not rely on the amount of attributes.
It generates as public parameters and as master secret key. By using the proxy reencryption technology, outsourced decryption ABE system can largely reduce the computation cost for users who intend to access the encrypted files stored in cloud. Given a ciphertext and a transformation key, CSP transforms a ciphertext into a simple ciphertext.
Our scheme is verifiable which ensures that the user efficiently checks whether the transformation is done correctly by the CSP. We also give the security definitions used in our paper in this section.
Assume that is an attribute universe. In order to solve this problem, Goyal et al. Thus, getswhich breaks the DL assumption.
HKU Scholars Hub: Offline/online attribute-based encryption with verifiable outsourced decryption
This theorem is proven via the following lemmas. Given the transformation key, the CSP transforms an ABE ciphertext into a simple ciphertext, from which the user recovers plaintext by using less computation overhead. Definition 2 discrete logarithm DL assumption [ 31 ].
In this article, we propose a new verifiable outsourced CP-ABE scheme with constant ciphertext length and, moreover, we prove that our scheme is secure and verifiable in standard model. Definition 1 bilinear map. Access structure is being referred to in [ 33 ]; we utilize AND gates with respect to multivalued attributes as follows.
Verifiablee be the challenger with respect to of the scheme [ 33 ]. To improve vverifiable, Green et al.
An encryptor randomly selects. Observe that does not know the actual retrieving key.
It outputs if associated with satisfies. It is described by the seven algorithms as follows.