# Course on Multiparty Computation and blockchains
###### tags: `Didattica`

## Useful links :

- Merkle Tree https://decentralizedthoughts.github.io/2020-12-22-what-is-a-merkle-tree/
- Avi Wigderson https://www.youtube.com/watch?v=5ovdoxnfFVc
- https://www.esat.kuleuven.be/cosic/blog/co6gc-introduction-to-zero-knowledge-proofs-1/ to use picture maybe
- https://www.zfnd.org/blog/mixnet-production-readiness/
- https://github.com/initc3/babySNARK/blob/master/babysnark.pdf
- https://twitter.com/zeroknowledgefm (just to not forget this exists)
- http://bitcoinbook.cs.princeton.edu/ (book on Bitcoins and Cryptocurrencies from Princeton uni)
- Maybe this one isn't relevant: https://www.zfnd.org/blog/mixnet-production-readiness/ (MixNets)
- BOOK on proof systems (Thaler) https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.pdf
- Boaz Barak's course [https://intensecrypto.org/public/index.html](link)

## Other link:
- http://www.lkozma.net/inequalities_cheat_sheet/ineq.pdf

## Notes from Blockchain Book

- Byzantine Agreement (or B.Broadcast, synonims) LSP82 description
- Pitch for Blockchain: Blockchain needs to reach agreement repeatedly over time
- Synchrony Assumption
- Ideal functionality for BB then talk about consistency and validity
- Dolev-Strong: the book does not explain very well what is $<b>_S$ (pag 14). I found easy this recursive definition for chain of signature:
- Maybe an explanation with "physical documents to be hand-signed" would be easy to follow to explain "k-signature chain"
- DS83 also prove that any *deterministic* protocol solving BB needs at least $f+1$ rounds.
- Pease Shostak and Lamport (PSL80): BB impossible under 1/3 corruption w/o Setup Assumptions. Do not prove it but show the triangle thinghy.
-