Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
7 results
Search Results
Item Undeniable Signature Scheme: A Survey(Institute of Electrical and Electronics Engineers Inc., 2020) Kale, P.; Hazarika, P.; Chandavarkar, B.R.Nowadays, almost all business organizations, committees use the internet to do transactions and confidential information exchange. So it is crucial to make these transactions secure and reliable. A system to be confident and trustworthy needs a function of cryptography, and also it must manage the keys of cryptography. The digital signature, which is universally verifiable, is a solution when there are disputes between the sender and receiver. Later the undeniable signature scheme was introduced as a modern technique to verify the validity of a message sent by the sender. The undeniable signature scheme has its properties to protect the interests of the sender and receiver. An authenticated verifier only can check the signature with the approval of the signer. In this paper, we have discussed various undeniable signature schemes-key generation, signature verification, and disavowal protocol. This paper compares different schemes of the undeniable signature on the various notations of security. © 2020 IEEE.Item Greatest common divisor and its applications in security: Case study(Institute of Electrical and Electronics Engineers Inc., 2020) Sri Siddhartha, M.; Rodriques, J.; Chandavarkar, B.R.In this paper, we explain the importance and applications of the Greatest Common Divisor(GCD) in the field of security. GCD of two numbers is the greatest divisor that ultimately divides these two numbers. The paper initially discusses four standard algorithms used in calculating GCD: Euclidean Algorithm, Binary GCD algorithm, Dijkstra's algorithm, and Lehmer's algorithm. We then analyze the various GCD applications in computer security. Some applications like generating modular multiplicative inverse are used in various cryptographic algorithms, reducing public keys' disclosure within closed groups, the importance of GCD in cryptographic algorithms, key refreshment message authentication, and peer validation. In the end, we cover the effects arising due to not proper use of GCD according to the algorithms stated in this paper, and how a poor choice of prime numbers that we use to compute the GCD and miscalculation of GCD can affect the computer security. © 2020 IEEE.Item Prime Numbers and Its Applications in Security: Case Study(Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2021) Namdeo, A.K.; Lomga, A.; Chandavarkar, B.R.Prime Numbers are the major building blocks in integer universe. Prime numbers play an important role in number theory and cryptography. With this unique nature of prime number, it is mainly used in security. Many security algorithms have used prime numbers because of their uniqueness. In this paper, we have discussed the importance of prime numbers and their application. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.Item Essential Requirements of IoT’s Cryptographic Algorithms: Case Study(Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2021) Kumar, S.; Lone, Z.A.; Chandavarkar, B.R.Internet of Things (IoT) devices are increasing rapidly in today’s world, but the security of devices remains a major concern due to the unavailability of the memory and processing power in these devices, which is because of their smaller size. The trade-off lies between security and performance, i.e. if security is increased, which will come with high complexity and hence would deter the performance. On the other hand, if performance has to be increased, it would come with a cost in terms of security. Also, IoT devices can be used as bots as they are globally accessible without much of a security. The most secure cryptographic algorithms use a lot of resources, and in case of IoT, resources are not available on that scale, so there is a need to design a secure algorithm (lightweight cryptography) that would use less resources and hence won’t affect the performance either. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.Item Ways of Connecting Illiterates with the Security Mechanism: Case Study(Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2021) Kumar, S.R.; Sonkar, M.; Chandavarkar, B.R.The digital communication faces lots of security threats and attacks in the network. Thus, security mechanisms are used as a measure to ensure safety and to implement the security services for the text documents, audio, video and other types of data communication over the network. These security mechanisms are helpful to recognise, prevent and recover from security breaches, threats and attacks. Some of the security mechanisms are Cryptography, Public key certification, Authentication, Digital signatures etc. Obviously, these are mostly used by educated people in communication for their data to be remain integrated, confidential and safe. But, a bitter fact is that there are 30.90% people who are illiterate and have no education background living in our country and their data is also very important to them. So, we have to connect those illiterate people to these security mechanisms, so that they can also communicate without being in fear of the data loss or data manipulation. There are many ways to connect illiterate people with the security mechanisms such as by using facial recognition and fingerprint as the password in various systems or machines like ATMs, banks, government offices and also provide information and knowledge about the prevention from the possible fraud, theft and malicious activities. This paper discuss those different ways to connect the illiterate people with security mechanisms and enlighten their lives. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.Item Comparative Study Between RSA Algorithm and Its Variants: Inception to Date(Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2021) Rathod, U.; Sreenivas, S.; Chandavarkar, B.R.RSA Public Key Cryptography (PKC) otherwise called asymmetric encryption, comprises of two keys known as public key and private key. While the sender utilizes receiver’s public key to encrypt the message, the receiver’s private key is utilized for decrypting the message, so there is no compelling reason to share a private key as in symmetric cryptography which requires sharing a private key. This paper means to investigate RSA and its variants, study its qualities and shortcomings, and propose inventive answers for conquer the shortcoming. RSA is extraordinary compared to other asymmetric key cryptographic algorithms in correspondence over systems. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.Item Mitigating Neighborship Attack In Underwater Sensor Networks(Institute of Electrical and Electronics Engineers Inc., 2021) Deshmukh, A.; Deo, S.; Chandavarkar, B.R.Transmission of information through Underwater Wireless Sensor Networks(UWSN) across the ocean is one of the enabling technologies for underwater communication. These advances trigger security concerns of the underlying UWSN. Due to the Sack of predictability of the movement of the nodes in such a system, secure neighbour discovery for successful information exchange is a challenge. A neighborship attack is the one which hinders neighbour discovery amongst the various nodes within the network. The wormhole attack and the Sybil attack being the prominent attacks in this category, lead to various issues if not mitigated. The consequences of these attacks can quickly scale from reduced throughput to loss of confidentiality. Moreover, conventional cryptographic algorithms are not possible to implement in a UWSN due to restrictions on the open acoustic channel and severe underwater conditions. In this paper, we propose a true-neighbour algorithm for mitigating neighborship attack in UWSN. Furthermore, the performance of this algorithm is demonstrated in UnetStack with reference to end to end packet delay, with and without implementation of the algorithm. © 2021 IEEE.