From 15ac1ae074afe8528d952893ecc60d7258da75cf Mon Sep 17 00:00:00 2001 From: Fabrice Mouhartem Date: Thu, 20 Sep 2018 13:13:48 +0200 Subject: [PATCH] typo --- chap-introduction.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/chap-introduction.tex b/chap-introduction.tex index 1bddf02..593e987 100644 --- a/chap-introduction.tex +++ b/chap-introduction.tex @@ -181,7 +181,7 @@ Let us recall that, in Learning-With-Errors schemes, an encryption have the form As group encryption requires this public-key $\mathbf{A}$ to be private, a way to achieve this is to have a zero-knowledge proof system which handles relations where the witness is multiplied with a private matrix. We address this issue introducing new technique to handle this kind of relations. -These techniques, based on a \textit{divide-and-conquer} strategy, are described in~\cref{ch:ge-lwe}, as well as the construction of the group signature scheme proven fully-secure in the standard model. +These techniques, based on a \textit{divide-and-conquer} strategy, are described in~\cref{ch:ge-lwe}, as well as the construction of the group encryption scheme proven fully-secure in the standard model. This work have been presented at Asiacrypt'16~\cite{LLM+16a} and have been done with BenoƮt Libert, San Ling, Khoa Nguyen and Huaxiong Wang. \subsection{Adaptive Oblivious Transfer}