Certificateless and provably-secure digital signature scheme based on elliptic curve

With the internet today available at the user’s beck, and call data or Information Security plays a vital role. Confidentiality, Integrity, Availability, and Non-repudiation are the pillars of security on which every application on the web is based on. With these basic requirements the users also need the security in low resource constrained environments making it more challenging for the security experts to design secured cryptographic algorithms. Digital Signatures play a pivotal role in Authentication. They help in verifying the integrity of the data being exchanged. Elliptical curves are the strongest contenders in Digital Signatures, and much research is being done to enhance the method in many ways. The paper briefs a secured and improved ECDSA Elliptical Curve Digital Signature Algorithm which is an improved and secured version of the Digital Signature Algorithm

Comparative Analysis of Cryptography Library in IoT

The paper aims to do a survey along with a comparative analysis of the various cryptography libraries that are applicable in the field of Internet of Things (IoT). The first half of the paper briefly introduces the various cryptography libraries available in the field of cryptography along with a list of all the algorithms contained within the libraries. The second half of the paper deals with cryptography libraries specifically aimed for application in the field of Internet of Things. The various libraries and their performance analysis listed down in this paper are consolidated from various sources with the aim of providing a single comprehensive repository for reference to the various cryptography libraries and the comparative analysis of their features in IoT.Comment: 5 pages, 14 table

MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING

El Gamal encryption was introduced in 1985 and is still commonly used today. Its hardness is based on a discrete logarithm problem defined over the finite abelian cyclic group group chosen in the original paper was but later it was proven that using the group of Elliptic Curve points could significantly reduce the key size required. The modified El Gamal encryption is dubbed its analog version. This analog encryption bases its hardness on Elliptic Curve Discrete Logarithm Problem (ECDLP). One of the fastest attacks in cracking ECDLP is the Pollard Rho algorithm, with the expected number of iterations where is the number of points in the curve. This paper proposes a modification of the Pollard Rho algorithm using a negation map. The experiment was done in El Gamal analog encryption of elliptic curve defined over the field  with different values of small digit . The modification was expected to speed up the algorithm by  times. The average of speed up in the experiment was 1.9 times

Model Pengamanan End-to-End Pada M-Banking Berbasis Algoritma Kurva Hyper Elliptic

. Currently, banking transactions using mobile banking has grown rapidly. The increasing the number of mobile application users becomes one of the main factors. Several approaches have been developed to improve the transaction security. Problems of message security still requires a solution to achieve computing speed and leverage security level. In this paper, we propose a security algorithms used to improve the mobile banking security with hyperelliptic curve algorithm. It will create a safe and an efficient transactions while message will be sent via public internet. Hyperelliptic curve algorithm will run a processes for authentication and encryption. it will produce fast computation and has good security level. This research produced little computing time on m-banking application while it run on Android. Hyperelliptic curve algorithm use a smaller key to achieve a good security level at m-banking application

Elliptic Curve Cryptography Based Data Transmission against Blackhole Attack in MANET

Mobile nodes roaming around in the hostile environment of mobile adhoc network (MANET) play the role of router as well as terminal. While acting as a router, a node needs to choose a reliable routing protocol. Besides, an encryption algorithm is needed to secure data to be conveyed through the unfriendly atmosphere while acting as a terminal. We have implemented Elliptic Curve Cryptography (ECC) along with Adhoc On Demand Multipath Distance Vector (AOMDV) routing protocol to secure data transmission against blackhole attack in a MANET. ECC, a public key cryptography that works on discrete logarithm problem with a much smaller key size, has been used to encrypt data packets at source node before transmission. We have used AOMDV, a reliable routing protocol compared to its parent protocol, Adhoc On Demand Distance Vector (AODV), with a multipath extension, for routing. The encrypted packets transferring between nodes via AOMDV, has been proved secured against blackhole attack. The performance of the secured protocol has been analyzed in terms of different performance metrics and in terms of varying number of blackhole attacker nodes

A Computational Analysis of ECC Based Novel Authentication Scheme in VANET

A recent development in the adhoc network is a vehicular network called VANET (Vehicular Adhoc Network). Intelligent Transportation System is the Intelligent application of VANET. Due to open nature of VANET attacker can launch various kind of attack. As VANET messages are deal with very crucial information’s which may save the life of passengers by avoiding accidents, save the time of people on a trip, exchange of secret information etc., because of this security is must be in the VANET. To ensure the highest level of security the network should be free from attackers, there by all information pass among nodes in the network must be reliable i.e. should be originated by an authenticated node. Authentication is the first line of security in VANET; it avoids nonregistered vehicle in the network. Previous research come up with some Cryptographic, Trust based, Id based, Group signature based authentication schemes. A speed of authentication and privacy preservation is important parameters in VANET authentication. This paper addresses the computational analysis of authentication schemes based on ECC. We started analysis from comparing plain ECC with our proposed AECC (Adaptive Elliptic Curve Cryptography) and EECC (Enhanced Elliptic Curve Cryptography). The result of analysis shows proposed schemes improve speed and security of authentication. In AECC key size is adaptive i.e. different sizes of keys are generated during key generation phase. Three ranges are specified for key sizes small, large and medium. In EECC we added an extra parameter during transmission of information from the vehicle to RSU for key generation. Schemes of authentications are evaluated by comparative analysis of time required for authentication and key breaking possibilities of keys used in authentication

Modified Autonomous Key Management Scheme with Reduced Communication/Computation Costs in MANET

The growing applications of mobile ad hoc networks (MANETs) have made related security issues much more important. B. Zhu et al. proposed a key management scheme using Shamir's secret sharing scheme to construct an Autonomous Key Management (AKM) hierarchy structure. However, Shamir's secret sharing in AKM to control key hierarchy incurs high message transmission costs. This paper modifies the secret sharing scheme and applies it to AKM to reduce communication and computation costs

Safeguarding the liabilities of Data Accessing in Cloud Computing

Cloud computing is the process of providing the virtualized services over the internet The space in the web commonly known as Cloud has been monitored by service provider In a real time scenario a user registers for a particular service and shares his data as well as access credential policies with CSP cloud service provider Though cloud computing has got major flexibility in data accessing users are very much concerned about their data security as it may be mislead by service providers They may share the owner s data to unauthenticated persons This is a big threat to the data owners In this paper a modern approach is proposed namely Cloud Information Accountability CIA framework and based on the notion of data liability We identify the common requirements and develop several guidelines to achieve data accountability in the cloud Once the data owner provides data the service provider will have full access and permission rights on the data Using traditional access control mechanisms after data rights are permitted the data is in the hands of the service provider We propose an algorithm which gives the details of people accessing the data using the automated logging details through the JAR file