SearcharxivSearch

arXiv subjects

Muhammad Hassan

Publications and source records attributed to Muhammad Hassan.

At least 19 recordsLinked to original sources

ANTMAN: An Efficient and Interpretable RTL-Level Run-Time Detection Framework for Stealthy Branch Predictor Attacks on BOOM

Runtime detection of microarchitectural side channel attacks remains significantly underexplored in RISCV compared with x86 and ARM ISAs, posing a serious threat to critical applications. State-of-the-art branch predictor attacks bypass traditional data and instruction caches by directly exploiting the state of internal history tables, making them inherently stealthy. Recent research has explored offline detection of microarchitectural attacks on RISC-V; however, efficient runtime detection of microarchitectural attacks on RISC-V hardware remains significantly unaddressed. State-of-the-art hardware-based runtime detection solutions leverage hardware performance counters (HPCs) but suffer from a restricted set of counter registers and tradeoffs between detection accuracy, detection speed, and sampling granularity, making them impractical for stealthy attacks. Moreover, sampling HPCs after distinct intervals leaves intermediate relationships between different microarchitectural blocks unobserved. Additionally, proprietary x86 and ARM ISAs constrain researchers from modifying processor microarchitectural designs. To address these limitations, we propose the first secure-by-design, highly interpretable, non-intrusive, RTL-level runtime detection solution for stealthy branch predictor attacks on BOOM RISC-V, evaluated under both simplified Next-Line Predictor (NLP) and complex TAGE predictor configurations. The attack detection relies on association rules extracted offline and embedded in hardware as a non-intrusive rule monitor that enables runtime detection. The proposed approach achieves excellent detection speed, terminates execution before secret disclosure, and produces zero false positives while remaining flexible for detecting previously unseen variants within the same family of branch predictor attacks.

cs.CR

Enhancing Reliability of Symbolic Execution Tools for Smart Contract Analysis through Rule-Based False Positive Reduction

A blockchain is a decentralized, secure ledger system that enables transparent and immutable record-keeping, essential for trust and security in digital transactions. Smart contracts are self-executing agreements encoded on a blockchain, enabling different parties to fulfill the terms of the agreement automatically. These contracts trigger corresponding actions when conditions are met, ensuring decentralized and transparent transactions. Writing reliable smart contracts is challenging due to the lack of standardization. To find security vulnerabilities, tools based on various approaches, including symbolic execution, are used. However, these tools often report a large number of false positives, raising concerns about their reliability. The time and effort spent investigating false positives diverts resources from addressing actual vulnerabilities. Therefore, such tools must also be evaluated according to the rate of false positives they exhibit. More importantly, the algorithms and heuristics used by the tools must be enhanced to distinguish between true vulnerabilities and false alarms. In this paper, we first demonstrate the prevalence of false positives in vulnerability reports generated by Mythril, a symbolic execution-based analysis tool for Ethereum smart contracts. We analyze the root causes of these inaccuracies and devise a rule-based approach based on the gained insight to reduce false positives. We implement our rules for the most impactful vulnerabilities in Mythril and assess the effectiveness of our approach. Our results show a significant reduction in false positives without compromising the detection of true vulnerabilities, thus enhancing the tool's reliability.

cs.SE

Gravitational Waves from Multiple Cosmic Superstrings and the Overshoot Problem

Post inflationary string cosmology can feature an initial population of multiple species of cosmic superstrings whose tension is controlled by a modulus rolling over a steep potential toward a late-time minimum. We perform a full analysis of the associated dynamical system, finding that overshooting the minimum is prevented by the friction of a radiation background of gravitational waves produced from the early decay of effective strings arising from NS5- and D3-branes wrapped around internal cycles. On the other hand, fundamental strings survive longer and decay when the modulus is oscillating around the minimum and they have about $1/3$ of the total energy density. The spectrum of gravitational waves generated by the decays of these multiple cosmic superstrings, even if diluted by a late epoch of modulus domination, can still result in a high-frequency, multi-peaked signal, offering an observational signature of generic features of string theory.

hep-th

Towards LLM-assisted High-Quality Property Generation for Solidity Smart Contracts

The immutable nature of smart contracts makes it challenging to fix and patch bugs once they are deployed to a blockchain. This implies that security vulnerabilities may be exposed to possible exploitation for a longer period, necessitating comprehensive pre-deployment testing. Property-based testing combined with fuzzing has proven itself as a promising technique for uncovering vulnerabilities. Traditionally, system properties are written by human experts, which is time-consuming and consequently expensive.With the recent advancement in Large Language Models (LLMs) and their ability to 'understand' natural language and code semantics, it may be possible to generate effective properties. This study, leverages state-of-the-art LLMs to generate high-quality properties for Soliditybased smart contracts. We measure the quality of the generated properties using mutation testing. Our results show that LLMs have the potential to generate high-quality properties that are close to those written by human experts. We extensively evaluate LLMs using various prompting techniques (e.g., zero shot, few shot, and prompt chaining). Overall, we find that Gemini Pro 1.5, when combined with prompt chaining, achieves the highest average mutation score of 25.99% among all studied configurations, closely approaching the human written benchmark of 31.75%. However, our per contract analysis reveals notable variance, particularly for the LibBit contract, where Gemini Pro 1.5 under prompt chaining achieves a mutation score of 74.34%, which is on par with human written properties (74.83%). This highlights that while average performance is informative, individual contract level results demonstrate that LLMs can, in some cases, match expert level property generation.

cs.SE

An Exploratory Study of Malicious Link Posting on Social Media Applications

Social network platforms are now widely used as a mode of communication globally due to their popularity and their ease of use. Among the various content-sharing capabilities made available via these applications, link-sharing is a common activity among social media users. While this feature provides a desired functionality for the platform users, link sharing enables attackers to exploit vulnerabilities and compromise users' devices. Attackers can exploit this content-sharing feature by posting malicious/harmful URLs or deceptive posts and messages which are intended to hide a dangerous link. However, it is not clear how the most common social media applications monitor and/or filter when their users share malicious URLs or links through their platforms. To investigate this security vulnerability, we designed an exploratory study to examine the top five android social media applications' performance when it comes to malicious link sharing. The aim was to determine if the selected applications had any filtering or defenses against malicious URL sharing. Our results show that most of the selected social media applications did not have an effective defense against the posting and spreading of malicious URLs. While our results are exploratory, we believe our study demonstrates the presence of a vital security vulnerability that malicious attackers or unaware users can use to spread harmful links. In addition, our findings can be used to improve our understanding of link-based attacks as well as the design of security measures that usability into account.

cs.SI

Insights from GitHub Community on the Matter Standard: Developer Perspectives and Challenges

Matter seeks to resolve longstanding interoperability problems in the Internet of Things (IoT), yet little is known about how developers experience the standard in day to day work. This paper examines over 13,000 issues from the official Project CHIP GitHub repository to understand the kinds of problems contributors report when implementing and integrating Matter. Using topic modeling and qualitative analysis, we identify four recurring areas of concern, Testing, Interoperability, Development, and Platform and Network, and describe how they manifest in the evolution of the codebase and tooling. The findings reveal systematic technical and integration challenges and point to concrete opportunities to refine Matter's test infrastructure, cross vendor guidance, and documentation as the standard continues to mature.

cs.SE

AI Healthcare Chatbots as Information Infrastructure: A Large-Scale Study of User-Reported Breakdowns

AI healthcare chatbots are increasingly used to support health information seeking and self-management, yet their performance and impact on users remains to be studied. This study examines over 15,000 user reviews from 59 AI healthcare chatbot apps to explore how these systems function in everyday informational and emotional contexts. Topic modeling and interpretive analysis identify three recurring breakdowns: access barriers and service unreliability, user experience and interaction quality, and billing and customer support issues. Privacy and security concerns are associated with the most negative experiences. By framing AI healthcare chatbots as information infrastructures, our findings highlight how failures in access, usability, and trust affect users, offering actionable insights for designers, policymakers, and information professionals aiming to improve digital health systems.

cs.HC

Mitigating Barren Plateaus via Domain Decomposition in Variational Quantum Algorithms for Nonlinear PDEs

Barren plateaus present a major challenge in the training of variational quantum algorithms (VQAs), particularly for large-scale discretizations of nonlinear partial differential equations. In this work, we introduce a domain decomposition framework to mitigate barren plateaus by localizing the cost functional. Our strategy is based on partitioning the spatial domain into overlapping subdomains, each associated with a localized parameterized quantum circuit and measurement operator. Numerical results for the time-independent Gross-Pitaevskii equation show that the domain-decomposed formulation, allowing subdomain iterations to be interleaved with optimization iterations, exhibits improved solution accuracy and stable optimization compared to the global VQA formulation.

math.NA

DRsam: Detection of Fault-Based Microarchitectural Side-Channel Attacks in RISC-V Using Statistical Preprocessing and Association Rule Mining

RISC-V processors are becoming ubiquitous in critical applications, but their susceptibility to microarchitectural side-channel attacks is a serious concern. Detection of microarchitectural attacks in RISC-V is an emerging research topic that is relatively underexplored, compared to x86 and ARM. The first line of work to detect flush+fault-based microarchitectural attacks in RISC-V leverages Machine Learning (ML) models, yet it leaves several practical aspects that need further investigation. To address overlooked issues, we leveraged gem5 and propose a new detection method combining statistical preprocessing and association rule mining having reconfiguration capabilities to generalize the detection method for any microarchitectural attack. The performance comparison with state-of-the-art reveals that the proposed detection method achieves up to 5.15% increase in accuracy, 7% rise in precision, and 3.91% improvement in recall under the cryptographic, computational, and memory-intensive workloads alongside its flexibility to detect new variant of flush+fault attack. Moreover, as the attack detection relies on association rules, their human-interpretable nature provides deep insight to understand microarchitectural behavior during the execution of attack and benign applications.

cs.CR

Threats and Security Strategies for IoMT Infusion Pumps

The integration of the Internet of Medical Things (IoMT) into healthcare systems has transformed patient care by enabling real-time monitoring, enhanced diagnostics, and enhanced operational efficiency. However, this increased connectivity has also expanded the attack surface for cybercriminals, raising significant cybersecurity and privacy concerns. This study focuses on the cybersecurity vulnerabilities of IoMT infusion pumps, which are critical devices in modern healthcare. Through a targeted literature review of the past five years, we analyzed seven current studies from a pool of 132 papers to identify security vulnerabilities. Our findings indicate that infusion pumps face vulnerabilities such as device-level flaws, authentication and access control issues, network and communication weaknesses, data security and privacy risks, and operational or organizational challenges that can expose them to lateral attacks within healthcare networks. Our analysis synthesizes findings from seven recent studies to clarify how and why infusion pumps remain vulnerable in each of these areas. By categorizing the security gaps, we highlight critical risk patterns and their implications. This work underscores the scope of the issue and provides a structured understanding that is valuable for healthcare IT professionals and device manufacturers. Ultimately, the findings can inform the development of targeted, proactive security strategies to better safeguard infusion pumps and protect patient well-being.

cs.CR

An additive two-level parallel variant of the DMRG algorithm with coarse-space correction

The density matrix renormalization group (DMRG) algorithm is a popular alternating minimization scheme for solving high-dimensional optimization problems in the tensor train format. Classical DMRG, however, is based on sequential minimization, which raises challenges in its implementation on parallel computing architectures. To overcome this, we propose a novel additive two-level DMRG algorithm that combines independent, local minimization steps with a global update step using a subsequent coarse-space minimization. Our proposed algorithm, which is directly inspired by additive Schwarz methods from the domain decomposition literature, is particularly amenable to implementation on parallel, distributed architectures since both the local minimization steps and the construction of the coarse-space can be performed in parallel. Numerical experiments on strongly correlated molecular systems demonstrate that the method achieves competitive convergence rates while achieving significant parallel speedups.

math.NA

AIM: A User-friendly GUI Workflow program for Isotherm Fitting, Mixture Prediction, Isosteric Heat of Adsorption Estimation, and Breakthrough Simulation

Adsorption breakthrough modeling often requires complex software environments and scripting, limiting accessibility for many practitioners. We present AIM, a MATLAB-based graphical user interface (GUI) application that streamlines fixed-bed adsorption modeling and analysis through an integrated workflow, which includes isotherm fitting, estimation of the enthalpy of adsorption, prediction of mixture behavior, and multicomponent breakthrough simulations. AIM supports 13 isotherm models for isotherm fitting and includes the implementation of Ideal Adsorbed Solution Theory (IAST) (FastIAS) and extended Langmuir models for predicting mixture isotherms. Moreover, the isotherm models can be used to run non-isothermal breakthrough simulations along with isosteric enthalpies of adsorption from the Clausius-Clapeyron and Virial equations. Users can export detailed column and outlet profiles (e.g., composition, temperature) in multiple formats, enhancing reproducibility and data sharing among practitioners. We compared the breakthrough simulation results from the AIM workflow and compared that with the experimental data in the literature for a ternary gas mixture (CO2/H2/N2) and found excellent agreement for outlet compositions and temperature profiles.

cond-mat.mtrl-sci

Using Label-Free Raman Spectroscopy Integrated with Microfluidic Chips to Probe Ferroptosis Networks in Cells

Ferroptosis, a regulated form of cell death driven by oxidative stress and lipid peroxidation, has emerged as a pivotal research focus with implications across various cellular contexts. In this study, we employed a multifaceted approach, integrating label-free Raman spectroscopy and microfluidics to study the mechanisms underpinning ferroptosis. Our investigations included the ferroptosis initiation based on the changes in the lipid Raman band at 1436 cm-1 under different cellular states, the generation of reactive oxygen species (ROS), lipid peroxidation, DNA damage/repair, and mitochondrial dysfunction. Importantly, our work highlighted the dynamic role of vital cellular components, such as NADPH, ferredoxin clusters, and key genes like GPX-4, VDAC2, and NRF2, as they collectively influenced cellular responses to redox imbalance and oxidative stress. Quantum mechanical (QM) and molecular docking simulations (MD) provided further evidence of interactions between the ferredoxin (containing 4Fe-4S clusters), NADPH and ROS which led to the production of reactive Fe species in the cells. As such, our approach offered a real-time, multidimensional perspective on ferroptosis, surpassing traditional biological methods, and providing valuable insights for therapeutic interventions in diverse biomedical contexts.

physics.bio-ph

On the relation between Galerkin approximations and canonical best-approximations of solutions to some non-linear Schr\"odinger equations

In this paper, we establish a superconvergence property of Galerkin approximations to some non-linear Schr\"odinger equations of Gross-Pitaevskii type. More precisely, denoting by $u^*\in X \subseteq H^1(\Omega)$ the exact solution to such an equation, by $\{X_{\delta}\}_{\delta >0}$, a sequence of conforming subspaces of $X$ satisfying the approximation property, by $u_\delta^*\in X_{\delta}$ the Galerkin solution to the equation, and by $\Pi^X_{\delta} u^*$, the $(\cdot, \cdot)_{X}$-best approximation in $X_\delta$ of $u^*$, we show -- under some assumptions -- that $u_\delta^*$ converges at a higher rate to $\Pi^X_{\delta} u^*$ than to $u^*$ in both the $L^2$ norm and the canonical $H^1$ norm. Our results apply to conforming finite element discretisations as well as spectral Galerkin methods based on polynomials or Fourier (plane-wave) expansions.

math.NA

Unveiling Privacy and Security Gaps in Female Health Apps

Female Health Applications (FHA), a growing segment of FemTech, aim to provide affordable and accessible healthcare solutions for women globally. These applications gather and monitor health and reproductive data from millions of users. With ongoing debates on women's reproductive rights and privacy, it's crucial to assess how these apps protect users' privacy. In this paper, we undertake a security and data protection assessment of 45 popular FHAs. Our investigation uncovers harmful permissions, extensive collection of sensitive personal and medical data, and the presence of numerous third-party tracking libraries. Furthermore, our examination of their privacy policies reveals deviations from fundamental data privacy principles. These findings highlight a significant lack of privacy and security measures for FemTech apps, especially as women's reproductive rights face growing political challenges. The results and recommendations provide valuable insights for users, app developers, and policymakers, paving the way for better privacy and security in Female Health Applications.

cs.HC

Decoding User Concerns in AI Health Chatbots: An Exploration of Security and Privacy in App Reviews

AI powered health chatbot applications are increasingly utilized for personalized healthcare services, yet they pose significant challenges related to user data security and privacy. This study evaluates the effectiveness of automated methods, specifically BART and Gemini GenAI, in identifying security privacy related (SPR) concerns within these applications' user reviews, benchmarking their performance against manual qualitative analysis. Our results indicate that while Gemini's performance in SPR classification is comparable to manual labeling, both automated methods have limitations, including the misclassification of unrelated issues. Qualitative analysis revealed critical user concerns, such as data collection practices, data misuse, and insufficient transparency and consent mechanisms. This research enhances the understanding of the relationship between user trust, privacy, and emerging mobile AI health chatbot technologies, offering actionable insights for improving security and privacy practices in AI driven health chatbots. Although exploratory, our findings highlight the necessity for rigorous audits and transparent communication strategies, providing valuable guidance for app developers and vendors in addressing user security and privacy concerns.

cs.CR

RISC-V V Vector Extension (RVV) with reduced number of vector registers

To reduce the area of RISC-V Vector extension (RVV) in small processors, the authors are considering one simple modification: reduce the number of registers in the vector register file. The standard 'V' extension requires 32 vector registers that we propose to reduce to 16 or 8 registers. Other features of RVV are still supported. Reducing the number of vector registers does not generate a completely new programming model: although the resulting core does not have binary code compatibility with standard RVV, compiling for it just requires parameterization of the vector register file size in the compiler. The reduced vector register file allows for still high utilization of vector RVV processor core. Many useful signal processing kernels require few registers, and become efficient at 1:4 chaining ratio.

cs.AR

Trace estimates for harmonic functions along circular arcs with applications to domain decomposition on overlapping disks

In this paper we derive several (and in many cases sharp) estimates for the $\mathrm{L}^2$-trace norm of harmonic functions along circular arcs. More precisely, we obtain geometry-dependent estimates on the norm, spectral radius, and numerical range of the Dirchlet-to-Dirichlet (DtD) operator sending data on the boundary of the disk to the restriction of its harmonic extension along circular arcs inside the disk. The estimates we derive here have applications in the convergence analysis of the Schwarz domain decomposition method for overlapping disks in two dimensions. In particular, they allow us to establish a rigorous convergence proof for the discrete parallel Schwarz method applied to the Conductor-like Screening Model (COSMO) from theoretical chemistry in the two-disk case, and to derive error estimates with respect to the discretization parameter, the number of Schwarz iterations, and the geometry of the domain. Our analysis addresses challenges beyond classical domain decomposition theory, especially the weak enforcement of boundary conditions.

math.AP