Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Discrete Mathematics and Combinatorics
Zero-Knowledge Reductions And Confidential Arithmetic, Marvin Jones
Zero-Knowledge Reductions And Confidential Arithmetic, Marvin Jones
All Dissertations
The changes in computing paradigms to shift computations to third parties have resulted in the necessity of these computations to be provable. Zero-knowledge arguments are probabilistic arguments that are used to to verify computations without secret data being leaked to the verifying party.
In this dissertation, we study zero-knowledge arguments with specific focus on reductions. Our main contributions are:
- Provide a thorough survey in a variety of zero-knowledge techniques and protocols.
- Prove various results of reductions that can be used to study interactive protocols in terms of subroutines. Additionally, we identify an issue in the analogous definition of zero-knowledge for …