Back to Results
First PageMeta Content



An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees (extended and colored version of [7]) Fabien Coelho ´ CRI, Ecole des mines de Paris,
Add to Reading List

Document Date: 2008-06-22 07:14:34

Open Document

File Size: 268,03 KB

Share Result on Facebook

City

Casablanca / Mumbai / San Diego / Paris / /

Company

SRI International Computer Science Laboratory / /

Country

France / United States / India / /

Event

Person Communication and Meetings / /

Facility

L. J. Camp / Stanford University / /

IndustryTerm

found solution / search process / search time distribution / target hardware / requester response protocols / work protocols / search cost / iterative search / streaming protocols / costly services / solution-verification protocols / above protocol / partial-tree constant-effort solution / /

OperatingSystem

DoS / /

Organization

MIT / Stanford University / /

Person

Alexandre Aillos / Gunnar Kreitz / Pierre Jouvelot / Thomas Sirvent / Vincent Bachelot / John B. Chapman / Progress / Zachary B. Ciccolo / /

/

Position

editor / editor / Financial Cryptography’98 / /

Product

Franklin / /

ProvinceOrState

California / /

PublishedMedium

Cryptology ePrint Archive / Lecture Notes in Computer Science / /

SportsLeague

Stanford University / /

Technology

Cryptography / Bread Pudding Protocols / solution-verification protocols / Public Key / above protocol / work protocols / Peer-to-peer / Proof-of-Work Protocol / http / private key / requester response protocols / simulation / 1 streaming protocols / Tonelli-Shanks algorithm / /

URL

http /

SocialTag