Compact e-cash from bounded accumulator

Man Ho Allen Au, Qianhong Wu, Willy Susilo, Yi Mu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

30 Citations (Scopus)

Abstract

Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different approach. We construct compact e-cash schemes from bounded accumulators. A bounded accumulator is an accumulator with a limit on the number of accumulated values. We show a generic construction of compact e-cash schemes from bounded accumulators and signature schemes with certain properties and instan-tiate it using an existing pairing-based accumulator and a new signature scheme. Our scheme revokes the secret key of the double-spender directly and thus supports more efficient coin tracing. The new signature scheme has an interesting property that is has the message space of a cyclic group G1equipped with a bilinear pairing, with efficient protocol to show possession of a signature without revealing the signature nor the message. We show that the new scheme is secure in the generic group model. The new signature scheme may be of independent interest.
Original languageEnglish
Title of host publicationTopics in Cryptology
Subtitle of host publicationCT-RSA 2007 - The Cryptographers Track at the RSA Conference 2007, Proceedings
PublisherSpringer Verlag
Pages178-195
Number of pages18
ISBN (Print)9783540693277
Publication statusPublished - 1 Jan 2007
Externally publishedYes
EventCryptographers Track at the RSA Conference, CT-RSA 2007 - San Francisco, United States
Duration: 5 Feb 20079 Feb 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4377 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceCryptographers Track at the RSA Conference, CT-RSA 2007
CountryUnited States
CitySan Francisco
Period5/02/079/02/07

Keywords

  • Bilinear pairings
  • Bounded accumulator
  • Compact e-cash

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this