|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 量子计算复杂性理论综述显示文摘量子计算复杂性理论是量子计算机科学的基础理论之一,对量子环境下的算法设计和问题求解具有指导意义.因此,该文对量子计算复杂性理论进行了综述.首先,介绍了各种量子图灵机模型及它们之间的关系.其次,量子计算复杂性是指在量子环境下对于某个问题求解的困难程度,包含问题复杂性、算法复杂性等.于是,该文介绍了量子问题复杂性、量子线路复杂性、量子算法复杂性,并且介绍了量子基本运算和Shor算法的优化实现.第三,格被看做是一种具有周期性结构的n维点空间集合.格密码有很多优势,包括具有抗量子计算的潜力,格算法具有简单易实现、高效性、可并行性特点,格密码已经被证明在最坏条件下和平均条件下具有同等的安全性.因此该文介绍了格的困难问题,以及主要的格密码方案现状.最后,对今后值得研究的一些重要问题和量子计算环境下的密码设计与分析给出了展望. | 张焕国 毛少武 吴万青 吴朔媚 刘金会 王后珍 贾建卫 | 2016 | 计算机学报2016，39，12： | 19 |
| 2 | Survey on cyberspace security显示文摘Along with the rapid development and wide application of information technology, human society has entered the information era. In this era, people live and work in cyberspace. Cyberspace is the collection of all information systems; it is the information environment for human survival. Therefore, it is necessary to ensure the security of cyberspace. This paper gives a comprehensive introduction to research and development in this field, with a description of existing problems and some currently active research topics in the areas of cyberspace itself, cyberspace security, cryptography, network security, information system security and information content security. | ZHANG HuanGuo HAN WenBao LAI XueJia LIN DongDai MA JianFeng LI JianHua | 2015 | Science China(Information Sciences)2015，58，11： | 15 |
| 3 | Survey on Key Technology Development and Application in Trusted Computing显示文摘Trusted computing,which can effectively increase the credibility of information system,has made great achievements and is in continuous development. For country who is going to strengthen network construction like China,it is an important fundamental supporting technology worth researching. China is in the international forefront in the field of trusted computing. This paper gives comprehensive introductions to the new development and application of key technologies in trusted computing,such as various trusted platform modules(TPM、TCM、TPCM),TCG Software Stack(TSS),trusted cloud server and Trusted Execution Environment(TEE). We illustrate the progressing and application extension of these technologies and also point out some key problems worth studying in the future. | Juan Wang Yuan Shi Guojun Peng Huanguo Zhang Bo Zhao Fei Yan Fajiang Yu Liqiang Zhang | 2016 | China Communications2016，13，11： | 7 |
| 4 | HKKS密钥交换协议分析显示文摘量子计算技术的发展对基于大整数因子分解、离散对数等问题具有交换代数结构的密码体制(如RSA、ECC和EIGamal密码)构成威胁,因此研究具有非交换代数结构的密码体制是一项富有挑战性的课题.针对该课题,Kahrobaei等人于2013年将一般矩阵群环作为平台提出了HKKS密钥交换协议并且于2014年将有限域上的矩阵群作为平台介绍该HKKS密钥交换协议.该文针对基于有限域上矩阵群的HKKS密钥交换协议,提出了4种攻击方法:结构攻击、线性化方程组攻击、超定多变量方程组攻击和离散对数方法攻击,并且分别给出了对应的算法描述和有效性分析.通过分析可知:(1)结构攻击算法是确定性算法,能够在O(n2ω)计算复杂度内获得共享密钥,其中n是矩阵H的阶数,ω≈2.3755;(2)线性化方程组攻击和超定多变量方程组攻击都利用Halmiton-Caylay定理将HKKS协议中私钥矩阵对(Ha,(HM)a)和(H-a,(HM)a)进行线性表示,采用线性方程组求解和XL算法求出一个相应的等价私钥矩阵进而计算共享密钥,这两种攻击方法的计算复杂度分别是O(nω+1)和O(n2ω);(3)当矩阵H(或者是矩阵HM)的特征多项式可约时,离散对数方法利用伴侣矩阵的性质分析P-HKKS问题进而求出该协议的私钥a(或者b),分析该方法的计算复杂度是O(n4).与此同时,该文分别将结构攻击、线性化方程组攻击、超定多变量方程组攻击应用到一般矩阵群环上的HKKS协议,这3种攻击方法也分别能够在多项式计算复杂度内得到共享密钥.与ACNS 2014会议上提出的线性代数攻击方法相比,结构攻击方法是确定性算法并且线性化方程组攻击的计算复杂度最低.最后,该文在给出攻击算法的基础上对HKKS协议给出了一些修正建议. | 刘金会 张焕国 贾建卫 王后珍 毛少武 吴万青 | 2016 | 计算机学报2016，39，3： | 7 |
| 5 | A public key cryptosystem based on data complexity under quantum environment显示文摘Since the Shor algorithm showed that a quantum algorithm can efficiently calculate discrete logarithms and factorize integers, it has been used to break the RSA, EIGamal, and ECC classical public key cryptosystems. This is therefore a significant issue in the context of ensuring communication security over insecure channels. In this paper, we prove that there are no polynomial-size quantum circuits that can compute all Boolean functions(of which there are 22ncases) in the standard quantum oracle model. Based on this,we propose the notion of data complexity under a quantum environment and suggest that it can be used as a condition for post-quantum computation. It is generally believed that NP-complete problems cannot be solved in polynomial time even with quantum computers. Therefore, a public key cryptosystem and signature scheme based on the difficulty of NP-complete problems and the notion of data complexity are presented here. Finally,we analyze the security of the proposed encryption and signature schemes. | WU WanQing ZHANG HuanGuo WANG HouZhen MAO ShaoWu JIA JianWei LIU JinHui | 2015 | Science China(Information Sciences)2015，58，11： | 6 |
| 6 | 云环境下基于环签密的用户身份属性保护方案显示文摘身份属性泄漏是最严重的云计算安全威胁之一,为解决该问题,提出了一种基于环签密的身份属性保护方案。该方案以云服务的数字身份管理为研究对象,论述了去中心化的用户密钥分割管理机制,用户自主选择算子在本地生成并存储密钥,从而令注册管理者(registrar)无法获得用户完全私钥,达到消除证书管理负载的目的。另外,本方案以用户访问权限为中心设计身份属性盲环签密验证机制,令用户和CSP组成环,基于环和自身属性用户可对消息子线性盲签密以及非交互公开密文验证,用以阻止多个CSP共谋导致的身份属性泄露场景,从而保护身份属性的完整性和机密性。最后,给出密文和属性强不可伪造、盲性机制的证明结果,在DBDH困难问题假设和适应性选择密文攻击下,方案中的用户可生成3个完全私钥组件,成功阻止环成员身份伪装。为验证系统有效性,围绕身份属性保护方案的综合负载问题对盲环签密算法进行性能评估,并对比同类算法以证实系统优化结果。 | 李拴保 傅建明 张焕国 陈晶 王晶 任必军 | 2014 | 通信学报2014，35，9： | 5 |
| 7 | 多变量公钥密码扩展方案的安全性分析显示文摘扩展的多变量公钥密码方案(Extended Multivariate Public Key Cryptosystem,EMC)是Wang等人在2011年提出的一种新的增强多变量公钥加密体制安全性的方法,其核心是在加密之前先对明文变量进行一次基于杂凑函数的驯顺变换(Hash-based Tame Transformation,简称HT变换)处理.Wang等人将EMC方法和加方法相结合构造出了多变量加密方案HTTP(Hash-based tame and plus).作者声称HTTP方案可以抵挡现有的对多变量公钥密码体制的攻击.文中对EMC方案和HTTP加密方案进行了安全性分析,分析结果表明EMC方案并没有真正增强原始多变量公钥密码体制的安全性.如果存在一种攻击方法可恢复原始的多变量公钥加密体制的合法密文对应的明文,那么同样可以恢复增强后的加密方案的合法密文对应的明文.计算机实验表明,我们的攻击是有效的. | 聂旭云 徐赵虎 廖永建 钟婷 | 2013 | 计算机学报2013，36，6： | 4 |
| 8 | A Private User Data Protection Mechanism in TrustZone Architecture Based on Identity Authentication显示文摘In Trust Zone architecture, the Trusted Application(TA) in the secure world does not certify the identity of Client Applications(CA) in the normal world that request data access, which represents a user data leakage risk. This paper proposes a private user data protection mechanism in Trust Zone to avoid such risks. We add corresponding modules to both the secure world and the normal world and authenticate the identity of CA to prevent illegal access to private user data. Then we analyze the system security, and perform validity and performance tests.The results show that this method can perform effective identity recognition and control of CA to protect the security of private user data. After adding authentication modules, the data operation time of system increases by about0.16 s, an acceptable price to pay for the improved security. | Bo Zhao Yu Xiao Yuqing Huang Xiaoyu Cui | 2017 | Tsinghua Science and Technology2017，22，2： | 3 |
| 9 | Cryptanalysis of Public Key Cryptosystems Based on Non-Abelian Factorization Problems显示文摘Advances in quantum computers threaten to break public-key cryptosystems(e.g., RSA, ECC, and EIGamal), based on the hardness of factoring or taking a discrete logarithm. However, no quantum algorithms have yet been found for solving certain mathematical problems in non-commutative algebraic structures. Recently,two novel public-key encryption schemes, BKT-B cryptosystem and BKT-FO cryptosystem, based on factorization problems have been proposed at Security and Communication Networks in 2013. In this paper we show that these two schemes are vulnerable to structural attacks and linearization equations attacks, and that they only require polynomial time complexity to obtain messages from associated public keys. We conduct a detailed analysis of the two attack methods and show corresponding algorithmic descriptions and efficiency analyses. In addition, we provide some improvement suggestions for the two public-key encryption schemes. | Jinhui Liu Aiwan Fan Jianwei Jia Huanguo Zhang Houzhen Wang Shaowu Mao | 2016 | Tsinghua Science and Technology2016，21，3： | 3 |
| 10 | 基于MI和TPM混合的多变量数字签名方案显示文摘本文基于MI和TPM两类多变量公钥密码的公钥,利用'减'方法将其混合,提出了多变量数字签名方案的中心映射构造新方法,给出了基于MI和TPM混合的多变量数字签名方案,该方案能够有效抵抗高阶线性化方程攻击、秩攻击、XL&Gr bner基攻击、差分攻击等现有典型攻击,并且与Rainbow、Sflashv2等典型多变量数字签名方案相比,在签名长度、密钥存储规模等方面具有优势. | 鲁晓彬 鲍皖苏 李发达 田礼 | 2012 | 电子学报2012，40，10： | 3 |
| 11 | Dependence-Induced Risk: Security Metrics and Their Measurement Framework显示文摘Despite the tremendous effort made by industry and academia,we are still searching for metrics that can characterize Cyberspace and system security risks. In this paper,we study the class of security risks that are inherent to the dependence structure in software with vulnerabilities and exhibit a 'cascading' effect. We present a measurement framework for evaluating these metrics,and report a preliminary case study on evaluating the dependence-induced security risks in the Apache HTTP Server. The experiment results show that our framework can not only clearly analyze the root cause of the security risks but also quantitatively evaluate the attack consequence of the risks. | Liqiang Zhang Fei Yan Bo Zhao Shouhuai Xu | 2016 | China Communications2016，13，11： | 2 |
| 12 | 新扩展多变量公钥密码方案显示文摘为了有效地抵抗线性攻击和差分攻击,基于'温顺变换'思想构造了一种非线性可逆变换,将此变换与Matsumoto-Imai(MI)方案结合,提出了一种新的扩展多变量公钥密码方案。接着,在扩展方案的基础上,设计出了新的多变量公钥加密方案和签名方案。分析结果表明:该方案继承了MI方案计算高效的优点,并且能够抵抗线性攻击、差分攻击和代数攻击。 | 乔帅庭 李益发 韩文报 | 2014 | 通信学报2014，35，4： | 2 |
| 13 | Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem显示文摘Advances in quantum computation threaten to break public key cryptosystems such as RSA, ECC,and El Gamal that are based on the difficulty of factorization or taking a discrete logarithm, although up to now,no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures. Against this background, Raulynaitis et al. have proposed a novel asymmetric cipher protocol using a matrix decomposition problem. Their proposed scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we show that the asymmetric cipher of the non-commutative cryptography scheme is vulnerable to a linear algebra attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. We also propose an improvement to enhance the scheme of Raulynaitis et al. | Jinhui LIU Huanguo ZHANG Jianwei JIA Houzhen WANG Shaowu MAO Wanqing WU | 2016 | Science China(Information Sciences)2016，59，5： | 2 |
| 14 | 适于双冗余系统的信任链生成和更新算法显示文摘可信计算技术中传统的信任链构建方式只适用于单一系统,对于工业控制领域广泛采用的双冗余系统会造成信任传递的断裂,为此提出一种适于双冗余系统的信任链模型,通过双信任链设计以及IMC/IMV交互机制,实现信任链从一个计算单元到另一个计算单元的扩展。在此基础上,提出了双冗余系统信任链生成和更新算法。最后基于可信理论和实验分析,对所提出模型的有效性进行证明。 | 王雷 杨明华 刘增良 郑建群 | 2017 | 通信学报2017，38，1： | 2 |
| 15 | Logistic混沌扰动三角形密码体制显示文摘针对多变量三角形体制不能抵抗线性攻击的问题,结合多变量密码体制与混沌理论建立混沌扰动多变量三角形体制。建立Logistic混沌映射的同步系统,并将Logistic映射在有限域上离散化。通过在三角形体制中增加Logistic混沌扰动,改变多变量三角形密码体制的中心映射的结构,消除多变量三角形体制的中心映射方程组之间存在的线性关系。通过理论分析证明提出的Logistic混浊扰动三角形密码体制能抵抗线性化攻击,提高了Jonquières体制的安全性。 | 孙小雁 张焕国 张茂胜 毛少武 | 2014 | 计算机应用与软件2014，31，9： | 1 |
| 16 | Cryptanalysis of a Cryptosystem with Non- Commutative Platform Groups显示文摘A cryptosystem with non-commutative platform groups based on conjugator search problem was recently introduced at Neural Computing and Applications 2016. Its versatility was illustrated by building a public-key encryption scheme. We propose an algebraic key-recovery attack in the polynomial computational complexity. Furthermore, we peel off the encryption and decryption process and propose attack methods for solving the conjugator search problem over the given non-abelian group. Finally, we provide corresponding practical attack examples to illustrate the attack methods in our cryptanalysis, and provide some improved suggestions. | Jinhui Liu Jianwei Jia Huanguo Zhang Rongwei Yu Yong Yu Wangqing Wu | 2018 | China Communications2018，15，2： | 1 |
| 17 | 相关随机分析线性子空间的伪适应性零知识证明显示文摘非交互式零知识(non-interactive zero-knowledge,NIZK)证明是零知识证明的一种,它也是密码学协议中的一个重要工具.非交互式零知识证明系统有着很多的应用,可以将其应用在数字签名方案、公钥密码体制以及密钥分配体制等.矩阵运算具有非交换属性,基于非交换代数结构的公钥密码算法,目前还没有量子计算算法,因此,基于矩阵的零知识证明具有抗量子计算攻击的潜力.Kiltz等人在EUROCRYPT 2015上构造了一个线性空间的伪适应性非交互式零知识证明(quasi-adaptive NIZK,QANIZK),同时将该技巧推广到保持线性同态结构的签名方案.针对这类方案,本文主要介绍了一种相关随机攻击方法,分别对线性空间的具有适应性合理性的QANIZK,简单的具有适应性一次模拟合理性的QANIZK和QANIZK构造进行了相关随机分析.在对方案的相关随机分析过程中,首先给定一个合理的假设,分析方案的公私密钥对,通过求解代数方程组,获取一些等价密钥,进而伪造签名.然后,分别介绍攻击方法相关的算法描述,有效性分析和攻击成功的概率.最后说明攻击方法的合理性并提出进一步的分析研究. | 刘金会 禹勇 杨波 吴万青 | 2018 | 密码学报2018，5，2： | 1 |
| 18 | Key Exchange Protocol Based on Tensor Decomposition Problem显示文摘The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols. | MAO Shaowu ZHANG Huanguo WU Wanqing ZHANG Pei SONG Jun LIU Jinhui | 2016 | China Communications2016，13，3： | 1 |
| 19 | 多变量分支混沌签名体制显示文摘针对量子计算机对现有密码算法的威胁,结合多变量公钥体制和混沌系统,提出一种能抵抗量子算法的分支密码体制。体制的中心映射有两个分支,分支一使用传统多变量公钥密码体制,分支二使用混沌密码体制,将两分支的输出结果相加,最后通过仿射变换将中心映射进行隐藏。利用分支结构提高计算效率,利用混沌系统克服传统多变量公钥密码体制的缺点以增强安全性,适用于各类设备进行签名运算。 | 孙小雁 张茂胜 朱晓姝 李硕明 | 2013 | 计算机工程与应用2013，49，2： | 0 |
| 20 | 云环境下基于属性的用户权限管理研究显示文摘用户权限分配是云计算服务的重要难题之一,提出了一种基于属性的用户权限管理方案。该方案以云服务中的新用户密钥分配为研究对象,论述了多方协同的用户签名验证解密管理机制,数据所有者和授权者共同选择属性集,数据所有者基于属性集定义密文访问结构,从而用户只有通过授权者认证才能获得解密密钥,达到用户权限升级与降级同步管理的目的。另外,本方案以群属性集更新为中心设计CP-ABE群签名验证机制,令数据所有者、用户和授权者组成群;基于群和自身属性用户可对消息签名以及公开验证,用以保护密文数据的细粒度访问控制。最后,给出签名有效性和不可伪造的证明结果。 | 李拴保 范乃英 傅建明 祁慧敏 刘芊 | 2014 | 计算机科学2014，41，9： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员