Skip to main navigation Skip to search Skip to main content

Anonymous transferable conditional e-cash

  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present the first anonymous transferable conditional e-cash system based on two recent cryptographic primitives, i.e., the Groth-Sahai(GS) proofs system and the commuting signatures, thus the unlinkability and anonymity of the user is obtained. We solve an open problem by dividing the deposit into two parts, so that the user is unlinkable in the transferrable protocol and the deposit protocol. Comparing the existing conditional e-cash, the size of the computation and communication of our scheme is constant.

Original languageEnglish
Title of host publicationSecurity and Privacy in Communication Networks - 8th International ICST Conference, SecureComm 2012, Revised Selected Papers
Pages45-60
Number of pages16
DOIs
StatePublished - 2013
Event8th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2012 - Padua, Italy
Duration: 3 Sep 20125 Sep 2012

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume106 LNICS
ISSN (Print)1867-8211

Conference

Conference8th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2012
Country/TerritoryItaly
CityPadua
Period3/09/125/09/12

Keywords

  • Groth-Sahai proofs
  • anonymity
  • commuting signatures
  • conditional e-cash
  • transferability

Fingerprint

Dive into the research topics of 'Anonymous transferable conditional e-cash'. Together they form a unique fingerprint.

Cite this