Compact E-Cash and Simulatable VRFs Revisited

  • Mira Belenkiy
  • Melissa Chase
  • Markulf Kohlweiss
  • Anna Lysyanskaya
Conference paper

DOI: 10.1007/978-3-642-03298-1_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5671)
Cite this paper as:
Belenkiy M., Chase M., Kohlweiss M., Lysyanskaya A. (2009) Compact E-Cash and Simulatable VRFs Revisited. In: Shacham H., Waters B. (eds) Pairing-Based Cryptography – Pairing 2009. Pairing 2009. Lecture Notes in Computer Science, vol 5671. Springer, Berlin, Heidelberg

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 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, pseudo randomness and set membership. The GS proofs for pseudorandom functions give rise to a much cleaner and substantially faster construction of simulatable verifiable random functions (sVRF) under a weaker number theoretic assumption. We obtain the first efficient fully simulatable sVRF with a polynomial sized output domain (in the security parameter).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Mira Belenkiy
    • 1
  • Melissa Chase
    • 1
  • Markulf Kohlweiss
    • 2
  • Anna Lysyanskaya
    • 3
  1. 1.Microsoft ResearchUSA
  2. 2.KU Leuven, ESAT-COSIC / IBBTBelgium
  3. 3.Brown UniversityUSA

Personalised recommendations