检索结果-南通市图书馆

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 {2. of {2. security,Institute of Software,Chinese Academy of Science,beijing 100190,China 2.0} key {2. of {2. security,Graduate University of Chinese Academy of Sciences,beijing {12.,China 3National Engineering Research Center of {2. security,beijing 100190,China state key {2. of {2. security Institute of Software Chinese Academy of Science Beijing China state key {2. of {2. 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

Quantum threshold group signature

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2008年第10期51卷 1505-1514页

作者： YANG YuGuang1,2.3 & WEN QiaoYan4 1 College of Computer Science and Technology, beijing University of Technology, beijing 10012., China 2.{2. 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 {2. key laboratory of Networking and Switching Technology, beijing University of Posts and Tele-communications, beijing 100876, China College of Computer Science and Technology Beijing University of Technology Beijing China state key {2. of Integrated Services Network Xidian University Xi’an China state key {2. of {2. security Graduate University of Chinese Academy of Sciences Beijing China state key {2. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

关键词： threshold quantum signature trusted party quantum cryptography

Research on applying physical chaos generator to spacecraft information security

在线全文

学校读者我要写书评

暂无评论

Science China(Technological Sciences) 2009年第5期52卷 1463-1470页

作者： ZHAO HePing state key {2. of {2. security,Graduate University of Chinese Academy of Sciences,beijing 100049,China China Academy of Space Technology,beijing 100094,China state key {2. of {2. 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

Threshold quantum secret sharing between multi-party and multi-party

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2008年第9期51卷 1308-1315页

作者： YANG YuGuang1,2.3 & WEN QiaoYan4 1 College of Computer Science and Technology,beijing University of Technology,beijing 10012.,China 2.{2. 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 {2. key laboratory of Networking and Switching Technology,beijing University of Posts and Tele-communications,beijing 100876,China College of Computer Science and Technology Beijing University of Technology Beijing China state key {2. of Integrated Services Network Xidian University Xi’an China state key {2. of {2. security (Graduate University of Chinese Academy of Sciences) Beijing China state key {2. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

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 {2.. This protocol is feasible with the present-day technique.

关键词： threshold quantum secret sharing quantum cryptography single photon multi-party and multi-party

Threshold proxy quantum signature scheme with threshold shared verification

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2008年第8期51卷 1079-1088页

作者： YANG YuGuang1,3,4 & WEN QiaoYan2.1 College of Computer Science and Technology,beijing University of Technology,beijing 10012.,China 2.{2. key laboratory of Networking and Switching Technology,beijing University of Posts and Tele-communications,beijing 100876,China 3.state key laboratory of Integrated Services Network,Xidian University,Xi’an 710071,China 4 {2. key laboratory of information security(Graduate University of Chinese Academy of Sciences) ,beijing 100049,China College of Computer Science and Technology Beijing University of Technology Beijing China state key {2. of Integrated Services Network Xidian University Xi’an China state key {2. of {2. security (Graduate University of Chinese Academy of Sciences) Beijing China state key {2. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

A threshold proxy quantum signature scheme with threshold shared verification is proposed. An original signer could authorize a group as its proxy signers. Then only t or more of n persons in the proxy group can generate the proxy signature on behalf of the original signer and any t-1 or fewer ones cannot do that. When the proxy signature needs to be verified,any t or more of n persons belonging to the verification group can verify the message and any t-1 or fewer ones cannot verify the validity of the proxy signature.

关键词： quantum signature threshold proxy quantum group signature threshold shared verification

Threshold quantum secure direct communication without entanglement

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2008年第2期51卷 176-183页

作者： YANG YuGuang1,3 & WEN QiaoYan2.1 College of Computer Science and Technology, beijing University of Technology, beijing 10002., 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 College of Computer Science and Technology Beijing University of Technology Beijing China state key {2. of {2. security (Graduate School of Chinese Academy of Sciences) Beijing China School of Science Beijing University of Posts and Telecommunications Beijing China

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.

关键词： quantum secure direct communication threshold secure direct communication quantum secret sharing

Paillier's trapdoor function hides Θ(n) bits

在线全文

学校读者我要写书评

暂无评论

Science China(information Sciences) 2011年第9期54卷 1827-1836页

作者： SU Dong & Lü KeWei state key {2. of {2. security,Graduate University of Chinese Academy of Sciences,beijing 100049,China state key {2. of {2. 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

Analysis of a kind of quantum cryptographic schemes based on secret sharing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2009年第9期52卷 1313-1316页

作者： ZHANG XingLan1 & JI DongYao2.1 College of Computer Science and Technology, beijing University of Technology, beijing 10012., China 2.{2. key laboratory of information security, Graduate University of Chinese Academy of Sciences, beijing 100049, China College of Computer Science and Technology Beijing University of Technology Beijing China state key {2. of {2. security Graduate University of Chinese Academy of Sciences Beijing China

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.

关键词： quantum identity authentication quantum secure direct communication quantum signature secret sharing

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 {2. of {2. security, Graduate University of Chinese Academy of Sciences, beijing 100049, China 2.0} key {2. of {2. security, Institute of Software of Chinese Academy of Sciences, beijing 100080, China state key {2. of {2. security Graduate University of Chinese Academy of Sciences Beijing China state key {2. of {2. 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