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 5 of 5 for “"polynomial commitments"”.

  1. KZG10 polynomial commitments in blockchain technologies /

    Since the introduction of "Bitcoin" blockchain technologies have been on the rise and have even entered the mainstream. The design of the "Bitcoin" protocol has some practical flaws. These flaws are being solved in other blockchains such as the "Ethereum" network. One of such problems is ensuring …

    vilnius Repository record for KZG10 polynomial commitments in blockchain technologies / (opens in a new tab)

  2. Dynamic Vector Commitments

    This thesis studies vector commitments (VCs), a cryptographic primitive that allows a user to generate a succinct digest (commitment) to a vector of values. Using the digest, a user can generate proofs convincing a verifier of an arbitrary entry value in the committed vector. VCs have important …

    unsw Repository record for Dynamic Vector Commitments (opens in a new tab)

  3. Towards better asynchronous systems: advances in cryptography and distributed protocols

    … committing technique that combines vector and polynomial commitments to detect malicious behavior by the dealer at dispersal time, whereas prior work deferred this detection to retrieval. 3.Asynchronous Verifiable Secret Sharing (AVSS) protocols also allow a dealer to disperse a message M …

    bu Repository record for Towards better asynchronous systems: advances in cryptography and distributed protocols (opens in a new tab)

  4. Srovnání schémat důkazů s nulovou znalostí v jednotném prostředí

    Zero-knowledge důkazy (ZKP) umožňují dokazovateli přesvědčit ověřovatele o správnosti tvrzení, aniž by odhalil podkladový svědek. V posledních letech se ZKP stal klíčovou součástí aplikací chránících soukromí i škálovatelných blockchainových systémů, od stručných rollupů založených na SNARK až po …

    brno-tech Repository record for Srovnání schémat důkazů s nulovou znalostí v jednotném prostředí (opens in a new tab)

  5. Towards Trustworthy Federated Learning: Security, Privacy, and Verifiability

    … verification for matrix multiplication via polynomial identities over pairing groups, achieving $O(n^2)$ prover complexity for matrix dimension $n$, constant-size proofs (320 bytes), and constant-time verification (3.68\,ms), yielding up to $19.07\times$ verification speedup over prior …

    waterloo Repository record for Towards Trustworthy Federated Learning: Security, Privacy, and Verifiability (opens in a new tab)