English
Related papers

Related papers: Penetration Testing == POMDP Solving?

200 papers

Cyber-attacks can occur at machine speeds that are far too fast for human-in-the-loop (or sometimes on-the-loop) decision making to be a viable option. Although human inputs are still important, a defensive Artificial Intelligence (AI)…

Artificial Intelligence · Computer Science 2020-02-24 Lashon B. Booker , Scott A. Musman

Agentic AI is transforming security by automating many tasks being performed manually. While initial agentic approaches employed a monolithic architecture, the Model-Context-Protocol has now enabled a remote-procedure call (RPC) paradigm to…

Cryptography and Security · Computer Science 2025-10-07 Zachary Ezetta , Wu-chang Feng

We study synthesis problems with constraints in partially observable Markov decision processes (POMDPs), where the objective is to compute a strategy for an agent that is guaranteed to satisfy certain safety and performance specifications.…

Information theory has been very successful in obtaining performance limits for various problems such as communication, compression and hypothesis testing. Likewise, stochastic control theory provides a characterization of optimal policies…

Information Theory · Computer Science 2018-10-15 Dhruva Kartik , Ekraam Sabir , Urbashi Mitra , Prem Natarajan

This paper investigates backdoor attack planning in stochastic control systems modeled as Markov Decision Processes (MDPs). A backdoor attack involves an adversary deploying a policy that performs well in the original MDP to pass testing,…

Systems and Control · Electrical Eng. & Systems 2026-04-27 Xinyi Wei , Shuo Han , Ahmed H. Hemida , Charles A. Kamhoua , Jie Fu

An Intrusion Detection System (IDS) is a software that monitors a single or a network of computers for malicious activities (attacks) that are aimed at stealing or censoring information or corrupting network protocols. Most techniques used…

Cryptography and Security · Computer Science 2015-05-12 Mahdi Zamani , Mahnush Movahedi

Partially observable Markov decision processes (POMDPs) have been widely used in many robotic applications for sequential decision-making under uncertainty. POMDP online planning algorithms such as Partially Observable Monte-Carlo Planning…

Artificial Intelligence · Computer Science 2024-03-05 Shili Sheng , David Parker , Lu Feng

Partially observable Markov decision processes (POMDP) are a useful model for decision-making under partial observability and stochastic actions. Partially Observable Monte-Carlo Planning is an online algorithm for deciding on the next…

Artificial Intelligence · Computer Science 2023-10-05 Oded Blumenthal , Guy Shani

The olfactory search POMDP (partially observable Markov decision process) is a sequential decision-making problem designed to mimic the task faced by insects searching for a source of odor in turbulence, and its solutions have applications…

Robotics · Computer Science 2023-03-21 Aurore Loisy , Robin A. Heinonen

The goal of an Intrusion Detection is inadequate to detect errors and unusual activity on a network or on the hosts belonging to a local network by monitoring network activity. Algorithms for building detection models are broadly classified…

Networking and Internet Architecture · Computer Science 2010-10-28 M. Sadiq Ali Khan

Intrusion Detection is one of major threats for organization. The approach of intrusion detection using text processing has been one of research interests which is gaining significant importance from researchers. In text mining based…

Cryptography and Security · Computer Science 2016-03-15 Gunupudi RajeshKumar , N Mangathayaru , G Narsimha

Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm able to generate approximate policies for large Partially Observable Markov Decision Processes. The online nature of this method supports scalability by…

Artificial Intelligence · Computer Science 2021-04-29 Giulio Mazzi , Alberto Castellini , Alessandro Farinelli

Partially Observable Markov Decision Processes (POMDPs) are a powerful framework for planning under uncertainty. They allow to model state uncertainty as a belief probability distribution. Approximate solvers based on Monte Carlo sampling…

Artificial Intelligence · Computer Science 2024-03-01 Daniele Meli , Alberto Castellini , Alessandro Farinelli

As per Adusumilli (2015),'70% of corporate business systems today are legacy applications. Recent statistics prove that over 60% of IT budget is spent on maintaining these Legacy systems, showing the rigidity and the fragile nature of these…

Software Engineering · Computer Science 2024-02-19 Sandra Smyth

We study automated intrusion detection in an IT infrastructure, specifically the problem of identifying the start of an attack, the type of attack, and the sequence of actions an attacker takes, based on continuous measurements from the…

Machine Learning · Computer Science 2025-12-23 Xiaoxuan Wang , Rolf Stadler

In this work, we study the problem of verification of systems in the presence of attackers using bounded model checking. Given a system and a set of security requirements, we present a methodology to generate and classify attackers, mapping…

Cryptography and Security · Computer Science 2019-11-15 Eric Rothstein-Morris , Sun Jun , Sudipta Chattopadhyay

Intention deception involves computing a strategy which deceives the opponent into a wrong belief about the agent's intention or objective. This paper studies a class of probabilistic planning problems with intention deception and…

Computer Science and Game Theory · Computer Science 2022-09-02 Jie Fu

Mobile applications are used to handle different types of data. Commonly, there is a set of personal identifiable information present in the data stored, shared and used by these applications. From that, attackers can try to exploit the…

Planning robust executions under uncertainty is a fundamental challenge for building autonomous robots. Partially Observable Markov Decision Processes (POMDPs) provide a standard framework for modeling uncertainty in many applications. In…

Robotics · Computer Science 2018-05-10 Yue Wang , Swarat Chaudhuri , Lydia E. Kavraki

POMDPs capture a broad class of decision making problems, but hardness results suggest that learning is intractable even in simple settings due to the inherent partial observability. However, in many realistic problems, more information is…

Machine Learning · Computer Science 2023-02-07 Jonathan N. Lee , Alekh Agarwal , Christoph Dann , Tong Zhang