1. 中国科学院计算技术研究所,北京 100190
2. 中国科学院大学,北京 100049
3. 内蒙古大学,内蒙古自治区 呼和浩特 010021
4. 布比(北京)网络技术有限公司,北京 100190
5. 重庆金美通信有限责任公司,重庆 400030
[ "李康(1992-),男,中国科学院计算技术研究所硕士生,主要研究方向为区块链技术。" ]
[ "孙毅(1979-),男,博士,中国科学院计算技术研究所研究员,主要研究方向为区块链、互联网服务优化。" ]
[ "张珺(1975-),女,博士,内蒙古大学副教授,主要研究方向为未来互联网、区块链技术。" ]
[ "李军(1974-),男,博士,布比(北京)网络技术有限公司首席运营官,主要研究方向为区块链技术。" ]
[ "周继华(1979-),男,博士,重庆金美通信有限责任公司副总工程师,主要研究方向为通信安全。" ]
[ "李忠诚(1962-),男,博士,中国科学院计算技术研究所研究员,主要研究方向为计算机网络。" ]
网络首发:2018-01,
纸质出版:2018-01-15
移动端阅览
李康, 孙毅, 张珺, 等. 零知识证明应用到区块链中的技术挑战[J]. 大数据, 2018,4(1):2018006.
Kang LI, Yi SUN, Jun ZHANG, et al. Technical challenges in applying zero-knowledge proof to blockchain[J]. Big Data Research, 2018, 4(1): 2018006.
李康, 孙毅, 张珺, 等. 零知识证明应用到区块链中的技术挑战[J]. 大数据, 2018,4(1):2018006. DOI: 10.11959/j.issn.2096-0271.2018006.
Kang LI, Yi SUN, Jun ZHANG, et al. Technical challenges in applying zero-knowledge proof to blockchain[J]. Big Data Research, 2018, 4(1): 2018006. DOI: 10.11959/j.issn.2096-0271.2018006.
区块链是一种以密码学算法为基础的点对点分布式账本技术,然而,公开透明的区块链账本辅以社会学挖掘、数据挖掘等统计学方法,使得用户的隐私面临重大威胁,因而隐私保护成为当前区块链技术研究的热点。总结了已有的隐私保护方案,重点聚焦于零知识证明技术,阐述并分析了零知识证明应用到区块链隐私保护方案中的技术挑战,并给出了具有指导意义的解决方案。
Blockchain is a peer-to-peer distributed ledger technology based on cryptography
However
open and transparent blockchain ledger
combined with sociological mining
data mining and other statistical methods
brings a major threat to user’s privacy.Therefore
privacy protection becomes a hot issue on the blockchain technology research.The existing privacy protection schemes were summarized
especially focusing on the zero-knowledge proof techniques.The technical challenges in applying zero-knowledge proof to blockchain privacy protection schemes were expounded and analyzed
and position solutions to these challenges were given.
MEIKLEJOHN S , POMAROLE M , JORDAN G , et al . A fistful of bitcoins:characterizing payments among men with no names [C ] // The 2013 Conference on Internet Measurement Conference,October 23-25,2013,Barcelona,Spain . New York:ACM Press , 2013 : 127 - 140 .
SASSON E B , CHIESA A , GARMAN C , et al . Zerocash:decentralized anonymous payments from Bitcoin [C ] // The 2014 IEEE Symposium on Security and Privacy,May 18-21,2014,San Jose,USA . Washington,DC:IEEE Computer Society , 2014 : 459 - 474 .
JENS G , . Short pairing-based non-interactive zero-knowledge arguments [C ] // The 16th International Conference on the Theory and Application of Cryptology and Information Security,December 5-9,2010,Singapore . Heidelberg:Springer , 2010 : 321 - 340 .
LIPMAA H , . Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments [C ] // The 9th International Conference on Theory of Cryptography,March 18-21,2012,Sicily,Italy . Heidelberg:Springer-Verlag , 2012 : 169 - 189 .
NIR B , ALESSANDRO C , YUVAL I . Succinct non-interactive arguments via linear interactive proofs [C ] // The 10th Theory of Cryptography Conference on Theory of Cryptography,March 3-6,2013,Tokyo,Japan . Heidelberg:SpringerVerlag , 2013 : 315 - 333 .
GENNARO R , GENTRY C , PARNO B , et al . Quadratic span programs and succinct NIZKs without PCPs [C ] // The 32nd Annual International Conference on the Theory & Applications of Cryptographic Techniques,May 26-30,2013,Athens,Greece.[S.l.:s.n] , 2013 : 626 - 645 .
PARNO B , HOWELL J , GENTRY C , et al . Pinocchio:nearly practical verifiable computation [C ] // The 2013 IEEE Symposium on Security & Privacy,May 19-22,2013,San Francisco,USA . Washington,DC:IEEE Computer Society , 2013 : 103 - 112 .
BEN-SASSON E , CHIESA A , GENKIN D , et al . Verifying program executions succinctly and in zero knowledge [C ] // The 33rd International Cryptology Conference(CRYPTO 2013),August 18-22,2013,Santa Barbara,USA . Heidelberg:Springer-Verlag , 2013 : 90 - 108 .
LIPMAA H , . Succinct non-interactive zero knowledge arguments from span programs and linear eror-correcting codes [C ] // The 19th International Conference on Advances in Cryptology,December 1-5,2013,Bangalore,India.New York:Springer-Verlag New York,Inc , 2013 : 41 - 60 .
BEN-SASSON E , CHIESA A , TROMER E , et al . Succinct non-interactive zero knowledge for a von neumann architecture [C ] // The 23rd USENIX Conference on Security Symposium,August 20-22,2014,San Diego,USA . Berkeley:USENIX Association , 2014 : 781 - 796 .
BEN-SASSON E , CHIESA A , GREEN M , et al . Secure sampling of public parameters for succinct zero knowledge proofs [C ] // 2015 IEEE Symposium on Security and Privacy (SP),May 18-21,2015,San Jose,USA . Piscataway:IEEE Press , 2015 : 287 - 304 .
PEREIRA G C C F , JR M A S , NAEHRIG M , et al . A family of implementationfriendly BN elliptic curves [J ] . Journal of Systems and Software , 2011 , 84 ( 8 ): 1319 - 1326 .
ARANHA D F , FUENTES-CASTAÑEDA L , KNAPP E , et al . Implementing pairings at the 192-bit security level [C ] // The 5th International Conference on PairingBased Cryptography,May 16-18,2012,Cologne,Germany . Heidelberg:SpringerVerlag , 2012 : 177 - 195 .
MENEZES A , SARKAR P , SINGH S . Challenges with assessing the impact of nfs advances on the security of pairing-based cryptography [C ] // International Conference on Cryptology,December 1-2,2016,Kuala Lumpur,Malaysia . Heidelberg:SpringerVerlag , 2016 : 83 - 108 .
0
浏览量
2126
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621