rixxc/masterthesis
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

More more more

Browse Source
This commit is contained in:
Aaron Kaiser
2023-05-01 17:38:55 +02:00
parent cf19ceb0fe
commit 419018dec3
7 changed files with 171 additions and 34 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
thesis/sections/security_notions.tex
View File

@@ -1,5 +1,3 @@
\subsection{Identical-Until-Bad Games}
\subsection{Canonical Identification Scheme}
A canonical identification scheme (CID), as defined in \cite{EC:AABN02}, is a protocol between two parties. The prover tries to proof the knowledge of a secret key to the verfier which only knows the public key. This is achieved by exchanging three messages between the two parties. At first the prover starts the protocol by sending a commitment $R$ to the verifier. The verifer answers with a random challenge $\ch$ from a predefined challenge set $\textbf{CHSet}$. The prover then uses the commitment, challenge and its secret key to calculate a response $s$. The verifier then can use the commitment, challenge and response together with the public key of the prover to verify the response and thereby whether the prover is actually in the possession of the private key.