Browse > Article
http://dx.doi.org/10.33778/kcsa.2019.19.5.011

Fair Private Block Encryption Protocol for Delegated Node of Public Blockchain  

Jung, Seung Wook (건양대학교/사이버보안공학과)
Lee, HooKi (건양대학교/사이버보안공학과)
Publication Information
Abstract
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. Finally proposed scheme satisfies the requirements for encryption and fairness.
Keywords
Blockchain; Private Block; Threshold Cryptosystem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Yaga, Dylan, et al. "Blockchain technology overview." arXiv preprint arXiv:1906.11078 (2019).
2 github, www.github.com
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 cryptosystem 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.   DOI
8 Shamir, Adi. "How to share a secret." Comm unications of the ACM 22.11 (1979): 612-613.   DOI
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.   DOI
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 Desmedt, Yvo, and Sushil Jajodia. Redistrib uting secret shares to new access structures and its applications. Vol. 148. Technical Report ISSE TR-97-01, George Mason University, 1997.
13 Gennaro, Rosario, et al. "Robust and efficient sharing of RSA functions." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 1996.
14 Pedersen, Torben Pryds. "A threshold cryptosystem without a trusted party." Workshop on the Theory and Application of of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1991.
15 Boneh, Dan, and Matthew Franklin. "Efficient generation of shared RSA keys." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 1997.
16 Ostrovsky, Rafail, and Moti Yung. "How to withstand mobile virus attacks." PODC. Vol. 91. 1991.
17 Herzberg, Amir, et al. "Proactive secret sharing or: How to cope with perpetual leakage." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 1995.
18 Frankel, Yair, et al. "Optimal-resilience proactive public-key cryptosystems." Proceedings 38th Annual Symposium on Foundations of Computer Science. IEEE, 1997.
19 C. Gehrmann and Y. Desmedt, Truly Anonym ous 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 of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1994.
21 Alon, Noga, Zvi Galil, and Moti Yung. "Efficient dynamic-resharing "verifiable secret sharing" against mobile adversary." European Symposium on Algorithms. Springer, Berlin, Heidelberg, 1995.
22 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.