Adjoint News

Verifiable Computing in Haskell: "Zero Knowledge Proofs"

Presentation by Anthony Sheldon

Anthony Sheldon from Adjoint will describe the theory of zero knowledge proofs and explain how to encode the operations of a simple embedded DSL to a single cryptographically-checkable polynomial test, and then prove there is correct execution for given inputs and outputs without revealing private data. Anthony will discuss the blockchain applications of this model with regards to security and trust model, and the regulatory and compliance implications for business.

Slides from the presentation