作業 證明 시스템

위키百科, 우리 모두의 百科事典.

作業 證明 시스템 ( proof-of-work (PoW) system 또는 protocol, function)은 서비스 要請者로부터 一部 作業을 要求함으로써(일반적으로 컴퓨터에 依한 處理 時間을 意味) 서비스 拒否 (DoS) 攻擊과 其他 서비스 惡用(예: 네트워크 上의 스팸 )을 斷念하게 만들기 위한 經濟的인 手段이다. 이 槪念은 1993年의 어느 한 雜誌 記事에서 提示된 바에 따르면 Cynthia Dwork와 Moni Naor에 依해 發明되었다. [1] "作業 證明"(Proof of Work, POW)이라는 用語는 1999年 論文에서 Markus Jakobsson와 Ari Juels에 依해 처음 만들어져 公式化되었다. [2] 通話에 價値를 提供하기 위해 使用된 作業 證明 시스템의 初期 例는 솔로몬 諸島 조가비 貨幣 이다.

作業 證明 機能 目錄 [ 編輯 ]

아래에는 現在 알려진 作業 證明 函數의 目錄이다:

같이 보기 [ 編輯 ]

各州 [ 編輯 ]

  1. 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.  
  2. Jakobsson, Markus; Juels, Ari (1999). “Proofs of Work and Bread Pudding Protocols” . 《Communications and Multimedia Security》 (Kluwer Academic Publishers): 258?272.  
  3. Back, Adam. “HashCash” .   Popular proof-of-work system. First announce in March 1997.
  4. Gabber, Eran; Jakobsson, Markus; Matias, Yossi; Mayer, Alain J. (1998). “Curbing junk e-mail via secure classification”. 《Financial Cryptography》: 198?213.  
  5. Wang, Xiao-Feng; Reiter, Michael (May 2003). “Defending against denial-of-service attacks with puzzle auctions” (PDF) . 《IEEE Symposium on Security and Privacy '03》. 2016年 3月 3日에 原本 文書 (PDF) 에서 保存된 文書 . 2018年 5月 11日에 確認함 .  
  6. Franklin, Matthew K. ; Malkhi, Dahlia (1997). “Auditable metering with lightweight security”. 《Financial Cryptography '97》.   Updated version May 4, 1998.
  7. Juels, Ari; Brainard, John (1999). “Client puzzles: A cryptographic defense against connection depletion attacks”. 《NDSS 99》.  
  8. 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》.  
  9. Abadi, Martin ; Burrows, Mike; Manasse, Mark; Wobber, Ted (2005). “Moderately hard, memory-bound functions”. 《ACM Trans. Inter. Tech.》 5 (2): 299?327.  
  10. Dwork, Cynthia ; Goldberg, Andrew ; Naor, Moni (2003). “On memory-bound functions for fighting spam”. 《Advances in Cryptology: CRYPTO 2003》 (Springer) 2729 : 426?444.  
  11. Coelho, Fabien. “Exponential memory-bound functions for proof of work protocols” . 《Cryptology ePrint Archive, Report》.  
  12. Tromp, John (2015). “Cuckoo Cycle; a memory bound graph-theoretic proof-of-work” (PDF) . 《Financial Cryptography and Data Security: BITCOIN 2015》. Springer. 49?62쪽.  
  13. Coelho, Fabien. “An (almost) constant-effort solution-verification proof-of-work protocol based on Merkle trees” . 《Cryptology ePrint Archive, Report》.  
  14. 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.  

外部 링크 [ 編輯 ]

  • “Finney's system” . 2007年 12月 22日에 原本 文書 에서 保存된 文書 . 2018年 5月 11日에 確認함 .  
  • 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.