- 期刊
Blind Collective Signature Protocol Based on Discrete Logarithm Problem
並列摘要
Using Schnorr's digital signature (DS) scheme as the underlying scheme there is designed the collective DS protocol. In the proposed collective DS protocol the signature is formed simultaneously by all signers, therefore using this protocol leads to natural solution of the problem of signing simultaneously a contract. Using the proposed collective DS protocol the blind collective DS protocol has been designed, which is a new type of the multi-signature schemes. For simultaneous signing a package of different contracts by different sets of signers it is proposed another new multi-signature scheme called composite signature.
延伸閱讀
- Fan, C. I., & Lei, C. L. (2002). A User Efficient Fair Blind Signature Scheme for Untraceable Electronic Cash. Journal of Information Science and Engineering, 18(1), 47-58. https://doi.org/10.6688/JISE.2002.18.1.5
- Verma, G. K. (2011). Probable Security Proof of a Blind Signature Scheme over Braid Groups. International Journal of Network Security, 12(2), 118-120. https://doi.org/10.6633/IJNS.201103.12(2).06
- Srinath, M. S., & Chandrasekaran, V. (2018). Isogeny-based Quantum-resistant Undeniable Blind Signature Scheme. International Journal of Network Security, 20(1), 9-18. https://doi.org/10.6633/IJNS.201801.20(1).02
- Rasslan, M. M. (2011). A Stamped Hidden-signature Scheme Utilizing The Elliptic Curve Discrete Logarithm Problem. International Journal of Network Security, 13(1), 49-57. https://doi.org/10.6633/IJNS.201107.13(1).06
- Hu, X. M., & Huang, S. T. (2010). Secure Identity-Based Blind Signature Scheme in the Standard Model. Journal of Information Science and Engineering, 26(1), 215-230. https://doi.org/10.6688/JISE.2010.26.1.15