Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Cryptography techniques involve message conveyance either in a secret form or in some hidden form. Cryptography finds it applications in almost all fields for secure data transfer. Looking into the history it is the military field which is very much influenced by secure data transfer and communication. Use of cryptography has spread its wings once digital communication stepped in. The thirst of data security increased when digital communication started using wireless medium for data transmission. It is therefore necessary to understand the basics and importance of cryptographic techniques for better, fast and efficient data transfer without any intrusion. © 2020 IJSTR.

Department of Information Technology

School of Information Technology and Engineering

Vellore Campus

World University root node

International Journal of Scientific and Technology Research

Modern cryptography-a review

Department of Analytics

School of Computer Science and Engineering

Advances in Data Mining and Database Management

Modern Technologies for Big Data Classification and Clustering

Data clustering plays a very important role in Data mining, machine learning and Image processing areas. As modern day databases have inherent uncertainties, many uncertainty-based data clustering algorithms have been developed in this direction. These algorithms are fuzzy c-means, rough c-means, intuitionistic fuzzy c-means and the means like rough fuzzy c-means, rough intuitionistic fuzzy c-means which base on hybrid models. Also, we find many variants of these algorithms which improve them in different directions like their Kernelised versions, possibilistic versions, and possibilistic Kernelised versions. However, all the above algorithms are not effective on big data for various reasons. So, researchers have been trying for the past few years to improve these algorithms in order they can be applied to cluster big data. The algorithms are relatively few in comparison to those for datasets of reasonable size. It is our aim in this chapter to present the uncertainty based clustering algorithms developed so far and proposes a few new algorithms which can be developed further.

Modern Technologies for Big Data Classification and Clustering Advances in Data Mining and Database Management

Uncertainty-Based Clustering Algorithms for Large Data Sets

With cloud computing, new online businesses need not put tons of effort into making the business grow to match user demands. Rather than focusing on how to handle increasing server load or storage capability in their own data centers, cloud computing permits such businesses to rescale within no time. Majority of the data nowadays is stored in these cloud data-providers. Despite all the advantages of cloud storage, it raises several economic, security, and privacy issues. One of the biggest concern has been the location of where our data is stored (in large, centralized data centers). This architecture undermines privacy. Also, it keeps the price of storage high and prevents new uses of data. © IAEME Publication.

International Journal of Mechanical Engineering and Technology

Nano drive: Privacy preserving decentralized storage

A digital signature is a mathematical technique used to validate the authenticity and integrity of a message and intended to solve the problem of tampering and impersonation in digital transactions. Basically a digital signature is a public key cryptographic technique. Using the concept of public key cryptography and discrete logarithmic problem this paper proposes a digital signature scheme preserving the properties of digital signature algorithm. © Research India Publications.

International Journal of Applied Engineering Research

An enhanced digital signature scheme

Big Data are a large amount of data that are being generated from social networks, mobile devices, sensors, etc. It was a great challenge to store and process Big Data before the advent of Hadoop. Understanding Big Data drives the growth of any company (White, 2015). This is now possible with Hadoop. Hadoop is a set of libraries that provide methods to access and analyze these data in a fast and efficient manner. There are many flavors of Hadoop available to us. Apache Hadoop is open source, and a lot of projects have been developed surrounding Apache Hadoop (Lam, 2010). Cloudera Hadoop is also available as. © 2017 by Taylor and Francis Group, LLC.

Department of Computational Intelligence

VIT Unitversity

Department of Software Systems

NoSQL: Database for Storage and Retrieval of Data in Cloud

Multicast an efficient means of group communication plays a major role in wide variety of real time applications. Such communication requires authenticity of messages that is being transmitted in order to provide security services such as data integrity, non-repudiation, authenticity of data origin. Traditionally, messages sent using paper documents are authenticated by handwritten signatures. But, nowadays as messages are transmitted as electronic documents authentication could be achieved using public key cryptographic technique called Digital Signature. Digital Signature is a powerful tool which comprises of a string of zeros and ones is easy to validate and authenticate but difficult to forge. This paper surveys in depth various digital signature techniques, its advantages and disadvantages that are used for authenticating group communication. © 2016, Research India Publications.

Department of Database Systems

Digital signature schemes for group communication: A survey

International Journal of Information and Decision Sciences

Classification by majority voting in feature partitions

Background: The security of a system or a network relies on how its users are validated to gain access over them. Usually these users are validated using passwords. One time password is a dynamic password which is valid for only one logged in session. OTP is being widely used nowadays in applications that involve e- transactions. Methods: OTPs are a pseudo random sequence of alphanumeric characters that are generated using mathematical algorithms. We propose a simple and efficient method for generating one time passwords using HMAC function. Results: HMAC value used for generating OTP is irreversible. Thus H(m) and H(m’) cannot be correlated to a same value. Predictions of future OTP cannot be done as random sequence of hexadecimal digits are generated. Conclusion: One time password is a single time use password and thus cannot be reused or stolen for future use. Generation method for OTP involves simple and efficient mathematical function. © 2016, International Journal of Pharmacy and Technology. All rights reserved.

International Journal of Pharmacy and Technology

An HMAC OTP

AbstractCryptographic key management needs utmost security in generating, exchanging, using, rekeying, storing of keys, being used for communication purposes. Successful key management is critical to the security of a cryptosystem. This paper presents a detailed survey on group key management and its challenges in network independent and network dependent approaches. The paper also focuses on the advantages, disadvantages and security vulnerabilities of these protocols.

Fulltext

Cybernetics and Information Technologies

A Survey on Group Key Management Schemes

Group communication involves one - many or many - many people communicating over their desired network. The importance of people communicating in groups over dynamic topology environment has led to the evolution of many multicast protocols. This paper presents a robust, scalable and a group authentication protocol for efficient and secure communication among the group members over the dynamic ad-hoc environment. © Research India Publications.

A secure robust on-demand multicast routing protocol over mobile Ad Hoc networks

Key exchange or Key establishment is a method in cryptography by which cryptographic keys are exchanged among the users, allowing the users to send messages in a secured manner over unsecured channel by using some cryptographic algorithms. Keeping messages to be highly confidential among a particular group of users seems to be a more challenging task when compared to peer to peer secrecy . With the advent of asymmetric key cipher algorithms, the key used for encryption could be made public as the decryption requires the private key. In this paper, we present a new and simple key exchange algorithm with low computational complexity for effective and secure group communication. © Research India Publications.

A novel Key exchange algorithm for secure group communication

Encyclopedia of Business Analytics and Optimization

Efficient High Dimensional Data Classification

Group communications are significant in Mobile Ad hoc Networks (MANET). Multicast is an wellorganized technique for applying group communications. Yet, it is interesting to implement effective and accessible multicast in MANET due to the effort in group member management and multicasting of packets forwarding in an active topology. We suggest a Asymmetrically Secured novel Efficient Geographic Multicast Protocol (EGMP). EGMP uses a practical-zone-based arrangement to implement accessible and effective group member management. A network-wide zone-based bi-directional tree is made to attain more well-organized member management and multicast delivery. The location information is used to monitor the zone structure, multicast tree building and multicast packets forwarding, which capably reduce the overhead for route finding and tree structure maintenance. Some approaches have been suggested to further improvement in the efficiency of the protocol, for example, presenting the concept of zone depth for construction an ideal tree structure and adding the position search of group of members with the ordered group member management. To switch empty zone problem met by most routing protocols using a zone structure. Finally, we plan a pattern to switch the security problem faced by the multicasting. The scalability and the productivity of EGMP are assessed through simulations and quantitative analysis. Our results prove that EGMP has great packet delivery ratio, and low control overhead, and is accessible to both group size and network size. EGMP has expressively lower control overhead, data transmission overhead, and multicast group joining delay.