Journal Articles

Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/19884

Browse

Has files: NoSubject: search.filters.subject.Cryptography

Search Results

Now showing 1 - 10 of 24
  • No Thumbnail Available
    Item
  • No Thumbnail Available
    Item
    A reverse sealed-bid auction system for mobile commerce
    (UK Simulation Society Clifton Lane Nottingham NG11 8NS, 2012) Singh, M.P.; Kella, S.
    In recent years, the demand for mobile commerce has increased. Due to this increased demand, mobile devices usage in internet auctions has also increased. In this paper, we propose a reverse sealed-bid auction model using collaborative mobile agents (MoRSAS) which can be used on mobile-based environment. We also proposed a new auction protocol using ECC (Elliptic Curve Cryptosystem) based signcryption scheme which reduces the computational load and communication overhead, providing high security with small key size. In our proposal, Trusted Dealer (TD) is the one who generates auction keys and key shares, also works like registration manager. Our method reduces the network load and executes the auction process efficiently. The proposed protocol satisfies the security requirements of sealed-bid auction protocol, like confidentiality, anonymity, bid privacy etc. © 2012, UK Simulation Society. All rights reserved.
  • No Thumbnail Available
    Item
    Digital signature-based secure node disjoint multipath routing protocol for wireless sensor networks
    (2012) Shiva Murthy, G.; D'Souza, R.J.; Varaprasad, G.
    The objective of energy efficient routing protocol is to increase the operational lifetime of the wireless sensor networks. Multipath routing protocols enhance the lifetime of the wireless sensor networks by distributing traffic among multiple paths instead of a single optimal path. Transmission of secured data is also an important research concern in the wireless sensor networks. In this paper, a secure node disjoint multipath routing protocol for wireless sensor networks is proposed. Here, the data packets are transmitted in a secure manner by using the digital signature crypto system. It is compared with an ad hoc on-demand multipath distance vector routing protocol. It shows better results in terms of packet delivery fraction, energy consumption, and end-to-end delay compared to the ad hoc on-demand multipath distance vector routing. © 2012 IEEE.
  • No Thumbnail Available
    Item
    A study to examine the superiority of CSAVK, AVK over conventional encryption with a single key
    (Science and Engineering Research Support Society ijbsbt@sersc.org, 2016) Goswami, R.S.; Chakraborty, S.K.; Bhunia, C.T.
    Time variant key is one of the great research challenges in the field of cryptography for achieving the perfect security. Automatic variable Key (AVK) has been well researched and established as an important technique to realize time variant key in achieving towards perfect security. In AVK, proposed by Bhunia, the key is made to vary from data to data or session to session that is essentially required for achieving perfect secrecy. The variable key is generated in each time a data is sent and or a session is made. The time variant key (in AVK) is found to reduce the frequency attack as seen in earlier research, while such key was in applied in AES algorithm. In the present experimental research the authors study the application of AVK & Computing & Shifting AVK (CSAVK) in RSA to examine the reducing effect of frequency attack. © 2016 SERSC.
  • No Thumbnail Available
    Item
    Batch verification of Digital Signatures: Approaches and challenges
    (Elsevier Ltd, 2017) Kittur, A.S.; Pais, A.R.
    Digital Signatures can be considered analogous to an ordinary handwritten signature for signing messages in the Digital world. Digital signature must be unique and exclusive for each signer. Multiple Digital Signatures signed by either single or multiple signers can be verified at once through Batch Verification. There are two main issues with respect to Batch Verification of Digital Signatures; first is the security problem and the second is the computational speed. Due to e-commerce proliferation, quick verification of Digital Signatures through specific hardware or efficient software becomes critical. Internet companies, banks, and other such organizations use Batch verification to accelerate verification of large number of Digital Signatures. Many Batch Verification techniques have been proposed for various Digital Signature algorithms. But most of them lack the security requirements such as signature authenticity, integrity, and non-repudiation. Hence there is a need for the study of batch verification of Digital Signatures. The main contributions of our survey include: (a) Identifying and categorizing various Batch verification techniques for RSA, DSS, and ECDSA(includes schemes based on Bilinear Pairing) (b) Providing a comparative analysis of these Batch Verification techniques (c) Identifying various research challenges in the area of Batch verification of signatures. © 2017 Elsevier Ltd
  • No Thumbnail Available
    Item
    Energy-efficient and reliable data collection in wireless sensor networks
    (Turkiye Klinikleri Journal of Medical Sciences Talapapa Bulvary no. 102 Hamammonu 1 06230, 2018) Puneeth, D.; Joshi, N.; Atrey, P.K.; Kulkarni, M.
    Ensuring energy efficiency, data reliability, and security is important in wireless sensor networks (WSNs). A combination of variants from the cryptographic secret sharing technique and the disjoint multipath routing scheme is an effective strategy to address these requirements. Although Shamir's secret sharing (SSS) provides the desired reliability and information-theoretic security, it is not energy efficient. Alternatively, Shamir's ramp secret sharing (SRSS) provides energy efficiency and data reliability, but is only computationally secure. We argue that both these approaches may suffer from a compromised node (CN) attack when a minimum number of nodes is compromised. Hence, we propose a new scheme that is energy efficient, provides data reliability, and is secure against CN attacks. The core idea of our scheme is to combine SRSS and a round-reduced AES cipher, which we call "split hop AES (SHAES)". Both the simulation results and the theoretical analysis are employed to validate the near-sink CN attack, and a secure reliable scheme using SHAES is proposed. © 2018 TÜBITAK.
  • No Thumbnail Available
    Item
    A secure and lightweight authentication scheme for roaming service in global mobile networks
    (Elsevier Ltd, 2018) Madhusudhan, R.; Shashidhara
    Global Mobile Network provides global roaming service to the users moving from one network to another. It is essential to authenticate and protect the privacy of roaming users. Recently, Marimuthu and Saravanan proposed a secure authentication scheme for roaming service in mobile networks. This scheme can protect user anonymity, untraceability, and is believed to have many abilities to resist a range of attacks in global mobile networks. In this paper, we analyse the security strength of their scheme and show that the authentication protocol is in fact insecure against insider attack, stolen-verifier attack, impersonation attack, denial-of-service attack, synchronization problem, lack of user anonymity and operational inefficiencies. Hence, we propose a secure and lightweight authentication scheme for Global Mobile Networks. In addition, the proposed scheme requires few message exchanges between the entities such as MU (Mobile User), FA (Foreign Agent) and HA (Home Agent). The scheme ensures both communication and computation efficiency as compared to the well-known authentication schemes. The performance analysis shows that the proposed authentication scheme is well suited for resource limited wireless and mobile environments. © 2017 Elsevier Ltd
  • No Thumbnail Available
    Item
    Randomised visual secret sharing scheme for grey-scale and colour images
    (Institution of Engineering and Technology journals@theiet.org, 2018) Mhala, N.C.; Jamal, R.; Pais, A.R.
    Randomised visual secret sharing is an encryption technique that utilises block-based progressive visual secret sharing and discrete cosine transform (DCT) based reversible data embedding technique to recover a secret image. The recovery method is based on progressive visual secret sharing, which recovers the secret image block by block. The existing block based schemes achieve the highest contrast level of 50% for noise-like and meaningful shares. The proposed scheme achieves a contrast level of 70-90% for noise-like and 70-80% for meaningful shares. The enhancement of contrast is achieved by embedding additional information in the shares using DCT-based reversible data embedding technique. Experimental results showed that the proposed scheme restores the secret image with better visual quality in terms of human visual system based parameters. © The Institution of Engineering and Technology 2017.
  • No Thumbnail Available
    Item
    A novel key exchange algorithm for security in internet of things
    (Institute of Advanced Engineering and Science info@iaesjournal.com, 2019) Koduru, K.; Reddy, P.V.G.D.P.; Preethi, P.
    Today Internet of things (IoT) interconnects any object possessing sensing and computing capabilities to the internet. In this era, increasing number of electronic devices and applications in Internet of Things (IoT) requires secured communication with low power consumption capabilities. As security is a major challenge in internet of things, it is important to design a key management solution that considers resource constrained nodes and hence key management in public key cryptography is a crucial issue. In this paper, a novel key exchange algorithm was developed and implemented on a low powered “Raspberry pi machine” to realize the overall impact it creates on the device. The performance of the proposed algorithm had shown a great improvement over the popular Diffie Hellman key exchange algorithm and a two-level security for data exchange between the parties is implemented. © © 2019 Institute of Advanced Engineering and Science. All rights reserved.
  • No Thumbnail Available
    Item
    Searchable encryption approaches: attacks and challenges
    (Springer London, 2019) Siva Kumar, D.V.N.; Santhi Thilagam, P.
    Searchable encryption (SE) is a cryptographic technique that allows the users to perform search over outsourced encrypted data in cloud servers while preserving the privacy of data and search query. In order to preserve privacy and security, data owners use various encryption schemes to encrypt their data and indexes. Due to the vulnerabilities in the encryption schemes adopted by SE schemes, information leakages are possible from the encrypted data. The cloud servers use various information disclosure attacks that exploit these leakages to infer plaintext information. In this paper, we analyze the existing SE approaches with respect to their security and precision goals and possible attacks on them. We also identify the root causes of these attacks and their remedies. An experimental study is also performed to investigate the susceptibility of SE schemes against attacks and countermeasures to prevent them. © 2018, Springer-Verlag London Ltd., part of Springer Nature.