Compact E-Cash from Bounded Accumulator

DOI10.1007/11967668_12zbMath1177.94179OpenAlexW2129769253MaRDI QIDQ5385952

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

Publication date: 17 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11967668_12

zbMATH Keywords

bilinear pairingsbounded accumulatorcompact e-cash

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

An Efficient Privacy-Preserving E-coupon System ⋮ Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors

This page was built for publication: Compact E-Cash from Bounded Accumulator