Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 88 for “"Zero-Knowledge Proofs"”.
-
Efficient Zero-Knowledge Proofs and Applications
Zero-knowledge proofs provide a means for a prover to convince a verifier that some claim is true and nothing more. The ability to prove statements while conveying zero information beyond their veracity has profound implications for cryptography and, especially, for its applicability to …
-
Chosen Ciphertext Security from Zero Knowledge Proofs
… a generic CPA-to-CCA transform that uses a zero-knowledge proof of knowledge in place of a re-encryption check. We prove security of our generic construction in the random oracle model, and we provide an instantiation of it using existing schemes. For the instantiation, we use ElGamal as our …
-
A study of perfect zero-knowledge proofs
Perfect zero-knowledge proofs enable one party (the prover) to prove an assertion to another party (the verifier) but without revealing anything but the truth of the assertion. The class of problems admitting such proofs is rich, including Graph Isomorphism, Quadratic Residuousity, and other …
-
Isogeny-Based Zero-Knowledge Proofs and Their Applications
… attacks fully broke SIDH, Petit showed that knowledge of the endomorphism ring could lead to a polynomial-time attack on SIDH when the parameter sets were unbalanced. Castryck and Vercauteren recently showed that the same attacks on unbalanced parameters with known endomorphism rings can be …
-
Collaborative Zero-Knowledge Proofs with Secure Multiparty Computations
… as cloud computing. In particular, we focus on zero-knowledge argument system, where the proof does not reveal any secret about the input. However, existing zero-knowledge argument system lacks efficiency, for proof generation takes huge computational overhead. In this thesis, we propose a new …
-
Collaborative Zero-Knowledge Proofs with Secure Multiparty Computations
… as cloud computing. In particular, we focus on zero-knowledge argument system, where the proof does not reveal any secret about the input. However, existing zero-knowledge argument system lacks efficiency, for proof generation takes huge computational overhead. In this thesis, we propose a new …
-
Collaborative Zero-Knowledge Proofs with Secure Multiparty Computations
… as cloud computing. In particular, we focus on zero-knowledge argument system, where the proof does not reveal any secret about the input. However, existing zero-knowledge argument system lacks efficiency, for proof generation takes huge computational overhead. In this thesis, we propose a new …
-
Collaborative Zero-Knowledge Proofs with Secure Multiparty Computations
… as cloud computing. In particular, we focus on zero-knowledge argument system, where the proof does not reveal any secret about the input. However, existing zero-knowledge argument system lacks efficiency, for proof generation takes huge computational overhead. In this thesis, we propose a new …
-
Collaborative Zero-Knowledge Proofs with Secure Multiparty Computations
… as cloud computing. In particular, we focus on zero-knowledge argument system, where the proof does not reveal any secret about the input. However, existing zero-knowledge argument system lacks efficiency, for proof generation takes huge computational overhead. In this thesis, we propose a new …
-
Collaborative Zero-Knowledge Proofs with Secure Multiparty Computations
… as cloud computing. In particular, we focus on zero-knowledge argument system, where the proof does not reveal any secret about the input. However, existing zero-knowledge argument system lacks efficiency, for proof generation takes huge computational overhead. In this thesis, we propose a new …
-
Efficient Zero-Knowledge Proofs for Real-World Programs
Zero-knowledge proofs (ZKPs) allow a prover to convince a verifier of the validity of a statement without revealing any information beyond its truth. Since their introduction in 1985 by Shafi Goldwasser, Silvio Micali, and Charles Rackoff, ZKPs have become foundational in both theoretical and …
-
Zero-knowledge Proofs for Programmable Anonymity, Moderation, and Reputation
… a system that previously only permitted equality proofs). It is possible to flip the order of operations, i.e., to design a proof system and then let users program their own notions of identity and what they want to show. Concretely, using modern, general-purpose zero-knowledge proof schemes and …
-
An Investigation into Graph Isomorphism Based Zero-Knowledge Proofs
Zero-knowledge proofs protocols are effective interactive methods to prove a node's identity without disclosing any additional information other than the veracity of the proof. They are implementable in several ways. In this thesis, I investigate the graph isomorphism based zero-knowledge proofs …
-
Key Exchange and Zero-Knowledge Proofs from Isogenies and Hyperelliptic Curves
… The SI-X3DH protocol requires a way of proving knowledge of SIDH secret keys. This brings us to the second primary focus of this thesis: zero-knowledge proofs. As suggested by the name, such schemes allow a statement to be proved without leaking any information other than the validity of the …
-
Traceable and Verifiable Trust in Microservices Architecture using Segmented Zero-Knowledge Proofs
… The platform has no implied trust, uses a nested zero-knowledge proof (ZKP) system, and does not rely on past interactions. Based on the successes and limitations of this study, each subsequent chapter was either built with added complexity or altered to align with the objectives. The overall …
-
Constructing Code-Based Zero-Knowledge Proofs Leveraging Generic Errors and Bounded Vectors
… from the field of coding theory. Among these, zero-knowledge proofs have emerged as a dynamic tool instrumental in constructing quantum-resilient digital signature schemes. We being by introducing HammR, a pre-quantum zero-knowledge proof protocol designed to verify Hamming weight and entry …
-
A Study of Separations in Cryptography: New Results and New Models
… study black-box constructions of constant-round zero-knowledge proofs from one-way permutations and show that, under commonly believed complexity assumptions, no such constructions exist. A widely recognized limitation of black-box impossibility results, however, is that they say nothing about …
Page 1 of 5