Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Auditable Metering with Lightweight Security
FC '97 Proceedings of the First International Conference on Financial Cryptography
Curbing Junk E-Mail via Secure Classification
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Publicly Verifiable Lotteries: Applications of Delaying Functions
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Proofs of Work and Bread Pudding Protocols
CMS '99 Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security
Defending Against Denial-of-Service Attacks with Puzzle Auctions
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
Secrecy, authentication, and public key systems.
Secrecy, authentication, and public key systems.
New client puzzle outsourcing techniques for DoS resistance
Proceedings of the 11th ACM conference on Computer and communications security
Off-Line karma: a decentralized currency for peer-to-peer and grid applications
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which 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.