ALL LANGUAGES IN NP HAVE DIVERTIBLE ZERO-KNOWLEDGE PROOFS AND ARGUMENTS UNDER CRYPTOGRAPHIC ASSUMPTIONS.
LECT NOTES COMPUT SC
1 - 10.
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.
|Title:||ALL LANGUAGES IN NP HAVE DIVERTIBLE ZERO-KNOWLEDGE PROOFS AND ARGUMENTS UNDER CRYPTOGRAPHIC ASSUMPTIONS|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only