작업 증명 시스템

작업 증명 시스템(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]
약한 Fiat–Shamir 서명^[1]
Ong–Schnorr–Shamir 서명 (broken by Pollard)^[1]
부분 해시 반전(Partial hash inversion)^[3]^[4]^[2] 이 논문은 작업 증명(POW)의 개념을 공식화하고 재사용 가능한 작업 증명(RPOW) 시스템의 하나인 브레드 푸딩 프로토콜(bread pudding protocol)의 독립적인 개념을 도입하고 있다.^[5] (해시캐시로서)
해시 수열(Hash sequences)^[6]
퍼즐^[7]
디피-헬먼 기반 퍼즐^[8]
Moderate^[9]
Mbound^[10]
Hokkaido^[11]
Cuckoo Cycle^[12]
머클 트리 기반^[13]
Guided tour puzzle protocol^[14]

같이 보기

각주

1 2 3 4 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.
1 2 Jakobsson, Markus; Juels, Ari (1999). “Proofs of Work and Bread Pudding Protocols”. 《Communications and Multimedia Security》 (Kluwer Academic Publishers): 258–272.
↑ Back, Adam. “HashCash”. 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” (PDF). 《IEEE Symposium on Security and Privacy '03》. 2016년 3월 3일에 원본 문서 (PDF)에서 보존된 문서. 2018년 5월 11일에 확인함.
↑ 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》.
↑ Abadi, Martín; Burrows, Mike; Manasse, Mark; Wobber, Ted (2005). “Moderately hard, memory-bound functions”. 《ACM Trans. Inter. Tech.》 5 (2): 299–327.
↑ Dwork, Cynthia; Goldberg, Andrew; Naor, Moni (2003). “On memory-bound functions for fighting spam”. 《Advances in Cryptology: CRYPTO 2003》 (Springer) 2729: 426–444.
↑ Coelho, Fabien. “Exponential memory-bound functions for proof of work protocols”. 《Cryptology ePrint Archive, Report》.
↑ Tromp, John (2015). “Cuckoo Cycle; a memory bound graph-theoretic proof-of-work” (PDF). 《Financial Cryptography and Data Security: BITCOIN 2015》. Springer. 49–62쪽.
↑ Coelho, Fabien. “An (almost) constant-effort solution-verification proof-of-work protocol based on Merkle trees”. 《Cryptology ePrint Archive, Report》.
↑ 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.

[DwoNao1992-1] 1 2 3 4 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.

[JaJue1999-2] 1 2 Jakobsson, Markus; Juels, Ari (1999). “Proofs of Work and Bread Pudding Protocols”. 《Communications and Multimedia Security》 (Kluwer Academic Publishers): 258–272.

[Ba1997-3] Back, Adam. “HashCash”. Popular proof-of-work system. First announce in March 1997.

[GaJaMaMa1998-4] Gabber, Eran; Jakobsson, Markus; Matias, Yossi; Mayer, Alain J. (1998). “Curbing junk e-mail via secure classification”. 《Financial Cryptography》: 198–213.

[WaRei2003-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일에 확인함.

[FraMa1997-6] Franklin, Matthew K.; Malkhi, Dahlia (1997). “Auditable metering with lightweight security”. 《Financial Cryptography '97》. Updated version May 4, 1998.

[JueBrai1999-7] Juels, Ari; Brainard, John (1999). “Client puzzles: A cryptographic defense against connection depletion attacks”. 《NDSS 99》.

[WaJueHaFe2004-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》.

[ABuMaWo2003-9] Abadi, Martín; Burrows, Mike; Manasse, Mark; Wobber, Ted (2005). “Moderately hard, memory-bound functions”. 《ACM Trans. Inter. Tech.》 5 (2): 299–327.

[DwoGoNao2003-10] Dwork, Cynthia; Goldberg, Andrew; Naor, Moni (2003). “On memory-bound functions for fighting spam”. 《Advances in Cryptology: CRYPTO 2003》 (Springer) 2729: 426–444.

[Coe2005-11] Coelho, Fabien. “Exponential memory-bound functions for proof of work protocols”. 《Cryptology ePrint Archive, Report》.

[Tro2014-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쪽.

[Coe2007-13] Coelho, Fabien. “An (almost) constant-effort solution-verification proof-of-work protocol based on Merkle trees”. 《Cryptology ePrint Archive, Report》.

[Abliz09-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.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]