From 521ba3ad777c7c1b347dbe5ca04ce8258c462ed3 Mon Sep 17 00:00:00 2001 From: Fabrice Mouhartem Date: Tue, 19 Jun 2018 13:22:57 +0200 Subject: [PATCH] Corrections --- chap-sigmasig.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/chap-sigmasig.tex b/chap-sigmasig.tex index b18fcbe..de21cea 100644 --- a/chap-sigmasig.tex +++ b/chap-sigmasig.tex @@ -2,7 +2,7 @@ % \addcontentsline{tof}{chapter}{\protect\numberline{\thechapter} Signatures de groupe dynamique à base de couplages} % \label{ch:sigmasig} %------------------------------------------------- -In this chapter, we aim at lifting the \textit{signature with efficient protocols} from~\cite{LPY15} into the random oracle model in order to get an efficient construction~\cite{BR93}. +In this chapter, we aim at lifting the \textit{signature with efficient protocols} from~\cite{LPY15} into the random oracle model in order to get an \textit{efficient} construction~\cite{BR93}. Signatures with efficient protocols in the Camenish and Lysyanskaya fashion~\cite{CL04a} are digital signatures which come with two companion protocols: a protocol whereby a signer can obliviously sign a committed message known only to the user and a zero-knowledge proof to efficiently attest possession of a hidden message-signature pair. This building block proved useful in the design of many efficient anonymity-related protocols such as anonymous credentials~\cite{Cha85,CL01}, which are similar to group signatures except that anonymity is irrevocable (meaning that there is no opening authority).