Paper 2016/242
Attribute-Based Signatures for Circuits from Bilinear Map
Yusuke Sakai and Nuttapong Attrapadung and Goichiro Hanaoka
Abstract
In attribute-based signatures, each signer receives a signing key from the authority, which is associated with the signer's attribute, and using the signing key, the signer can issue a signature on any message under a predicate, if his attribute satisfies the predicate. One of the ultimate goals in this area is to support a wide class of predicates, such as the class of \emph{arbitrary circuits}, with \emph{practical efficiency} from \emph{a simple assumption}, since these three aspects determine the usefulness of the scheme. We present an attribute-based signature scheme which allows us to use an arbitrary circuit as the predicate with practical efficiency from the symmetric external Diffie-Hellman assumption. We achieve this by combining the efficiency of Groth-Sahai proofs, which allow us to prove algebraic equations efficiently, and the expressiveness of Groth-Ostrovsky-Sahai proofs, which allow us to prove any NP relation via circuit satisfiability.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published by the IACR in PKC 2016
- Keywords
- attribute-based signaturesGroth-Sahai proofsGroth-Ostrovsky-Sahai proofs
- Contact author(s)
- yusuke sakai @ aist go jp
- History
- 2016-03-04: received
- Short URL
- https://ia.cr/2016/242
- License
-
CC BY