IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 2- Issue 5, May 2013 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Multi Message Signcryption Based On Chaos With Public Verifiability

[Full Text]

 

AUTHOR(S)

Aditya Kumar, Mohd Mohiuddin Ansari

 

KEYWORDS

Index Terms: Chaos, Signcryption, Chebyshev polynomial, Hash function, Keyed Hash Function, Encryption, Signature.

 

ABSTRACT

Abstract: Chaos is one type of complex dynamic behaviour generated by determined nonlinear dynamic systems. Dependency on initial conditions and highly unpredictable nature of chaotic signals lead to novel cryptographic applications. Cryptography and chaos have some common features, the most prominent being sensitivity to parameters’ and variables’ changes. This paper focuses on multi-message signcryption schemes based on chaoswith public verifiability. In this paper we purpose two signcryption schemes for single and multiple recipients. The purposed schemes use a chaos based multi-key generator to generate multiple keys for signcryption scheme and are publicly verifiable, highly sensitive to the initial conditions, and provide high security due to its chaotic nature.

 

REFERENCES

[1] M.Toorani, A. Beheshti, “Cryptanalysis of an Elliptic Curve-based Signcryption Scheme,” International Journal of Network Security, Vol.10, No.1, PP.51-56, Jan 2010.

[2] Dalia H. Elkamchouchi: “A Chaotic Public Key Multi-Message Multi-Recipients Signcryption Scheme (CPK-MM-MR-SS),”12th World Multi-Conference on Systemics, Cybernetics and Informatics: (WMSCI), 2008

[3] M. Elkamchouchi, A-A. M. EmarahEsam A. A. Hagras: “Public Key Multi-Message Signcryption (PK-MMS) Scheme For Secure Communication Systems,” Fifth Annual Conference on Communication Networks and Services Research(CNSR), 2007

[4] H. Elkamchouchi, Mohammed Nasr, and R. Ismail, “A New Efficient Multiple Messages Signcryption Scheme with Public Verifiability,” L. Qi (Ed.): FCC 2009, CCIS 34, pp. 193–200, 2009.

[5] Benoit Libert, J- J.Quisquater: “A new identity based signcryption scheme from pairing,” IW2003, Paris, France, March 31 -April 4, 2003, paper 11.3.4, p. 109.

[6] Y. Zheng, H. Imai, “How to construct efficient Signcryption Schemes on elliptic curves,” Proc. of IFIP/SEC’98, Chapman & Hall, 1998

[7] Yuliang Zheng, "Efficient Signcryption Schemes on Elliptic Curves," Advances in cryptology, Vol.10, pp.15-19, 2000.

[8] Yiliang Han, XiaolinGui, “Multi-recipient Signcryption for Secure Group Communication,”Industrial Electronics and Applications, 2009 ICIEA 2009. 4th IEEE conference on, pp. 161-164, 25-27 May 2009

[9] Y. Zheng, “Digital Signcryption or How to Achieve Cost (Signature & Encryption) << Cost (Signature) + Cost (Encryption),” Advances in Cryptology - Crypto’97, LNCS 1294, Springer, pp. 165-179, 1997

[10] Fateman, R.J, “Lookup tables, recurrences, and complexity,” In Proc. Int. Symp. Sym-bolic and Algebraic Computation. ISSAC, pp. 68–73, 1989

[11] Y. Zheng, “Signcryption and its applications in efficient public key solutions,” Proceeding of ISw97, pp. 291-312,1998.

[12] LjupcoKocarev , ShiguoLian (Eds.), Chaos-Based Cryptography, Springer, chapter 2,2011

[13] Xuanwu Zhou, “Improved Signcryption Scheme with Public Verifiability,” Knowledge Engineering and Software Engineering, 2009 (KESE ’09) Pacific Asia Conference on,pp. 178-181, 19-20 Dec. 2009