|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Survey of information security显示文摘The 21st century is the age of information when information becomes an important strategic resource. The information obtaining, processing and security guarantee capability are playing critical roles in comprehensive national power, and information security is related to the national security and social stability. Therefore, we should take measures to ensure the information security of our country. In recent years, momentous accomplishments have been obtained with the rapid development of information security technology. There are extensive theories about information security and technology. However, due to the limitation of length, this article mainly focuses on the research and development of cryptology, trusted computing, security of network, and information hiding, etc. | SHEN ChangXiang ZHANG HuangGuo FENG DengGuo CAO ZhenFu HUANG JiWu | 2007 | Science in China(Series F)2007，50，3： | 39 |
| 2 | Differential Fault Attack on Camellia显示文摘 | ZHOU Yongbin WU Wenling XU Nannan FENG Dengguo | 2009 | Chinese Journal of Electronics2009，18，1： | 15 |
| 3 | An attack on hash function HAVAL-128显示文摘In this paper, we give a fast attack against hash function——HAVAL-128.HAVAL was presented by Y. L. Zheng et al. at Auscrypto’92. It can be processed in 3, 4 or 5 passes, and produces 128, 160, 192, or 224-bit fingerprint. We break the HAVAL with 128-bit fingerprint. The conclusion is that, given any 1024-bit message m, we just make some modifications about m, and the modified message m can collide with another message m’ only with probability 1/27, where m’ = m + △m, in which Am is a fixed difference selected in advance. In addition, two collision examples for HAVAL-128 are given in this paper. | WANG Xiaoyun FENG Dengguo YU Xiuyuan | 2005 | Science in China(Series F)2005，48，5： | 9 |
| 4 | Identity Based Threshold Proxy Signature显示文摘 | XU Jing ZHANG Zhenfeng FENG Dengguo | 2006 | Chinese Journal of Electronics2006，15，1： | 6 |
| 5 | The theory and practice in the evolution of trusted computing显示文摘Trusted computing(TC)is an emerging technology to enhance the security of various computing platforms by a dedicated secure chip(TPM/TCM),which is widely accepted by both the industrial and academic world.This paper attempts to sketch the evolution of TC from the view of our theoretical and engineering work.In theory,we focus on protocol design and security analysis.We have proposed the first ECDAA protocol scheme based on q-SDH assumption,which highlights a new way to design direct anonymous attestation scheme.In technical evolution,we discuss the key technologies of trust chain,trusted network connection and TC testing and evaluation.We break through several key technologies such as trusted boot,OS measurement and remote attestation,and implement a TC system from TPM/TCM to network.We also design and implement a testing and evaluation system of TC platform,which is the first one put into practical application in China.Finally,with the rapid development of cloud computing and mobile applications,TC is moving toward some new directions,such as the trust in cloud and mobile environments,new TPM standard,and flexible trust execution environment trust establishment method. | Dengguo Feng Yu Qin Wei Feng Jianxiong Shao | 2014 | Chinese Science Bulletin2014，59，32： | 5 |
| 6 | Formal analysis of TPM2.0 key management APIs显示文摘The trusted platform module(TPM),a system component implemented on physical resources,is designed to enable computers to achieve a higher level of security than the security level that it is possible to achieve by software alone.For this reason,the TPM provides a way to store cryptographic keys and other sensitive data in its memory,which is shielded from access by any entity other than the TPM.Users who want to use those keys and data to achieve some security goals are restricted to interact with the TPM through its APIs defined in the TPM specification.Therefore,whether the TPM can provide Protected Capabilities it claimed depends to a large extent on the security of its APIs.In this paper,we devise a formal model,which is accessible to a fully mechanized analysis,for the key management APIs in the TPM2.0 specification.We identify and formalize security properties of these APIs in our model and then successfully use the automated prover Tamarin to obtain the first mechanized analysis of them.The analysis shows that the key management subset of TPM APIs preserves the secrecy of non-duplicable keys for unbounded numbers of fresh keys and handles.The analysis also reports that the key duplication mechanism,used to duplicate a key between two hierarchies,is vulnerable to impersonation attacks,which enable an adversary to recover the duplicated key of the originating hierarchy or import his own key into the destination hierarchy.Aiming at avoiding these vulnerabilities,we proposean approach,which restricts the originating and destination TPMs to authenticate each other’s identity during duplication.Then we formally demonstrate that our approach maintains the secrecy of duplicable keys when they are duplicated. | Qianying Zhang Shijun Zhao Yu Qin Dengguo Feng | 2014 | Chinese Science Bulletin2014，59，32： | 5 |
| 7 | Modular approach to the design and analysis of password-based security protocols显示文摘In this paper, a general framework for designing and analyzing password-based security protocols is presented. First we introduce the concept of 'weak computational indistinguishability' based on current progress of password-based security protocols. Then, we focus on cryptographic foundations for password-based security protocols, i.e., the theory of 'weak pseudorandomness'. Furthermore, based on the theory of weak pseudorandomness, we present a modular approach to design and analysis of password-based security protocols. Finally, applying the modular approach, we design two kinds of password-based security protocols, i.e., password-based session key distribution (PSKD) protocol and protected password change (PPC) protocol. In addition to having forward secrecy and improved efficiency, new protocols are proved secure. | FENG DengGuo CHEN WeiDong | 2007 | Science in China(Series F)2007，50，3： | 4 |
| 8 | Security analysis of a new stream cipher显示文摘In this paper, we analyze the security of a new stream cipher-COSvd(2,128). This cipher was proposed by E. Filiol et al. at the ECRYPT SASC’2004 (The State of the Art of Stream Ciphers). It uses clock-controlled non-linear feedback registers together with an S-box controlled by a chaotic sequence and was claimed to prevent any existing at- tacks. However, our analysis shows that there are some serious security flaws in the de- sign of the S-box, resulting in heavy biased byte distribution in the keystream. In some broadcast applications, this flaw will cause a ciphertext-only attack with high success rate. Besides, there are also many security flaws in other parts of the cipher. We point out these flaws one by one and develop a divide-and-conquer attack to recover the secret keys from O(226)-byte known plaintext with success rate 93.4597% and complexity O(2113), which is much lower than 2512, the complexity of exhaustive search. | ZHANG Bin FENG Dengguo | 2006 | Science in China(Series F)2006，49，3： | 4 |
| 9 | Stream cipher designs: a review显示文摘Stream cipher is an important branch of symmetric cryptosystems, which takes obvious advantages in speed and scale of hardware implementation. It is suitable for using in the cases of massive data transfer or resource constraints, and has always been a hot and central research topic in cryptography. With the rapid development of network and communication technology, cipher algorithms play more and more crucial role in information security. Simultaneously, the application environment of cipher algorithms is increasingly complex, which challenges the existing cipher algorithms and calls for novel suitable designs. To accommodate new strict requirements and provide systematic scientific basis for future designs, this paper reviews the development history of stream ciphers, classifies and summarizes the design principles of typical stream ciphers in groups, briefly discusses the advantages and weakness of various stream ciphers in terms of security and implementation. Finally, it tries to foresee the prospective design directions of stream ciphers. | Lin JIAO Yonglin HAO Dengguo FENG | 2020 | Science China(Information Sciences)2020，63，3： | 4 |
| 10 | A new discrete Fourier transform randomness test显示文摘The randomness of random number generators(RNGs) is important for the reliability of cryptographic systems since the outputs of RNGs are usually utilized to construct cryptographic parameters.Statistical tests are employed to evaluate the randomness of the RNG outputs. The discrete Fourier transform(DFT) test is an important test item of the most popular statistical test suite NIST SP800-22. In the standard NIST DFT test and related improved studies, there exist accuracy and efficiency issues. First, the bit sequences generated by known good RNGs have a high probability to be rejected when the sequences are long or the sequence number is large, due to the deviation between the actual distribution of the test statistic values and the assumed normal distribution. Second, the long test time and high memory consumptions of the complex DFT test algorithm also affect its practicability. To solve these problems, we propose a new DFT test method for long sequences(106 or more bits). Different from the previous DFT test methods focusing on making the distribution of the test statistic values closer to the normal distribution, we reconstruct the statistic to follow the chi-square distribution. Our experiment result shows that our method has higher reliability in the two-level test, and could effectively reduce the test time and the memory consumptions.When applying our method on randomness test, the test efficiency has been increased to about 4 times for 106-bit sequences and 7 times for 107-bit sequences. In conclusion, our method has lower probability of making errors, and is more suitable for practical application scenarios. | Meihui CHEN Hua CHEN Limin FAN Shaofeng ZHU Wei XI Dengguo FENG | 2019 | Science China(Information Sciences)2019，62，3： | 3 |
| 11 | Black-box testing based on colorful taint analysis显示文摘Software vulnerability detection is one of the most important methods for guaranteeing software security.Two main classes of methods can detect vulnerabilities in binary files:white-box testing and black-box testing.The former needs to construct and solve path constraints to detect vulnerabilities.It has two main drawbacks:path exploding and complexity of constraints.The latter often aimlessly exhausts various inputs to test binary files.This paper combines both testing methods to detect vulnerabilities in binary files.By analyzing the input elements that aect check condition corresponding to a certain check point,we can generate one class of inputs that get to the check point to increase fuzzing eciency.By analyzing the relationship between guard conditions and check condition,the redundant check points are removed.Colorful taint analysis method(CTAM)is proposed to compute guard conditions,which is more ecient than traditional taint analysis method(TTAM).We implemented a prototype and made several experiments on it.The results showed that our method could increase the eciency of black-box testing. | CHEN Kai FENG DengGuo SU PuRui ZHANG YingJun | 2012 | Science China(Information Sciences)2012，55，1： | 3 |
| 12 | Security model and modular design of fair authentication key exchange protocols显示文摘It is traditionally assumed that the legal two parties in authentication key exchange (AKE) communications are both credible. However, in more and more network applications nowadays, it is often required that such protocols be run under the circumstances where ones do not trust in each other. Therefore, in this paper we propose the idea of fair authentication key exchange (FAKE), which has not only the basic properties of AKE protocols, but also some new properties: the 'session proof' embedded in the input of protocols by the customer; and if not revealed, the protocols have the deniability, otherwise the transcript of protocol is binding for the identifications. Such a method is capable of solving the contradiction between protecting privacy and the dissension on network service. Then the security model of FAKE protocols is formulated systematically and a flaw of the security model of current signature schemes proposed by Kudla is also corrected. Finally, a kind of FAKE protocol based on current signature schemes is designed and the mBJM-AK security, conditional deniability and fairness of FAKE protocols are proved in the random oracle model. | FENG DengGuo & CHEN WeiDong State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China | 2010 | Science China(Information Sciences)2010，53，2： | 2 |
| 13 | Improved multi-pass fast correlation attacks with applications显示文摘In this paper we propose two new algorithms for multi-pass fast correlation attacks on stream ciphers.The first algorithm aims at fast symbol-wise decoding in the circumstances that the noise is not very high and we have little resource for pre-computation.The second algorithm deals with the practical decoding problem in the high noise and limited keystream cases.The new algorithms are applicable to arbitrary form LFSR and compare favorably to the previously known algorithms in the scenarios under consideration.As applications,we demonstrate new key recovery attacks on one-level Bluetooth E0 and LILI-128,respectively.Given 2 37 -bit keystream and 2 28-byte memory,our attack against one-level E0 needs 2 35.1 operations.Given 2 24-bit keystream and 2 24.5 -byte memory,our attack on LILI-128 has time complexity 2 70.6 operations. | ZHANG Bin FENG DengGuo | 2011 | Science China(Information Sciences)2011，54，8： | 2 |
| 14 | An Efficient Mutual Authentication and Key Agreement Protocol Preserving User Anonymity in Mobile Networks显示文摘 | Xu Jing Zhu Wentao Feng Dengguo | 2011 | Computer Communications2011，34，3： | 1 |
| 15 | An Improved Smart Card Based Password Authentication Scheme with Provable Secu- rity显示文摘 | Xu Jing Zhu Wentao Feng Dengguo | 2009 | Computer Standards & Interfaces2009，31，4： | 1 |
| 16 | Direct anonymous attes- tation for next generation TPM 显示文摘 | Chen Xiaofeng Feng Dengguo | 2008 | Journal of Comput- ers2008，，12： | 1 |
| 17 | On constant-round zero-knowledge proofs of knowledge for NP-relations显示文摘This paper considers the existence of constant-round zero-knowledge proofs of knowledge for NP under standard assumptions. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof of knowledge system for the NP-relation under the assumption that factoring is intractable. Our construction not only shows the existence of constant-round zero-knowledge proofs of knowledge, but also gives a positive answer to the open problem of the existence of 3-round zero-knowledge proofs for NP. | LI HongDa XU HaiXia LI Bao FENG DengGuo | 2010 | Science China(Information Sciences)2010，53，4： | 1 |
| 18 | Security flaws in authentication protocols with anonymity for wireless environments显示文摘 | Xu Jing Feng Dengguo | 2009 | ETRI Journal2009，31，4： | 1 |
| 19 | Survey of information security显示文摘 | Shen ChangXiang Zhang HuangGuo Feng DengGuo | 2007 | Science in China Series: E ( Information Security)2007，37，2： | 1 |
| 20 | Generic Side-channel Distinguisher Based on Kolmogorov-Smirnov Test: Explicit Construction and Practical Evaluation显示文摘 | LIU Jiye ZHOU Yongbin YANG Shuguo FENG Dengguo | 2012 | Chinese Journal of Electronics2012，21，3： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员