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 8 of 8 for “"Snarks"”.

  1. Formalizing soundness proofs of SNARKs

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms

    uiuc Repository record for Formalizing soundness proofs of SNARKs (opens in a new tab)

  2. SNARKs for C : verifying program executions succinctly and in zero knowledge

    We present a proof system that allows efficient verification of NP statements, given proofs produced by an untrusted yet computationally-bounded prover. Our system is publicly verifiable: after a trusted third-party has generated a proving key and a verification key, anyone can use the proving key …

    mit Repository record for SNARKs for C : verifying program executions succinctly and in zero knowledge (opens in a new tab)

  3. Measurements of edge uncolourability in cubic graphs

    … as the famous Petersen graph and the Blanusa snarks, to discovering in nite classes of uncolourable cubic graphs such as the Louphekine and Goldberg snarks, to investigating parameters which measure the uncolourability of cubic graphs. These parameters include resistance, oddness and weak …

    western-cape Repository record for Measurements of edge uncolourability in cubic graphs (opens in a new tab)

  4. An ECDSA Nullifier Scheme and a Proof of Identity Application

    ZK-SNARKs (Zero Knowledge Succinct Noninteractive ARguments of Knowledge) are one of the most promising new applied cryptography tools: proofs allow anyone to prove a property about some data, without revealing that data. Largely spurred by the adoption of cryptographic primitives in blockchain …

    mit Repository record for An ECDSA Nullifier Scheme and a Proof of Identity Application (opens in a new tab)

  5. Succinct non-Interactive arguments

    … our transformations is recursive composition of SNARKs and, more generally, new techniques for constructing and using proof-carrying data (PCD) systems, which extend the notion of a SNARK to the distributed setting. Concretely, to bootstrap a given SNARK, we recursively compose the SNARK to …

    mit Repository record for Succinct non-Interactive arguments (opens in a new tab)

  6. Cryptographic Innovations in Blockchain

    … attacks. These two protocols are based on zk-SNARKs, a family of succinct zero-knowledge cryptographic algorithms that has gained much prominence recently for ensuring scalability and privacy in decentralised contexts. The idea is also among the first in the literature to introduce social …

    poli-torino Repository record for Cryptographic Innovations in Blockchain (opens in a new tab)

  7. ZKPerf: Performance benchmarking and Analysis of Zero-knowledge Frameworks and Virtual Machines

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-05-01

    uiuc Repository record for ZKPerf: Performance benchmarking and Analysis of Zero-knowledge Frameworks and Virtual Machines (opens in a new tab)

  8. Succinct publicly auditable MPC with universal setup

    In recent years, Multiparty computation as a service (MPCSaaS) is gaining popularity as a promising approach for building privacy-preserving communication systems. Although there has been significant improvement in the efficiency and robustness of such protocols, in this thesis, we argue that these …

    uiuc Repository record for Succinct publicly auditable MPC with universal setup (opens in a new tab)