A SECURE WIRELESS PEER TO PEER AUTHENTICATION PROTOCOL USING TRIPLE DECOMPOSITION PROBLEM

Purchase PDF

Published: 2017-12-13

Page: 63-69


ATUL CHATURVEDI *

Department of Mathematics, Pranveer Singh Institute of Technology (PSIT), Kanpur, India.

VARUN SHUKLA

Department of Electronics and Communication, Pranveer Singh Institute of Technology (PSIT), Kanpur, India.

NEELAM SRIVASTAVA

Department of Electronics and Communication, REC, Kannauj, India.

*Author to whom correspondence should be addressed.


Abstract

Identification protocols are vital for secure wireless communication for peer to peer or group communication. Our assumption is that the communication channel is insecure and any intruder can access to it. The intruder can launch various related attacks and it leads to the failure of the cryptographic goals. In this paper, we propose a new identification protocol which can be customized as a money transaction protocol based on the triple decomposition problem. We show that our protocol matches with the necessary security requirements which include completeness, soundness and honest verifier zero knowledge under the assumption that the triple decomposition problem is secure. The proposed scheme is very useful in all those situations where data communication security is highly desired.

Keywords: Braid groups, discrete logarithm problem, identification schemes, secure communication, triple decomposition problem


How to Cite

CHATURVEDI, A., SHUKLA, V., & SRIVASTAVA, N. (2017). A SECURE WIRELESS PEER TO PEER AUTHENTICATION PROTOCOL USING TRIPLE DECOMPOSITION PROBLEM. Asian Journal of Mathematics and Computer Research, 22(2), 63–69. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/1167

Downloads

Download data is not yet available.