Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,922 papers · 148 categories

Trend · papers per month

285683111 · Jun 202019922001200920172026
48 results for Security attacks

This paper discusses adversarial attacks on cyber security systems using machine learning.

problem Adversarial attacks limit the use of machine learning in cyber security.
method Characterizes adversarial attack methods and their applications in cyber security.
result Highlights unique challenges and future research directions for adversarial attacks in cyber security.

This research secures deployed sentiment analysis models by identifying and defending against attack vectors.

problem Securing deployed machine learning models, particularly sentiment analysis systems, from adversarial attacks.
method BAD (Build, Attack, Defend) Architecture, evaluating two implementations.
result Demonstrated a viable methodology for securing machine learning models in production.

secml is a Python library for secure and explainable machine learning.

problem Evaluate and understand security and explainability of machine learning models.
method Implement attacks and explainability methods for various algorithms.
result Demonstrates how quickly models fail under adversarial perturbations and visualizes influential features.

To promote secure and private artificial intelligence (SPAI), we review studies on the model security and data privacy of DNNs. Model security allows system to behave as intended without being affected by malicious external influences that can compromise its integrity and efficiency. Security attacks can be divided bas…

2018-07-31abs ↗pdf ↗

New study analyzes security of neural network data reconstruction attacks.

problem Data reconstruction attacks pose a threat to private training data.
method Analyzes security boundary of data reconstruction attacks via neuron exclusivity state.
result Characterizes insecure/secure boundary of data reconstruction attacks.

Study assesses how much security restaking protocols need to pay for.

problem Determining the optimal security level for restaking protocols using token incentives.
method Expanding a model by Durvasula and Roughgarden to include strategic attackers and node operators, constructing an approximation algorithm for token-based incentives.
result Restaking protocols can be secure with proper incentive management, even against strategic adversaries.

This work develops secure distributed algorithms for machine learning to protect against data poisoning and network attacks.

problem Vulnerability of distributed machine learning algorithms to cyber threats.
method Game-theoretic framework to capture conflicting goals of a learner and an attacker, iterative distributed algorithm.
result Distributed SVM is prone to fail in different types of attacks, with impact depending on network structure and attack capabilities.

Paper proposes efficient privacy-preserving matrix encryption for secure collaborative learning against malicious adversaries.

problem Secure collaborative learning of sensitive data across different agencies is challenging with malicious adversaries.
method The paper applies matrix encryption to secure data against chosen plaintext attack, known plaintext attack, and collusion attack, achieving local differential privacy and high computation efficiency.
result The proposed schemes are computationally efficient and secure against malicious adversaries compared to existing techniques.

The paper certifies decision trees against evasion attacks using program analysis.

problem Vulnerability of decision tree models to evasion attacks by maliciously crafted perturbations.
method Transform decision trees into imperative programs for program analysis, leveraging abstract interpretation.
result Soundly verifies security guarantees of decision tree models, yielding minimal false positives.

Adversarial edit attacks improve machine learning model security for tree data.

problem Improving security of machine learning models for tree-structured data.
method Extends adversarial attacks to tree-structured data using tree edit distance and black-box queries.
result Many tree classifiers can be effectively attacked, demonstrating the vulnerability of these models.

This study extends verifiable learning to boosted tree ensembles, enabling efficient security verification.

problem Efficiently verifying the robustness of boosted tree ensembles against norm-based attackers.
method Formal verification of robustness for large-spread boosted tree ensembles, considering LL_\infty-norm and pseudo-polynomial time for LpL_p-norm verification.
result Polynomial time verification for LL_\infty-norm attackers, NP-hard for other norms, and pseudo-polynomial time for LpL_p-norm verification.

Clustering algorithms have become a popular tool in computer security to analyze the behavior of malware variants, identify novel malware families, and generate signatures for antivirus systems. However, the suitability of clustering algorithms for security-sensitive settings has been recently questioned by showing tha…

2018-11-25abs ↗pdf ↗

Cronus securely transfers model parameters to protect federated learning from poisoning attacks.

problem Federated learning's privacy and security issues, especially with large models.
method Cronus uses black-box knowledge transfer to reduce parameter dimensions and control information leakage.
result Cronus is the only secure federated learning method against poisoning attacks.

New method uses model's generalization gap to predict membership inference attacks.

problem Predicting membership inference attacks on machine learning models.
method Uses the model's generalization gap as a metric to estimate the vulnerability to membership inference attacks.
result Demonstrates that the model's generalization gap provides an upper bound on MIA security.

Researchers develop methods to protect reinforcement learning and control systems from policy poisoning attacks.

problem Attacks on reinforcement learning and control systems that manipulate learned policies.
method Unified framework for solving policy poisoning attacks, demonstrating global optimality and feasibility.
result Policy poisoning attacks are feasible and can be defended with a convex optimization approach.

New security patch for object tracking in self-driving cars mitigates vulnerabilities.

problem Vulnerability of object tracking in self-driving cars, especially Kalman Filter-based trackers.
method Adaptive strategy to balance focus on observations and predictions based on deviation anomaly index.
result Certified effectiveness against a generalized hijacking attack model.

Paper analyzes InstaHide's security, recovering all private images with provable guarantee.

problem Protecting privacy of training data in neural networks.
method Unified framework to understand and analyze attacks on InstaHide, presenting a new algorithm to recover all private images with provable guarantee.
result InstaHide is computationally secure but not information-theoretically secure when mixing two private images.

Clustering algorithms have been increasingly adopted in security applications to spot dangerous or illicit activities. However, they have not been originally devised to deal with deliberate attack attempts that may aim to subvert the clustering process itself. Whether clustering can be safely adopted in such settings r…

2018-11-25abs ↗pdf ↗

The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.

problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M\mathbb{M} and Model S\mathbb{S} through convex optimization and game-theoretic lens.
result Model S\mathbb{S} achieves tighter security guarantees through single validator sets and aggregated slashing logic.

This study examines LiDAR spoofing attacks on autonomous vehicle perception.

problem Security vulnerabilities in LiDAR-based perception systems in autonomous driving.
method Formulated as an optimization problem, designed input perturbation and objective functions, combined optimization and global sampling.
result Attack success rates improved to around 75% through strategic input perturbation.

Machine learning has become one of the main components for task automation in many application domains. Despite the advancements and impressive achievements of machine learning, it has been shown that learning algorithms can be compromised by attackers both at training and test time. Machine learning systems are especi…

2018-08-16abs ↗pdf ↗

Study on how many queries an adversary needs to make to match the best attack in white-box model.

problem Query complexity of adversarial attacks in machine learning models.
method Investigates the number of queries required for an adversary to match the best possible attack in the white-box model, using entropy of decision boundaries as a measure.
result Lower bound on the number of queries required for an adversary to match the best possible attack in the white-box model.

This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.

problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.

Attackers can poison environments to force RL agents to follow target policies.

problem Security threat to reinforcement learning where attackers manipulate environments to force agents into following target policies.
method Optimization framework for finding optimal stealthy attacks under different measures of attack cost.
result Attackers can easily succeed in teaching any target policy to RL agents under mild conditions.

Paper defends diffusion models from membership inference attacks using Langevin dynamics.

problem Defending diffusion models against membership inference attacks.
method Uses critically-damped higher-order Langevin dynamics with auxiliary variables.
result Demonstrates improved resistance to membership inference attacks through theoretical investigation and validation.

Stochastic defense improves natural classifiers against adversarial attacks.

problem Vulnerability of deep networks to adversarial attacks.
method Long-run MCMC sampling with Energy-Based Model for adversarial purification.
result Balancing memoryless and metastable behavior leads to effective purification and robust classification.