all InfoSec news
Query-Efficient and Scalable Black-Box Adversarial Attacks on Discrete Sequential Data via Bayesian Optimization. (arXiv:2206.08575v1 [cs.LG])
June 20, 2022, 1:20 a.m. | Deokjae Lee, Seungyong Moon, Junhyeok Lee, Hyun Oh Song
cs.CR updates on arXiv.org arxiv.org
We focus on the problem of adversarial attacks against models on discrete
sequential data in the black-box setting where the attacker aims to craft
adversarial examples with limited query access to the victim model. Existing
black-box attacks, mostly based on greedy algorithms, find adversarial examples
using pre-computed key positions to perturb, which severely limits the search
space and might result in suboptimal solutions. To this end, we propose a
query-efficient black-box attack using Bayesian optimization, which dynamically
computes important positions …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Information Security Engineers
@ D. E. Shaw Research | New York City
Cybersecurity Engineer
@ Alstom | Charleroi, BE
Member of Compliance, Information Technology
@ Anchorage Digital | United States
Information Security Consultant (GRC) - Cumulus Systems
@ Hitachi | (HIL) DELHI - RHQ
Security Engineer
@ EarnIn | Mexico