一种基于Paillier和FO承诺的新型区块链隐私保护方案  

A Novel Blockchain Privacy Preserving Scheme Based on Paillier and FO Commitment

作　　者：李洋[1,2] 王萌萌[1,2] 朱建明 王秀利[1,2] 王友卫 Li Yang;Wang Mengmeng;Zhu Jianming;Wang Xiuli;Wang Youwei(School of Information,Central University of Finance and Economics,Beijing 100081;Engineering Research Center of State Financial Security,Ministry of Education(Central University of Finance and Economics),Beijing 102206)

机构地区：[1]中央财经大学信息学院,北京10081 [2]国家金融安全教育部工程研究中心(中央财经大学),北京102206

出　　处：《信息安全研究》2023年第4期306-312,共7页Journal of Information Security Research

基　　金：国家自然科学基金项目(61906220);教育部人文社科项目(19YJCZH178);中央财经大学新兴交叉学科建设项目

摘　　要：区块链是一种共享数据库,具有高度去中心化和可追溯性等优良特性.然而,数据泄露仍然是区块链交易的一大难题.为了解决这个问题,提出了带变量k的Paillier同态加密(Paillier homomorphic encryption with variable k, KPH)方案,这是一种新型区块链隐私保护策略,使用RSA公钥加密算法隐藏交易信息,利用FO承诺对交易金额的合法性进行零知识证明,并通过Paillier半同态加密算法的加法同态性更新交易金额.与典型的Paillier算法不同,KPH方案的Paillier算法包含变量k,并结合函数L和中国剩余定理,将算法的时间复杂度从O(|n|^(2+e))降低到O(log n),使算法解密过程更加高效.The blockchain is a shared database with excellent characteristics such as high decentralization and traceability.However,data leakage is still a big problem for blockchain transactions.To order to solve the problem,this paper introduces Paillier homomorphic encryption with variable k(KPH),a privacy protection strategy that hides transaction information by the public key encryption algorithm RSA,performs zero-knowledge proof on the legitimacy of the transaction amount with FO commitment,and updates the transaction amount using the enhanced Paillier semi-homomorphic encryption algorithm and verifies the transaction using the FO commitment.Unlike the typical Paillier algorithm,the KPH scheme's Paillier algorithm includesthe variable k and combines the L function and the Chinese remainder theorem to reduce the time complexity from O(|n|^(2+x))to O(logn),making the algorithm decryption process more efficient.

关 键 词：Paillier同态加密 中国剩余定理 FO承诺 公钥加密算法 隐私保护 区块链 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]