|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Multiple Linear Cryptanalysis of Reduced-Round SMS4 Block Cipher显示文摘 | LIU Zhiqiang GU Dawu ZHANG Jing | 2010 | Chinese Journal of Electronics2010，19，3： | 6 |
| 2 | New algorithms for verifiable outsourcing of bilinear pairings显示文摘Dear editor,Outsourcing of computation has received widespread attention with the development of cloud computing and the proliferation of mobile devices[1].Despite the huge benefits that it provides,it also encounters some security concerns and other challenges.First,the | Yanli REN Ning DING Tianyin WANG Haining LU Dawu GU | 2016 | Science China(Information Sciences)2016，59，9： | 3 |
| 3 | Knowledge transferred adaptive filter pruning for CNN compression and acceleration显示文摘Dear editor,It is necessary to compress the convolutional neural network(CNN) for resource-constrained devices deployment, resulting in accelerated model training and inference. “Soft” filter pruning(SFP) [1] conducts dynamic pruning operations during training time, allowing updates of the pruned filters to compensate for any possible misoperation. However. | Lihua GUO Dawu CHEN Kui JIA | 2022 | Science China(Information Sciences)2022，65，12： | 2 |
| 4 | A Novel Method for Power Analysis Based on Combinational Logic in Block Cipher Circuit显示文摘In this paper, we propose a method that builds power model template according to input transitions of combinatorial logic circuit. By computing its correlation with the overall power consumption of a cryptographic circuit, we are able to recover the secret key. Several simulation-based experiments have been conducted,which verifies the feasibility of our method and shows that the combinatorial logic is also faced with the problem of information leakage in power analysis cases. Compared with DPA(Differential power analysis) and CPA(Correlation power analysis), our attack is fairly effective against the cryptographic circuits whose protection is only implemented on the register parts of the sequential circuit. In addition, a few topics for further research, as well as the advices for more precise power model and countermeasures,are presented at the end of the paper. | GUO Zheng GU Dawu YUAN Kan LIU Junrong HE Yuming | 2014 | Chinese Journal of Electronics2014，23，1： | 2 |
| 5 | Efficient Hierarchical Identity Based Signature Scheme in the Standard Model显示文摘Hierarchical identity based cryptography is a generalization of identity based encryption that mirrors an organizational hierarchy. It allows a root public key generator to distribute the workload by delegating public key generation and identity authentication to lower-level public key generators. Most hierarchical identity based signature schemes are provably secure in the random oracle model or the weak models without random oracles such as gauntlet-ID model. Currently, there is no hierarchical identity based signature scheme that is fully secure in the standard model, with short public parameters and a tight reduction. In this paper, a hierarchical identity based signature scheme based on the q-SDH problem that is fully secure in the standard model is proposed. The signature size is independent of the level of the hierarchy. Moreover, our scheme has short public parameters, high efficiency and a tight reduction. | REN Yanli GU Dawu | 2008 | Wuhan University Journal of Natural Sciences2008，13，6： | 2 |
| 6 | Fully CCA2 Secure Identity-based Broadcast Encryption without Random Oracles 显示文摘 | Ren Yanli Gu Dawu | 2009 | Information Processing Letters2009，109，11： | 1 |
| 7 | SGOR : secure and scal- able geographic opportunistic routing with received signal strength in WSNs显示文摘 | Lyu Chen Gu Dawu Zhang Xiaomei | 2015 | Computer Communications2015，59，： | 1 |
| 8 | Precise bounded-concurrent zero-knowledge proofs for NP显示文摘Precise concurrent zero-knowledge is a new notion introduced by Pandey et al.in Eurocrypt'08.This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time.Pandey et al.also constructed some precise concurrent zero-knowledge argument systems.In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP,which has the precision p(n,y) = poly(n) + O(ny).Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed.Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy.We make no setup assumption.The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers,while that of argument systems can only resist polynomial-time adversarial provers. | DING Ning GU DaWu | 2010 | Science China(Information Sciences)2010，53，9： | 1 |
| 9 | A secure control protocol for USB mass storage devices显示文摘 | Fuw Yiyang Tzung Dawu Chiu Suhui | 2010 | IEEE Transac- tions on Consumer Electronics2010，56，4： | 1 |
| 10 | Provably Secure Three-party Password- based Authenticated Key Exchange Protocol显示文摘 | Zhao Jianjie Gu Dawu | 2012 | Information Sciences2012，184，1： | 1 |
| 11 | Differential Fault Analysis on the ARIA Algorithm显示文摘 | Li Wei Gu Dawu Li Juanru | 2008 | Information Sciences2008，178，19： | 1 |
| 12 | High Strain Rate Deformation Behavior of Zirconium at Elevated Temperatures显示文摘High temperature mechanical behaviors of zirconium at high strain rate of 103 s-1 were studied by split Hopkinson pressure bar (SHPB).The influences of strain rate and temperature on the micro-structural evolution,as well as the occurrence of shear localization and subsequent fracture,were also investigated.It s found that the compressive stress-strain response depends sensitively on the applied strain rate and test temperature.Micro-structural observations revealed that the density of the twinning grains reduced as the temperature increased,and increased in response to increasing strain rate.Optical observation of the fracture surfaces showed evidence of adiabatic shear localization along the fracture planes prior to crack formation.Finally,a special form of the Zerilli-Armstrong model was used to describe the mechanical response of zirconium. | Dawu Xiao Yinglei Li Shisheng Hu Lingcang Cai | 2010 | Journal of Materials Science & Technology2010，26，10： | 1 |
| 13 | Fully CCA2 secure identity based broadcast encryption without random oracles显示文摘 | REN Yanli GU Dawu | 2009 | Information Processing Letters2009，109，11： | 1 |
| 14 | Exploiting unidi-rectional links for key establishment protocols in heterogeneoussensor networks显示文摘 | ZHANG Yuanyuan GU Dawu LI Juanru | 2008 | Computer Communications2008，31，13： | 1 |
| 15 | Improved impossible differential cryptanalysis of large-block Rijndael显示文摘Rijndael is a substitution-permutation network(SPN) block cipher for the AES development process. Its block and key sizes range from 128 to 256 bits in steps of 32 bits, which can be denoted by Rijndael-b-k, where b and k are the block and key sizes, respectively. Among them, Rijndael-128-128/192/256,that is, AES, has been studied by many researchers, and the security of other large-block versions of Rijndael has been exploited less frequently. However, more attention has been paid to large-block versions of block ciphers with the fast development of quantum computers. In this paper, we propose improved impossible differential attacks on 10-round Rijndael-256-256, 10-round Rijndael-224-256, and 9-round Rijndael-224-224 using precomputation tables, redundancies of key schedules, and multiple impossible differentials. For 10-round Rijndael-256-256, the data, time, and memory complexities of our attack were approximately 2^(244.4) chosen plaintexts, 2^(240.1) encryptions, and 2^(181.4) blocks, respectively. For 10-round Rijndael-224-256, the data, time, and memory complexities of our attack were approximately 2^(214.4) chosen plaintexts, 2^(241.3) encryptions, and 2^(183.4) blocks, respectively. For 9-round Rijndael-224-224, the data, time, and memory complexities of our attack are approximately 2^(214.4) chosen plaintexts, 2^(113.4) encryptions, and 2^(87.4) blocks,respectively, or 2^(206.6) chosen plaintexts, 2^(153.6) encryptions, and 2^(111.6) blocks, respectively. To the best of our knowledge, our results are currently the best on Rijndael-256-256 and Rijndael-224-224/256. | Ya LIU Yifan SHI Dawu GU Bo DAI Fengyu ZHAO Wei LI Zhiqiang LIU Zhiqiang ZENG | 2019 | Science China(Information Sciences)2019，62，3： | 1 |
| 16 | An Effective Differential Fault Analysis on the Serpent Cryptosystem in the Internet of Things显示文摘Due to the strong attacking ability, fast speed, simple implementation and other characteristics, differential fault analysis has become an important method to evaluate the security of cryptosystem in the Internet of Things. As one of the AES finalists, the Serpent is a 128-bit Substitution-Permutation Network(SPN) cryptosystem. It has 32 rounds with the variable key length between 0 and 256 bits, which is flexible to provide security in the Internet of Things. On the basis of the byte-oriented model and the differential analysis, we propose an effective differential fault attack on the Serpent cryptosystem. Mathematical analysis and simulating experiment show that the attack could recover its secret key by introducing 48 faulty ciphertexts. The result in this study describes that the Serpent is vulnerable to differential fault analysis in detail. It will be beneficial to the analysis of the same type of other iterated cryptosystems. | LI Wei TAO Zhi GU Dawu SUN Li QU Bo LIU Zhiqiang LIU Ya | 2014 | China Communications2014，11，6： | 1 |
| 17 | Ciphertext-only fault analysis on the Midori lightweight cryptosystem显示文摘Dear editor,The Midori lightweight cipher can be applied in the RFID tags and other low-resource devices to protect information on the Internet.This cipher was proposed by Banik et al.and presented at the ASIACRYPT conference[1].It has a Substitution Permutation Network structure with a 128-bit keysize,and two block-size variants,64 bits and 128 bits.The optimization of its design and implementation mainly consist of replacing an 8-bit S-box with two 4-bit S-boxes.In 2013,Fuhr et al.[2]proposed the ciphertext-only fault analysis(CFA)on AES.Then in 2016,Dobraunig et al.[3]validated the aforementioned CFA using a physical experiment and broke a series of nonce-based authenticated encryption schemes on AES. | Wei LI Linfeng LIAO Dawu GU Shan CAO Yixin WU Jiayao LI Zhihong ZHOU Zheng GUO Ya LIU Zhiqiang LIU | 2020 | Science China(Information Sciences)2020，63，3： | 1 |
| 18 | Fully CCA2 Secure Identity Based Broadcast Encryption Without Random Oracles显示文摘 | Ren Yanli Gu Dawu | | 0，，11： | 1 |
| 19 | Exploiting unidirectional links for key establishment protocols in heterogeneous sensor networks显示文摘 | Zhang Yuanyuan Gu Dawu Li Juanru | 2008 | Computer Communications2008，31，13： | 1 |
| 20 | Provably Secure Three-party Password-based Authenticated Key Exchange Protocol显示文摘 | Zhao Jianjie Gu Dawu | | 0，，01： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员