An Improved Non-Interactive Zero-Knowledge Range Proof for Decentralized Applications

被引:11
作者
Tsai, Ya-Che [1 ]
Tso, Raylin [1 ]
Liu, Zi-Yuan [1 ]
Chen, Kung [1 ,2 ]
机构
[1] Natl Chengchi Univ, Dept Comp Sci, Taipei, Taiwan
[2] Natl Chengchi Univ, Dept Management Informat Syst, Taipei, Taiwan
来源
2019 IEEE INTERNATIONAL CONFERENCE ON DECENTRALIZED APPLICATIONS AND INFRASTRUCTURES (DAPPCON) | 2019年
关键词
Blockchain; Commitment scheme; Non-interactive zero-knowledge; Privacy protection; Range proof;
D O I
10.1109/DAPPCON.2019.00025
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Blockchain is the core technology underlying the first decentralized cryptocurrency, Bitcoin, introduced by Nakamoto in 2008. Since then, blockchain technology has many more advancements that are being developed and experimented. In particular, recent blockchain platforms such as Ethereum offer general and executable scripts, namely smart contracts, that can be employed to develop decentralized applications (DApps) in many domains beyond payment. However, the transparency of blockchain data raises concerns for many applications that require high privacy level. Therefore, many privacy enhancing technologies have been applied to DApp development, including zero knowledge proof (ZKP). This paper focuses on a particular kind of ZKP, called zero knowledge range proof (ZKRP), that has been applied in blockchain-based payments for banks. ZKRP allows a user to convince other people that a secret value actually lies within an interval without revealing any information about the secret. Here we introduce a new ZKRP which has the following remarkable features: (1) Non-interactive: No communication is required between a user and a verifier during the proof. (2) Range-flexibility: There is no limitation on the lower bound and the upper bound of the range except that they are natural numbers. (3) Efficiency: Our scheme is modified from that of Pang et al. (2010), yet achieves better security and is more efficient than their scheme. We believe our new ZKRP can be beneficial to the development of DApps and can extend the application scope to more scenarios.
引用
收藏
页码:129 / 134
页数:6
相关论文
共 23 条
[1]   Non-Interactive Zero-Knowledge Proofs for Composite Statements [J].
Agrawal, Shashank ;
Ganesh, Chaya ;
Mohassel, Payman .
ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, 2018, 10993 :643-673
[2]  
[Anonymous], 1989, Conference on the Theory and Application of Cryptology, DOI DOI 10.1007/0-387-34805-0'22
[3]  
[Anonymous], 2017, 2017 IEEE Power Energy Society Innovative Smart Grid Technologies Conference ISGT, DOI 10.1109/ISGT.2017.8086092
[4]  
[Anonymous], 2017, TECHNICAL REPORT
[5]   Zerocash: Decentralized Anonymous Payments from Bitcoin [J].
Ben-Sasson, Eli ;
Chiesa, Alessandro ;
Garmant, Christina ;
Green, Matthew ;
Miers, Ian ;
Tromer, Eran ;
Virza, Madars .
2014 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2014), 2014, :459-474
[6]  
Boudot F, 2000, LECT NOTES COMPUT SC, V1807, P431
[7]  
Bunz Benedikt., 2018, Bulletproofs: Short Proofs for Confidential Transactions and More. IEEE Security and Privacy
[8]  
Chaabouni R., 2012, LNCS, V7397, P179, DOI [10.1007/978-3-642-32946-314, DOI 10.1007/978-3-642-32946-314]
[9]  
Fujisaki E, 1997, LECT NOTES COMPUT SC, V1294, P16
[10]  
Goldreich Oded, 2010, FDN CRYPTOGRAPHY, V1