Exposé de Rafael Pass lors du colloque Paris Crypto Day organisé par le département informatique de l'ENS.
Nakamoto’s famous blockchain protocol enables achieving consensus in a so-called permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not depend on the identities of the players. His ingenious protocol prevents “sybil attacks” (where an adversary spawns any number of new players) by relying on computational puzzles (a.k.a. “moderately hard functions”) introduced by Dwork and Naor (Crypto’92).
Prior works that analyze the blockchain protocol either make the simplifying assumption that network channels are fully synchronous (i.e. messages are instantly delivered without delays) (Garay et al, Eurocrypt’15) or only consider specific attacks (Nakamoto’08; Sampolinsky and Zohar, FinancialCrypt’15); additionally, as far as we know, none of them deal with players joining or leaving the protocol...
Catégories: Paris Crypto Day
Mot-clés : base de données, sécurité, Nouvelles technologies, cryptographie, système informatique, blockchain
Voir aussi
|
|
Cursus :
Rafael Pass est professeur agrégé au département informatique de l'université de Cornell. Ses recherches portent sur la cryptographie et son interaction avec la complexité et la théorie des jeux.
Cliquer ICI pour fermerDernière mise à jour : 03/11/2016
Tous droits réservés
@ 2011 ENS