jude/Riskless
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Correct bib file

Browse Source
This commit is contained in:
jude
2023-08-20 11:16:57 +01:00
parent 94f6246547
commit 8fc50531c1
3 changed files with 12 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
whitepaper/Dissertation.tex
View File

@ -1075,7 +1075,7 @@ The second is to associate a non-random value with a random value. In practice,
\subsection{Quantum resistance}
Paillier is broken if factoring large numbers is computationally feasible \cite[Theorem~9]{paillier1999public}. Therefore, it is vulnerable to the same quantum threat as RSA is, known as Shor's algorithm \cite{shor_1997}. Alternative homomorphic encryption schemes are available, which are believed to be quantum-resistant, as they are based on lattice methods (e.g, \cite{fhe}).
Paillier is broken if factoring large numbers is computationally feasible \cite[Theorem~9]{paillier1999public}. Therefore, it is vulnerable to the same quantum threat as RSA is, known as Shor's algorithm \cite{Shor_1997}. Alternative homomorphic encryption schemes are available, which are believed to be quantum-resistant, as they are based on lattice methods (e.g, \cite{fhe}).
\subsection{Honest-verifier}