We present a divertible zero-knowledge proof (argument) for SAT under the assumption that probabilistic encryption homomorphisms exist. Our protocol uses a simple ‘swapping’ technique which can be applied to many zero knowledge proofs (arguments). In particular we obtain a divertible zero-knowledge proof for graph isomorphism. The consequences for abuse-free zero-knowledge proofs are also considered.
CITATION STYLE
Burmester, M. V. D., & Desmedt, Y. (1991). All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 473 LNCS, pp. 1–10). Springer Verlag. https://doi.org/10.1007/3-540-46877-3_1
Mendeley helps you to discover research relevant for your work.