|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Extended multivariate public key cryptosystems with secure encryption function显示文摘Advances in quantum computers pose great threats on the currently used public key cryptographic algorithms such as RSA and ECC. As a promising candidate secure against attackers equipped with quantum computational power, multivariate public key cryptosystems (MPKCs) have attracted increasing attention in recently years. Unfortunately, the existing MPKCs can only be used as a multivariate signature scheme, and it remains unknown how to construct an efficient MPKC enabling secure encryption. Furthermore, some multivariate signature schemes have been shown insecure in recent years, and it is also not trivial to build MPKC which can serve as a secure signature scheme. By employing the basic MQ-trapdoors, this paper proposes a novel MPKC and shows how it can be used as a multivariate signature scheme and a multivariate encryption scheme, respectively. The goal is achieved by incorporating our new hash authentication techniques and some modification methods such as the Shamir's minus method. Thorough analysis shows that our schemes are secure and efficient. Our MPKC gives a positive response to the challenges in multivariate public key cryptography. | WANG HouZhen 1,2 , ZHANG HuanGuo 1,2 , WANG ZhangYi 1,2 & TANG Ming 1,2 1 The Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Computer, Wuhan University, Wuhan 430079, China 2 State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China | 2011 | Science China(Information Sciences)2011，54，6： | 26 |
| 2 | A new perturbation algorithm and enhancing security of SFLASH signature scheme显示文摘This paper introduces the concept of noise factor and noise operation, and constructs a noise group. We present a new perturbation algorithm for enhancing security of multivariate public key cryptosystems (MPKCs). European Consortium SFLASH which derives from Matsumoto-Imai scheme is a fast signature scheme intended for low cost smart cards. It was broken with the differential cryptanalysis by Dubois et al. in 2007. Taking Matsumoto-Imai system as an example, security analysis shows that the new algorithm can powerfully demolish its potential mathematical properties of the public key, and effectively avoid differential cryptanalysis without lowering the effciency of the original algorithm. | WANG HouZhen ZHANG HuanGuo GUAN HaiMing HAN HaiQing | 2010 | Science China(Information Sciences)2010，53，4： | 12 |
| 3 | A Resistant Quantum Key Exchange Protocol and Its Corresponding Encryption Scheme显示文摘The emergence of quantum computer will threaten the security of existing public-key cryptosystems,including the Diffie Hellman key exchange protocol,encryption scheme and etc,and it makes the study of resistant quantum cryptography very urgent.This motivate us to design a new key exchange protocol and encryption scheme in this paper.Firstly,some acknowledged mathematical problems was introduced,such as ergodic matrix problem and tensor decomposition problem,the two problems have been proved to NPC hard.From the computational complexity prospective,NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them.From the algebraic structures prospective,non-commutative cryptography has been considered to resist quantum.The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures,so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures.Secondly,a new problem was constructed based on the introduced problems in this paper,then a key exchange protocol and a public key encryption scheme were proposed based on it.Finally the security analysis,efficiency,recommended parameters,performance evaluation and etc.were also been given.The two schemes has the following characteristics,provable security,security bits can be scalable,to achieve high efficiency,quantum resistance,and etc. | MAO Shaowu ZHANG Huanguo WU Wanqing LIU Jinhui LI Shuanbao Wang Houzhen | 2014 | China Communications2014，11，9： | 11 |
| 4 | Lattice-Based Double-Authentication-Preventing Ring Signature for Security and Privacy in Vehicular Ad-Hoc Networks显示文摘Amidst the rapid development of the Internet of Things (loT), Vehicular Ad-Hoc NETwork (VANET), a typical loT application, are bringing an ever-larger number of intelligent and convenient services to the daily lives of individuals. However, there remain challenges for VANETs in preserving privacy and security. In this paper, we propose the first lattice-based Double-Authentication-Preventing Ring Signature (DAPRS) and adopt it to propose a novel privacy-preserving authentication scheme for VANETs, offering the potential for security against quantum computers. The new construction is proven secure against chosen message attacks. Our scheme is more efficient than other ring signature in terms of the time cost of the message signing phase and verification phase, and also in terms of signature length. Analyses of security and efficiency demonstrate that our proposed scheme is provably secure and efficient in the application. | Jinhui Liu Yong Yu Jianwei Jia Shijia Wang Peiru Fan Houzhen Wang Huanguo Zhang | 2019 | Tsinghua Science and Technology2019，24，5： | 10 |
| 5 | Design theory and method of multivariate hash function显示文摘This paper proposes a novel hash algorithm whose security is based on the multivariate nonlinear polynomial equations of NP-hard problem over a finite field and combines with HAIFA iterative framework. Over the current widely used hash algorithms, the new algorithm has the following advantages: its security is based on a recognized difficult mathematical problem; the hash length can be changed freely; its design can be automated such that users may construct specific hash function meeting the actual needs. Furthermore, we discuss the security, efficiency and performance of the new algorithm. Under some related difficult mathematical assumptions and theoretical analysis, the new algorithm is proven practical by the experiment results, and capable of achieving security of an ideal hash function by choosing suitable parameters. In addition, it can also be used as a pseudo-random number generator for the good randomness of its output. | WANG HouZhen ZHANG HuanGuo WU QianHong ZHANG Yu LI ChunLei ZHANG XinYu | 2010 | Science China(Information Sciences)2010，53，10： | 8 |
| 6 | 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 |
| 7 | 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 |
| 8 | Survey on Quantum Information Security显示文摘The security of classical cryptography based on computational complexity assumptions has been severely challenged with the rapid development of quantum computers and quantum algorithms. Quantum cryptography, which offers unconditional security based on some principles of quantum mechanics, has become a significant branch and hotspot in the field of modern cryptography research. In this paper, we review the research and development of several important and well-studied branches of quantum cryptography in terms of theory and experiment, including quantum key distribution, quantum secret sharing, quantum secure direct communication, quantum signature, and quantum private query. We also briefly review the research and development of some other branches which are currently in the stage of theoretical research but receive widespread concern from academia, including quantum private comparison, quantum anonymous voting, quantum secure multi-party summation, quantum sealed-bid auction, quantum public key cryptosystem, quantum key agreement, quantum dialogue, and quantum identity authentication. In addition, we discuss some open issues and future research directions for the branches referred to above. | Huanguo Zhang Zhaoxu Ji Houzhen Wang Wanqing Wu | 2019 | China Communications2019，16，10： | 2 |
| 9 | Quantum Polynomial-Time Fixed-Point Attack for RSA显示文摘Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed. | Yahui Wang Huanguo Zhang Houzhen Wang | 2018 | China Communications2018，15，2： | 2 |
| 10 | 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 |
| 11 | Multivariate Public-key Encryption Scheme based on Error CorrectingCodes显示文摘 | WANG Houzhen SHEN Changxiang XU Zhengquan | | 0，，04： | 1 |
| 12 | Cryptanalysis of a lattice based key exchange protocol显示文摘A lattice is a set of points in n-dimensional space with a periodic structure.Lattice-based cryptosystem holds a great promise for post-quantum cryptography[1],as they enjoy very strong security proofs based on the worst-case hardness,relatively efficient implementations,as well as great simplicity.The first lattice-based cryptosystem was proposed by Ajtai and Dwork[2],whose security is based on the lattice problems in the worstcase.After their seminal work,several latticebased cryptosystems have been proposed till now, | Shaowu MAO Pei ZHANG Houzhen WANG Huanguo ZHANG Wanqing WU | 2017 | Science China(Information Sciences)2017，60，2： | 0 |
| 13 | Oxygen vacancies and N-doping in organic–inorganic pre-intercalated vanadium oxide for high-performance aqueous zinc-ion batteries显示文摘Pre-intercalation of metal ions into vanadium oxide is an effective strategy for optimizing the performance of rechargeable zinc-ion battery(ZIB)cathodes.However,the battery long-lifespan achievement and high-capacity retention remain a challenge.Increasing the electronic conductivity while simultaneously prompting the cathode diffusion kinetics can improve ZIB electrochemical performance.Herein,N-doped vanadium oxide(N-(Zn,en)VO)via defect engineering is reported as cathode for aqueous ZIBs.Positron annihilation and electron paramagnetic resonance clearly indicate oxygen vacancies in the material.Density functional theory(DFT)calculations show that N-doping and oxygen vacancies concurrently increase the electronic conductivity and accelerate the diffusion kinetics of zinc ions.Moreover,the presence of oxygen vacancies substantially increases the storage sites of zinc ions.Therefore,N-(Zn,en)VO exhibits excellent electrochemical performance,including a peak capacity of 420.5 mA h g^(-1)at 0.05 A g^(-1),a high power density of more than 10000 W kg^(-1)at 65.3 Wh kg^(-1),and a long cycle life at 5 A g^(-1)(4500 cycles without capacity decay).The methodology adopted in our study can be applied to other cathodic materials to improve their performance and extend their practical applications. | Feng Zhang Min Du Zhenyu Miao Houzhen Li Wentao Dong Yuanhua Sang Hechun Jiang Wenzhi Li Hong Liu Shuhua Wang | 2022 | InfoMat2022，4，11： | 0 |
| 14 | Evaluation of the stability of shortcut nitrification-denitrification process based on online specific oxygen uptake rate monitoring显示文摘Shortcut nitrification-denitrification(SCND)is widely concerned because of its low energy consumption and high nitrogen removal efficiency.However,the current difficulty lies in the stable maintenance of SCND performance,which leads to the challenge of large-scale application of this new denitrification technology.In this study,the nitrogen removal pathway from complete nitrification-denitrification(CND)to SCND was rapidly realized under high free ammonia(FA),high pH and low dissolved oxygen(DO)conditions.The variations of specific oxygen uptake rate(SOUR)of activated sludge in both processes were investigated by an online SOUR monitoring device.Different curves of SOUR from CND to SCND process were observed,and the ammonia peak obtained based on SOUR monitoring could be used to control aeration time accurately in SCND process.Accordingly,the SOUR ratio of ammonia oxidizing bacteria(AOB)to nitrite oxidizing bacteria(NOB)(SOURAOB/SOURNOB)was increased from 1.40 to 2.93.16S rRNA Miseq high throughput sequencing revealed the dynamics of AOB and NOB,and the ratio of relative abundance(AOB/NOB)was increased from 1.03 to 3.12.Besides,SOURAOB/SOURNOB displayed significant correlations to ammonia removal rate(P<0.05),ammonia oxidation rate/nitrite oxidation rate(P<0.05),nitrite accumulation rate(P<0.05)and the relative abundance of AOB/NOB(P<0.05).Thus,a strategy for evaluation the SCND process stability based on online SOUR monitoring is proposed,which provides a theoretical basis for optimizing the SCND performance. | Zhouliang Tan Yue Guan Yajun Luo Lin Wang Houzhen Zhou Chong Yang Dan Meng Yangwu Chen | 2023 | Chinese Chemical Letters2023，34，8： | 0 |
| 15 | Cryptanalysis of an MOR cryptosystem based on a finite associative algebra显示文摘The Shor algorithm is effective for public-key cryptosystems based on an abelian group. At CRYPTO 2001, Paeng(2001) presented a MOR cryptosystem using a non-abelian group, which can be considered as a candidate scheme for post-quantum attack. This paper analyses the security of a MOR cryptosystem based on a finite associative algebra using a quantum algorithm. Specifically, let L be a finite associative algebra over a finite field F. Consider a homomorphism φ : Aut(L) → Aut(H) × Aut(I), where I is an ideal of L and H ■ L/I.We compute dim Im(φ) and dim Ker(φ), and combine them by dim Aut(L) = dim Im(φ) + dim Ker(φ). We prove that Im(φ) = Stab Comp(H,I)(μ + B^2(H, I)) and Ker(φ)■ Z^1(H, I). Thus, we can obtain dim Im(φ), since the algorithm for the stabilizer is a standard algorithm among abelian hidden subgroup algorithms. In addition,Z^1(H, I) is equivalent to the solution space of the linear equation group over the Galois fields GF(p), and it is possible to obtain dim Ker(φ) by the enumeration theorem. Furthermore, we can obtain the dimension of the automorphism group Aut(L). When the map ? ∈ Aut(L), it is possible to effectively compute the cyclic group ? and recover the private key a. Therefore, the MOR scheme is insecure when based on a finite associative algebra in quantum computation. | Wanqing WU Huanguo ZHANG Houzhen WANG Shaowu MAO Shuomei WU Haiqing HAN | 2016 | Science China(Information Sciences)2016，59，3： | 0 |
| 16 | New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem显示文摘During the last two decades, there has been intensive and fast development in Multivariate Public Key Cryptography(MPKC), which is considered to be an important candidate for post-quantum cryptography. However,it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme(especially an encryption scheme) employing the existing trapdoor construction. In this paper, we propose a new key-exchange scheme and an MPKC scheme based on the Morphism of Polynomials(MP) problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem,namely the Decisional Multivariate Diffie-Hellman(DMDH) problem derived from the MP problem. The proposed key agreement is one of several non-number-theory-based protocols, and is a candidate for use in the post-quantum era. More importantly, by slightly modifying the protocol, we offer an original approach to designing a secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency,and seems competitive with traditional MPKC schemes. | Houzhen Wang Huanguo Zhang Shaowu Mao Wanqing Wu Liqiang Zhang | 2016 | Tsinghua Science and Technology2016，21，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员