dogear

enter for all results · esc to close

Multi-Theorem Preprocessing NIZKs from Lattices

link.springer.comsite

visit link.springer.com ↗
0
sign in to dogear this
from
Papers
added
2026-10-10
likes
0

similar

  1. Sorting with Bialgebras and Distributive Laws, 2012, Hinze et al. cs.ox.ac.uk
    site category #recursion-schemes link ↗
  2. Knowledge complexity of interactive proof systems github.com
    site category #crypto-papers link ↗
  3. How to construct zero-knowledge proof systems for NP wisdom.weizmann.ac.il
    site category #crypto-papers link ↗
  4. proof-using-helper.py github.com
    site category #coq link ↗

    Modifies source files to include proof annotations for faster parallel proving.

  5. Theorem Provers wiki.haskell.org
    site category #haskell link ↗
  6. Proofs of knowledge cseweb.ucsd.edu
    site category #crypto-papers link ↗

Papers › The list > Specific topics > Zero Knowledge Proofs: “Construction of non-interactive zero-knowledge (NIZK) proofs using lattice-based preprocessing models, by Sam Kim and David J. Wu.”