Amortized E-Cash

  • Authors:
  • Moses Liskov;Silvio Micali

  • Affiliations:
  • -;-

  • Venue:
  • FC '01 Proceedings of the 5th International Conference on Financial Cryptography
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an e-cash scheme which provides a trade-off between anonymity and efficiency, by amortizingth e cost of zero-knowledge and signature computation in the cash generation phase.Our work solves an open problem of Okamoto in divisible e-cash. Namely, we achieve results similar to those of Okamoto, but (1) based on traditional complexity assumptions (rather than ad hoc ones), and (2) within a much crisper definitional framework that highlights the anonymity properties, and (3) in a simple fashion.