I. J. of Electrical & Electronics Research
Research Article | 
A New Fail-Stop Group Signature over Elliptic Curves Secure against Computationally Unbounded Adversary
Author(s) : Namita Tiwari1, Mayur Rahul2, Rati Shukla3, Devvrat Tyagi4 and Ayushi Prakash5
Published In : International Journal of Electrical and Electronics Research (IJEER) Volume 10, Issue 2 , Special Issue on RDCTML
Publisher : FOREX Publication
Published : 22 May 2022
e-ISSN : 2347-470X
Page(s) : 150-153
Abstract
If an adversary has unlimited computational power, then signer needs security against forgery. Fail Stop signature solves it. If the motive of the signature is to hide the identity of the signer who makes signature on behalf of the whole group then solution is Group signature. We combine these two features and propose “A new Fail Stop Group Signature scheme (FSGSS) over elliptic curves”. Security of our proposed FSGSS is based on “Elliptic curve discrete logarithm problem” (ECDLP). Use of elliptic curve makes our proposed FSGSS feasible to less bandwidth environment, Block chains etc. Due to security settings over elliptic curves, efficiency of proposed scheme increases in terms of computational complexity.
Keywords: ID based Public key cryptography, Group signature, Fail Stop Signature, Elliptic Curve Cryptography
Namita Tiwari, Department of Mathematics, School of Sciences, C.S.J.M. University Kanpur, U.P. India; Email: namita.mnnit@gmail.com
Mayur Rahul, Department of Computer Application, UIET, C.S.J.M. University Kanpur, U.P. India
Rati Shukla, GIS Cell, MNNIT Prayagraj, U.P. India
Devvrat Tyagi, ABES Engineering College, Ghaziabad, U.P. India
Ayushi Prakash, ABES Engineering College, Ghaziabad, U.P. India
[1] Jonathan Jen-Rong Chen, Yi-Yuan Chiang, Wang-Hsin Hsu, and Wen-Yen Lin, Fail-Stop Group Signature Scheme, Security and Communication Networks, 2021, https://doi.org/10.1155/2021/6693726.[Cross Ref]
[2] M.Rahul, N.Kohli, R.Agarwal, Facial Expression Recognition using Local Multidirectional Score Pattern Descriptor and Modifid Hidden Markov Model International Journal of Advanced Intelligence Paradigm(Inderscience),Vol.18,No. 4, 2021.[Cross Ref]
[3] V.Yadav, M.Rahul, R.Yadav ,A New Efficient Method for the Detection of Intrusion in 5G and beyond Networks using ML Journal of Scientific and Industrial Research.,80.,60-65,Jan 2021.[Cross Ref]
[4] V.Yadav, M.Rahul, R.Shukla A New Improved Approach for Feature Generation and Selection in Multi- Relational Statistical Modelling using ML Journal of Scientific and Industrial Research, 79, 1095-1100, Dec 2020.[Cross Ref]
[5] M. Rahul, N. Kohli, R. Agarwal, Facial Expression Recognition using Local Binary Patterns and Modified Hidden Markov Model International Journal of Advanced Intelligence Paradigm (Inder-science), Volume 17, No 3/4, 2020.[Cross Ref]
[6] Y. Cao, Decentralized group signature scheme based on block-chain, Proceedings of the 2019 International Conference on Communications, Information System And Computer Engineering (CISCE), Haikou, China, July 2019.[Cross Ref]
[7] Sun, Y., Liu, Y. & Wu, B. An efficient full dynamic group signature scheme over ring. Cybersecurity 2, 21 https://doi.org/10.1186/s42400-019-0037-8, 2019.[Cross Ref]
[8] Ling, S, Nguyen K, Wang H, Xu Y, Lattice-based group signatures: achieving full dynamicity with ease. In: Gollmann D, Miyaji A, Kikuchi H (eds) Proceedings of Conference ACNS: 10-12 July 2017; Kanazawa, 293–312. Springer, Beilin Heidelberg 2017.[Cross Ref]
[9] Libert, B, Ling S, Nguyen K, Wang H (2016b) Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. In: Fischlin M Coron JS (eds) Proceedings of Conference EUROCRYPT: 8-12 May 2016; Vienna, 1–31, Springer, Beilin Heidelberg, 2016.[Cross Ref]
[10] Bootle, J, Cerulli A, Chaidos P, Ghadafi E, Groth J (2016) Foundations of fully dynamic group signatures. In: Manulis M, Sadeghi AR, Schneider S (eds) Proceedings of Conference ACNS: 19-22 June 2016; Guildford, 117–136. Springer, Beilin Heidelberg, 2016.[Cross Ref]
[11] The Certicom Corporation, SEC 2: Recommended Elliptic Curve Domain Parameters, www:secg:org=collateral=sec2f inal:pdf.[Cross Ref]
[12] Shamus Software Ltd., Miracl library, http://www.shamus.ie/index.php?page=home.
[13] Tiwari N, Padhye S, Provable secure proxy signature scheme without bilinear pairings. Int. J. Commun. Syst. (2011), DOI: 10.1002/dac.1367.[Cross Ref]
[14] Neal Koblitz: A Course in Number Theory and Cryptography, Springer Verlag Berlin, 1994.[Cross Ref]
[15] David Chaum: Group Signatures, Advances in Cryptology- EUROCRYPT'91, LNCS 547, pp. 257-265, 1991. Q Springer-Verlag Berlin Heidelberg 1991.[Cross Ref]
[16] Michael Waidner and Birgit P.: The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability, Advances in Cryptology EUROCRYPT '89, LNCS 434, Springer Verlag, p. 690, 1989.[Cross Ref]
Namita Tiwari, Mayur Rahul, Rati Shukla, Devvrat Tyagi and Ayushi Prakash (2022), A New Fail-Stop Group Signature over Elliptic Curves Secure against Computationally Unbounded Adversary. IJEER 10(2), 150-153. DOI: 10.37391/IJEER.100217.