Cryptography Algorithms by Massimo Bertaccini

Author:Massimo Bertaccini
Language: eng
Format: epub
Publisher: Packt Publishing Pvt Ltd
Published: 2022-01-20T00:00:00+00:00

Conclusions and the weaknesses of zk-SNARKs in Zcash

As we saw in the previous section, one of the weak points of this protocol can be found in QAP. As I have explained, Zcash has tried to overcome this problem using homomorphic evaluation, in other words, keeping the polynomials in blind. The issue is that homomorphic encryption usually causes bit-overflow; moreover, the protocols and schemes required to achieve fully homomorphic encryption are very complex. As you already know, my theory is that in cryptography, complexity is the enemy of security. I won't enter this debate now because it's not within the scope of the book to analyze the entire protocol of Zcash.

Imagine the scenario discussed in the Non-interactive ZKPs section based on the RSA problem. If I have to demonstrate to an expert that I hold the formula for an atomic bomb, then the experts will probably ask me to show something more than a hash function of the document, [m], that states the proof. The verifier will be convinced only when they get substantial proof. In other words, ZKPs are limited in the amount of evidence of knowledge they are able to provide.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.