Compact E-Cash and Simulatable VRFs Revisited

  title={Compact E-Cash and Simulatable VRFs Revisited},
  author={Mira Belenkiy and Melissa Chase and Markulf Kohlweiss and Anna Lysyanskaya},
  journal={IACR Cryptology ePrint Archive},
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 product equations (Eurocrypt 2008) to two related cryptographic problems: compact e-cash (Eurocrypt 2005) and simulatable verifiable random functions (CRYPTO 2007). We present the first efficient compact e-cash scheme that does not rely on a random oracle. To this end we construct efficient GS proofs for signature possession… CONTINUE READING



Citations per Year

72 Citations

Semantic Scholar estimates that this publication has 72 citations based on the available data.

See our FAQ for additional information.