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 64 for “"Zero-knowledge proof"”.
-
A Writeup on Plonky2 Zero-Knowledge Proof System
Η παρούσα διπλωματική εργασία αποτελεί μια εκτενή παρουσίαση του Plonky2. Όπως είναι γνωστό, οι αποδείξεις μηδενικής γνώσης (ιδιαίτερα στις σύγχρονες μορφές τους, τα zk-SNARKs και zk-STARKs) εξελίσσονται ραγδαία τόσο στον ακαδημαϊκό χώρο όσο και στη βιομηχανία. Όσον αφορά τις πρακτικές εφαρμογές …
-
Zero-Knowledge Proof-Enabled SAT Co-processor for Blockchain Systems
… in Circom Domain Specific Language to create zero-knowledge proofs (ZKPs) usable in blockchain contexts. I implemented DPLL and Chaff as arithmetic circuits within Circom and analyze them based on constraint count, proving delay, and zk-SNARK verification layers. With this evaluation, the aim …
-
Elliptic curve cryptography, zero-knowledge proof, and Lamport's hash chain in a distributed authentication system
… and Lamport's hash chain can operate in a zero-knowledge proof to establish and manage trust. The paper also discusses how this design avoids some of the most common flaws in distributed authentication systems. Finally, based on results from tests conducted with included source codes, the …
-
A novel privacy-preserving data sharing system based on attributed-based encryption and zero knowledge proof
… Attribute-Based Encryption (CP-ABE), and Zero-Knowledge Proofs (ZKP). By employing CP-ABE, the proposed system enables fine-grained access control, ensuring that only authorised entities can access sensitive data based on specified attributes. The integration of Zero-Knowledge Proofs …
-
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 …
-
SNARKs: New Applications and New Constructions Based on Error-Correcting Codes
Zero-knowledge proofs (ZKPs) are cryptographic protocols that enable one party, the prover, to convince another party, the verifier, of the truth of a given statement without revealing any information beyond the validity of the statement itself. First introduced by Goldwasser, Micali, and Rackoff …
-
SNARKs: New Applications and New Constructions Based on Error-Correcting Codes
Zero-knowledge proofs (ZKPs) are cryptographic protocols that enable one party, the prover, to convince another party, the verifier, of the truth of a given statement without revealing any information beyond the validity of the statement itself. First introduced by Goldwasser, Micali, and Rackoff …
-
SNARKs: New Applications and New Constructions Based on Error-Correcting Codes
Zero-knowledge proofs (ZKPs) are cryptographic protocols that enable one party, the prover, to convince another party, the verifier, of the truth of a given statement without revealing any information beyond the validity of the statement itself. First introduced by Goldwasser, Micali, and Rackoff …
-
SNARKs: New Applications and New Constructions Based on Error-Correcting Codes
Zero-knowledge proofs (ZKPs) are cryptographic protocols that enable one party, the prover, to convince another party, the verifier, of the truth of a given statement without revealing any information beyond the validity of the statement itself. First introduced by Goldwasser, Micali, and Rackoff …
-
SNARKs: New Applications and New Constructions Based on Error-Correcting Codes
Zero-knowledge proofs (ZKPs) are cryptographic protocols that enable one party, the prover, to convince another party, the verifier, of the truth of a given statement without revealing any information beyond the validity of the statement itself. First introduced by Goldwasser, Micali, and Rackoff …
-
SNARKs: New Applications and New Constructions Based on Error-Correcting Codes
Zero-knowledge proofs (ZKPs) are cryptographic protocols that enable one party, the prover, to convince another party, the verifier, of the truth of a given statement without revealing any information beyond the validity of the statement itself. First introduced by Goldwasser, Micali, and Rackoff …
-
Homomorfinio šifravimo taikymas elektroninio balsavimo sistemoje /
… scheme with homomorphic property and ZKP - zero knowledge proofs. All of them have been applied to the development of an digital voting website. Using RSA blind signature scheme for anonymous login to the voting process was achieved. Because system knows that this signature could only be …
-
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 …
-
Cryptographic Credentials with Privacy-preserving Biometric Bindings
… into the Anonymous Credentials scheme. Security proofs for non-transferability, correctness of ownership, and unlinkability are provided for the protocol’s instantiation into Digital Credentials. Our approach uses specialized biometric devices in both the issue and show protocols. These devices …
-
A post-quantum digital signature scheme based on supersingular isogenies
… of Unruh’s construction of non-interactive zero-knowledge proofs to an interactive zero-knowledge proof proposed by De Feo, Jao, and Plut. We implement our proposed scheme on an x86- 64 PC platform as well as an ARM-powered device. We exploit the stateof-the-art techniques to speed up the …
-
Construction of Sudoku, magic rectangles, magic Sudoku, twin Sudoku, and their extension to 3D Sudoku with application in cryptography and data security
… shown that they can be used in cryptography and zero-knowledge proof protocols. Sudoku puzzles are in the class of NP-complete problems, so zero knowledge proof protocols can be based on this class of problems. Sudoku tables like Latin squares can be used to generate locally repairable codes …
-
Non-Interactive Proofs: What Assumptions Are Sufficient?
A non-Interactive proof system allows a prover to convince a verifier that a statement is true by sending a single round of messages. In this thesis, we study under what assumptions can we build non-interactive proof systems with succinct verification and zero-knowledge. We obtain the following …
Page 1 of 4