Pricing via Processing or Combatting Junk Mail
By Cynthia Dwork, Moni Naor. 1992
Subfields: Privacy & Security, Algorithms & Complexity
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Privacy & Security
- Elaine Shi
- Steven Goldfeder
- Jonathan Katz
- Nicolas Papernot
- Dawn Song
- George Danezis
- Mariana Raykova
- Benedikt Bünz
In Algorithms & Complexity
- Marcus Pendleton
- Mustafa Al-Bassam
- Dawn Song
- Laurent L. Njilla
- Joseph Bonneau
- Andrew K. Miller
- Joshua A. Kroll
- Cormac Herley
Citations in the corpus
- DOS-Resistant Authentication with Client Puzzles (2000, background): “The idea of requiring the client to commit its resources firstwas described early by Dwork and Naor [5].”
- Permacoin: Repurposing Bitcoin Work for Data Preservation (2014, background): “Correctly solving an SOP constitutes a proof of work [3], i.”
- Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies (2016, background): “This approach originates from the attempts to combat spam [Dwork and Naor 1993, Back 2002].”
- Increasing the Cost of Model Extraction with Calibrated Proof of Work (2022, methodology): “…the client 9 , which can potentially use the returned labels to train its own model. which initially were used in the security domain to prevent a server from Denial-of-Service attacks (DoS) 1 , provide users with a small puzzle to be solved before giving access to the service (Dwork & Naor, 1993).”
- ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER (2014, background): “Dwork and Naor [1992] provided the first work into the usage of a cryptographic proof of computational expenditure (“proof-of-work”) as a means of transmitting a value signal over the Internet.”
- GAIA: a benchmark for General AI Assistants (2023, methodology): “The output could only be obtained upon successful completion of the task and be easy to validate, analogous to the Proof of Work algorithm (Jakobsson and Juels, 1999; Dwork and Naor, 1993), where a computer is asked to solve a complex problem whose solution is easy to verify.”
- SoK: Consensus in the Age of Blockchains (2017, methodology): “d by Dwork and Naor in 1993 as a technique for combatting spam mail, by requiring the email sender to compute the solution to a mathematical puzzle to prove that some computational work was performed [59]. PoW was independently proposed in 1997 for Hashcash by Back, another system for fighting spam [”
- Blockchain Based Access Control (2017, unknown): “Deciding which block to add to the ledger at each step is resolved by a distributed consensus algorithm called ’Nakamoto consensus’ that relies on HashCash Proof-of-Works [4].”
- FruitChains: A Fair Blockchain (2017, background): “Nakamoto blockchain protocol overcomes this issue by relying on “computational puzzles”—a.k.a. moderately hard functions or proofs of work — put forth by Dwork and Naor [DN92]: roughly speaking, the participants are required to solve the computational puzzle of some well-defined diffulty in order to c”
- A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform (2017, background): “This is achieved by forcing peers to find a nonce N such that given their block B and a limit L, the cryptographic hash of B ||N is lower than L [12], [13].”
- Pi: a path identification mechanism to defend against DDoS attacks (2003, background): “Researchers often propose computational solutions for this class of attacks [10, 12, 17].”
- RapidChain: Scaling Blockchain via Full Sharding (2018, background): “Unlike traditional consensus mechanisms, the Nakamoto consensus allows new participants to join the protocol using a proof-of-work (PoW) process [27], where a node demonstrates that it has done a certain amount of work by presenting a solution to a computational puzzle.”
- “ Proof-of-Work ” Proves Not to Work version 0 . 2 (2004, background): “However, there is an alternative to real-world money, which was first proposed by Dwork and Naor in 1992 [8].”
- Trusted Computing, Trusted Third Parties, and Verified Communications (2004, background): “Checking the validity of a “proof of work” (evidence that the sender has performed some moderately hard computation, of the kind suggested for discouraging spam; e.g., [ Dwork and Naor, 1992; Jakobsson and Juels, 1999]).”
- The Economics of Bitcoin Mining, or Bitcoin in the Presence of Adversaries (2013, background): “Such an analysis is necessary but not sufficient to explain the consensus that Bitcoins are valuable.”