PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
A number of previous papers explored the notion of identity-based group signature. We present a generic construction of identity-based group signatures. Our construction is based o...
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We provide examples of pairing-friendly...
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...