Back to Results
First PageMeta Content
Error detection and correction / Search algorithms / Proof-of-work system / Lamport signature / Hash function / Hash tree / SHA-1 / Hash list / Crypt / Cryptography / Cryptographic hash functions / Hashing


An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees Technical Report A/390/CRI Fabien Coelho ´ CRI, Ecole des mines de Paris,
Add to Reading List

Document Date: 2008-01-11 06:10:48

Open Document

File Size: 202,29 KB

Share Result on Facebook

City

Mumbai / San Diego / Paris / /

Company

SRI International Computer Science Laboratory / /

Country

France / United States / India / /

Facility

L. J. Camp / Stanford University / /

IndustryTerm

found solution / search process / search time distribution / target hardware / web-sites / constant-effort solution / work protocols / bread pudding protocols / iterative search / solution-verification protocols / above protocol / challenge-response protocols / search effort / /

OperatingSystem

DoS / /

Organization

MIT / Stanford University / /

Person

Alexandre Aillos / Pierre Jouvelot / Vincent Bachelot / /

/

Position

editor / Financial Cryptography’98 / /

Product

Franklin / /

ProvinceOrState

California / /

PublishedMedium

Cryptology ePrint Archive / /

SportsLeague

Stanford University / /

Technology

Cryptography / bread pudding protocols / solution-verification protocols / Public Key / above protocol / Solution-Verification protocol / work protocols / Challenge-Response protocol Challenge-response protocols / Peer-to-peer / ascii / challenge-response protocols / http / private key / Tonelli-Shanks algorithm / /

SocialTag