Jayaprakash Kar

Learn More
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(More)
This paper describes an efficient and secure online and off-line signature scheme for wireless sensor network (WSN). Security of the proposed scheme is based on difficulty of breaking Bilinear Diffie-Hellman problem (BDHP). WSN systems are usually deployed in hostile environments where they encounter a wide variety of malicious attacks. Information that is(More)
Deniable authentication protocol enables a receiver to identify the true source of a given message, but not to prove the identity of the sender to a third party. This property is very useful for providing secure negotiation over the Internet. This paper describes a secure identity based deniable authentication protocol whose security is based on(More)
Deniable authentication protocol enables a receiver to identify the true source of a given message, but not to prove the identity of the sender to a third party. This property is very useful for providing secure negotiation over the Internet. This paper describes a secure non-interactive deniable authentication protocol using ECDSA signature scheme. The(More)
This paper describes a new deniable authentication protocol whose security is based Diffe-Hellman (CDH) Problem of type Decisional Diffie-Hellman(DDH) and the Hash Diffie-Hellman (HDDH) problem. Here we have used pairing technique i.e the problem is called Bilinear Diffie Hell-man (BDHP) problem. The protocol is of identity-based and can be implemented in(More)
This article proposes a provably secure aggregate sign-cryption scheme in random oracles. Security of the scheme is based on computational infeasibility of solving Decisional Bilinear Diffie-Hellman Problem and Discrete Logarithm Problems. Confidentiality and authenticity are two fundamental security requirements of Public key Cryptography. These are(More)
A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of two or more original signers without knowing the content of the message or document. It combines the advantages of proxy signature, blind signature and multi-signature scheme. This paper describes an efficient proxy(More)
In this paper we have proposed an efficient password security of multiparty Key Exchange Protocol based on Elliptic Curve Discrete Logarithm Problem. Key exchange protocols allow a group of 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,(More)
In this paper we have designed a fair e-cash system using Schnorr's one-time signature and Okamoto-Schnoor blind signature. In addition, the proposed e-cash system is constructed using elliptic curve cryptosystems (ECC) under the limited-storage environment for mobile devices such as smart cards, PDA etc able to efficiently store the coin streams.(More)