Paper 2013/342

Attribute-Based Encryption for a Subclass of Circuits with Bounded Depth from Lattices

Xiang Xie and Rui Xue

Abstract

In this work, we present two Key-Policy Attribute-Based Encryption (ABE) schemes for some subclass of circuits based on the Learning with Error (LWE) assumption. Our constructions are selectively secure in the standard model. More specifically, our first construction supports a subclass of circuits with polynomially bounded depth. We call this subclass the OR-restricted circuits which means that for any input $x$, if $f(x)=0$ then for all the OR gates in $f$, at least one of its incoming wires will evaluate to $0$. The second one is a Key-Policy ABE scheme for shallow circuits whose depth is bounded by $O(\log\log\lambda)$, where $\lambda$ is the security parameter.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Functional EncryptionAttribute-Based EncryptionLattices
Contact author(s)
xiexiangiscas @ gmail com
History
2013-06-09: received
Short URL
https://ia.cr/2013/342
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/342,
      author = {Xiang Xie and Rui Xue},
      title = {Attribute-Based Encryption for a Subclass of Circuits with Bounded Depth from Lattices},
      howpublished = {Cryptology ePrint Archive, Paper 2013/342},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/342}},
      url = {https://eprint.iacr.org/2013/342}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.