Key transparency: Blockchain meets NoiseSocket
summary
Describes using a sparse Merkle tree to store identifier→public‑key bindings so clients get strict proof of absence as well as presence, anchoring each epoch root in public blockchains for immutable history; commitments and a deterministic signature/VRF hide identifiers and real user counts. Claims Merkle proofs are a few kilobytes versus gigabytes for full chains. Shows a working proof‑of‑concept: Arduino sensor → engine.io shim → Go microservice → browser, all end‑to‑end encrypted and fitting in 18 KB Arduino demo.
AI-written summary · about
chapters (9)
- 0:00Introduction and speaker background
- 3:43Blockchain beyond cryptocurrency
- 7:40Key Transparency concept
- 15:37Merkle trees and sparse proofs
- 22:04Key Transparency implementation
- 26:08NoiseSocket protocol overview
- 32:15NoiseSocket architecture
- 35:48Demo and practical use
- 47:35Q&A session
related talks
39mPrivacy-preserving Approaches to Transparency Logs
23mBlockchain
42mWhy Privacy Matters
50mIdentity & Trust in Monitored Spaces
43mFinding the merkle tree in the block chain forest
12mThe Privacy Paradox: Balancing Transparency and Security in Blockchain
51mCLOSING KEYNOTE - Security is What We Make of It - Blockchain and Beyond
21mGhostor: Toward a Secure Data Sharing System from Decentralized Trust