Attribute-based signature (ABS) is a versatile cryptographic primitive that allows a user possessing a set of attributes from the trusted authority to sign a message with fine-grained control over the identifying information, and the signature will reveal nothing no more than the fact that the attributes of the signer satisfy the? predicate with respect to the message. In this paper, we introduce a fully secure and efficient attribute-based signature for inner-product (IP) predicate from lattice assumptions in the random oracle model, in which the admissible IP predicate is more general in contrast to those of the existing lattice-based constructions. More precisely, the proposed scheme is the first attribute-based signature from lattices to support conjunctions, disjunctions, threshold predicates, polynomial evaluations, and CNF/DNF formulas.
展开▼
