62 search results - page 1 / 13 » Groth-Sahai Proofs Revisited |
PKC
2010
Springer
14 years 2 months ago
2010
Springer
ACNS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...
AFRICACRYPT
2010
Springer
14 years 5 months ago
2010
Springer
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
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...
IACR
2011
12 years 10 months ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...