Programmable Cryptography (Part 1)
by gubsheep. Thanks to Justin Glibert, Barry Whitehat, Vitalik Buterin, Yan Zhang, Alex Allain, Dan Boneh, Elaine Shi, Nicholas Brysiewicz, and Albert Ni for discussion and review. Cryptography is undergoing a generational transition, from special-purpose cryptography to programmable cryptography. By “special-purpose cryptography,” we mean protocols that allow us to perform a single operation with cryptographic guarantees. Public-key encryption and signature schemes are examples of special-purpose cryptography: for example, a signature scheme allows me to prove to you that I know a unique cryptographic key. More complex examples of special-purpose cryptography include group signatures, a special type of signature scheme which enables one person to sign anonymously on behalf of a group, or range proofs, which enable you to prove that a secret number is within some range, without revealing the number. In each of these cases, cryptographers have designed a special-purpose protocol, someti
0xPARC
Explore this link on the map →related reading
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Signal >> Blog >> Quantum Resistance and the Signal Protocolsignal.org
- Secure multi-party computation - Wikipediaen.wikipedia.org
- thesis.pdfaayushg.com
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Cryptography - Wikipediaen.wikipedia.org
- zkSNARKs and Programmable Group Signatures - HackMDhackmd.io
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- Themes from Real World Crypto 2022 - The Trail of Bits Blogblog.trailofbits.com