preliminaries.tex 8.68 KB
Newer Older
1 2 3 4 5
\section{Model learning background}\label{sec:prelims}
\subsection{Mealy machines} \label{ssec:mealy}
We use \textit{Mealy machines} to represent the state machine of SSH implementations. A Mealy machine is a a 5-tuple $\mathcal{M} = (Q, q_0, I, O, \rightarrow \rangle)$, where
$I$, $O$ and $Q$ are finite sets of \emph{inputs}, \emph{outputs} and \emph{states}, $q_0 \in Q$ is the initial state, and $\rightarrow \subseteq Q \times I \times O \times Q$ 
is the \emph{transition relation}. We say $q \xrightarrow{i/o} q'$ if $(q, i, o, q') \in \rightarrow$. 
6

7
A Mealy machine  $\mathcal{M}$ is \emph{input enabled} if for each state $q$ and input $i$, there is a transition  $q \xrightarrow{i/o} q'$, for some $o$ and $q'$. Additionally,
Paul Fiterau Brostean's avatar
Paul Fiterau Brostean committed
8
a Mealy machine is said to be \emph{deterministic} if there is at most one such transition defined. Our setting restricts the representations of systems to Mealy machines that are both
9
input enabled and deterministic. 
10

11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
%\begin{figure}[h]
%\centering
%\begin{tikzpicture}[>=stealth',shorten >=1pt,auto,node distance=2.8cm]
%  \node[initial,state] (q0)      {$q_0$};
%  \node[state]         (q1) [right of=q0]  {$q_1$};
%  \node[state] 	(q2) [right of=q1] {$q_2$};
%
%  \path[->]          (q0)  	edge                 node [below] {X/A} (q1);
%  \path[->]          (q1)  	edge                 node [below] {Y/B} (q2);
%  \path[->]		(q0)		edge 	[bend left]	node {Y/A} (q2);
%  \path[->]		(q2) 	edge 	[loop right] 	node [text centered, text width = 1cm] {X/A \\ Y/B} (q2);
%  \path[->]		(q1) 	edge	[loop below] node {X/B} (q1);
%\end{tikzpicture}
%\caption{Example Mealy machine}
%\label{mealy example}
%\end{figure}
27

28
\subsection{MAT Framework} \label{ssec:mat}
Erik Poll's avatar
shit  
Erik Poll committed
29

30
The most efficient algorithms for model learning all follow
Paul Fiterau Brostean's avatar
updates  
Paul Fiterau Brostean committed
31
the pattern of a \emph{minimally adequate teacher (MAT)} as proposed by Angluin~\cite{Angluin1987Learning}.
Erik Poll's avatar
shit  
Erik Poll committed
32 33 34 35
Here learning is viewed as a game in which a \emph{learner} has to infer an unknown automaton by asking queries to a teacher. The teacher knows the automaton, which in our setting is a deterministic Mealy machine $\M$,
also called the System Under Learning ({\dsut}).
Initially, the {\dlearner} only knows the input alphabet $I$ and
output alphabet $O$ of $\M$.
Paul Fiterau Brostean's avatar
Paul Fiterau Brostean committed
36
The task of the {\dlearner} is to learn $\M$ through two types of queries:
37 38 39 40 41
\begin{itemize}
\item
With a \emph{membership query}, the learner asks what the response is to an input sequence $\sigma \in I^{\ast}$.
The teacher answers with the output sequence in $A_{\M}(\sigma)$.
\item
Paul Fiterau Brostean's avatar
Paul Fiterau Brostean committed
42
With an \emph{equivalence query}, the {\dlearner} asks whether a hypothesized Mealy machine $\CH$ is correct, that is,
43 44 45 46
whether $\CH \approx \M$. The teacher answers \emph{yes} if this is the case. Otherwise it answers
\emph{no} and supplies a \emph{counterexample}, which is a sequence $\sigma \in I^{\ast}$ that triggers
a different output sequence for both Mealy machines, that is, $A_{\CH}(\sigma) \neq A_{\M}(\sigma)$.
\end{itemize}
Erik Poll's avatar
shit  
Erik Poll committed
47 48 49 50 51 52 53 54
%
If $\M$ is treated as a black box, the equivalence query can only be
approximated by a \emph{test query}, which uses conformance testing
\cite{LeeY96} -- more specifically, model-based testing --
to look for a counterexample with a finite number of queries. Note
that this cannot exclude the possibility that there is more behaviour
that has not been discovered.  For a recent overview of model learning
algorithms for this setting see \cite{Isberner2015}.
55

56 57
in applications where one wants to learn a model of a black-box reactive system, or System Under Learning ({\dsut}). The teacher typically
consists of the {\dsut}, which answers membership queries, and a conformance
Paul Fiterau Brostean's avatar
Paul Fiterau Brostean committed
58 59
testing tool \cite{LeeY96} that approximates equivalence queries using a set
of \emph{test queries}. A test query consists of asking the {\dsut} for the response to an input sequence
60
$\sigma \in I^{\ast}$, similar to a membership query. 
61

62 63 64
\subsection{Abstraction} \label{ssec:mappers}
Most current learning algorithms are only applicable to Mealy machines with small alphabets comprising abstract messages. Practical systems typically 
have parameterized input/output alphabets, whose application triggers updates on the system's state variables. To learn
Paul Fiterau Brostean's avatar
Paul Fiterau Brostean committed
65
these systems we place a \emph{mapper} between the {\dlearner} and the {\dsut}. The {\dmapper} is a transducer which translates 
66
concrete inputs to abstract inputs and concrete outputs to abstract outputs. For a thorough definition of mappers, we refer to \cite{AJUV15}. 
67

68
%Perhaps some explanation
69

70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112
%
%
%concrete inputs in $I$ to abstract inputs in $X$,
%concrete outputs in $O$ to abstract outputs in $Y$, and vice versa.
%alphabets
%
%
%Starting from Angluin's seminal $L^{\ast}$ algorithm \cite{Ang87}, many
%algorithms have been proposed for learning finite, deterministic Mealy machines
%via a finite number of queries. We refer to \cite{Isberner2015} for recent overview.
%In applications in which one wants to learn a model of a black-box reactive system, the teacher typically
%consists of a System Under Learning (\dsut) that answers the membership queries, and a conformance
%testing tool \cite{LeeY96} that approximates the equivalence queries using a set
%of \emph{test queries}. A test query consists of asking to the \dsut for the response to an input sequence
%$\sigma \in I^{\ast}$, similar to a membership query.
%
%
%
%
%
%
%In protocol state fuzzing, a state machine of the implementation is learned by actively sending and receiving messages to and from the System Under Learning (SUL). A single message is called a \textit{query}, and a sequence of messages a \textit{trace}. The state machine is formed by sending consecutive traces to the SUL and analyzing the output. The trace to be sent is, in our case, determined by the L*-algorithm. When a trace is completed the SUL has to be reset to its initial state.  
%
%After sending a sufficient amount of traces, a hypothesis is formed. The hypothesis is checked for  by a testing oracle. Said oracle sends traces to the SUL, predicts an output through the hypothesis, and compares this output to the actual output received by the SUL. 
%
%In our case, sending messages to the SUL means sending packets that contain, for example, the length of the packet, a sequence number or a list of supported encryptions. This information is unnecessary for the learning process, and is not supported by the Learnlib implementation of L* that we use. We abstract all this information away, leaving us with an abstract representation of messages. To convert these abstract messages to correct packets and back, a mapper is used. This mapper has to keep track of state variables, and has to be able to perform actions such as encryption and compression. This means that the mapper itself contains a state machine, which is based on existing knowledge about the protocol used in the SUL.
%
%\begin{figure}[h]
%\centering
%\includegraphics[scale=0.8]{Naamloos.png} 
%\caption{A learning setup}
%\label{learning setup}
%\end{figure}
%
%The setup shown in figure \ref{learning setup} is the setup Verleg used, and serves as an example for a typical learning setup, here ``Learner'' is the program that uses the L*-algorithm to generate traces to send to the SUL, these traces are in the form of abstract messages. The learner sends these messages to the mapper, which translates them to concrete packages which are sent to the SUL. A response of the SUL is then converted by the mapper to an abstract message and sent to the learner.
%
%\subsection{Secure Shell} \label{secure shell}
%
%The SSH-protocol uses a client-server structure consisting of three components. These components will be referred to as layers, however note that outer layers do not wrap inner layers, instead messages of different layers are distinguished through their message number. The three components are as follows: 
%\begin{itemize}
%\item The transport layer protocol. This creates the basis for communication between server and client, providing a key exchange protocol and server authentication. The key exchange protocol is performed through three roundtrips. During the first, both client and server send a KEXINIT message. Then, the client sends a KEX30 message, the server responds with a KEX31 message. Finally, both parties send a NEWKEYS message, which indicates that the keys sent in the second step can be used.
%\item The user authentication protocol. This component is used to authenticate a client to the server, for example, through a username and password combination, or through SSH-keys.
%\item The connection protocol. This is used to provide different services to the connected client, it can thus multiplex the encrypted channel into different channels. The provided services can be services like file transfer or a remote terminal. Typical messages are requests for opening or closing channels, or requests for earlier named services.
Erik Poll's avatar
shit  
Erik Poll committed
113
%\end{itemize}