Derivation of Constraints from Machine Learning Models and Applications to Security and Privacy
Résumé
This paper shows how we can combine the power of machine learning with the flexibility of constraints. More specifically, we show how machine learning models can be represented by first-order logic theories, and how to derive these theories. The advantage of this representation is that it can be augmented with additional formulae, representing constraints of some kind on the data domain. For instance, new knowledge, or potential attackers, or fairness desiderata. We consider various kinds of learning algorithms (neural networks, k-nearest-neighbours, decision trees, support vector machines) and for each of them we show how to infer the FOL formulae. Then we focus on one particular application domain, namely the field of security and privacy. The idea is to represent the potentialities and goals of the attacker as a set of constraints, then use a constraint solver (more precisely, a solver modulo theories) to verify the satisfiability. If a solution exists, then it means that an attack is possible, otherwise, the system is safe. We show various examples from different areas of security and privacy; specifically, we consider a side-channel attack on a password checker, a malware attack on smart health systems, and a model-inversion attack on a neural network.
Mots clés
2012 ACM Subject Classification Computing methodologies → Learning paradigms
Computing methodologies → Symbolic and algebraic manipulation
Security and privacy → Formal security models
Security and privacy → Privacy-preserving protocols
Security and privacy → Information flow control phrases Constraints
machine learning
privacy
security
Origine : Fichiers produits par l'(les) auteur(s)