Comparing two pairing-based aggregate signature schemes
S Chatterjee, D Hankerson, E Knapp… - Designs, Codes and …, 2010 - Springer
Designs, Codes and Cryptography, 2010•Springer
Abstract In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-
secure aggregate signature scheme. Their scheme uses bilinear pairings and their security
proof is in the random oracle model. The first pairing-based aggregate signature scheme
which has a security proof that does not make the random oracle assumption was proposed
in 2006 by Lu, Ostrovsky, Sahai, Shacham and Waters (LOSSW). In this paper, we compare
the security and efficiency of the BGLS and LOSSW schemes when asymmetric pairings …
secure aggregate signature scheme. Their scheme uses bilinear pairings and their security
proof is in the random oracle model. The first pairing-based aggregate signature scheme
which has a security proof that does not make the random oracle assumption was proposed
in 2006 by Lu, Ostrovsky, Sahai, Shacham and Waters (LOSSW). In this paper, we compare
the security and efficiency of the BGLS and LOSSW schemes when asymmetric pairings …
Abstract
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the random oracle model. The first pairing-based aggregate signature scheme which has a security proof that does not make the random oracle assumption was proposed in 2006 by Lu, Ostrovsky, Sahai, Shacham and Waters (LOSSW). In this paper, we compare the security and efficiency of the BGLS and LOSSW schemes when asymmetric pairings derived from Barreto–Naehrig (BN) elliptic curves are employed.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果