检索结果-南通市图书馆

On constant-round zero-knowledge proofs of knowledge for NP-relations

在线全文

学校读者我要写书评

暂无评论

Science china(information sciences) 2010年第4期53卷 788-799页

作者： LI HongDa1*, XU HaiXia1, LI Bao1 & FENG DengGuo2 1state key laboratory of information security, graduate university of chinese academy of sciences, beijing 100049, china 2state key laboratory of information security, Institute of Software of chinese academy of sciences, beijing 100080, china state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing China state key laboratory of information security Institute of Software of Chinese Academy of Sciences Beijing China

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.

关键词： zero-knowledge proof proof of knowledge constant-round NP-relation

Quasi-secure quantum dialogue using single photons

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2007年第5期50卷 558-562页

作者： 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 College of Computer Science and Technology Beijing University of Technology Beijing China state key laboratory of information security Graduate University of the Chinese Academy of Sciences Beijing China School of Science Beijing University of Posts and Telecommunications Beijing China

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.

关键词： quantum dialogue, single photon, quantum secure direct communication

Black-box testing based on colorful taint analysis

在线全文

学校读者我要写书评

暂无评论

Science china(information sciences) 2012年第1期55卷 171-183页

作者： CHEN Kai1,2,3,FENG DengGuo1,SU PuRui1&ZHANG YingJun1,2,3 1state key laboratory of information security,Institute of Software,chinese academy of Science,beijing 100190,china 2state key laboratory of information security,graduate university of chinese academy of sciences,beijing 100049,china 3National Engineering Research Center of information security,beijing 100190,china state key laboratory of information security Institute of Software Chinese Academy of Science Beijing China state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing China National Engineering Research Center of information security Beijing China

Software vulnerability detection is one of the most important methods for guaranteeing software *** main classes of methods can detect vulnerabilities in binary files:white-box testing and black-box *** former needs to construct and solve path constraints to detect *** has two main drawbacks:path exploding and complexity of *** latter often aimlessly exhausts various inputs to test binary *** paper combines both testing methods to detect vulnerabilities in binary *** 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 *** analyzing the relationship between guard conditions and check condition,the redundant check points are *** 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 *** results showed that our method could increase the eciency of black-box testing.

关键词： software testing vulnerability detection dynamic testing black-box testing colorful taint analysis

Multiparty simultaneous quantum identity authentication with secret sharing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第3期51卷 321-327页

作者： 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 College of Computer Science and Technology Beijing University of Technology Beijing China state key laboratory of information security (graduate university of the chinese academy of sciences) Beijing China School of Science Beijing University of Posts and Telecommunications Beijing China Institute of Electronic Technology Information Engineering University Zhengzhou China Trusted Computing laboratory Beijing University of Technology Beijing China

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.

关键词： quantum identity authentication secret sharing quantum cryptography

SQUARE attack on block ciphers with low algebraic degree

在线全文

学校读者我要写书评

暂无评论

Science china(information sciences) 2010年第10期53卷 1988-1995页

作者： SUN Bing 1 , LI RuiLin 1 , QU LongJiang 1,3 & LI Chao 1,2,3 1 Science College of National university of Defense Technology, Changsha 410073, china 2 state key laboratory of information security, graduate university of chinese academy of sciences, beijing 100049, china 3 National Mobile Communications Research laboratory, Southeast university, Nanjing 210096, china Science College of National university of Defense Technology Changsha China National Mobile Communications Research laboratory Southeast University Nanjing China state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing China

By using an algebraic method, the mathematical foundation of SQUARE attack is studied in this paper. We point out that a SQUARE distinguisher exists if and only if the degree of the polynomial function between n-bit input which is active and n-bit output which is balanced is 2 n-2. And the algebraic method can also be used to determine the property of a balanced set after passed through a nonlinear S-box, by which in some cases we can find a SQUARE distinguisher with more rounds. The validity of SQUARE attack and the influence of the choice of S-box are also studied. If the round function of a Feistel cipher has a low algebraic degree, a SQUARE attack cannot recover the right keys in some special cases. However, SQUARE attack on SPN ciphers always holds. The relations among SQUARE attack and some other cryptanalytic method are studied, showing that if a cipher is breakable by SQUARE attack, then it is also breakable by the interpolation attack.

关键词： SQUARE attack interpolation attack integral attack block cipher

Studies and advances on joint source-channel encoding/decoding techniques in flow media communications

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2010年第1期53卷 1-17页

作者： TU GuoFang1, LIU JianJun1, ZHANG Can1,2, GAO ShaoShuai3 & LI ShiDong4 1School of information Science and Engineering, graduate university of chinese academy of sciences, beijing 100049, china 2state key laboratory of information security, graduate university of chinese academy of sciences, beijing 100049, china 3National Institute of Standards and Technology, Gaithersburg, MD 20899, USA, 4Department of Mathematics, San Francisco state university, San Francisco, CA 94132, USA School of information Science and Engineering Graduate University of Chinese Academy of Sciences Beijing China state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing China National Institute of Standards and Technology Gaithersburg USA Department of Mathematics San Francisco State University San Francisco USA

Joint source-channel coding/decoding (JSCC/JSCD) techniques in flow media communications have become a state-of-the-art and one of the challenging research subjects in the spatial communication area. They have great application prospective and deep impact in various manned space flights, satellite missions, mobile radio communications and deep-space explorations. In the last few years, there have been influential achievements in JSCC/JSCD studies. This paper aims at an introduction to the basic principles of joint source-channel optimal design. A general summarization and classification for various existing JSCC/JSCD methods is addressed. Also presented is a JSCD scheme based on variable-length coding, capable of providing reliable resolutions for flow media data transmission in spatial communications.

关键词： joint source-channel coding/decoding rate allocation variable-length coding/decoding iterative decoding

Research on applying physical chaos generator to spacecraft information security

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Technological sciences) 2009年第5期52卷 1463-1470页

作者： ZHAO HePing state key laboratory of information security,graduate university of chinese academy of sciences,beijing 100049,china china academy of Space Technology,beijing 100094,china state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing China china academy of Space Technology Beijing China

The effectiveness of a short-length message extension method based on physical chaos generator was analyzed and the entropy of the extended message was calculated in this *** analysis demon-strated that with the mentioned method the entropy of short-length messages,which are repeatedly used in spacecraft data systems,is obviously increased,and the security of transmission is enhanced as *** paper also presented an improvement of the protocol for secret key agreement presented by *** and *** of depending on characteristics of communication channel,this method takes advantage of the random data produced by physical chaos generator to preset the initial parameters of the procedure on both sides of communication,so that the procedure and quantity of cipher key can be precisely *** method can be used to cipher key management of se-cure communication between long life-span spacecraft and ground system.

关键词： physical chaos generator spacecraft information security message extension cipher key management

A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2006年第9期16卷 998-1001页

作者： HU Lei and SUN Nigang (state key laboratory of information security, graduate School of chinese academy of sciences, beijing 100049, china) state key laboratory of information security Graduate School of Chinese Academy of Sciences Beijing 100049 China

Using a polynomial expression of the highest coordinate map, we deduce an exact formula on the linear complexity of the highest coordinate sequence derived from a maximal periodic sequence over an arbitrary Galois ring of characteristic p2 , where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4.

关键词： Galois ring highest coordinate sequence linear complexity.

Paillier's trapdoor function hides Θ(n) bits

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2011年第9期54卷 1827-1836页

作者： SU Dong & Lü KeWei state key laboratory of information security,graduate university of chinese academy of sciences,beijing 100049,china state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing China

In this paper,we re-examine the bit security of Paillier’s trapdoor *** show that given a random w=gcyN mod N2 ∈ZN2* the most significant bit of its class c is a hard-core predicate,under a standard assumption that is computing composite residuosity class is *** the simultaneous security,we prove that n number of the class c’s bits are simultaneously hard-core under the standard assumption,where n is the length of c.

关键词： Paillier’s trapdoor function hard-core predicate hard-core function simultaneous security most significant bit