期刊文献+

基于属性加密的区块链组织交易可控可监管隐私保护方案

Controllable and Supervised Privacy Protection Scheme for Blockchain Organization Transaction Based on Attribute Encryption
下载PDF
导出
摘要 区块链技术具有广泛的应用前景,金融行业、供应链和数字资产等领域已实现广泛部署。但在实际应用中,由于区块链数据是公开的,在某些情况下可能会泄露隐私信息,区块链中的隐私保护仍然存在一些挑战。在以组织为单位的区块链系统中,为满足组织内或组织间的合作,在隐私保护的同时需要对交易内容进行访问控制,实现可控的隐私保护。然而在保护用户隐私的同时,区块链也需要进行监管,以保护数据的合法性和安全性。为此,文章提出一种基于属性加密的区块链多组织交易可控可监管隐私保护方案。该方案不依赖特定的隐私保护方法,使用属性基加密对隐私保护陷门进行访问控制,可以作为一个独立的模块使用。该方案允许交易组织自行控制隐私保护的范围,同时监管部门可以根据不同的交易组织分配不同的监管者。实验分析表明,该方案实现了区块链中多组织交易的可控隐私保护和多监管者分级监管,同时具有较高的安全性和较好的性能。 Blockchain technology has broad application prospects,and has been widely deployed in the financial industry,supply chain,and digital assets.However,in practical applications,since the blockchain data is public,private information may be leaked in some cases,and there are still some challenges in privacy protection in the blockchain.In an organization-based blockchain system,in order to meet the cooperation within or between organizations,it is necessary to control access to transaction content while protecting privacy to achieve controllable privacy protection.While protecting user privacy,blockchain also needs to be supervised to protect the legality and security of data.Therefore,this paper proposed a controllable and supervised privacy protection scheme for blockchain multiorganization transactions based on attribute encryption.The scheme did not rely on a specific privacy protection method,and used attribute-based encryption to control access to privacy protection trapdoors,which could be used as an independent module.This scheme allowed trading organizations to control the scope of privacy protection on their own,and the supervisory department could assign different supervisors according to different trading organizations.Experimental analysis shows that the scheme realizes the controllable privacy protection and multi-regulator hierarchical supervision of multi-organization transactions in the blockchain,and has high security and high performance at the same time.
作者 李家辉 秦素娟 高飞 孙东旭 LI Jiahui;QIN Sujuan;GAO Fei;SUN Dongxu(State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China;CNPC Digital and Information Management Department,Beijing 100007,China)
出处 《信息网络安全》 CSCD 北大核心 2023年第12期103-112,共10页 Netinfo Security
基金 国家重点研发计划[2020YFB1005900]。
关键词 区块链 隐私保护 监管 属性基加密 blockchain privacy protection supervision attribute-based encryption
  • 相关文献

参考文献6

二级参考文献32

  • 1王鹏,王琳,祝跃飞.在P2P网络下Sybil攻击的研究与防范[J].微电子学与计算机,2006,23(4):162-165. 被引量:5
  • 2Oded Regev.On lattices, learning with errors, random linear codes, and cryptography[J].Journal of the ACM (JACM).2009(6)
  • 3Johannes Bl?mer,Stefanie Naewe.Sampling methods for shortest vectors, closest vectors and successive minima[J].Theoretical Computer Science.2009(18)
  • 4Phong Q. Nguyen,Thomas Vidick.Sieve algorithms for the shortest vector problem are practical[J].Journal of Mathematical Cryptology.2008(2)
  • 5Jean-Sebastien Coron,Alexander May.Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring[J].Journal of Cryptology.2007(1)
  • 6Dorit Aharonov,Oded Regev.Lattice problems in NP ∩ coNP[J].Journal of the ACM (JACM).2005(5)
  • 7Subhash Khot.Hardness of approximating the shortest vector problem in lattices[J].Journal of the ACM (JACM).2005(5)
  • 8Phong Q. Nguyen,Igor E. Shparlinski.The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces[J].Designs Codes and Cryptography.2003(2)
  • 9I. Dinur,G. Kindler,R. Raz,S. Safra.Approximating CVP to Within Almost-Polynomial Factors is NP-Hard[J].COMBINATORICA.2003(2)
  • 10Irit Dinur.Approximating SVP ∞ to within almost-polynomial factors is NP-hard[J].Theoretical Computer Science.2002(1)

共引文献395

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部