A Strong Designated Verifiable DL Based Signcryption Scheme

Sujata Mohanty,Banshidhar Majhi 한국정보처리학회 2012 Journal of information processing systems Vol.8 No.4

A Novel Fair Tracing E-Cash System based on Elliptic Curve Discrete Logarithm Problem

Jayaprakash Kar,Banshidhar Majhi 보안공학연구지원센터 2009 International Journal of Security and Its Applicat Vol.3 No.4

IDMMAC: Interference Aware Distributed Multi-Channel MAC Protocol for WSAN

Kakarla, Jagadeesh,Majhi, Banshidhar,Battula, Ramesh Babu Korea Information Processing Society 2017 Journal of information processing systems Vol.13 No.5

In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad-hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi-channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.

A Strong Designated Verifiable DL Based Signcryption Scheme

Mohanty, Sujata,Majhi, Banshidhar Korea Information Processing Society 2012 Journal of information processing systems Vol.8 No.4

This paper presents a strong designated verifiable signcryption scheme, in which a message is signcrypted by a signcryptor and only a specific receiver, who called a "designated verifier", verifies it using his own secret key. The scheme is secure, as an adversary can not verify the signature even if the secret key of the signer is compromised or leaked. The security of the proposed scheme lies in the complexity of solving two computationally hard problems, namely, the Discrete Logarithm Problem (DLP) and the Integer Factorization Problem (IFP). The security analysis of the scheme has been done and it is proved that, the proposed scheme can withstand an adaptive chosen ciphertext attack. This scheme can be very useful in organizations where there is a need to send confidential documents to a specific recipient. This scheme can also be applicable to real life scenarios, such as, e-commerce applications, e-banking and e-voting.

An Efficient Password Security of Three-Party Key Exchange Protocol based on ECDLP

Jayaprakash Kar,Banshidhar Majhi 보안공학연구지원센터 2009 International Journal of Security and Its Applicat Vol.3 No.4

In this paper we have proposed an efficient password security of Three- Party Key Exchange Protocol based on Elliptic Curve Discrete Logarithm Problem. Key exchange protocols allow two parties communicating over a public network to establish a common secret key called session key. Due to their significance by in building a secure communication channel, a number of key exchange protocols have been suggested over the years for a variety of settings. Here we have taken two one-way hash functions to build the level of security high.

IDMMAC: Interference aware Distributed Multi-channel MAC protocol for WSAN

Jagadeesh Kakarla,Banshidhar Majhi,Ramesh Babu Battula 한국정보처리학회 2017 Journal of information processing systems Vol.13 No.5

In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed forwireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ampleamount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed toenhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the adhoctraffic indication message (ATIM) window phase and data transmission phase). When a sensor wants totransmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and thecapacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via acontrol channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backupcluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and nodedegree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area orit leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multichannelMAC protocol is also proposed for actor-actor coordination. An actor selects a minimuminterference and maximum throughput channel among the available channels to communicate with thedestination actor. The performance of the proposed IDMMAC protocol is analyzed using standard networkparameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. Theobtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MACprotocols.

A Contour Descriptors-Based Generalized Scheme for Handwritten Odia Numerals Recognition

Mishra, Tusar Kanti,Majhi, Banshidhar,Dash, Ratnakar Korea Information Processing Society 2017 Journal of information processing systems Vol.13 No.1

In this paper, we propose a novel feature for recognizing handwritten Odia numerals. By using polygonal approximation, each numeral is segmented into segments of equal pixel counts where the centroid of the character is kept as the origin. Three primitive contour features namely, distance (l), angle (${\theta}$), and arc-tochord ratio (r), are extracted from these segments. These features are used in a neural classifier so that the numerals are recognized. Other existing features are also considered for being recognized in the neural classifier, in order to perform a comparative analysis. We carried out a simulation on a large data set and conducted a comparative analysis with other features with respect to recognition accuracy and time requirements. Furthermore, we also applied the feature to the numeral recognition of two other languages-Bangla and English. In general, we observed that our proposed contour features outperform other schemes.

A Contour Descriptors-Based Generalized Scheme for Handwritten Odia Numerals Recognition

( Tusar Kanti Mishra ),( Banshidhar Majhi ),( Ratnakar Dash ) 한국정보처리학회 2017 Journal of information processing systems Vol.13 No.1

In this paper, we propose a novel feature for recognizing handwritten Odia numerals. By using polygonal approximation, each numeral is segmented into segments of equal pixel counts where the centroid of the character is kept as the origin. Three primitive contour features namely, distance (l), angle (θ), and arc-tochord ratio (r), are extracted from these segments. These features are used in a neural classifier so that the numerals are recognized. Other existing features are also considered for being recognized in the neural classifier, in order to perform a comparative analysis. We carried out a simulation on a large data set and conducted a comparative analysis with other features with respect to recognition accuracy and time requirements. Furthermore, we also applied the feature to the numeral recognition of two other languages― Bangla and English. In general, we observed that our proposed contour features outperform other schemes.

CLB-ECC: Certificateless Blind Signature Using ECC

Nayak, Sanjeet Kumar,Mohanty, Sujata,Majhi, Banshidhar Korea Information Processing Society 2017 Journal of information processing systems Vol.13 No.4

Certificateless public key cryptography (CL-PKC) is a new benchmark in modern cryptography. It not only simplifies the certificate management problem of PKC, but also avoids the key escrow problem of the identity based cryptosystem (ID-PKC). In this article, we propose a certificateless blind signature protocol which is based on elliptic curve cryptography (CLB-ECC). The scheme is suitable for the wireless communication environment because of smaller parameter size. The proposed scheme is proven to be secure against attacks by two different kinds of adversaries. CLB-ECC is efficient in terms of computation compared to the other existing conventional schemes. CLB-ECC can withstand forgery attack, key only attack, and known message attack. An e-cash framework, which is based on CLB-ECC, has also been proposed. As a result, the proposed CLB-ECC scheme seems to be more effective for applying to real life applications like e-shopping, e-voting, etc., in handheld devices.

CLB-ECC: Certificateless Blind Signature Using ECC

( Sanjeet Kumar Nayak ),( Sujata Mohanty ),( Banshidhar Majhi ) 한국정보처리학회 2017 Journal of information processing systems Vol.13 No.4

Certificateless public key cryptography (CL-PKC) is a new benchmark in modern cryptography. It not only simplifies the certificate management problem of PKC, but also avoids the key escrow problem of the identity based cryptosystem (ID-PKC). In this article, we propose a certificateless blind signature protocol which is based on elliptic curve cryptography (CLB-ECC). The scheme is suitable for the wireless communication environment because of smaller parameter size. The proposed scheme is proven to be secure against attacks by two different kinds of adversaries. CLB-ECC is efficient in terms of computation compared to the other existing conventional schemes. CLB-ECC can withstand forgery attack, key only attack, and known message attack. An e-cash framework, which is based on CLB-ECC, has also been proposed. As a result, the proposed CLB-ECC scheme seems to be more effective for applying to real life applications like e-shopping, e-voting, etc., in handheld devices.