융합보안논문지 (Convergence Security Journal)

  • 제20권4호
  • /
  • Pages.177-186
  • /
  • 2020
  • /
  • 1598-7329(pISSN)
  • /
  • 2508-7460(eISSN)
한국융합보안학회 (Korea convergence Security Association)
권호 표지
DOI QR코드

DOI QR Code

동등한 권한을 가진 대표노드를 위한 능동적 비밀 분산을 이용한 비공개 블록 암호화 기법

Fair Private Block Encryption Protocol with Proactive Secret Sharing for Delegated Node of Public Blockchain

  • 정승욱 (건양대학교/사이버보안공학과)
  • 투고 : 2020.09.28
  • 심사 : 2020.10.21
  • 발행 : 2020.10.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

현재의 퍼블릭 블록체인은 누구나 원장의 내용을 볼 수 있도록 설계가 되어있다. 하지만 응용에 따라서 비밀 정보를 블록체인에 저장해야 하는 경우도 있으나 이에 대한 연구는 아직 미진하다. 본 논문에서는 DPoS(Delegated Proof of Stack) 합의방식을 사용하는 블록체인을 대상으로 공개 블록과 비공개 블록의 두 계층으로 이루어진 블록체인을 제안하고 비공개 블록의 암호화를 위한 요구사항을 도출하였다. 도출된 암호화 요구사항을 만족하는 dealer없는 t-of-n threshold 암호화를 제안하였다. 또한, DPoS의 대표노드들은 가입과 탈퇴가 발생할 수 있어서, 대표노드의 가입과 탈퇴에 따라서 키 조각을 재분배하는 효율적인 방법을 제시하였다. 제안된 기법이 대표노드간의 공평성과 동일한 신뢰성을 만족하는 특징을 가진다.

In current public blockchain, any node can see every blocks, so that public blockchain provider transparent property. However, some application requires the confidential information to be stored in the block. Therefore, this paper proposes a multi-layer blockchain that have the public block layer and the private block for confidential information. This paper suggests the requirement for encryption of private block. Also, this paper shows the t-of-n threshold cryptosystem without dealer who is trusted third party. Moreover, the delegated node who has key information can be withdraw the delegated node group or a new delegated node can join in the delegated node group. Therefore, the paper proposes an efficient key information resharing scheme for withdraw and join. Finally proposed scheme satisfies the requirements for encryption and fairness.

키워드

과제정보

본 논문은 2020년도 정부(과학기술정보통신부)의 재원으로 정보통신기획평가원의 지원을 받아 수행된 연구임 (No.2019-0-00411, 블록체인의 개인 콘텐츠 추적과 완전소멸수정을 위한 잊힐 권리 문제 해결)

참고문헌

  1. Yaga, Dylan, et al., "Blockchain technology overview." arXiv preprint arXiv:1906.11078 (2019).
  2. 병적 별도관리대상자 명단 https://www.privacy.go.kr/wcp/pif/sch/personalInfoFileViewPopup.do?prsnInfoFileId=PIF_000000000712041
  3. Zheng, Zibin, et al., "An overview of blockchain technology: Architecture, consensus, and future trends." 2017 IEEE International Congress on Big Data (BigData Congress). IEEE, 2017.
  4. Hong, Jeongdae, et al., "Fair threshold decryption with semi-trusted third parties." Australasian Conference on Information Security and Privacy. Springer, Berlin, Heidelberg, 2009.
  5. Pedersen, Torben Pryds, "A threshold crypto-system without a trusted party." Workshop on the Theory and Application of of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1991.
  6. Daemen, Joan, and Vincent Rijmen, The design of Rijndael: AES-the advanced encryption standard. Springer Science & Business Media, 2013.
  7. ElGamal, Taher, "A public key cryptosystem and a signature scheme based on discrete logarithms." IEEE transactions on information theory 31.4 (1985): 469-472. https://doi.org/10.1109/TIT.1985.1057074
  8. Shamir, Adi. "How to share a secret." Communications of the ACM 22.11 (1979): 612-613. https://doi.org/10.1145/359168.359176
  9. Reiter, Michael K., and Kenneth P. Birman, "How to securely replicate services." ACM Transactions on Programming Languages and Systems (TOPLAS) 16.3 (1994): 986-1009. https://doi.org/10.1145/177492.177745
  10. Gennaro, Rosario, et al., "Robust threshold DSS signatures." International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1996.
  11. Frankel, Yair, Peter Gemmell, and Moti Yung, "Witness-based cryptographic program checking and robust function sharing." STOC. Vol. 96. No. 47. 1996.
  12. Gennaro, Rosario, et al., "Robust and efficient sharing of RSA functions." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 1996.
  13. Pedersen, Torben Pryds, "A threshold crypto-system without a trusted party." Workshop on the Theory and Application of of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1991.
  14. Boneh, Dan, and Matthew Franklin, "Efficient generation of shared RSA keys." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 1997.
  15. Ostrovsky, Rafail, and Moti Yung, "How to withstand mobile virus attacks." PODC. Vol. 91. 1991.
  16. Herzberg, Amir, et al., "Proactive secret sharing or: How to cope with perpetual leakage." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 1995.
  17. Desmedt, Yvo, and Sushil Jajodia, "Redistributing secret shares to new access structures and its applications", Vol. 148. Technical Report ISSE TR-97-01, George Mason University, 1997.
  18. Frankel, Yair, et al., "Optimal-resilience proactive public-key cryptosystems." Proce dings 38th Annual Symposium on Foundations of Computer Science. IEEE, 1997.
  19. C. Gehrmann and Y. Desmedt, 'Truly Anonymous secret sharing', Manuscript.
  20. Li, Chuan-Ming, Tzonelih Hwang, and Narn-Yih Lee, "Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders." Workshop on the Theory and Application of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1994.
  21. Desmedt, Yvo, Giovanni Di Crescenzo, and Mike Burmester, "Multiplicative non-abelian sharing schemes and their application to threshold cryptography." International Conference on the Theory and Application of Cryptology. Springer, Berlin, Heidelberg, 1994.
  22. Alon, Noga, Zvi Galil, and Moti Yung, "Efficient dynamic-resharing "verifiable secret sharing" against mobile adversary." European Symposium on Algorithms. Springer, Berlin, Heidelberg, 1995.
  23. 병역사항신고 및 공개 파일 https://www.privacy.go.kr/wcp/pif/sch/personalInfoFileViewPopup.do?prsnInfoFileId=PIF_000000000076460.