Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
The BB signature scheme is said to have a signature length as short as the BLS signature, and is also more efficient. The scheme was designed so that the bilinear pairing only needs to be done once during the verification, as compared to the BLS scheme that needs two bilinear pairings.
People also ask
May 9, 2018 · 5 Conclusion. In this paper, we proposed a variant of the BLS signature scheme with a tight security reduction based on the co-CDH assumption.
In this paper, we propose a variant of the BLS signature with tight security reduction based on the co-CDH assumption. Besides upgraded to the notion of strong ...
May 18, 2018 · In this paper, we propose a variant of the BLS signature with tight security reduction based on the co-CDH assumption. Besides upgraded to the ...
A variant of the BLS signature with tight security reduction based on the co-CDH assumption is proposed, upgraded to the notion of strong existential ...
Abstract. We propose and analyze two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model ...
Abstract. A signature scheme is unique if for every public key and message there is only one signature that is accepted as valid by the.
In contrast to this, our reduction in the AGM is tight and hence justifies parameters currently used in practice. To further justify our reliance on the AGM, we ...
Missing: Variant | Show results with:Variant
to key-prefixed multi-user BLS security in the standard model. Finally, we present a tight security reduction for the key-prefixed BGLS scheme in the multi-user.
This idea can be applied to BLS scheme, providing a deterministic signature scheme with a tight reduction. The new scheme can be described as follows:.