Paper 2012/641

A unidirectional conditional proxy re-encryption scheme based on non-monotonic access structure

Bin Wang

Abstract

Recently, Fang et al. [6] introduced an interactive(bidirectional) conditional proxy re-encryption(C-PRE) scheme such that a proxy can only convert ciphertexts that satisfy access policy set by a delegator. Their scheme supports monotonic access policy expressed by “OR” and “AND” gates. In addition, their scheme is called interactive since generation of re-encryption keys requires interaction between the delegator and delegatee. In this paper, we study the problem of constructing a unidirectional(non-interactive) C-PRE scheme supporting non-monotonic access policy expressed by “NOT”, “OR” and “AND” gates. A security model for unidirectional C-PRE schemes is also proposed in this paper. To yield a unidirectional C-PRE scheme supporting non-monotonic access policy, we extend the unidirectional PRE scheme presented by Libert et al. [8] by using the ideas from the non-monotonic attributed based encryption (ABE) scheme presented by Ostrovsky et al. [9]. Furthermore, the security of our C-PRE scheme is proved under the modified 3-weak Decision Bilinear Diffie-Hellman Inversion assumption in the standard model.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
jxbin76 @ yahoo cn
History
2012-11-11: received
Short URL
https://ia.cr/2012/641
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/641,
      author = {Bin Wang},
      title = {A unidirectional conditional proxy re-encryption scheme based on non-monotonic access structure},
      howpublished = {Cryptology ePrint Archive, Paper 2012/641},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/641}},
      url = {https://eprint.iacr.org/2012/641}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.