Proof of work without all the work

D Gupta, J Saia, M Young - … of the 19th international conference on …, 2018 - dl.acm.org
Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a
computational cost on participating devices. Unfortunately, traditional PoW schemes require …

mod_kaPoW: Mitigating DoS with transparent proof-of-work

E Kaiser, W Feng - Proceedings of the 2007 ACM CoNEXT conference, 2007 - dl.acm.org
Unwanted traffic remains a fundamental problem for networked systems. Proof-of-work
(PoW) is a defense mechanism that adds a client-specific challenge at the start of a …

Lazy Susan: dumb waiting as proof of work

J Crowcroft, T Deegan, C Kreibich, R Mortier, N Weaver - 2007 - cl.cam.ac.uk
The open nature of Internet services has been of great value to users, enabling dramatic
innovation and evolution of services. However, this openness permits many abuses of open …

[PDF][PDF] Cuckoo Cycle: a memory-hard proof-of-work system.

J Tromp - IACR Cryptol. ePrint Arch., 2014 - Citeseer
Cuckoo Cycle: a memory-hard proof-of-work system Page 1 Cuckoo Cycle: a memory-hard
proof-of-work system John Tromp February 1, 2014 Abstract We introduce the first trivially …

Crime and punishment in distributed byzantine decision tasks

P Civit, S Gilbert, V Gramoli, R Guerraoui… - 2022 IEEE 42nd …, 2022 - ieeexplore.ieee.org
A decision task is a distributed input-output problem in which each process starts with its
input value and eventually produces its output value. Examples of such decision tasks are …

Proofs of work and bread pudding protocols

M Jakobsson, A Juels - … and Multimedia Security IFIP TC6/TC11 Joint …, 1999 - Springer
We formalize the notion of a proof of work (POW). In many cryptographic protocols, a prover
seeks to convince a verifier that she possesses knowledge of a secret or that a certain …

[PDF][PDF] Momentum–a memory-hard proof-of-work via finding birthday collisions

D Larimer - Download date, 2014 - hashcash.org
We introduce the concept of memory-hard proof-of-work algorithms and argue that in order
for proof-of-work based systems to be secure against attacks using custom hardware, they …

[PDF][PDF] Asynchronous secure computation

M Ben-Or, R Canetti, O Goldreich - Proceedings of the twenty-fifth annual …, 1993 - dl.acm.org
We initiate a study of security in asynchronous networks. We consider a completely
asynchronous network where every two parties are connected via a private channel, and …

Distributed zero-knowledge proofs over networks

A Bick, G Kol, R Oshman - Proceedings of the 2022 Annual ACM-SIAM …, 2022 - SIAM
Zero knowledge proofs are one of the most influential concepts in theoretical computer
science. In the seminal definition due to Goldwasser, Micali and Rackoff dating back to the …

Pow-based distributed cryptography with no trusted setup

M Andrychowicz, S Dziembowski - … , Santa Barbara, CA, USA, August 16 …, 2015 - Springer
Motivated by the recent success of Bitcoin we study the question of constructing distributed
cryptographic protocols in a fully peer-to-peer scenario under the assumption that the …