Multisignature Protocols and Problem of Simultaneous Signing a Package of Contracts
Electronic messages authentication is an issue of significant importance for geographical information systems (GIS). In some cases the multisignature protocols can be effectively applied to solve efficiently special information authentication problems in GIS. New multisignature protocols based on the discrete logarithm problem in finite groups are introduced. The protocols are based on digital signature schemes over multiplicative groups of the ground finite fields, elliptic curves (EC), and vector groups, the last being a new cryptographic primitive. The protocols provide generation of the collective digital signature (DS) possessing internal integrity. Nobody participating in the protocol is able to form a valid collective DS that corresponds to reduced number of the signers. Besides, the collective DS of some special type can prove that a package of documents is signed by different sets of signers, and moreover the collective DS is formed simultaneously by all signers. Therefore the protocols solve the well-known problem of simultaneous signing a contract as well as they solve the more difficult problem of simultaneous signing a package of contracts. The paper considers applicability of the known DS standards to implement the proposed protocols.
KeywordsDigital signature Collective digital signature Discrete logarithm problem multisignature schemes Public key Finite group
Unable to display preview. Download preview PDF.
- 1.Boldyreva A (2003) Efficient Threshold Signature, Multisignature and Blind Signature Shemes Based on the Gap-Diffi-Hellman-Group Signature Sheme. vol 2139, Springer, Heidelberg, pp 31–46Google Scholar
- 2.Min-Shiang Hwang, Cheng-Chi Lee (2005) Research Issues and Challenges for Multiple Digital Signatures. J International Journal of Network Security 1: 1–7Google Scholar
- 3.Minh NH, Moldovyan NA, Minh NL (2008) New Multisignature Protocol Based on Randomized Signature Algorithms. In: 2008 IEEE International Conference on Research, Innovation and Vision for the Future in computing & Communication Technologies. University of Science. Vietnam National University, Ho Chi Minh CityGoogle Scholar
- 4.Schneier B (1996) Applied Cryptography. Second Edition. John Wiley & Sons, Inc. New YorkGoogle Scholar
- 5.. GOST R 34.10-94 (1994) Russian Federation Standard. Information Technology. Cryptographic data Security. Produce and check procedures of Electronic Digital Signature based on Asymmetric Cryptographic Algorithm. Government Committee of the Russia for Standards (in Russian)Google Scholar
- 6.. GOST R 34.10-2001 (2001) Russian Federation Standard. Information Technology. Cryptographic data Security. Produce and check procedures of Electronic Digital Signature. Government Committee of the Russia for Standards (in Russian)Google Scholar
- 9.Miller V (1986) Use of elliptic curves in cryptography, Advances in cryptology. In: Proceedings of Crypto';85, vol 218, Springer, Heidelberg pp 417–426Google Scholar
- 10.Moldovyan NA, Moldovyan AA (2009) Vector Finite Groups as Primitives for Fast Digital Signature Algorithms Springer. In: 4th Int. Workshop IF&GIS'09 Russia, St.Petersburg, Springer, HeidelbergGoogle Scholar