code for proof system

2023-03-18 15:41:37 +00:00
parent 2d72cdd87b
commit 6b001d9f2c
5 changed files with 97 additions and 8 deletions
--- a/whitepaper/Dissertation.pdf
+++ b/whitepaper/Dissertation.pdf
--- a/whitepaper/Dissertation.tex
+++ b/whitepaper/Dissertation.tex
@ -364,9 +364,9 @@ Then, a proof for the following homologous problem can be trivially constructed:

 % Furthermore, the above protocol can be made non-interactive using the Fiat-Shamir heuristic \citep{fiatshamir}. (this contradicts the lit review)

-\subsection{Recovering $r$ given $c$}
+\subsection{Implementation details}
+

-The proof requires that the prover can perform new calculations with $r$ given a cyphertext $c = g^mr^n \mod n^2$. For ease of programming, 

 \subsection{Application to domain}