プルーフ・オブ・ワークシステム
出典: フリー百科事典『ウィキペディア（Wikipedia）』 (2022/06/18 00:07 UTC 版)
関連
注釈
- 1.^大半のUnixシステムではこれはコマンドで確認できる:
echo -n 1:52:380119:calvin@comics.net:::9B760005E92F0DAE | openssl sha1
外部リンク
- Finney's system at the Wayback Machine (archived December 22, 2007)
- bit gold Bit gold. Describes a complete money system (including generation, storage, assay, and transfer) based on proof of work functions and the machine architecture problem raised by the use of these functions.
- ^ a b c d Dwork, Cynthia; Naor, Moni (1993). “Pricing via Processing, Or, Combatting Junk Mail, Advances in Cryptology”. CRYPTO’92: Lecture Notes in Computer Science No. 740 (Springer): 139–147.
- ^ a b c Jakobsson, Markus; Juels, Ari (1999). “Proofs of Work and Bread Pudding Protocols”. Communications and Multimedia Security (Kluwer Academic Publishers): 258–272.
- ^ Laurie, Ben; Clayton, Richard (May 2004). “Proof-of-work proves not to work”. WEIS 04.
- ^ Liu, Debin; Camp, L. Jean (June 2006). "Proof of Work can work - Fifth Workshop on the Economics of Information Security". Cite webテンプレートでは
|access-date=引数が必須です。 (説明) - ^ How powerful was the Apollo 11 computer?, a specific comparison that shows how different classes of devices have different processing power.
- ^ a b Abadi, Martín; Burrows, Mike; Manasse, Mark; Wobber, Ted (2005). “Moderately hard, memory-bound functions”. ACM Trans. Inter. Tech. 5 (2): 299–327.
- ^ a b Dwork, Cynthia; Goldberg, Andrew; Naor, Moni (2003). “On memory-bound functions for fighting spam”. Advances in Cryptology: CRYPTO 2003 (Springer) 2729: 426–444.
- ^ a b Coelho, Fabien. "Exponential memory-bound functions for proof of work protocols". Cryptology ePrint Archive, Report. Cite webテンプレートでは
|access-date=引数が必須です。 (説明) - ^ a b Tromp, John (2015). "Cuckoo Cycle; a memory bound graph-theoretic proof-of-work" (PDF). Financial Cryptography and Data Security: BITCOIN 2015. Springer. pp. 49–62. Cite webテンプレートでは
|access-date=引数が必須です。 (説明) - ^ a b Abliz, Mehmud; Znati, Taieb (December 2009). “A Guided Tour Puzzle for Denial of Service Prevention”. Proceedings of the Annual Computer Security Applications Conference (ACSAC) 2009 (Honolulu, HI): 279–288.
- ^ Back, Adam. "HashCash". Cite webテンプレートでは
|access-date=引数が必須です。 (説明) Popular proof-of-work system. First announce in March 1997. - ^ Gabber, Eran; Jakobsson, Markus; Matias, Yossi; Mayer, Alain J. (1998). “Curbing junk e-mail via secure classification”. Financial Cryptography: 198–213.
- ^ Wang, Xiao-Feng; Reiter, Michael (May 2003). “Defending against denial-of-service attacks with puzzle auctions”. IEEE Symposium on Security and Privacy '03.
- ^ Franklin, Matthew K.; Malkhi, Dahlia (1997). “Auditable metering with lightweight security”. Financial Cryptography '97. Updated version May 4, 1998.
- ^ Juels, Ari; Brainard, John (1999). “Client puzzles: A cryptographic defense against connection depletion attacks”. NDSS 99.
- ^ Waters, Brent; Juels, Ari; Halderman, John A.; Felten, Edward W. (2004). “New client puzzle outsourcing techniques for DoS resistance”. 11th ACM Conference on Computer and Communications Security.
- ^ Coelho, Fabien. "An (almost) constant-effort solution-verification proof-of-work protocol based on Merkle trees". Cryptology ePrint Archive, Report. Cite webテンプレートでは
|access-date=引数が必須です。 (説明) - ^ "Reusable Proofs of Work". 2007年12月22日時点のオリジナルよりアーカイブ。 Cite webテンプレートでは
|access-date=引数が必須です。 (説明)
[前の解説]
「プルーフ・オブ・ワークシステム」の続きの解説一覧
- プルーフ・オブ・ワークシステムのページへのリンク
