Abstract
We present an interactive zero-knowledge proof for the discrete logarithm problem which is based on smooth numbers. The main feature of our proof is its communication complexity (number of messages exchanged, number of bits communicated) which is less than that of competing schemes.
Cite
CITATION STYLE
APA
Desmedt, Y., & Burmester, M. (1993). An efficient zero-knowledge scheme for the discrete logarithm based on smooth numbers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 739 LNCS, pp. 352–359). Springer Verlag. https://doi.org/10.1007/3-540-57332-1_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free