In this paper, a novel multisignature scheme based on chaotic maps is proposed. The purpose of multisignatures is to manage the complexities of a document signed by numerous signatories. The chaotic system is an encryption method proposed in recent years that has received widespread attention in the field of cryptography. This paper first examines the methods of multisignatures and chaotic maps, and then proposes a multisignature scheme that was designed using chaotic maps. During the processing of a multisignature scheme, to authenticate the precision of the received document, the signatory must first obtain the signed document, and then utilize the characteristics of chaotic maps to recover the original document. If the recovered document is meaningful, this indicates that no errors exist in the signature, thus the signatures are valid and the document can be signed. If the recovered document is not sufficiently clear, signing is denied. At present, because no relevant literature exists that has proposed utilizing chaotic maps to establish a multisignature system; this paper aims to develop a novel research method.
LiC.M., HwangT. and LeeN.Y., Remark on the threshold RSA signature scheme, Advances in Cryptology-CRYPTO’93, Santa Barbara, California (1994), 413–419.
2.
LaihC.S., YangW.C. and ChenC.H., Efficient method for generating strong primes with constraint of bit length, Electronics Letters27(20) (1991), 1807–1808.
3.
DenningD.E., Digital signatures with RSA and other public-key cryptosystem, Communications of the ACM27(4) (1984), 388–392.
4.
DaviesD.W., Applying the RSA digital signature to electronic mail, IEEE Computer Magazine16(2) (1983), 55–62.
5.
XiaoD., ShihF. and LiaoX., A chaos-based hash function with both modification detection and localization capabilities, Commun Nonlinear Sci Numer Simul15(9) (2010), 2254–2261.
6.
BrickellE.F. and McCurleyK.S., An interactive identification scheme based on discrete logarithms and factoring,: pp, Advances in Cryptology-EUROCRYPT’90 Proceeding, Berlin: Springer-Verlag, (1990), 63–71.
7.
DachseltF. and SchwarzW., Chaos and cryptography, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications48(12) (2001), 1498–1509.
8.
ChenG., MaoY. and ChuiC., A symmetric image encryption scheme based on 3D chaotic cat maps, Chaos Solitons Fractals21(3) (2004), 749–761.
9.
SimmonsG.J.Contemporary Cryptology: The Science of Information Integrity, Piscatoway, New York, IEEE Press, 1992.
10.
FridrichJ., Symmetric ciphers based on two-dimensional chaotic maps, International Journal of Bifurcation and Chaos8(6) (1998), 1259–1284.
11.
GordonJ., Strong RSA keys, Electron Letters20 (1984), 514–516.
12.
LiuJ.K., AuM.H. and SusiloW., Self-Generated-Certificate Public Key Cryptography and Certificateless Signature/Encryption Scheme in the Standard Model, In: 2007 ACM Symposium on InformAtion, Computer and Communications Security - ASIACCS’07.
13.
ZhangJ., ChenD., WangY.On the Security of a Digital Signature with Message Recovery Using Self-certified Public Key, Proceedings of the International Conference on Applied Mathematics and Computer Science (AMCOS’05) (2005), 343–346.
14.
ShimK.A., Forgery attacks on the ID-based multisignature scheme without reblocking and predetermined signing order, Computer Standards & Interfaces30 (2008), 121–123.
15.
DavidK.B., The digital signature standard: Overview and current status, Computer & Security12 (1993), 437–446.
16.
ChainK. and KuoW.C., A new digital signature scheme based on chaotic maps, Nonlinear Dynamics74(4) (2013), 1003–1012.
17.
ChainK., KuoW.C. and ChangK.H., Enhancement key agreement scheme based on chaotic maps, International Journal of Computers and Applications37(2) (2015), 67–72.
18.
ItakuraK. and NakamuraK., A public-key cryptosystem suitable for digital multisignatures, NEC Research and Development71 (1983), 1–8.
19.
OhtaK. and OkamotoT., A digital multisignature scheme based on the Fiat-Shamir scheme, pp, Advances in Cryptology-ASIACRYPT’91, International Conference on the Theory and Application of Cryptology ProceedingsFujiyoshida, Japan, Springer-Verlag1991, pp. 139–148.
20.
WongK.W., A fast chaotic cryptographic scheme with dynamic look up table, Physics Letters A298(4) (2002), 238–242.
21.
HarnL. and KieslerT., New scheme for digital multisignatures, Electronics Letters25(15) (1989), 1002–1003.
22.
HarnL., New digital signature scheme based on discrete logarithms, Electronic Letts30(5) (1994), 396–398.
23.
HarnL., Digital multi-signature with distinguished signing authorities, Electronics Letters35 (1999), 294–295.
24.
HarnL. and RenJ., Efficient identity-based RSA multisignatures, Computers and Security27 (2010), 12–15.
25.
KocarevL., Chaos-based cryptography: A brief overview, IEEE Circuits and Systems Magazine1(3) (2001), 6–21.
26.
BellareM. and NevenG., Identity-based multi-signatures from RSA, Proceedings of the Topics in cryptology CTRSA, LNCS2007 (4377), 145–162.
27.
OgiwaraM., A method for generating cryptographically strong primes, Transactions IEICEE73 (1990), 985–994.
28.
RivestR.L., ShamirA. and AdelmanL.M., A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM21(2) (1978), 120–126.
29.
Al-RiyamiS. and PatersonK., Certificateless public key cryptography, In: Proceedings of the Asiacrypt’03, LNCS 2894, Springer Verlag, 2003, pp. 452–473.
30.
DengS., LiY. and XiaoD., Analysis and improvement of a chaos-based Hash function construction, Commun Nonlinear Sci Numer Simul15(5) (2010), 1338–1347.
31.
IslamS.H. and BiswasG.P., Certificateless short sequential and broadcast multisignature schemes using elliptic curve bilinear pairings, Journal of King Saud University - Computer and Information Sciences26 (2014), 89–97.
32.
JyeS., A speech encryption using fractional chaotic systems, Nonlinear Dynamics65 (2011), 103–108.
33.
MitomiS. and MiyajiA., A Multisignature Scheme with Message Flexibility, Order Flexibility and Order Verifiability, Proceedings of the 5th Australasian Conference on Information Security and Privacy (ACISP 2000), Spring-Verlag, 2000, pp. 98–312.
34.
MicaliS., OhtaK. and ReyzinL., Accountable-subgroup multisignatures: Extended abstract, Proceedings of the ACM Conference on Computer and Communications Security 2001 (CCS2001), ACM press, 2001, pp. 245–254.
35.
ElGamalT., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transaction on Information TheoryIT-31(4) (1985), 469–472.
36.
OkamotoT., FujikaA., FujisakiE.An efficient digital signature scheme based on an Elliptic curve over the ring Zn Crypto’92, Santa Barbara, California, 1992, pp. 54–65.
37.
OkamotoT., A digital multisignature scheme using bijective public-key cryptosystems, ACM Transactions on Computer Systems6(4) (1988), 432–441.
38.
BiaoW., XiaodongY. and GuangY., An Identity Based Multisignature Scheme from the Weil Pairing, Proceedings of the International Conference on Computer Design and Applications5 (2010), 585–587.
39.
DiffieW. and HellmanM.E., New directions in cryptography, IEEE Transactions on Information TheoryIT-22(6) (1976), 644–654.
40.
GuiW.X. and ZhangX.P., ID-based designed-verifier multisignature without trusted PKG, Proceedings of the Third International Conference on Information and Computing, 2010, pp. 213–215.
41.
WangX., YangL. and LiuR., A chaotic image encryption algorithm based on perceptron model, Nonlinear Dynamics62 (2010), 615–621.
42.
WangX., WangX. and ZhaoJ., Chaotic encryption algorithm based on alternant of stream cipher and block cipher, Nonlinear Dynamics63 (2011), 587–597.
43.
ChungY.F., HuangK.H., LaiF. and ChenT.S., ID-based digital signature scheme on the elliptic curve cryptosystem, Computer Standards and Interfaces29 (2000), 601–604.
44.
TanZ., A chaotic maps-based authenticated key agreement protocol with strong anonymity, Nonlinear Dynamics72(1-2) (2013), 311–320.
