## 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.

Author: | Tenos Vumuro |

Country: | Malaysia |

Language: | English (Spanish) |

Genre: | Medical |

Published (Last): | 22 February 2016 |

Pages: | 81 |

PDF File Size: | 2.34 Mb |

ePub File Size: | 6.32 Mb |

ISBN: | 587-2-46288-356-1 |

Downloads: | 29043 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Moran |

We also implement the scheme [ 31 ] for comparison. The challenger runs and sets. We can find that the ciphertext length in our scheme is constant, while it will grow with the amount of attributes involved in access policy linearly. If such a tuple exists, it runs and returns to ; otherwise, it returns. Otherwise, he computes and. If such a tuple exists, it runs algorithm and returns to ; otherwise, it returns.

Bilinear Pairing Definition 1 bilinear map. If such a tuple exists, it sends the transformation key to. To improve efficiency, Green et al. In order to solve this problem, Lai et al. It generates as public parameters and as master secret key. Tables 1 — 3 show that our scheme is efficient.

### Verifiable Outsourced Decryption of Attribute-Based Encryption with Constant Ciphertext Length

Similar to the proof in [ 31 ], the verifiability of our scheme reduces to the discrete logarithm assumption. This algorithm takes, and attribute set as input. Definition 1 bilinear map. In order to improve the witb performance and reduce communication overhead, we propose a new verifiable outsourcing scheme with constant ciphertext length.

We introduce some basic knowledge about bilinear encrypton, security assumption, access structure, and CP-ABE which our scheme relies on. This is an open access article distributed under the Creative Commons Attribution Licensewhich permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This algorithm takes the security parameter and attribute universe as input. The adversary adaptively issues queries. It sends to the adversary.

## Security and Communication Networks

Similar to the decryption algorithm, the time required by transformation grows linearly with the number of attributes for Lai et al. In order to evaluate the efficiency for our scheme, we implement our scheme with java pairing-based cryptography JPBC library [ 36 ], a port lutsourced the pairing-based cryptography PBC library in C [ 37 ]. Our scheme decrpytion verifiable which ensures that the user efficiently checks whether the transformation is done correctly by the CSP.

Table 1 illustrates that the size of private key, ciphertext, and transform key in our scheme is decrypttion. To receive news and publication updates for Security and Communication Networks, enter your email address in the box below.

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. It outputs message or.

Theorem 6 is correct from the two lemmas below. Suppose that there exists an adversary that attacks verifiability of our new scheme at nonnegligible advantage.

He calculates, and. The user only needs to spend less computational overhead to recover the plaintext from simple ciphertext. In order to protect privacy of the user, Han et al. If wins the above game, then can obtain where and are obtained by.

Observe that does not know the actual retrieving key. Thus, we come to a conclusion that the advantage for an adversary in is negligible. Without loss of generality, we suppose that the adversary does not launch transformation key query for attribute setif a private key query about the same attribute set has been issued.

View at Google Scholar R. The challenger chooses and computes. If such attribite-based tuple exists, it returns as the transformation key.

Schemes in [ 3334 ] put forward a good solution to this problem in which the ciphertext length is constant.

### HKU Scholars Hub: Offline/online attribute-based encryption with verifiable outsourced decryption

The advantage for is defined as. The adversary gives a guess for and succeeds in the game if. A decryptor calculates as follows: This algorithm takes, and as input. In order to solve this problem, Goyal et al.