HackerNoon.com
Published in

HackerNoon.com

Private and Compliant: About Zero-Knowledge Proofs and Security Token Protocols

The Identity Challenge

zk-SNARKs?

  1. Completeness: if the statement is true, and the verifier and prover are honest, the proof is accepted.
  2. Soundness: if the statement is false, a cheating prover cannot convince an honest verifier that it is true, except with some tiny probability.
  3. Zero-knowledge: if the statement is true, a verifier does not learn anything beyond the fact that the statement is true.
  4. Succinct: The size of the proof needs to be small enough to be verified in a few milliseconds.
  5. Non-Interactive: Only one set of information is sent to the verifier for verification, therefore there is no back and forth communication between the prover and verifier.
  6. ARgument: A computationally sound proof: soundness holds against a prover that leverages polynomial-time, i.e. bounded computation.
  7. of Knowledge: The proof cannot be constructed without access to the witness (the private input needed to prove the statement).

Zk-SNARKs and Security Tokens

Implementation Ideas

Zk-SNARKs Alternatives You Should Know About

--

--

Elijah McClain, George Floyd, Eric Garner, Breonna Taylor, Ahmaud Arbery, Michael Brown, Oscar Grant, Atatiana Jefferson, Tamir Rice, Bettie Jones, Botham Jean

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Jesus Rodriguez

CEO of IntoTheBlock, Chief Scientist at Invector Labs, I write The Sequence Newsletter, Guest lecturer at Columbia University, Angel Investor, Author, Speaker.