Public Blockchain technology like Ethereum is gaining interest and growing use case among startup and fintechs.
Apart from scalability issues which are going to be solved with new consensus and mining techniques (Ethereum Metropolis and Bitcoin SegWit2x with Lightning network),
privacy on transaction is still an issue which is not yet fully addressed yet. Because of the public nature of a Ethereum, many businesses are reluctant to deploy Smart-contract or Dapps solutions for fear of exposing confidential or sensitive information.
The use of zk SNARKs (zk-SNARK stands for “Zero-Knowledge Succinct Non-Interactive Argument of Knowledge”) would essentially solve this dilemma (next EIP improvement of Ethereum called 'Byzantium' include zk SNARKS).
The idea of zk-SNARKs is that they allow verification of the correctness of computations, without a verifier having to execute those computations, or even learn what was actually executed. Using zk-SNARKs, a verifier can confirm that a computation happened correctly, with ‘zero-knowledge’ of the computation.
We propose during this talk to have a brief presentation on cryptography and theory around zero-knowledge proof algorithm.
Then we will try to showcase the benefits of zk-SNARKS and other privacy-preserving techniques (like zcash) on the public blockchain ecosystem.
Once data is
embedded in the
cannot be altered
Do you think
Bitcoin is still
• Wallet address re-use, linking your transactions
together into a single profile.
• IP address re-use.
• Combining inputs from multiple transactions,
• Using mobile wallet, effectively revealing to a third
party your full set of addresses.
In a Zero-knowledge (ZK) proof we have
• Prover - Peggy
• Verifier - Victor
The prover wants to convince the
verifier that a statement is true without
leaking any extra information.
E.g. the prover wants to convince the
verifier that he has a secret without
Privacy-preserving techniques using zero knowledge proof in public Ethereum - Nov 3 - BAT3811
Properties of ZK proofs:
• Termination: the protocol finishes
after a number of steps.
• Completeness: if the statement is
true then the verifier will be
convinced of this at the end of the
• Soundness: if the statement is false
then it is unlikely that the verifier will
• Zero-knowledge: at the end of the
protocol no sensitive information is
leaked to the verifier.
Privacy-preserving techniques using zero knowledge proof in public Ethereum - Nov 3 - BAT3813
Homomorphic encryption allows to
perform operations on sensitive data
while keeping it encrypted.
Use case: secure cloud computing
Privacy-preserving techniques using zero knowledge proof in public Ethereum - Nov 3 - BAT3818
𝐸𝑛𝑐 𝑚 + 𝐸𝑛𝑐 𝑛 = 𝐸𝑛𝑐(𝑚 + 𝑛)
ELCA is working on innovation projects wich aims to
cover the following domain(s)
• Cloud Security and Searchable Encryption in the
• ChatBot and Natural Language processing
Mr Nagib Aouini Mr Jorge Alvaradp
Head of Cyber Security Lead Blockchain Architect
Tel : 021 613 2136 Tel : 021 613 2111
Confidential do not distribute 31
Dr Sonia Bogos
Tel : 021 613 2111