Basel Alomair
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Basel Alomair has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Andrew Clark
Washington University in St. Louis
7 shared publications - Radha Poovendran
University of Washington, Seattle, Washington, USA
7 shared publications Radha Poovendran
For Science and Technology ♣ University of Washington ✠ King Abdulaziz City
5 shared publicationsLinda Bushnell
4 shared publications- Linda Bushnell
Department of Electrical and Computer Engineering, University of Washington, Seattle, WA, USA
4 shared publications - Andrew Clark
Department of Electrical Engineering University of Washington 98195 Seattle WA
2 shared publications
Latest Publications
- Open Access
- 11 August 2026
- Published by Springer Nature
- p. 193-224
UCX is All You Need: A Universal Transform for Committing Authenticated Encryption
- 11 August 2026
- Published by Springer Nature
- p. 193-224
Open AccessUCX is All You Need: A Universal Transform for Committing Authenticated Encryption
- Open Access
BadScientist: Can a Research Agent Write Convincing but Unsound Papers that Fool LLM Reviewers?
The convergence of LLM-powered research assistants and AI-based peer review systems creates a critical vulnerability: fully automated publication loops where AI-generated research is evaluated by AI reviewers without human oversight. We investigate this through \textbf{BadScientist}, a framework that evaluates whether fabrication-oriented paper generation agents can deceive multi-model LLM review systems. Our generator employs presentation-manipulation strategies requiring no real experiments. We develop a rigorous evaluation framework with formal error guarantees (concentration bounds and calibration analysis), calibrated on real data. Our results reveal systematic vulnerabilities: fabricated papers achieve acceptance rates up to . Critically, we identify \textit{concern-acceptance conflict} -- reviewers frequently flag integrity issues yet assign acceptance-level scores. Our mitigation strategies show only marginal improvements, with detection accuracy barely exceeding random chance. Despite provably sound aggregation mathematics, integrity checking systematically fails, exposing fundamental limitations in current AI-driven review systems and underscoring the urgent need for defense-in-depth safeguards in scientific publishing.
Open AccessBadScientist: Can a Research Agent Write Convincing but Unsound Papers that Fool LLM Reviewers?
The convergence of LLM-powered research assistants and AI-based peer review systems creates a critical vulnerability: fully automated publication loops where AI-generated research is evaluated by AI reviewers without human oversight. We investigate this through \textbf{BadScientist}, a framework that evaluates whether fabrication-oriented paper generation agents can deceive multi-model LLM review systems. Our generator employs presentation-manipulation strategies requiring no real experiments. We develop a rigorous evaluation framework with formal error guarantees (concentration bounds and calibration analysis), calibrated on real data. Our results reveal systematic vulnerabilities: fabricated papers achieve acceptance rates up to . Critically, we identify \textit{concern-acceptance conflict} -- reviewers frequently flag integrity issues yet assign acceptance-level scores. Our mitigation strategies show only marginal improvements, with detection accuracy barely exceeding random chance. Despite provably sound aggregation mathematics, integrity checking systematically fails, exposing fundamental limitations in current AI-driven review systems and underscoring the urgent need for defense-in-depth safeguards in scientific publishing.
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 230-241
JailbreaksOverTime: Detecting Jailbreak Attacks Under Distribution Shift
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 230-241
Open AccessJailbreaksOverTime: Detecting Jailbreak Attacks Under Distribution Shift
- Open Access
- 4 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 341-352
PromptShield: Deployable Detection for Prompt Injection Attacks
- 4 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 341-352
Open AccessPromptShield: Deployable Detection for Prompt Injection Attacks
- 25 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (11) , 4470-4483
On the Structure and Computation of Random Walk Times in Finite Graphs
- 25 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (11) , 4470-4483
On the Structure and Computation of Random Walk Times in Finite Graphs
- Open Access
On the Structure and Computation of Random Walk Times in Finite Graphs
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the convergence of Markov processes, as well as applications in control, machine learning, and social sciences. In this paper, we investigate the computational structure of the random walk times as a function of the set of target nodes, and find that the commute, hitting, and cover times all exhibit submodular structure, even in non-stationary random walks. We provide a unifying proof of this structure by considering each of these times as special cases of stopping times. We generalize our framework to walks in which the transition probabilities and target sets are jointly chosen to minimize the travel times, leading to polynomial-time approximation algorithms for choosing target sets. Our results are validated through numerical study.
Open AccessOn the Structure and Computation of Random Walk Times in Finite Graphs
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the convergence of Markov processes, as well as applications in control, machine learning, and social sciences. In this paper, we investigate the computational structure of the random walk times as a function of the set of target nodes, and find that the commute, hitting, and cover times all exhibit submodular structure, even in non-stationary random walks. We provide a unifying proof of this structure by considering each of these times as special cases of stopping times. We generalize our framework to walks in which the transition probabilities and target sets are jointly chosen to minimize the travel times, leading to polynomial-time approximation algorithms for choosing target sets. Our results are validated through numerical study.
- Open Access
- 9 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 62 (10) , 5055-5068
Toward Synchronization in Networks With Nonlinear Dynamics: A Submodular Optimization Framework
Synchronization underlies phenomena including memory and perception in the brain, coordinated motion of animal flocks, and stability of the power grid. These synchronization phenomena are often modeled through networks of phase-coupled oscillating nodes. Heterogeneity in the node dynamics, however, may prevent such networks from achieving the required level of synchronization. In order to guarantee synchronization, external inputs can be used to pin a subset of nodes to a reference frequency, while the remaining nodes are steered toward synchronization via local coupling. In this paper, we present a submodular optimization framework for selecting a set of nodes to act as external inputs in order to achieve synchronization from a desired set of initial states. We derive threshold-based sufficient conditions for synchronization, and then prove that these conditions are equivalent to constraints on monotone submodular functions over partition matroids. Based on this connection, we map the sufficient conditions for synchronization to constraints on submodular functions, leading to efficient algorithms with provable optimality bounds for selecting input nodes. We illustrate our approach via numerical studies of synchronization in power systems.
- 9 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 62 (10) , 5055-5068
Open AccessToward Synchronization in Networks With Nonlinear Dynamics: A Submodular Optimization Framework
Synchronization underlies phenomena including memory and perception in the brain, coordinated motion of animal flocks, and stability of the power grid. These synchronization phenomena are often modeled through networks of phase-coupled oscillating nodes. Heterogeneity in the node dynamics, however, may prevent such networks from achieving the required level of synchronization. In order to guarantee synchronization, external inputs can be used to pin a subset of nodes to a reference frequency, while the remaining nodes are steered toward synchronization via local coupling. In this paper, we present a submodular optimization framework for selecting a set of nodes to act as external inputs in order to achieve synchronization from a desired set of initial states. We derive threshold-based sufficient conditions for synchronization, and then prove that these conditions are equivalent to constraints on monotone submodular functions over partition matroids. Based on this connection, we map the sufficient conditions for synchronization to constraints on submodular functions, leading to efficient algorithms with provable optimality bounds for selecting input nodes. We illustrate our approach via numerical studies of synchronization in power systems.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 959-963
The MISO wiretap channel with channel uncertainty: Asymptotic perspectives
The N-antenna MISO Gaussian wiretap channel with imperfect channel-state information at the transmitter (CSIT) is studied in terms of secrecy rate scaling versus the signal-to-noise ratio (SNR) and N. Two schemes are considered, beamforming (BF) and artificial noise injection (AN). It is shown that if the CSIT error is independent of SNR, then both schemes do not achieve scaling versus SNR. However, if this error vanishes as SNR increases, then AN achieves the optimal scaling versus SNR, contrary to BF. Scaling can be achieved in BF by increasing N. In fact, BF achieves the optimal scaling versus N. In the AN scheme however, injecting noise in multiple direction deteriorates its scaling versus N. Nevertheless, AN can achieve the optimal scaling if noise is sent in only one direction. This leads to better performance than BF if the CSIT error is smaller than a threshold which is also derived.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 959-963
The MISO wiretap channel with channel uncertainty: Asymptotic perspectives
The N-antenna MISO Gaussian wiretap channel with imperfect channel-state information at the transmitter (CSIT) is studied in terms of secrecy rate scaling versus the signal-to-noise ratio (SNR) and N. Two schemes are considered, beamforming (BF) and artificial noise injection (AN). It is shown that if the CSIT error is independent of SNR, then both schemes do not achieve scaling versus SNR. However, if this error vanishes as SNR increases, then AN achieves the optimal scaling versus SNR, contrary to BF. Scaling can be achieved in BF by increasing N. In fact, BF achieves the optimal scaling versus N. In the AN scheme however, injecting noise in multiple direction deteriorates its scaling versus N. Nevertheless, AN can achieve the optimal scaling if noise is sent in only one direction. This leads to better performance than BF if the CSIT error is smaller than a threshold which is also derived.
- 1 December 2016
- Published by Wiley in Security and Communication Networks
- Vol. 9 (18) , 6173-6188
Authenticated encryption: how reordering can impact performance
- 1 December 2016
- Published by Wiley in Security and Communication Networks
- Vol. 9 (18) , 6173-6188
Authenticated encryption: how reordering can impact performance
- Open Access
Adaptive Mitigation of Multi-Virus Propagation: A Passivity-Based Approach
Malware propagation poses a growing threat to networked systems such as computer networks and cyber-physical systems. Current approaches to defending against malware propagation are based on patching or filtering susceptible nodes at a fixed rate. When the propagation dynamics are unknown or uncertain, however, the static rate that is chosen may be either insufficient to remove all viruses or too high, incurring additional performance cost. In this paper, we formulate adaptive strategies for mitigating multiple malware epidemics when the propagation rate is unknown, using patching and filtering-based defense mechanisms. In order to identify conditions for ensuring that all viruses are asymptotically removed, we show that the malware propagation, patching, and filtering processes can be modeled as coupled passive dynamical systems. We prove that the patching rate required to remove all viruses is bounded above by the passivity index of the coupled system, and formulate the problem of selecting the minimum-cost mitigation strategy. Our results are evaluated through numerical study.
Open AccessAdaptive Mitigation of Multi-Virus Propagation: A Passivity-Based Approach
Malware propagation poses a growing threat to networked systems such as computer networks and cyber-physical systems. Current approaches to defending against malware propagation are based on patching or filtering susceptible nodes at a fixed rate. When the propagation dynamics are unknown or uncertain, however, the static rate that is chosen may be either insufficient to remove all viruses or too high, incurring additional performance cost. In this paper, we formulate adaptive strategies for mitigating multiple malware epidemics when the propagation rate is unknown, using patching and filtering-based defense mechanisms. In order to identify conditions for ensuring that all viruses are asymptotically removed, we show that the malware propagation, patching, and filtering processes can be modeled as coupled passive dynamical systems. We prove that the patching rate required to remove all viruses is bounded above by the passivity index of the coupled system, and formulate the problem of selecting the minimum-cost mitigation strategy. Our results are evaluated through numerical study.