Abstract
A verifiable encryption scheme (VES) is useful for many cryptographic protocols. A VES may be either for (encryption of) discrete logarithms or for (encryption of) e-th roots. So far, all the VESs for discrete logarithms are inefficient, but there exists an efficient VES for e-th roots. In this paper, we presents an efficient VES for discrete logarithms and prove its security.
Cite
CITATION STYLE
Bao, F. (2000). An efficient verifiable encryption scheme for encryption of discrete logarithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1820, pp. 213–220). Springer Verlag. https://doi.org/10.1007/10721064_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
