×

Implementations of verifiable computation and succinct arguments - survey and wishlist - slides.pptx

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

  Parent Folder


Implementations of verifiable computation and succinct arguments - survey and wishlist - slides.pptx
PPTX 4 years ago 1.01 MB
Copy Link   
How to use SNARKs in universally composable protocols - 2015.pdf
PDF 4 years ago 508.20 kB
Copy Link   
Interactive oracle proofs - 2016.pdf
PDF 4 years ago 3.63 MB
Copy Link   
How to run Turing machines on encrypted data.pdf
PDF 4 years ago 329.35 kB
Copy Link   
Ligero: Lightweight sublinear arguments without a trusted setup - 2017.pdf
PDF 4 years ago 1.44 MB
Copy Link   
How to explain zero knowledge protocols to other people's children.pdf
PDF 4 years ago 226.79 kB
Copy Link   
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability - Bootle - 2017.pdf
PDF 4 years ago 877.21 kB
Copy Link   
Hash first, argue later: Adaptive verifiable computations on outsourced data - 2016.pdf
PDF 4 years ago 511.14 kB
Copy Link   
MARVELlous: A STARK-friendly family of cryptographic primitives - 2018.pdf
PDF 4 years ago 216.73 kB
Copy Link   
Halo: Recursive proof composition without a trusted setup - 2019.pdf
PDF 4 years ago 326.51 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   
Geppetto: Versalite verifiable computation.pdf
PDF 4 years ago 621.81 kB
Copy Link   
Pinocchio: Nearly practical verifiable computation.pdf
PDF 4 years ago 454.30 kB
Copy Link   
Fully dynamic verifiable zero-knowledge order queries for network data.pdf
PDF 4 years ago 681.70 kB
Copy Link   
Practical verified computation with streaming interactive proofs - thesis - Justin Thaler - 2013.pdf
PDF 4 years ago 3.29 MB
Copy Link   
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again.pdf
PDF 4 years ago 576.58 kB
Copy Link   
Quadratic span programs and succinct NIZKs without PCPs - GGPR.pdf
PDF 4 years ago 412.66 kB
Copy Link   
Efficient zero-knowledge arguments in the discrete log setting, revisited - 2019.pdf
PDF 4 years ago 406.92 kB
Copy Link   
Quasilinear-size zero knowledge from linear-algebraic PCPs - 2016.pdf
PDF 4 years ago 513.10 kB
Copy Link   
Efficient zero-knowledge arguments for arithmetic ciruits in the discrete log setting.pdf
PDF 4 years ago 580.31 kB
Copy Link   

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