Lecture

Distributed Randomness: Drand

Description

This lecture covers the concept of distributed randomness using Drand, a service that provides verifiable, unpredictable, and unbiased random numbers. It explains cryptographic tools for decentralized systems, including shared-algorithm cryptography, symmetric-key cryptography, and public-key cryptography. The lecture delves into topics such as interactive key exchange, elliptic curve cryptography, and the Elliptic Curve Digital Signature Algorithm (ECDSA). It also explores the challenges of generating public randomness, the history of randomness beacons, and the League of Entropy. Additionally, it discusses the practical applications of Drand in Filecoin consensus, lotteries, and blockchain systems.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.