|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 2005年全国治超工作要点显示文摘 | Issued by Ministry of Communications of the People′s Republic of China,T he Ministry of Public Security of the People′s Republic of China,National Development and Reform Comm ission,the Ministry of Propaganda of the CPC Central Committee,General Administration of Qu ality Supervision Inspection and Quarantine of the PRC,State Administration of Work Safety,State Administration for Industry & Commerce,China Legislative | 2005 | 交通标准化2005，，5： | 34 |
| 2 | Efficient signcryption between TPKC and IDPKC and its multi-receiver construction显示文摘The primitive signcryption provides authenticity and privacy simultaneously. In this paper, we present efficient signcryption schemes between the traditional public key cryptosystem (TPKC) and the identity based cryptosystem (IDPKC). In contrast, all the existing signcryption schemes available in the literature, to our knowledge, are limited to within one type of cryptosystem. We also discuss them in the multi-receiver setting. Formal security proofs are provided to guarantee the security for our schemes, in the random oracle model, under the hardness of the bilinear Diffie-Hellman problem. | SUN YinXia & LI Hui Key Laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi’an 710071, China | 2010 | Science China(Information Sciences)2010，53，3： | 29 |
| 3 | 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 |
| 4 | Quantum secure direct communication with cluster states显示文摘A quantum secure direct communication protocol with cluster states is proposed.Compared with the deterministic secure quantum communication protocol with the cluster state proposed by Yuan and Song(Int.J.Quant.Inform.,2009,7:689),this protocol can achieve higher intrinsic efficiency by using two-step transmission.The implementation of this protocol is also discussed. | CAO WeiFeng 1,YANG YuGuang 3,4,5* & WEN QiaoYan 2 1 College of Electric and Information Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,China 2 State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China 3 College of Computer Science and Technology,Beijing University of Technology,Beijing 100124,China 4 State Key Laboratory of Integrated Services Network,Xidian University,Xi’an 710071,China 5 State key Laboratory of Information Security Gradute University of Chinese Academy of Sciences,Beijing 100049,China | 2010 | Science China(Physics,Mechanics & Astronomy)2010，53，7： | 20 |
| 5 | Quasi-secure quantum dialogue using single photons显示文摘A quasi-secure quantum dialogue protocol using single photons was proposed. Different from the previous entanglement-based protocols, the present protocol uses batches of single photons which run back and forth between the two parties. A round run for each photon makes the two parties each obtain a classical bit of information. So the efficiency of information transmission can be increased. The present scheme is practical and well within the present-day technology. | YANG YuGuang1,2 & WEN QiaoYan31 College of Computer Science and Technology, Beijing University of Technology, Beijing 100022, China 2 State Key Laboratory of Information Security, Graduate University of the Chinese Academy of Sciences, Beijing 100049, China 3 School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China | 2007 | Science China(Physics,Mechanics & Astronomy)2007，50，5： | 18 |
| 6 | 中国社会保险制度研究显示文摘本文认为,目前中国社会保险制度改革在养老、医疗、失业等方面已取得突破性进展,社会保险制度创新进入一个重要阶段;与此同时,许多重要问题亟待解决。文章指出,要完善现行社会保险制度,就要改造现行社会保险管理体制、逐步放松对社会保险基金特别是养老金基金投资营运的政府管制、为企业补充养老保险的实施确立起恰当的政策框架、通过多种方式偿还中央政府的隐性年金债务。 | The Project Group of the Social Security System in China, CASS | 1999 | 中国社会科学1999，，4： | 15 |
| 7 | Symmetric-key cryptosystem with DNA technology显示文摘DNA cryptography is a new field which has emerged with progress in the research of DNA computing. In our study, a symmetric-key cryptosystem was designed by applying a modern DNA biotechnology, microarray, into cryptographic technologies. This is referred to as DNA symmetric-key cryptosystem (DNASC). In DNASC, both encryption and decryption keys are formed by DNA probes, while its ciphertext is embedded in a specially designed DNA chip (microarray). The security of this system is mainly rooted in difficult biology processes and problems, rather than conventional computing technology, thus it is unaffected by changes from the attack of the coming quantum computer. The encryption process is a fabrication of a specially designed DNA chip and the decryption process is the DNA hybridization. In DNASC, billions of DNA probes are hybridized and identified at the same time, thus the decryption process is conducted in a massive, parallel way. The great potential in vast parallelism computation and the extraordinary information density of DNA are displayed in DNASC to some degree. | LU MingXin1,2*, LAI XueJia3*, XIAO GuoZhen4,2 & QIN Lei5 1 Department of Information Management, Nanjing University, Nanjing 210093, China 2 State Key Lab of Information Security, Institute of Software of Chinese Academy of Science, Beijing 100049, China 3 Department of Computer Science & Engineer, Shanghai Jiao Tong University, Shanghai 200030, China 4 State Key Lab of ISN, Xidian University, Xi’an 710071, China 5 Cancer Research Institute, Queen’s University, Kingston, Ontario, K7L3N6, Canada | 2007 | Science in China(Series F)2007，50，3： | 14 |
| 8 | An efficient ranging method based on Chinese remainder theorem for RIPS measurement显示文摘The radio interferometric positioning system(RIPS) measures the phase difference of the interference signal to provide high accuracy and at the same time maintain simple hardware configuration for wireless sensor networks.However, it suffers from phase ambiguity problem because of the periodicity of phase, which makes it hard to determine the actual distance difference only from a single phase measurement.To solve the problem, RIPS makes multiple measurements at different frequencies so as to determine the distance difference from multiple phases.However, this is a computationally intensive searching process and not suitable for energyconstrained wireless sensor nodes.In this paper, we introduce the Chinese remainder theorem(CRT) to RIPS to solve the phase ambiguity problem.Meanwhile, we utilize some properties of the coefficients in the CRT algorithm to avoid the over-sensitivity of the traditional CRT, which increases the robustness of the algorithm.We apply this robust CRT algorithm to the ranging process which calculates the distance difference directly from a closed-form equation and therefore reduces the response time and the energy consumption of the ranging procedure. | WANG Chen , YIN QinYe & WANG WenJie Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi’an Jiaotong University, Xi’an 710049, China | 2010 | Science China(Information Sciences)2010，53，6： | 13 |
| 9 | Multiparty simultaneous quantum identity authentication with secret sharing显示文摘Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented. All the users can be authenticated by a trusted third party (TTP) simultaneously. In the first protocol,the TTP shares a random key K with all the users using quantum secret sharing. The ith share acts as the authentication key of the ith user. When it is necessary to perform MSQIA,the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users. According to his share,each user performs the corresponding unitary operations on the single photon sequence sequentially. At last,the TTP can judge whether the impersonator exists. The sec-ond protocol is a modified version with a circular structure. The two protocols can be efficiently used for MSQIA in a network. They are feasible with current technol-ogy. | YANG YuGuang1,2,WEN QiaoYan3 & ZHANG Xing4,5 1 College of Computer Science and Technology,Beijing University of Technology,Beijing 100022,China 2 State Key Laboratory of Information Security (Graduate University of the Chinese Academy of Sciences),Beijing 100049,China 3 School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China 4 Institute of Electronic Technology,Information Engineering University,Zhengzhou 450004,China 5 Trusted Computing Laboratory,Beijing University of Technology,Beijing 100022,China | 2008 | Science China(Physics,Mechanics & Astronomy)2008，51，3： | 12 |
| 10 | Capability of evolutionary cryptosystems against differential cryptanalysis显示文摘The evolutionary cryptosystem is a new cryptosystem.This paper studies its security level resisting against differential cryptanalysis.It is shown that the evolutionary cryptosystem possesses higher resistance than its initial fixed cryptosystem against differential cryptanalysis.On the basis of the relationship among the data complexity,the bit advantage and the success rate of differential cryptanalysis,it is proven that more data is needed for attacking the evolutionary cryptosystem when the bit advantage and success rate are identical.Moreover,it is shown that the time complexity for attacking the evolutionary cryptosystem is higher than that of differential attacking its initial fixed cryptosystem with the same amount of plaintext-ciphertext pairs.The research indicates that the evolutionary cryptosystem is more robust than its initial fixed cryptosystem against differential cryptanalysis. | ZHANG HuanGuo 1,2 ,LI ChunLei 1,2 & TANG Ming 1,2 1 School of Computer,Wuhan University,Wuhan 430072,China 2 Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education,Wuhan University,Wuhan 430072,China | 2011 | Science China(Information Sciences)2011，54，10： | 11 |
| 11 | Research on theory and key technology of trusted computing platform security testing and evaluation显示文摘Trusted computing has become a new trend in the area of international information security, and the products of trusted computing platform begin to be used in application. Users will not use the products of information security, unless it goes through the testing and evaluation. Here we concentrate on the testing and evaluation problem of trusted computing platform, begin with constructing proper formalization model of trusted computing platform for testing, and establish a mathematical chain of trust model based on SPA. Moreover, we give a verification method of composite characteristics and find the potential factors threatening the trusted system in the process of remote attestation through analysis. For trusted software stack, we study the problem of automatic generation of test case and propose an improved method of generating the random test case, to raise the quality of test case. Finally, we give a prototype system of trusted computing platform and the actual test data related. The result demonstrates that there exist some flaws in the architecture of the present TCG computing platform. At the same time, some flaws are found in the products of existing trusted computing platform, thus a basis is laid for the improvement and development of trusted platform technology and its products. | ZHANG HuanGuo1,2, YAN Fei1,2, FU JianMing1,2, XU MingDi1,2, YANG Yang1,2, HE Fan1,2 & ZHAN Jing1,2 1School of Computer, Wuhan University, Wuhan 430072, China 2Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, Wuhan 430072, China | 2010 | Science China(Information Sciences)2010，53，3： | 11 |
| 12 | Threshold quantum secure direct communication without entanglement显示文摘For the first time, a threshold quantum secure direct communication (TQSDC) scheme is presented. Similar to the classical Shamir's secret sharing scheme, the sender makes n shares, S1, …, Sn of secret key K and each receiver keeps a share secretly. If the sender wants to send a secret message M to the receivers, he en-codes the information of K and M on a single photon sequence and sends it to one of the receivers. According to the secret shares, the t receivers sequentially per-form the corresponding unitary operations on the single photon sequence and ob-tain the secret message M. The shared shares may be reusable if it can be judged that there is no eavesdropper in line. We discuss that our protocol is feasible with current technology. | YANG YuGuang1,3 & WEN QiaoYan2 1 College of Computer Science and Technology, Beijing University of Technology, Beijing 100022, China 2 School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China 3 State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences), Beijing 100049, China | 2008 | Science China(Physics,Mechanics & Astronomy)2008，51，2： | 11 |
| 13 | DC ice-melting model for wet-growth icing conductor and its experimental investigation显示文摘Icicles are often formed under the downside surface of conductor in the wet growth icing of overhead power line. When the ice deposit around overhead power line is molten by Joule heat produced by current, the pattern of heat transfer of ice deposit with icicles is dissimilar to that without icicle, so the ice-melting model for the columnar icing conductor cannot be applied to icicle-shaped icing conductor. According to the heat-transfer characteristic of the icicle-shaped icing conductor, this paper puts forward a DC ice-melting model for the icicle-shaped icing conductor. Because this full model includes three-dimensional heat-transfer and interface movement, which cannot be solved in closed form, a finite element scheme in space-domain and a finite difference scheme in time-domain are employed to discretize the governing equations. Firstly the whole ice-melting process on the icicle-shaped icing conductor is simulated by this model. Then the simulated results are validated by ice-melting experiments in the artificial chamber. The study from the model and the experiments shows that the size and length of icicle as well as the space between the adjacent icicles are factors to affect ice-melting. With the shorter icicle space, the bigger icicle size and the longer icicle-length, the surface of ice layer is enlarged and then more heat is taken away by the convection and radiation, so the ice melting time will get longer. | FAN SongHai1,2, JIANG XingLiang1, SHU LiChun1, SUN CaiXin1 & WANG DaXing1,2 1 State Key Laboratory of Power Transmission Equipment & System Security and New Technology, Chongqing University, Chongqing 400044, China 2 Sichuan Electric Power Test and Research Institute, Chengdu 610072, China | 2010 | Science China(Technological Sciences)2010，53，12： | 9 |
| 14 | A formal model of fair exchange protocols显示文摘Based on the study of existing fair exchange protocols, this paper sets up an accurate formal model by stepwise refinement. In the process of refinement an unreliable channel is employed to simulate an attack behavior. The model provides a novel formal definition of exchanged items, and presents the formal goals for fairness, accountability, etc., reflecting the inherent requirements for fair exchange protocols across-the-board. In order to check, prove, and design fair exchange protocols effectively and efficiently, the model puts forward a novel property of abuse-freeness which applies to all fair exchange protocols, gives a formal definition for trust strand of the third party, and presents general criteria of designing a secure and effective fair exchange protocol. Taking a typical fair exchange protocol as an example, this paper presents the analysis steps of fair exchange protocols appealing to our model. An unknown attack is uncovered. The analysis reveals the process of a complete attack, discovering deeper reasons for causing an attack. Finally, we modify the flawed protocol and the revised protocol ensures the desirable properties. | QING Sihan1,2,3 & LI Gaicheng1,2,3 1. Engineering Research Center for Information Security Technology, Institute of Software, Chinese Aca- demy of Sciences, Beijing 100080, China 2. Beijing Zhongke Ansheng Corporation of Information Technology, Beijing 100080, China 3. Graduate School of the Chinese Academy of Sciences, Beijing 100039, China | 2005 | Science in China(Series F)2005，48，4： | 9 |
| 15 | Secure network coding in the presence of eavesdroppers显示文摘Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity. | LUO MingXing1,2,3, YANG YiXian1,2,3, WANG LiCheng1,2,3 & NIU XinXin1,2,3 1Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China 2Key Laboratory of Network and Information Attack and Defence Technology of MOE, Beijing University of Posts and Telecommunications, Beijing 100876, China 3National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China | 2010 | Science China(Information Sciences)2010，53，3： | 8 |
| 16 | Threshold quantum secret sharing between multi-party and multi-party显示文摘A threshold quantum secret sharing (TQSS) scheme between multi-party and multi-party was proposed using a sequence of single photons,which is useful and efficient when the parties of communication are not all present. We described the process of this TQSS scheme and discussed its security. It was shown that entan-glement is not necessary for quantum secret sharing. Moreover,the theoretic effi-ciency was improved to approach 100% as almost all the instances can be used for generating the private key,and each photon can carry one bit of information. This protocol is feasible with the present-day technique. | YANG YuGuang1,2,3 & WEN QiaoYan4 1 College of Computer Science and Technology,Beijing University of Technology,Beijing 100124,China 2 State Key Laboratory of Integrated Services Network,Xidian University,Xi’an 710071,China 3 State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences),Beijing 100049,China 4 State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Tele-communications,Beijing 100876,China | 2008 | Science China(Physics,Mechanics & Astronomy)2008，51，9： | 8 |
| 17 | Calibration based universal JPEG steganalysis显示文摘For steganalysis of JPEG images,features derived in the embedding domain appear to achieve a prefer-able performance. However,with the existing JPEG steganography,the minor changes due to the hid-den secret data are not easy to be explored directly from the quantized block DCT (BDCT) coefficients in that the energy of the carrier image is much larger than that of the hidden signal. In this paper,we present an improved calibration-based universal JPEG steganalysis,where the microscopic and macro-scopic calibrations are combined to calibrate the local and global distribution of the quantized BDCT coefficients of the test image. All features in our method are generated from the difference signal be-tween the quantized BDCT coefficients of the test image and its corresponding microscopic calibrated image,or calculated as the difference between the signal extracted from test image and its correspond-ing macroscopic calibrated image. The extracted features will be more effective for our classification. Moreover,through using the Markov empirical transition matrices,both magnitude and sign dependen-cies along row scanning and column scanning patterns existed in intra-block and inter-block quantized BDCT coefficients are employed in our method. Experimental results demonstrate that our proposed scheme outperforms the best effective JPEG steganalyzers having been presented. | HUANG FangJun1,2 & HUANG JiWu1,2 1 School of Information Science and Technology,Sun Yat-Sen University,Guangzhou 510275,China 2 Guangdong Key Lab. of Information Security Technology,Sun Yat-Sen University,Guangzhou 510275,China | 2009 | Science in China(Series F)2009，52，2： | 8 |
| 18 | Analysis of a kind of quantum cryptographic schemes based on secret sharing显示文摘Recently, Yang et al. proposed a kind of quantum cryptographic schemes based on secret sharing. The main idea is drawn from the case, where any n participants who share a secret K can co-operate as K does. This process can be applied to encryption, authentication, signature and so on. Unfortunately, since there is no identity authentication of the share's holder, these schemes inherit the limitation of secret sharing in practice. If some participants do not follow the protocol, the protocol would be a failure at last. Moreover, these schemes encounter another serious attack. Any two participants can co-operate to defeat the schemes by sending different shares to the parties unknown to the distributor of the secret K, such that these parties can execute the protocol as well. The attack proves that it is not enough for quantum cryptographic schemes that only the secret key is secure. | ZHANG XingLan1 & JI DongYao2 1 College of Computer Science and Technology, Beijing University of Technology, Beijing 100124, China 2 State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China | 2009 | Science China(Physics,Mechanics & Astronomy)2009，52，9： | 8 |
| 19 | Hamiltonian realization of power system dynamic models and its applications显示文摘Power system is a typical energy system. Because Hamiltonian approaches are closely related to the energy of the physical system, they have been widely re-searched in recent years. The realization of the Hamiltonian structure of the nonlinear dynamic system is the basis for the application of the Hamiltonian methods. However, there have been no systematically investigations on the Ham-iltonian realization for different power system dynamic models so far. This paper researches the Hamiltonian realization in power systems dynamics. Starting from the widely used power system dynamic models, the paper reveals the intrinsic Hamiltonian structure of the nonlinear power system dynamics and also proposes approaches to formulate the power system Hamiltonian structure. Furthermore, this paper shows the application of the Hamiltonian structure of the power system dynamics to design non-smooth controller considering the nonlinear ceiling effects from the real physical limits. The general procedure to design controllers via the Hamiltonian structure is also summarized in the paper. The controller design based on the Hamiltonian structure is a completely nonlinear method and there is no lin-earization during the controller design process. Thus, the nonlinear characteristics of the dynamic system are completely kept and fully utilized. | MA Jin1 & MEI ShengWei2 1 Key Laboratory of Power System Protection and Dynamic Security Monitoring and Control of Ministry of Education, North China Electric Power University, Beijing 102206, China 2 Electrical Engineering Department, Tsinghua University, Beijing 100084, China | 2008 | Science China(Technological Sciences)2008，51，6： | 8 |
| 20 | Research on Relationships Between Built Environment and Criminal Behavior in Parking Areas: A Case Study on Pudong New Area, Shanghai | MAO Yuanyuan, PhD Candidate, School of Architecture & Urban Planning, Tongji University, Shanghai, P. R. China. DAI Shenzhi, Professor, School of Architecture & Urban Planning, Tongji University, Shanghai, P. R. China. DENG Tian, China Overseas Property Group Co., Ltd (Eastern China), Shanghai, P. R. China. XU Bin, Off icer, Shanghai Municipal Public Security Bureau Pudong Branch, Shanghai, P. R. China. ZHU Wei, PhD, Eindhoven University of Technology, Eindhoven, the Netherlands. DONG Hengping, Postgraduate student, School of Architecture & Urban Planning, Tongji University, Shanghai, P. R. China. | 2009 | China City Planning Review2009，18，2： | 7 |
您所在的机构暂未开通此部分的功能，请联系管理员