32 search results - page 4 / 7 » Secure Delegation of Elliptic-Curve Pairing |
CHES
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations...
IWSEC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Pairing-based cryptography (PBC) has enabled the construction of many cryptographic protocols. However, there are scenarios when PBC is too heavyweight to use, such as wh...
WAIFI
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
DCC
2010
IEEE
13 years 7 months ago
2010
IEEE
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...
ASIACRYPT
2005
Springer
14 years 18 days ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...