Browser Security Attacks and Detection Techniques: A Case of Tabnabbing

2020 ◽  
Vol 8 (1) ◽  
pp. 33-41
Author(s):  
Dr. S. Sarika ◽  
Keyword(s):  
Credit Card ◽  
State Of The Art ◽  
Experimental Results ◽  
Detection Technique ◽  
Security Attacks ◽  
Agent Based ◽  
Detection Techniques ◽  
Browser Security ◽  
Cyber Threats ◽  
Multi Agent

Phishing is a malicious and deliberate act of sending counterfeit messages or mimicking a webpage. The goal is either to steal sensitive credentials like login information and credit card details or to install malware on a victim’s machine. Browser-based cyber threats have become one of the biggest concerns in networked architectures. The most prolific form of browser attack is tabnabbing which happens in inactive browser tabs. In a tabnabbing attack, a fake page disguises itself as a genuine page to steal data. This paper presents a multi agent based tabnabbing detection technique. The method detects heuristic changes in a webpage when a tabnabbing attack happens and give a warning to the user. Experimental results show that the method performs better when compared with state of the art tabnabbing detection techniques.

A Simulation Software for the Evaluation of Vulnerabilities in Reputation Management Systems

2021 ◽  
Vol 37 (1-4) ◽  
pp. 1-30
Author(s):  
Vincenzo Agate ◽  
Alessandra De Paola ◽  
Giuseppe Lo Re ◽  
Marco Morana
Keyword(s):  
Quality Of Service ◽  
Distributed Systems ◽  
State Of The Art ◽  
Simulation Software ◽  
Reputation Management ◽  
Management Systems ◽  
Security Attacks ◽  
Vulnerability Evaluation ◽  
Multi Agent

Multi-agent distributed systems are characterized by autonomous entities that interact with each other to provide, and/or request, different kinds of services. In several contexts, especially when a reward is offered according to the quality of service, individual agents (or coordinated groups) may act in a selfish way. To prevent such behaviours, distributed Reputation Management Systems (RMSs) provide every agent with the capability of computing the reputation of the others according to direct past interactions, as well as indirect opinions reported by their neighbourhood. This last point introduces a weakness on gossiped information that makes RMSs vulnerable to malicious agents’ intent on disseminating false reputation values. Given the variety of application scenarios in which RMSs can be adopted, as well as the multitude of behaviours that agents can implement, designers need RMS evaluation tools that allow them to predict the robustness of the system to security attacks, before its actual deployment. To this aim, we present a simulation software for the vulnerability evaluation of RMSs and illustrate three case studies in which this tool was effectively used to model and assess state-of-the-art RMSs.

scholarly journals Trust in multi-agent systems

2004 ◽  
Vol 19 (1) ◽  
pp. 1-25 ◽  
Author(s):  
SARVAPALI D. RAMCHURN ◽  
DONG HUYNH ◽  
NICHOLAS R. JENNINGS
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
Comprehensive Treatment ◽  
Multi Agent Systems ◽  
Agent Based ◽  
Agent Systems ◽  
The Core ◽  
Open Distributed Systems ◽  
Multi Agent

Trust is a fundamental concern in large-scale open distributed systems. It lies at the core of all interactions between the entities that have to operate in such uncertain and constantly changing environments. Given this complexity, these components, and the ensuing system, are increasingly being conceptualised, designed, and built using agent-based techniques and, to this end, this paper examines the specific role of trust in multi-agent systems. In particular, we survey the state of the art and provide an account of the main directions along which research efforts are being focused. In so doing, we critically evaluate the relative strengths and weaknesses of the main models that have been proposed and show how, fundamentally, they all seek to minimise the uncertainty in interactions. Finally, we outline the areas that require further research in order to develop a comprehensive treatment of trust in complex computational settings.

Multi-Agent–Based Simulation of University Email Communities

2011 ◽  
pp. 273-291
Author(s):  
David Rodrigues
Keyword(s):  
Communication Network ◽  
Network Formation ◽  
Real Data ◽  
Informal Communication ◽  
University Environment ◽  
Agent Based ◽  
Detection Techniques ◽  
The Social ◽  
Multi Agent ◽  
Full Knowledge

In this chapter, a study on informal communication network formation in a university environment is presented. The teacher communication network is analyzed through community detection techniques. It is evident that informal communication is an important process that traverses the vertical hierarchical structure of departments and courses in a university environment. A multi-agent model of the case study is presented here, showing the implications of using real data as training sets for multi-agent-based simulations. The influence of the “social neighborhood,” as a mechanism to create assortative networks of contacts without full knowledge of the network, is discussed. It is shown that the radius of this social neighborhood has an effect on the outcome of the network structure and that in a university’s case this distance is relatively small.

Optimal Consensus Recovery of Multi-agent System Subjected to Agent Failure

2020 ◽  
Vol 29 (06) ◽  
pp. 2050017
Author(s):  
Deep Shekhar Acharya ◽  
Sudhansu Kumar Mishra
Keyword(s):  
Communication Channel ◽  
State Of The Art ◽  
Normal Operation ◽  
Multi Agent Systems ◽  
External Disturbances ◽  
Algorithmic Approach ◽  
Agent Based ◽  
Quick Recovery ◽  
Multi Agent ◽  
Agent Networks

Multi-Agent Systems are susceptible to external disturbances, sensor failures or collapse of communication channel/media. Such failures disconnect the agent network and thereby hamper the consensus of the system. Quick recovery of consensus is vital to continue the normal operation of an agent-based system. However, only limited works in the past have investigated the problem of recovering the consensus of an agent-based system in the event of a failure. This work proposes a novel algorithmic approach to recover the lost consensus, when an agent-based system is subject to the failure of an agent. The main focus of the algorithm is to reconnect the multi-agent network in a way so as to increase the connectivity of the network, post recovery. The proposed algorithm may be applied to both linear and non-linear continuous-time consensus protocols. To verify the efficiency of the proposed algorithm, it has been applied and tested on two multi-agent networks. The results, thus obtained, have been compared with other state-of-the-art recovery algorithms. Finally, it has been established that the proposed algorithm achieves better connectivity and therefore, faster consensus when compared to the other state-of-the-art.

scholarly journals All-in-One Framework for Detection, Unpacking, and Verification for Malware Analysis

2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Mi-Jung Choi ◽  
Jiwon Bang ◽  
Jongwook Kim ◽  
Hajin Kim ◽  
Yang-Sae Moon
Keyword(s):  
Detection Method ◽  
State Of The Art ◽  
Experimental Results ◽  
Detection Accuracy ◽  
Malware Analysis ◽  
Integrated Framework ◽  
Detection Techniques ◽  
Verification Algorithm ◽  
Extensive Analysis ◽  
Hybrid Detection

Packing is the most common analysis avoidance technique for hiding malware. Also, packing can make it harder for the security researcher to identify the behaviour of malware and increase the analysis time. In order to analyze the packed malware, we need to perform unpacking first to release the packing. In this paper, we focus on unpacking and its related technologies to analyze the packed malware. Through extensive analysis on previous unpacking studies, we pay attention to four important drawbacks: no phase integration, no detection combination, no real-restoration, and no unpacking verification. To resolve these four drawbacks, in this paper, we present an all-in-one structure of the unpacking system that performs packing detection, unpacking (i.e., restoration), and verification phases in an integrated framework. For this, we first greatly increase the packing detection accuracy in the detection phase by combining four existing and new packing detection techniques. We then improve the unpacking phase by using the state-of-the-art static and dynamic unpacking techniques. We also present a verification algorithm evaluating the accuracy of unpacking results. Experimental results show that the proposed all-in-one unpacking system performs all of the three phases well in an integrated framework. In particular, the proposed hybrid detection method is superior to the existing methods, and the system performs unpacking very well up to 100% of restoration accuracy for most of the files except for a few packers.

scholarly journals Multi-agent based data mining aggregation approaches using machine learning techniques

2018 ◽  
Vol 7 (3) ◽  
pp. 1136
Author(s):  
V Devasekhar ◽  
P Natarajan
Keyword(s):  
Machine Learning ◽  
Data Mining ◽  
Optimization Algorithm ◽  
Experimental Results ◽  
Machine Learning Techniques ◽  
Statistical Features ◽  
Agent Based ◽  
Cluster Data ◽  
Learning Techniques ◽  
Multi Agent

Data Mining is an extraction of important knowledge from the various databases using different kinds of approaches. In the multi agent, distributed mining the knowledge aggregation is one of challenging task. This paper tries to optimize the problem of aggregation and boils down into the solution, which is derived based on the machine learning statistical features of each agents. However, in this paper a novel optimization algorithm called Multi-Agent Based Data Mining Aggregation (MABDA) is used for present day’s scenarios. The MBADA algorithm has agents which collect extracted knowledge and summarizes the various levels of agent’s cluster data into an aggregation with maximum accuracies. To prove the effectiveness of the proposed algorithm, the experimental results are compared with relatively existing methods. 

A REVIEW ON THE INTERACTION ISSUES IN AGENT-BASED MARKETPLACES

2002 ◽  
Vol 01 (03) ◽  
pp. 457-471 ◽  
Author(s):  
JEAN-LUC KONING
Keyword(s):  
Electronic Commerce ◽  
State Of The Art ◽  
Agent Based ◽  
Related Research ◽  
Agent Interactions ◽  
Research Perspectives ◽  
Complex Agent ◽  
Virtual Institutions ◽  
Multi Agent ◽  
Bilateral Negotiations

While there are already literature surveys upon agent-mediated electronic commerce applications, none have specifically tackled the issue from an interaction perspective or looked at how the control is distributed among the agents. This state-of-the-art survey focuses on how agent interactions are handled. First, it deeply looks at how methods for enforcing the actions taken by agents have been dealt with, namely protocols, negotiation and auction. Second, it defines the various types of communication languages used in multi-agent market architectures. The three main alternatives are KQML, ACL and FLBC. A comparison is then made between them and shows how much they suite their purpose. Third, this paper highlights how the current electronic commerce applications provide explicit and integrated support for complex agent interactions and present several virtual institutions where agents are engaged in multiple bilateral negotiations. Finally, it discusses some related research perspectives and identify some limitations.

scholarly journals Multi-Agent Planning with Baseline Regret Minimization

2017 ◽  
Author(s):  
Feng Wu ◽  
Shlomo Zilberstein ◽  
Xiaoping Chen
Keyword(s):  
State Of The Art ◽  
Experimental Results ◽  
Benchmark Problems ◽  
Minimization Algorithm ◽  
Generation Algorithm ◽  
Regret Minimization ◽  
Multi Agent ◽  
Planning Problems ◽  
Multi Agent Planning ◽  
Better Than

We propose a novel baseline regret minimization algorithm for multi-agent planning problems modeled as finite-horizon decentralized POMDPs. It guarantees to produce a policy that is provably better than or at least equivalent to the baseline policy. We also propose an iterative belief generation algorithm to effectively and efficiently minimize the baseline regret, which only requires necessary iterations to converge to the policy with minimum baseline regret. Experimental results on common benchmark problems confirm its advantage comparing to the state-of-the-art approaches.

Agent-Based Integrated and Collaborative Engineering Asset Management

2008 ◽  
Vol 594 ◽  
pp. 481-493 ◽  
Author(s):  
David W. Hsiao ◽  
Amy J.C. Trappey ◽  
Lin Ma ◽  
Yat Chih Fan ◽  
Yen Chieh Mao
Keyword(s):  
Asset Management ◽  
State Of The Art ◽  
Process Models ◽  
Resource Manager ◽  
Agent Based ◽  
Collaborative Environment ◽  
Renewal Time ◽  
Architectural Framework ◽  
Automatic Parking ◽  
Multi Agent

Engineering assets are fundamentally important to enterprises. Thus, making the best use of engineering assets attracts equipment and system engineers’ attention. The state-of-the-art researches contribute to asset condition monitoring, asset symptom diagnosis, asset health prognosis, and the integration of above knowledge. However, they still lack the combination with enterprise resources to determine the best maintenance/renewal time for the optimization of total enterprise benefits. Consequently, this paper proposes the integrated architectural framework, activity and process models of a multi-agent system called agent-based integrated engineering asset management (AIEAM) based on agent techniques to build collaborative environment for asset manager, diagnosis expert, prognosis expert and enterprise resource manager. An engineering asset management case (for repair and maintenance of automatic parking tower) applying the proposed architecture and models is depicted in the paper.

Sign in / Sign up

Export Citation Format

Share Document