fmouhart/thesis
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add definitions

Browse Source
This commit is contained in:
Fabrice Mouhartem 2018-06-19 14:41:13 +02:00
parent b9b2995033
commit 1bb122c516
1 changed files with 47 additions and 45 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
symbols.tex
View File

@ -12,10 +12,10 @@
$\widetilde{\mathbf{A}}$ & Gram-Schmidt orthogonalization of matrix $\mathbf{A}$ \\ $\widetilde{\mathbf{A}}$ & Gram-Schmidt orthogonalization of matrix $\mathbf{A}$ \\
$\mathbf{A}^T_{}, \mathbf{u}^T_{}$ & the transpose of a matrix or a vector respectively \\ $\mathbf{A}^T_{}, \mathbf{u}^T_{}$ & the transpose of a matrix or a vector respectively \\
$\mathbf{I}_n$ & the $n$ dimension identity matrix in $\RR^{n \times n}$ \\ $\mathbf{I}_n$ & the $n$ dimension identity matrix in $\RR^{n \times n}$ \\
$\U(S)$ & If $S$ is a finite set, $\U(S)$ denotes the uniform distribution over $S$\\ $\U(S)$ & If $S$ is a finite set, $\U(S)$ denotes the uniform distribution over $S$ \\
$\Supp(D)$ & If $D$ is a probability distribution, $\Supp(D)$ denotes the support of $D$ \\ $\Supp(D)$ & If $D$ is a probability distribution, $\Supp(D)$ denotes the support of $D$ \\
$\Pr[E]$ & Probability that an event $E$ occurs \\ $\Pr[E]$ & Probability that an event $E$ occurs \\
$D \approx_s D'$ & $D$ is statistically close to $D'$ \\ $D \approx_s D'$ & The distribution $D$ is statistically close to the distribution $D'$ \\
[1ex] \multicolumn{2}{l}{\scbf{Usual sets}} \\ [1ex] \multicolumn{2}{l}{\scbf{Usual sets}} \\
$\QQ$ & the set of rational numbers \\ $\QQ$ & the set of rational numbers \\
$\RR$ & the set of real numbers \\ $\RR$ & the set of real numbers \\
@ -24,7 +24,7 @@
$\FF_2$ & the field $\ZZ_{/2\ZZ}$ \\ $\FF_2$ & the field $\ZZ_{/2\ZZ}$ \\
$\mathbb{S}^d$ & the set of vectors of dimension $d$ in the set $\mathbb{S}$ \\ $\mathbb{S}^d$ & the set of vectors of dimension $d$ in the set $\mathbb{S}$ \\
$\mathbb{S}^{n \times m}$ & the set of matrices with $n$ rows and $m$ columns in the set $\mathbb{S}$ \\ $\mathbb{S}^{n \times m}$ & the set of matrices with $n$ rows and $m$ columns in the set $\mathbb{S}$ \\
$\permutations_D$ & The set of all permutations over $\{1,\ldots, D\}$ \\ $\permutations_k$ & The set of all permutations over $\{1,\ldots, k\}$ \\
[1ex] \multicolumn{2}{l}{\scbf{Protocols}} \\ [1ex] \multicolumn{2}{l}{\scbf{Protocols}} \\
$\PKE$ & Public Key Encryption \\ $\PKE$ & Public Key Encryption \\
$\ZK$ & Zero-Knowledge \\ $\ZK$ & Zero-Knowledge \\
@ -32,6 +32,8 @@
$\NIZK$ & Non-Interactive Zero-Knowledge \\ $\NIZK$ & Non-Interactive Zero-Knowledge \\
$\QANIZK$ & Quasi-Adaptive Non-Interactive Zero-Knowledge \\ $\QANIZK$ & Quasi-Adaptive Non-Interactive Zero-Knowledge \\
$\textsf{WI}$ & Witness indistinguishable \\ $\textsf{WI}$ & Witness indistinguishable \\
$\textsf{GS}$ & Group Signature \\
$\GE$ & Group Encryption \\
$\OT$ & Oblivious Transfer \\ $\OT$ & Oblivious Transfer \\
[1ex] \multicolumn{2}{l}{\scbf{Security Notions}} \\ [1ex] \multicolumn{2}{l}{\scbf{Security Notions}} \\
$\advantage{\mathrm{E}}{\adv}$ & Advantage of adversary $\adv$ for experiment $\mathrm{E}$ \\ $\advantage{\mathrm{E}}{\adv}$ & Advantage of adversary $\adv$ for experiment $\mathrm{E}$ \\
@ -45,16 +47,16 @@
$\UC$ & Universal Composability \\ $\UC$ & Universal Composability \\
[1ex] \multicolumn{2}{l}{\scbf{Security Assumptions}} \\ [1ex] \multicolumn{2}{l}{\scbf{Security Assumptions}} \\
[.5ex] \multicolumn{2}{l}{\quad\textbf{Lattices}} \\ [.5ex] \multicolumn{2}{l}{\quad\textbf{Lattices}} \\
$\SIS$ & Short Integer Solution \\ $\SIS$ & Short Integer Solution (\cref{de:sis}) \\
$\ISIS$ & Inhomogeneous Short Integer Solution \\ $\ISIS$ & Inhomogeneous Short Integer Solution (\cref{de:sis}) \\
$\LWE$ & Learning-with-Errors \\ $\LWE$ & Learning-with-Errors (\cref{de:lwe}) \\
$\SIVP$ & Shortest Independent Vectors Problem \\ $\SIVP$ & Shortest Independent Vectors Problem (\cref{de:sivp}) \\
[.5ex] \multicolumn{2}{l}{\quad\textbf{Cyclic groups}} \\ [.5ex] \multicolumn{2}{l}{\quad\textbf{Cyclic groups}} \\
$\DLP$ & Discrete Logarithm Problem \\ $\DLP$ & Discrete Logarithm Problem (\cref{de:DLP}) \\
$\DDH$ & Decisional Diffie-Hellman \\ $\DDH$ & Decisional Diffie-Hellman (\cref{de:DDH}) \\
[.5ex] \multicolumn{2}{l}{\quad\textbf{Bilinear groups}} \\ [.5ex] \multicolumn{2}{l}{\quad\textbf{Bilinear groups}} \\
$\SXDH$ & Symmetric eXternal Diffie-Hellman \\ $\SXDH$ & Symmetric eXternal Diffie-Hellman (\cref{de:SXDH}) \\
$\SDL$ & Symmetric Discrete Logarithm \\ $\SDL$ & Symmetric Discrete Logarithm (\cref{de:SDL}) \\
[1ex] \multicolumn{2}{l}{\scbf{Stern-like protocol}} \\ [1ex] \multicolumn{2}{l}{\scbf{Stern-like protocol}} \\
$\mathsf{B}^2_{\mathfrak m}$ & The set of $\bit$ vector of hamming weight $\mathfrak m$ \\ $\mathsf{B}^2_{\mathfrak m}$ & The set of $\bit$ vector of hamming weight $\mathfrak m$ \\
$\mathsf{B}^3_{\mathfrak m}$ & The set of $\nbit$ vectors with $\mathfrak m$ elements in $-1$, $0$ and $1$ \\ $\mathsf{B}^3_{\mathfrak m}$ & The set of $\nbit$ vectors with $\mathfrak m$ elements in $-1$, $0$ and $1$ \\