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

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_4 ◽

2017 ◽

pp. 61-90 ◽

Cited By ~ 1

Author(s):

David Pointcheval ◽

Olivier Sanders ◽

Jacques Traoré

Download Full-text