Group blind digital signatures: A scalable solution to electronic cash-Reference-Cited by-同舟云学术

Group blind digital signatures: A scalable solution to electronic cash

Published:1998 Issue: Volume: Page:184-197
ISSN:0302-9743
Container-title:Financial Cryptography
language:
Short-container-title:

Author:

Lysyanskaya Anna,Ramzan Zulfikar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055483

Reference21 articles.

1. Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62–73, Fairfax, 1993. ACM.

2. Stefan Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI, April 1993.

3. Jan Camenisch. Efficient and generalized group signatures. In Proc. EUROCRYPT 97, pages 465–479. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1233.

4. Jan Camenisch, Ueli Maurer, and Markus Stadler. Digital payment systems with passive anonymity-revoking trustees. Journal of Computer Security, 5(1), 1997.

5. Jan Camenisch and Markus Stadler. Efficient group signatures for large groups. In Proc. CRYPTO 97, pages 410–424. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1294.

Cited by 85 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A survey on lattice-based digital signature;Cybersecurity;2024-04-01

2. A public-key quantum group blind signature scheme based on single-qubit rotations;Laser Physics Letters;2024-01-24

3. A dynamic quantum group blind signature scheme based on four-particle cluster state;Quantum Information Processing;2023-03-22

4. An Efficient Group Signature Scheme Based on ECDLP;Proceedings of International Conference on Data Science and Applications;2023

5. A Privacy-Aware Electricity Consumption Data Collection Model Based on Group Blind Signature;Security and Communication Networks;2022-05-19