Correct bib file
This commit is contained in:
jude
parent
94f6246547
commit
8fc50531c1
|
|
@ -90,7 +90,7 @@ doi={10.1109/SP.2014.36}}
|
|||
|
||||
@misc{monero,
|
||||
author = {Monero Research Lab},
|
||||
title = {What is {Monero} ({XMR})?}
|
||||
title = {What is {Monero} ({XMR})?},
|
||||
howpublished = {\url{https://www.getmonero.org/get-started/what-is-monero/}}
|
||||
}
|
||||
|
||||
|
|
@ -245,8 +245,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
|
||||
|
||||
@InProceedings{fiatshamir,
|
||||
author="Fiat, Amos
|
||||
and Shamir, Adi",
|
||||
author="Fiat, Amos and Shamir, Adi",
|
||||
editor="Odlyzko, Andrew M.",
|
||||
title="How To Prove Yourself: Practical Solutions to Identification and Signature Problems",
|
||||
booktitle="Advances in Cryptology --- CRYPTO' 86",
|
||||
|
|
@ -264,7 +263,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
year = {2020},
|
||||
publisher = {GitHub},
|
||||
journal = {GitHub repository},
|
||||
howpublished = {\url{https://github.com/tc39/proposal-bigint}},
|
||||
howpublished = {\url{https://github.com/tc39/proposal-bigint}}
|
||||
}
|
||||
|
||||
@misc{lzstring,
|
||||
|
|
@ -273,7 +272,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
year = {2013},
|
||||
publisher = {GitHub},
|
||||
journal = {GitHub repository},
|
||||
howpublished = {\url{https://github.com/pieroxy/lz-string}},
|
||||
howpublished = {\url{https://github.com/pieroxy/lz-string}}
|
||||
}
|
||||
|
||||
@misc{ipfs,
|
||||
|
|
@ -282,7 +281,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
year = {2023},
|
||||
publisher = {GitHub},
|
||||
journal = {GitHub repository},
|
||||
howpublished = {\url{https://github.com/ipfs/specs}},
|
||||
howpublished = {\url{https://github.com/ipfs/specs}}
|
||||
}
|
||||
|
||||
@misc{unciv,
|
||||
|
|
@ -291,7 +290,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
year = {2023},
|
||||
publisher = {GitHub},
|
||||
journal = {GitHub repository},
|
||||
howpublished = {\url{https://github.com/yairm210/Unciv}},
|
||||
howpublished = {\url{https://github.com/yairm210/Unciv}}
|
||||
}
|
||||
|
||||
@misc{msgpack,
|
||||
|
|
@ -309,7 +308,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
year = {2022},
|
||||
publisher = {GitHub},
|
||||
journal = {GitHub repository},
|
||||
howpublished = {\url{https://github.com/Caligatio/jsSHA}},
|
||||
howpublished = {\url{https://github.com/Caligatio/jsSHA}}
|
||||
}
|
||||
|
||||
@article{RABIN1980128,
|
||||
|
|
@ -341,24 +340,15 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
|
||||
@article{Shor_1997,
|
||||
doi = {10.1137/s0097539795293172},
|
||||
|
||||
url = {https://doi.org/10.1137%2Fs0097539795293172},
|
||||
|
||||
year = 1997,
|
||||
month = {oct},
|
||||
|
||||
publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
|
||||
|
||||
volume = {26},
|
||||
|
||||
number = {5},
|
||||
|
||||
pages = {1484--1509},
|
||||
|
||||
author = {Peter W. Shor},
|
||||
|
||||
title = {Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer},
|
||||
|
||||
journal = {{SIAM} Journal on Computing}
|
||||
}
|
||||
|
||||
|
|
@ -384,7 +374,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
institution = {U.S. Department of Commerce},
|
||||
address= {Washington, D.C.},
|
||||
DOI = {10.6028/NIST.FIPS.202},
|
||||
year = {2015},
|
||||
year = {2015}
|
||||
}
|
||||
|
||||
@inproceedings{Jurik2003ExtensionsTT,
|
||||
|
|
@ -434,7 +424,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
title={{ECMAScript} 2024 Language Specification},
|
||||
author={ECMA},
|
||||
journal={ECMA (European Association for Standardizing Information and Communication Systems), pub-ECMA: adr,},
|
||||
url = {https://tc39.es/ecma262}
|
||||
url = {https://tc39.es/ecma262},
|
||||
year={1999}
|
||||
}
|
||||
|
||||
|
|
@ -453,8 +443,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
}
|
||||
|
||||
@InProceedings{randomoracle,
|
||||
author="Pointcheval, David
|
||||
and Stern, Jacques",
|
||||
author="Pointcheval, David and Stern, Jacques",
|
||||
editor="Maurer, Ueli",
|
||||
title="Security Proofs for Signature Schemes",
|
||||
booktitle="Advances in Cryptology --- EUROCRYPT '96",
|
||||
|
|
@ -476,7 +465,7 @@ howpublished = {\url{https://zcash.readthedocs.io/en/latest/rtd_pages/basics.htm
|
|||
pages = {107--120},
|
||||
url = {https://www.usenix.org/conference/atc19/presentation/jangda},
|
||||
publisher = {USENIX Association},
|
||||
month = jul,
|
||||
month = jul
|
||||
}
|
||||
|
||||
@INPROCEEDINGS{upnp,
|
||||
|
|
|
|||
Binary file not shown.
|
|
@ -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}
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue