An intensive introduction to cryptography: Hash Functions, Random Oracles, and Bitcoin
intensecrypto.org · 5,910 words · saved by 1 readers
Lecture notes on Cryptography by Boaz Barak
An intensive introduction to cryptography: Hash Functions, Random Oracles, and Bitcoin Hash Functions, Random Oracles, and Bitcoin See any bugs/typos/confusing explanations? Open a GitHub issue . You can also comment below ★ See also the PDF version of this chapter (better formatting/references) ★ Hash Functions, Random Oracles, and Bitcoin We have seen pseudorandom generators, functions and permutations, as well as Message Authentication codes, CPA and CCA secure encryptions. This week we will talk about cryptographic hash functions and some of their magical properties. We motiv
related reading
- An intensive introduction to cryptography: indexintensecrypto.org
- But how does bitcoin actually work?youtube.com
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Lecture 14: Zero knowledge proofsboazbarak.org
- Bitcoin | Computer Securitytextbook.cs161.org
- ZK-Friendly Hash Functions | Zellic — Researchzellic.io
- btcProcFC.pdfcs.cornell.edu
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- lecnotes.pdfcs.cornell.edu
- What is the math behind elliptic curve cryptography?hackernoon.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Private information retrieval using homomorphic encryption (explained from scratch)blintzbase.com