Paper Info
Title
Short pairing-efficient threshold-attribute-based signature
Abstract
In this paper, we construct a new threshold-attribute-based signature (t-ABS) scheme that is significantly more efficient than all previous t-ABS schemes. The verification algorithm requires the computation of only 3 pairing operations, independently of the attribute set of the signature, and the size of the signature is also independent of the number of attributes. The security of all our schemes is reduced to the computational Diffie-Hellman problem. We also show how to achieve shorter public parameters based on the intractability of computational Diffie-Hellman assumption in the random oracle model.
Year
DOI
Venue
2012
10.1007/978-3-642-36334-4_19
Pairing
Keywords
Field
DocType
short pairing-efficient threshold-attribute-based signature,verification algorithm,new threshold-attribute-based signature,previous t-abs scheme,computational diffie-hellman problem,pairing operation,random oracle model,shorter public parameter,computational diffie-hellman assumption
ElGamal signature scheme,Attribute based signature,Merkle signature scheme,Algorithm,Random oracle,Theoretical computer science,Pairing,Hash function,Mathematics,Computation,Schnorr signature
Conference
Citations 
PageRank 
References 
16
0.64
10
Authors
3
Name
Order
Citations
PageRank
Martin Gagné11276.25
Shivaramakrishnan Narayan21327.27
Reihaneh Safavi-Naini32378257.74