used uniform font for sets

thesis/sections/mu_security_of_eddsa/mu-gamez_implies_mu-uf-nma.tex

@@ -21,13 +21,13 @@ This section shows that MU-\igame implies MU-UF-NMA security of the EdDSA signat
 		\State \quad $a_i \randomsample \{2^{n-1}, 2^{n-1} + 2^c, ..., 2^n - 2^c\}$
 		\State \quad $\groupelement{A_i} \assign a_i \groupelement{B}$
 		\State $s^* \randomsample \adversary{A}^{\ioracle(\inp)}(\groupelement{A_1}, \groupelement{A_2}, ..., \groupelement{A_N})$	
-		\State \Return $\exists (\groupelement{R}^*, \ch^*) \in Q, i \in \{1,2,...,N\} \in : \groupelement{R}^* = 2^c s^* \groupelement{B} - 2^c \ch^* \groupelement{A_i}$		
+		\State \Return $\exists (\groupelement{R}^*, \ch^*) \in \pset{Q}, i \in \{1,2,...,N\} \in : \groupelement{R}^* = 2^c s^* \groupelement{B} - 2^c \ch^* \groupelement{A_i}$		
 	\end{algorithmic}
 	\vspace{2mm}
 	\begin{algorithmic}[1] 
 		\Statex \underline{\oracle \ioracle($\groupelement{R_i} \in \group{G}$)}
 		\State $\ch_i \randomsample \{0,1\}^{2b}$
-		\State $Q \assign Q \cup \{ (\groupelement{R}_i, \ch_i) \}$
+		\State $\pset{Q} \assign \pset{Q} \cup \{ (\groupelement{R}_i, \ch_i) \}$
 		\State \Return $\ch_i$
 	\end{algorithmic}
 	\hrule