×

Scalable, transparent, and post-quantum secure computational integrity - 2018.pdf

Home / Discover /diyhpl.us/~bryan/papers2/bitcoin/snarks/

  Parent Folder


Scalable, transparent, and post-quantum secure computational integrity - 2018.pdf
PDF 4 years ago 798.63 kB
Copy Link   
SNARKs for C: Verifying program executions succinctly and in zero knowledge.pdf
PDF 4 years ago 5.27 MB
Copy Link   
Scalable zero knowledge via cycles of elliptic curves.pdf
PDF 4 years ago 734.73 kB
Copy Link   
Recursive composition and bootstrapping for SNARKs and proof-carrying data.pdf
PDF 4 years ago 879.34 kB
Copy Link   
Secure sampling of public parameters for succinct zero knowledge proofs.pdf
PDF 4 years ago 605.44 kB
Copy Link   
Quasilinear-size zero knowledge from linear-algebraic PCPs - 2016.pdf
PDF 4 years ago 513.10 kB
Copy Link   
Signatures of correct computation.pdf
PDF 4 years ago 497.40 kB
Copy Link   
Quadratic span programs and succinct NIZKs without PCPs - GGPR.pdf
PDF 4 years ago 412.66 kB
Copy Link   
Slow motion zero knowledge identifying with colliding commitments.pdf
PDF 4 years ago 549.10 kB
Copy Link   
Practical verified computation with streaming interactive proofs - thesis - Justin Thaler - 2013.pdf
PDF 4 years ago 3.29 MB
Copy Link   
Spartan: Efficient and general-purpose zkSNARKs without trusted setup - 2019.pdf
PDF 4 years ago 381.43 kB
Copy Link   
Pinocchio: Nearly practical verifiable computation.pdf
PDF 4 years ago 454.30 kB
Copy Link   
Square span programs with applications to succinct NIZK arguments.pdf
PDF 4 years ago 398.34 kB
Copy Link   
NIZKs with an untrusted CRS: Security in the face of parameter subversion - 2016.pdf
PDF 4 years ago 490.00 kB
Copy Link   
Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits - 2019.pdf
PDF 4 years ago 643.82 kB
Copy Link   
MARVELlous: A STARK-friendly family of cryptographic primitives - 2018.pdf
PDF 4 years ago 216.73 kB
Copy Link   
Succinct non-interactive arguments - Chiesa - thesis.pdf
PDF 4 years ago 10.41 MB
Copy Link   
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability - Bootle - 2017.pdf
PDF 4 years ago 877.21 kB
Copy Link   
Succinct non-interactive arguments via linear interactive proofs.pdf
PDF 4 years ago 841.71 kB
Copy Link   
Ligero: Lightweight sublinear arguments without a trusted setup - 2017.pdf
PDF 4 years ago 1.44 MB
Copy Link   

Join FilePursuit on FilePursuit Discord Server chat for discussions and more information.