6 results on '"Vani Rajasekar"'
Search Results
2. Scheduling task and offloading process based on KNN and NB algorithm on cloud
- Author
-
S. E. Dharani, R. Keerthana, S. Harivarshini, Vani Rajasekar, J. Premalatha, and K. Sathya
- Subjects
Artificial neural network ,Computer science ,business.industry ,Process (computing) ,Cloud computing ,computer.software_genre ,Scheduling (computing) ,Task (project management) ,Naive Bayes classifier ,ComputingMethodologies_PATTERNRECOGNITION ,Virtual machine ,Classifier (linguistics) ,business ,Algorithm ,computer - Abstract
Cloud Computing is quickly developing and a lot more cloud suppliers are arising. This project says how the incoming tasks are scheduled in the cloud. In this paper, presenting a classifier algorithmic technique that integrates the K-Nearest Neighbor(KNN) algorithm with the Naive Bayes algorithm. Calculation offloading innovation offers a feasible arrangement by offloading some calculation serious assignments of the K-Nearest Neighbor algorithm and the Naive Bayes algorithm to edges or distant mists that are furnished with adequate assets. However, the offloading process might lead to excessive delays and thus seriously affect the user experience. To address this significant issue, we first respect the average response time of multi-task parallel scheduling as our streamlining objective. Finally, the K-Nearest Neighbor and Naive Bayes algorithm based applications are proposed to solve the problem. Offloading a task means how the task is scheduled in Virtual Machine, first, the task is separated into types(small, medium, large and extra-large) after that it sees which Virtual Machine is available to load the task. Suppose, if the incoming task is too-large then we have to offload it by separating the task into subtask as 6 operations (split, combine, merge, demerge, promote and demote). To avoid the burden in the Virtual Machine, We analyze the above operations by using the K-Nearest Neighbour (KNN) algorithm with the Naive Bayes algorithm and then scheduled in the Virtual Machine. We want to show that the K-Nearest Neighbour (KNN) algorithm with the Naive Bayes algorithm shows better performance than Deep Neural Network(DNN).
- Published
- 2021
3. Online food court payment processing using blockchain
- Author
-
S. Nishanth, S. Ramesh Kumar, Vani Rajasekar, K. Sathya, J. Premalatha, and M. Praveena
- Subjects
Computer science ,media_common.quotation_subject ,Software requirements specification ,Data security ,Business model ,Payment ,Computer security ,computer.software_genre ,Manual labour ,Order (business) ,Payment gateway ,Payment processor ,computer ,media_common - Abstract
It is a web-based application designed commonly for use in Food & beverage based enterprises. These applications tackle the issues of Manual Labour cost in the food court bringing about a rapid expansion in the Overall business Model. It also provides the proprietor of the restaurant to administer and make modifications as per the stip-ulations in their restaurant. The consumer can order their food by accessing the application through their mobile browser in an optimized manner. The retailer can easily complete the order in time, as there will be a streamlined check-in for the availability of ingredients. In this paper, let's exemplify the overall description and generalized soft-ware requirements specification of the entire systematic structure designed for use in different food courts. Our appli-cation will impart the restaurant employees to manage their online cuisines and keep track of all the orders placed by their consumers. Furthermore, the Customer can make Payment using the Existing Payment Gateways as well as they can go for blockchain-based Payment Methodologies. Eventually, this idea is projected to reduce the overheads of Payment gateways and improvise Data security in a precise manner.
- Published
- 2021
4. RETRACTION: Cryptanalysis and enhancement of multi factor remote user authentication scheme based on signcryption
- Author
-
Sathya Krishnamoorthi, Vani Rajasekar, and Premalatha Jayapaul
- Subjects
Computer Networks and Communications ,Data_MISCELLANEOUS ,Cryptography ,0102 computer and information sciences ,02 engineering and technology ,Encryption ,Computer security ,computer.software_genre ,01 natural sciences ,Microbiology ,0202 electrical engineering, electronic engineering, information engineering ,Discrete Mathematics and Combinatorics ,Elliptic curve cryptography ,Replay attack ,Signcryption ,Mathematics ,Authentication ,Algebra and Number Theory ,business.industry ,Applied Mathematics ,Password cracking ,020206 networking & telecommunications ,Multi-factor authentication ,010201 computation theory & mathematics ,business ,computer - Abstract
The major need of remote user authentication is to verify the authenticity of the user through insecure channel. Till today enormous remote user authentication schemes have been proposed but still some security flaws remains. Some of them are vulnerable to password guessing attack, Id guessing attack, client and server impersonation attack, replay attack, Denial of Service (DoS) attack etc. Besides the security issues many such schemes are supposed to have higher computational and communicational cost. To overcome these challenges a lightweight cryptographic scheme called signcryption has evolved. Signcryption is a logical combination of encryption and digital signature in single step. Thereby it provides necessary security features in less computational cost of 0.97 ms and communication cost of 824 bits. The proposed research work outlines the weakness in Dharminder et al's authentication scheme which is prone to biometric recognition error, offline password guessing attack, impersonation attack and replay attack. Furthermore the proposed study provides a secure multifactor authentication scheme using signcryption based on Hyper Elliptic Curve Cryptography (HECC) and Bio-hash function. The formal security analysis of proposed scheme is done using Burrows-Abadi-Needham logic. The analysis reveals that the proposed scheme is computational and communication efficient and satisfies all the needed security goals. The scheme is also been formally verified using AVISPA tool that confirms that it is resilient to security attacks.
- Published
- 2019
5. An Enhanced Anti-phishing Scheme to Detect Phishing Website
- Author
-
S. Dhanesh Raakul, J. Premalatha, K. Sathya, Vani Rajasekar, and Muzafer Saračević
- Subjects
Scheme (programming language) ,Computer science ,Computer security ,computer.software_genre ,computer ,Phishing ,computer.programming_language - Abstract
Phishing is a network attack in which attacker generates a replica of current legitimate site to contrivance the users into submitting their personal and sensitive information. A good anti-phishing solution should have rapid access time and rapid detection rate, but most of the existing solutions fail to satisfy it. A new method is proposed to prevent phishing attack which evaluates the URL Characteristics and cross check with the white-list. The proposed method has higher access time and higher detection rate than other methods. Whenever the user opens a website for the first time which is not available in the white-list, the algorithm proposed here examines the webpage using URL characteristics. The experimental results depict the accuracy of proposed method having accuracy of 93.8% with less negative rate.
- Published
- 2021
6. An efficient lightweight cryptographic scheme of signcryption based on hyperelliptic curve
- Author
-
J. Premalatha, K. Sathya, Vani Rajasekar, and S. Varadhaganapathy
- Subjects
020203 distributed computing ,Authentication ,business.industry ,Computer science ,020207 software engineering ,Cryptography ,02 engineering and technology ,Encryption ,Computer security ,computer.software_genre ,Forward secrecy ,Authentication protocol ,Lightweight Extensible Authentication Protocol ,0202 electrical engineering, electronic engineering, information engineering ,Challenge–response authentication ,business ,computer ,Signcryption ,Computer network - Abstract
The emerging trend now in network security is lightweight cryptography which is the need of the hour due to the growth of wireless technology. As the internet technology grows day by day identity authentication in wireless network is more important. Generally, these wireless systems are in demand of security and resource (power). In order to meet these constraints an important lightweight scheme called Remote user authentication with signcryption is proposed with security features such as confidentiality, integrity (originality of sender and receiver), message and user authentication, non-repudiation, forward secrecy and public verifiability. Signcryption is a new paradigm that fulfils the functions of signature and encryption in one logical step and therefore the cost in terms of computation is reduced compared to the scheme signature-then-encryption. Till today many Remote user authentication schemes based on Elliptic curve, El-Gamal and RSA have been proposed. This paper points out the limitations of existing scheme such as lack in security aspects for example, password guessing attack, impersonation attack, forward secrecy, computation overhead, larger memory requirements. The proposed scheme based on signcryption using hyper elliptic curve that fulfils all the gaps of existing system.
- Published
- 2016
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.