Scalable Divisible E-cash

DOI10.1007/978-3-319-28166-7_14zbMath1459.94102OpenAlexW2294943399WikidataQ56920960 ScholiaQ56920960MaRDI QIDQ2794505

Jacques Traoré, Sébastien Canard, Olivier Sanders, David Pointcheval

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28166-7_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash ⋮ Scalable Divisible E-cash

Cites Work

• Pairings for cryptographers
• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Scalable Divisible E-cash
• Divisible E-Cash Made Practical
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Universal Electronic Cash
• Divisible E-Cash in the Standard Model
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Compact E-Cash
• Pairing-Friendly Elliptic Curves of Prime Order
• Divisible E-Cash Systems Can Be Truly Anonymous
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scalable Divisible E-cash