Samrat Mondal

Followers

Following

Public Views

Interests

Uploads

Papers by Samrat Mondal

Integration of Discriminate Features and Similarity Preserving for Unsupervised Domain Adaptation

2022 IEEE 19th India Council International Conference (INDICON)

COVID-19 Detection from Lung Ultrasound Images using a Fuzzy Ensemble-based Transfer Learning Technique

2022 26th International Conference on Pattern Recognition (ICPR)

Vision Transformer Based COVID-19 Detection Using Chest CT-scan images

2022 IEEE-EMBS International Conference on Biomedical and Health Informatics (BHI)

On The Limitation of Some Fully Observable Multiple Session Resilient Shoulder Surfing Defense Mechanisms

Cornell University - arXiv, May 30, 2017

Using password based authentication technique, a system maintains the login credentials (username... more Using password based authentication technique, a system maintains the login credentials (username, password) of the users in a password file. Once the password file is compromised, an adversary obtains both the login credentials. With the advancement of technology, even if a password is maintained in hashed format, then also the adversary can invert the hashed password to get the original one. To mitigate this threat, most of the systems now a days store some system generated fake passwords (also known as honeywords) along with the original password of a user. This type of setup confuses an adversary while selecting the original password. If the adversary chooses any of these honeywords and submits that as a login credential, then system detects the attack. A large number of significant work have been done on designing methodologies (identified as M DS OA) that can protect password against observation or, shoulder surfing attack. Under this attack scenario, an adversary observes (or records) the login information entered by a user and later uses those credentials to impersonate the genuine user. In this paper, we have shown that because of their design principle, a large subset of M DS OA (identified as M FODS SOA) cannot afford to store honeywords in password file. Thus these methods, belonging to M FODS SOA , are unable to provide any kind of security once password file gets compromised. Through our contribution in this paper, by still using the concept of honeywords, we have proposed few generic principles to mask the original password of M FODS SOA category methods. We also consider few well established methods like S3PAS, CHC, PAS and COP belonging to M FODS SOA , to show that proposed idea is implementable in practice.

Download

A Many Objective Optimization Based Entity Matching Framework for Bibliographic Database

TENCON 2019 - 2019 IEEE Region 10 Conference (TENCON)

Entity matching aims at mapping records to different entities where records share the common enti... more Entity matching aims at mapping records to different entities where records share the common entity name. The entity matching problem is challenging because several times records do not contain complete information (many of the attributes are missing), unequal distribution of records for different entities, big overlaps between records of different entities. In this paper, we have proposed an unsupervised framework to solve this problem. The aforementioned problem is posed as a partitioning problem. Three unknown artifacts for solving this partitioning problem: optimal partitioning including the optimal number of partitions, suitable distance measure which can be utilized to measure the distance between records and a set of attributes/features which can take part in the distance calculation, are determined automatically using the search capability of a multiobjective optimization technique. Several objective functions which help in measuring the goodness of partitioning are optimized simultaneously by some popular multiobjective optimization techniques, NSGA-II/NSGA-III (Non-dominated Sorting Genetic Algorithm-II/III) to solve the partitioning problem. Total 247 combinations of eight different objective functions are used in the experiments for partitioning fourteen bibliographic datasets. A detailed comparative study of the proposed approach using NSGA-II and NSGA-III.

Exploiting Higher Order Multi-dimensional Relationships with Self-attention for Author Name Disambiguation

ACM Transactions on Knowledge Discovery from Data

Name ambiguity is a prevalent problem in scholarly publications due to the unprecedented growth o... more Name ambiguity is a prevalent problem in scholarly publications due to the unprecedented growth of digital libraries and number of researchers. An author is identified by their name in the absence of a unique identifier. The documents of an author are mistakenly assigned due to underlying ambiguity, which may lead to an improper assessment of the author. Various efforts have been made in the literature to solve the name disambiguation problem with supervised and unsupervised approaches. The unsupervised approaches for author name disambiguation are preferred due to the availability of a large amount of unlabeled data. Bibliographic data contain heterogeneous features, thus recently, representation learning-based techniques have been used in literature to embed heterogeneous features in common space. Documents of a scholar are connected by multiple relations. Recently, research has shifted from a single homogeneous relation to multi-dimensional (heterogeneous) relations for the laten...

Online author name disambiguation in evolving digital library

Neurocomputing

SPOSS: Secure Pin-Based-Authentication Obviating Shoulder Surfing

Information Systems Security, 2016

Classical PIN based authentication schemes are susceptible to shoulder surfing attacks and hence ... more Classical PIN based authentication schemes are susceptible to shoulder surfing attacks and hence attacker may obtain secret credentials of legitimate user very easily. Some of the existing schemes that provide resistance against shoulder surfing attacks either require multiple rounds for entering single digit or some have dependency on external hardware or some of the schemes require complex computation to be done mentally in order to enter the PIN. Another possible security threat could be stealing the credentials if password file is compromised. In this paper, we propose a new PIN entry mechanism known as SPOSS which provides resilience against not only human-based shoulder surfing but also against recording attack (for one session) in which attacker may impose a recording device like camera to record the whole login session for future reference. SPOSS also provides security against password file compromise attack. Additionally, user authentication can be ensured by single round only without doing any complex computation and without any dependency of external hardware. Experimental analysis shows that proposed scheme achieves a good balance between usability and security parameters.

Intelligent Scheduling of Smart Appliances in Energy Efficient Buildings: A Practical Approach

2019 32nd International Conference on VLSI Design and 2019 18th International Conference on Embedded Systems (VLSID), 2019

In this work, we propose a scheduling algorithm, named mixed-MinPeak, to schedule deferrable appl... more In this work, we propose a scheduling algorithm, named mixed-MinPeak, to schedule deferrable appliances that can be of both preemptive and non-preemptive types, together in the presence of non-deferrable appliances. The performance of the proposed algorithm has been evaluated on practical power consumption data, along with a comparative analysis with existing algorithms, the results of which prove the capability of the proposed algorithm in producing better solutions.

Coordinated Scheduling of Residential Appliances and Heterogeneous Energy Sources in a Smart Microgrid

Proceedings of the 6th ACM International Conference on Systems for Energy-Efficient Buildings, Cities, and Transportation, 2019

We propose a coordinated scheduling approach for controllable electrical appliances along with th... more We propose a coordinated scheduling approach for controllable electrical appliances along with the optimal usage of heterogeneous energy sources to minimize the energy drawn from the grid and thereby reducing electricity cost for the users. A mixed integer linear programming (MILP) formulation for the problem is presented to produce the optimal solutions, and an efficient heuristic algorithm is proposed to obtain results efficiently.

drPass: A Dynamic and Reusable Password Generator Protocol

Information Systems Security, 2018

In general, alphanumeric passwords are used for authentication due to its simplicity and deployab... more In general, alphanumeric passwords are used for authentication due to its simplicity and deployability. Strong and distinct alphanumeric passwords are inconvenient to memorize. So, users often pick weak passwords and reuse them. Also, users employ some simple tricks to derive passwords from a basic one. However, such weak and easy to derive passwords could not provide sufficient strength to protect users confidential resources. These passwords reduce the work of attackers to a great extent. Although the strong and distinct passwords reduce brute force attack, they are prone to theft and are often compromised under different vulnerabilities. Thus, by compromising one password, an attacker may gain access to other web-accounts where identical or similar passwords are used by the same user. In this paper, we propose drPass, a dynamic and reusable password generating protocol that generates high entropy passwords and thwarts various password stealing attacks. The proposed drPass scheme does not require any server-side change of existing websites for its implementation. It reduces the memory burden on users and also helps users to generate and maintain highly secure, distinct passwords for each site.

Towards optimal scheduling of thermal comfortability and smoothening of load profile in energy efficient buildings: work-in-progress

Embedded Software, Sep 30, 2018

In this work, we propose a multi-objective optimal scheduling strategy for air-conditioning devic... more In this work, we propose a multi-objective optimal scheduling strategy for air-conditioning devices to optimize both energy consumption and thermal comfort for the users. We propose a graph-based modeling for the problem and utilize Johnson's all elementary circuit finding algorithm to obtain the desired solutions. The proposed methodology has been experimented on test cases that mimic real-world scenario, and further, the applicability of Karp's minimum mean cycle algorithm is also studied in this problem set-up.

On Designing a Questionnaire Based Honeyword Generation Approach for Achieving Flatness

2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE), 2018

Honeyword (or fake password) based authentication technique has become a well-established securit... more Honeyword (or fake password) based authentication technique has become a well-established security mechanism for protecting the original password from the server-side attack. However, there are few underlying issues associated with this technique which are still a matter of concern for the security community. Achieving flatness or producing honeywords that are equally likely to the original password is one such major concern that requires further attention. Though recent studies have made significant efforts to meet this flatness criterion, our analysis shows that they still fall short to address this issue. In this paper, at first, we have made a detailed investigation to define the basic properties for achieving flatness. Followed by this, we have proposed a questionnaire-based authentication technique which can generate significantly flatter list of honeywords compared to existing state-of-the-art. Further study reveals that the proposed technique passes the other essential evaluation criteria of honeyword based authentication technique with flying colors.

SLAP: A Secure and Lightweight Authentication Protocol for machine-to-machine communication in industry 4.0

Computers & Electrical Engineering, 2022

An unsupervised heuristic based approach for author name disambiguation

2018 10th International Conference on Communication Systems & Networks (COMSNETS), 2018

Author name disambiguation is one of the very important problems in scientometrics. Plenty of app... more Author name disambiguation is one of the very important problems in scientometrics. Plenty of approaches have been proposed for solving this problem. However, none of the proposed approaches is complete so there is still scope for improvement. In this regard, we have proposed an unsupervised heuristic-based approach for author name disambiguation. The technique also uses the information collected from the web as auxiliary information. Experimental results show that our method performs better than the existing methods.

MBOS: Modified Best Order Sort Algorithm for Performing Non-Dominated Sorting

2018 IEEE Congress on Evolutionary Computation (CEC), 2018

The current paper aims to improve an efficient algorithm for solving the problem of non-dominated... more The current paper aims to improve an efficient algorithm for solving the problem of non-dominated sorting which is one of the dominant steps of any Pareto based multi/many objective optimization algorithms. Recent years witnessed a large number of attempts in developing some solution frameworks for the problem of non-dominated sorting. One such recent approach is ‘Best Order Sort’ which is efficient with respect to the number of dominance comparisons. However, this approach does not perform well in the presence of duplicate solutions. In this paper attempts have been made to modify the ‘Best Order Sort’ and we call this modified version as ‘Modified Best Order Sort’ to remove the above mentioned limitation. The modified best order sort algorithm has been thoroughly analyzed in different scenarios. Current work shows that ‘Best Order Sort’ can be generalized without affecting its best and the worst case time complexities.

On Designing a Lesser Obtrusive Authentication Protocol to Prevent Machine-Learning-Based Threats in Internet of Things

IEEE Internet of Things Journal, 2021

In the era of the Internet of Things (IoT), people access many applications through smartphones f... more In the era of the Internet of Things (IoT), people access many applications through smartphones for controlling smart devices. Therefore, such a centralized node must follow a robust access control mechanism so that an intruder cannot control the connected devices. Recent reports suggest that password can be used as an authentication factor for accessing the smart setups. However, this static information can be compromised under the light of different machine learning (ML)-empowered attack mechanisms. Alarmingly, different sensors used in the IoT setup can also expose this static information to the adversaries. Password-based authentication that uses a challenge–response strategy is an effective solution for handling such threat scenarios. In this article, at first, we show that no existing usable challenge–response protocol is safe to be used in the public area network. Following this, we propose a challenge–response protocol that is more secure to use in the public domain. By using eight classifiers, we show that a learning-based threat specific to our protocol has a marginal impact on the method’s security standard. The discussion in this article also suggests that the proposed protocol has usability and security advantages compared to the existing state of the art (e.g., reduces the number of interactions between the user and verifier by a factor of 0.5).

Work-in-Progress: Towards Optimal Scheduling of Thermal Comfortability and Smoothening of Load Profile in Energy Efficient Buildings

2018 International Conference on Embedded Software (EMSOFT), 2018

Optimal Sizing and Efficient Routing of Electric Vehicles for a Vehicle-on-Demand System

IEEE Transactions on Industrial Informatics, 2022

Due to the steep rise in global population, urbanization, and industrialization, most of the citi... more Due to the steep rise in global population, urbanization, and industrialization, most of the cities in the world today are witnessing increased carbon footprints and reduced per capita space. In such a scenario, vehicle sharing and carpooling systems, specifically with electric vehicles (EV), can significantly help due to the reduced cost of ownership, maintenance, and parking space. In this article, we study the challenging problem of optimal sizing and efficient routing for an electric vehicle-on-demand system. Users demand EVs at the pooling stations at different time instances with individual deadlines to reach the destinations. The objective is to fulfill all the demands respecting the deadlines with minimum investment, which essentially translates to minimizing the total number of EVs. We define the problem formally using mixed-integer linear programming formulation and propose a set of intelligent and efficient heuristic algorithms to solve it efficiently. The proposed algorithms’ performances are tested and validated in a simulated environment on a reasonable size city network with many EV demands. The results obtained show that the proposed heuristic algorithms are competent by reducing 200–360 EVs per day on a network of 282 charging ports, indicating their scalability to be implemented in real-world scenarios.

On Designing A Questionnaire Based Legacy-UI Honeyword Generation Approach For Achieving Flatness

ArXiv, 2017

Modern trend sees a lot usage of \textit{honeywords} (or fake password) for protecting the origin... more Modern trend sees a lot usage of \textit{honeywords} (or fake password) for protecting the original passwords in the password file. However, the usage of \textit{honeywords} has strongly been criticized under the different security and usability parameters. Though many of these issues have been successfully resolved, research in this domain is still facing difficulties in \textit{achieving flatness} (or producing the equally probable \textit{honeywords} with reference to the original password). Though recent studies have made a significant effort to meet this criterion, we show that they either fall short or are based on some unrealistic assumptions. To practically fulfill this flatness criterion, we propose a questionnaire-oriented authentication system based on the episodic (or long term) memory of the users. Our study reveals that proposed mechanism is capable of generating significantly improved flatter list of \textit{honeywords} compared to the existing protocols. The subseque...

Download

Samrat Mondal

Uploads

Papers by Samrat Mondal

Log In