Attribute-based signature (ABS), originally introduced by Maji et al. (CT-RSA\u2711), represents an essential mechanism to allow for fine-grained authentication. A user associated with an attribute $x$ can sign w.r.t. a given public policy $C$ only if his attribute satisfies $C$, i.e., $C(x)=1$. So far, much effort on constructing bilinear map-based ABS schemes have been made, where the state-of-the-art scheme of Sakai et al. (PKC\u2716) supports the very wide class of unbounded circuits as policies. However, construction of ABS schemes without bilinear maps are less investigated, where it was not until recently that Tsabary (TCC\u2717) showed a lattice-based ABS scheme supporting bounded circuits as policies, at the cost of weakening the s...
We present a framework for building practical anonymous credential schemes based on the hardness of ...
International audienceAn accumulator is a function that hashes a set of inputs into a short, constan...
Building cryptographic schemes upon as many fundamentally different hard problems as possible, seems...
Attribute-based signature (ABS), originally introduced by Maji et al. (CT-RSA'11), represents an ess...
Attribute-Based Signature (ABS), introduced by Maji et al. (CT-RSA\u2711), is an advanced privacy-p...
In Attribute-Based Signatures (ABS; first defined by Maji, Prabhakaran and Rosulek, CT-RSA 2011) an ...
Attribute-Based Signatures (ABS) are a versatile cryptographic primitive and have many applications....
Attribute based signature schemes (ABS) constitute important and powerful primitives when it comes t...
Attribute-based signatures, as introduced by Maji et al. [MPR11] allow to generate anonymously a sig...
This paper presents the first attribute-based signature (ABS) scheme supporting signing policies rep...
Designing attribute-based systems supporting highly expressive access policies has been one of the p...
Anonymous authentication schemes such as group signatures and anonymous credentials are important pr...
International audienceAttribute-based cryptography is a natural solution for fine-grained access con...
Attribute based signature (ABS) is a novel cryptographic primitive, which enables a party to sign me...
This paper presents a fully secure (adaptive-predicate unforgeable and private) attribute-based sign...
We present a framework for building practical anonymous credential schemes based on the hardness of ...
International audienceAn accumulator is a function that hashes a set of inputs into a short, constan...
Building cryptographic schemes upon as many fundamentally different hard problems as possible, seems...
Attribute-based signature (ABS), originally introduced by Maji et al. (CT-RSA'11), represents an ess...
Attribute-Based Signature (ABS), introduced by Maji et al. (CT-RSA\u2711), is an advanced privacy-p...
In Attribute-Based Signatures (ABS; first defined by Maji, Prabhakaran and Rosulek, CT-RSA 2011) an ...
Attribute-Based Signatures (ABS) are a versatile cryptographic primitive and have many applications....
Attribute based signature schemes (ABS) constitute important and powerful primitives when it comes t...
Attribute-based signatures, as introduced by Maji et al. [MPR11] allow to generate anonymously a sig...
This paper presents the first attribute-based signature (ABS) scheme supporting signing policies rep...
Designing attribute-based systems supporting highly expressive access policies has been one of the p...
Anonymous authentication schemes such as group signatures and anonymous credentials are important pr...
International audienceAttribute-based cryptography is a natural solution for fine-grained access con...
Attribute based signature (ABS) is a novel cryptographic primitive, which enables a party to sign me...
This paper presents a fully secure (adaptive-predicate unforgeable and private) attribute-based sign...
We present a framework for building practical anonymous credential schemes based on the hardness of ...
International audienceAn accumulator is a function that hashes a set of inputs into a short, constan...
Building cryptographic schemes upon as many fundamentally different hard problems as possible, seems...