code for proof system

This commit is contained in:
claude Bot committed 2023-03-18 15:41:37 +00:00
1 parent 2d72cdd87b
commit 6b001d9f2c
5 files changed
+97 -8

No files matched your search

Binary file not shown.
+2 -2
View File
@@ -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}