An (Almost) Constant-E ort Solution-Veri cation Proof-of-Work Protocol based on Merkle Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Journal of Cryptology Année : 2008

An (Almost) Constant-E ort Solution-Veri cation Proof-of-Work Protocol based on Merkle Trees

(1)
1
Fabien Coelho

Résumé

Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions that are easy to check by the provider. We present such a new scheme for solution-verification protocols. Although most schemes to date are probabilistic unbounded iterative processes with high variance of the requester effort, our Merkle tree scheme is deterministic, with an almost constant effort and null variance, and is computation-optimal
Fichier principal
Vignette du fichier
A-390.pdf (178.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00752925 , version 1 (16-11-2012)

Identifiants

  • HAL Id : hal-00752925 , version 1

Citer

Fabien Coelho. An (Almost) Constant-E ort Solution-Veri cation Proof-of-Work Protocol based on Merkle Trees. 1st international conference on Progress in cryptology, Jun 2008, Casablanca,, Morocco. pp.Pages 80-93. ⟨hal-00752925⟩
155 Consultations
161 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More