Difference between revisions of "Offense - Adversarial Threats/Attacks"
(→Boolean Satisfiability (SAT) Problem/Satisfiability Modulo Theories (SMT): Z3 and Reluplex Solvers) |
|||
| Line 37: | Line 37: | ||
<youtube>wbRx18VZlYA</youtube> | <youtube>wbRx18VZlYA</youtube> | ||
| − | == Boolean Satisfiability (SAT) Problem/Satisfiability Modulo Theories (SMT) | + | == Boolean Satisfiability (SAT) Problem/Satisfiability Modulo Theories (SMT) Solvers == |
[http://www.youtube.com/results?search_query=~SAT+SMT+Satisfiability+Modulo+Theories+Z3+Reluplex+Deep+Learning+Artificial+Intelligence Youtube search...] | [http://www.youtube.com/results?search_query=~SAT+SMT+Satisfiability+Modulo+Theories+Z3+Reluplex+Deep+Learning+Artificial+Intelligence Youtube search...] | ||
* [http://rise4fun.com/ Rise4Fun - automata concurrency design encoders infrastructure languages security synthesis testing verification language] | * [http://rise4fun.com/ Rise4Fun - automata concurrency design encoders infrastructure languages security synthesis testing verification language] | ||
* [http://ijcai13.org/files/tutorial_slides/tb1.pdf SAT in AI: high performance search methods with applications] | * [http://ijcai13.org/files/tutorial_slides/tb1.pdf SAT in AI: high performance search methods with applications] | ||
| + | * [http://stanford.edu/~guyk/pub/CAV2017_R.pdf Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks] | ||
<youtube>DX3G4IoTNF0</youtube> | <youtube>DX3G4IoTNF0</youtube> | ||
Revision as of 16:10, 5 July 2018
______________________________________________________
- Cleverhans - library for benchmarking the vulnerability of machine learning models to adversarial examples blog
- Adversarial Machine Learning for Anti-Malware Software | nababora @ GitHub
- Deep-pwning/Metasploit | Clarence Chio
- EvadeML.org | University of Virginia
- AdversariaLib: An Open-source Library for the Security Evaluation of Machine Learning Algorithms Under Attack
- Pattern Recognition and Applications Lab (PRA Lab)
Adversarial examples are inputs to machine learning models that an attacker has intentionally designed to cause the model to make a mistake; they’re like optical illusions for machines. Myth: An attacker must have access to the model to generate adversarial examples. Fact: Adversarial examples generalize across models trained to perform the same task, even if those models have different architectures and were trained on a different training set. This means an attacker can train their own model, generate adversarial examples against it, and then deploy those adversarial examples against a model they do not have access to. -Deep Learning Adversarial Examples – Clarifying Misconceptions | Goodfellow et al.
Weaponizing Machine Learning
Boolean Satisfiability (SAT) Problem/Satisfiability Modulo Theories (SMT) Solvers
- Rise4Fun - automata concurrency design encoders infrastructure languages security synthesis testing verification language
- SAT in AI: high performance search methods with applications
- Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks