检索结果-南通市图书馆

CBCR:CBC MAC with rotating transformations

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2011年第11期54卷 2247-2255页

作者： ZHANG LiTing 1,2,WU WenLing 1,ZHANG Lei 1 & WANG Peng 21 state key laboratory of information security,Institute of Software,chinese academy of sciences,beijing 100190,china 2 graduate university of chinese academy of sciences,beijing 100049,china state key laboratory of information security Institute of Software Chinese Academy of Sciences graduate university of chinese academy of sciences

Message authentication codes (MACs) are widely used to protect data integrity and data origin authentication in *** this paper,we propose a new block-cipher-based MAC algorithm,CBCR,with provable security for arbitrary-length *** adopts rotating operations in the end of cipherblock-chaining structure,and it appends fixed-length prefixes to all messages,which implies flexible usages in *** example,these fixed-length prefixes can be filled with some security parameters,message redundancies,*** also propose CBCR0,a special case of CBCR that sets its prefix to be an all-zero *** with CMAC,a recommended standard by the US National Institute of Standards and Technology (NIST),CBCR0 enjoys all the advantages that CMAC has,but requires less memory;so,in practical applications,CBCR0 behaves as well as CMAC does,and it is even more suitable for environments with limited memory resources,*** cards.

关键词： message authentication code cipher block chaining block cipher provable security

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 100124,china 2 state 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 state 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 laboratory of Integrated Services Network Xidian University Xi’an China state key laboratory of information security (graduate university of chinese academy of sciences) Beijing China state key laboratory 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 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 College of Computer Science and Technology Beijing University of Technology Beijing China state key laboratory of information 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

维普期刊数据库

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 state key laboratory of information security Graduate University of Chinese Academy of Sciences National Engineering Research Center of information security

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

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

维普期刊数据库

Joint source channel VL coding/decoding for deep space communication networks based on a space trellis

在线全文

学校读者我要写书评

暂无评论

Science china(information sciences) 2011年第9期54卷 1883-1894页

作者： WU WeiRen 1,TU Juan 2,TU GuoFang 1,GAO ShaoShuai 1 & ZHANG Can 1,3 1 School of information Science and Engineering,graduate university of chinese academy of sciences,beijing 100049,china 2 beijing Institute of Electronic System Engineering,china Aerospace Science & Industry Corp.,beijing 100854,china 3 state key laboratory of information security,graduate university of chinese academy of Science,beijing 100049,china School of information Science and Engineering Graduate University of Chinese Academy of Sciences beijing Institute of Electronic System Engineering China Aerospace Science & Industry Corp

This paper presents joint source channel variable length (VL) coding/decoding based on a space *** constructing a joint decoding plane trellis,better decoding performance can be achieved than by using the bit-level decoding ***,the plane trellis is complicated,which results in high decoding complexity for decoding VL turbo *** solve this problem,we construct a space trellis and design a low-complexity joint decoding algorithm with a variable length symbol-a posteriori probability (VLS-APP) algorithm in resource constrained deep space communication *** results show that the proposed approach reduces the decoding complexity by 10% compared with the plane trellis,and the gain of Eb/N0 is about 0.2 dB at SER=***,it provides substantial error protection for variable-length encoded image data.

关键词： joint coding/decoding VL turbo codes space trellis VLS-APP

Round-optimal zero-knowledge proofs of knowledge for NP

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2012年第11期55卷 2473-2484页

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

It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are *** there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open *** paper focuses on the problem and gives a positive answer by presenting two constructions of constant-round(black-box) zero-knowledge proofs of knowledge for the HC(hamiltonian cycle) *** the recent result of Katz,our second construction which relies on the existence of claw-free functions has optimal round complexity(5-round) assuming the polynomial hierarchy does not collapse.

关键词： zero-knowledge proofs proofs of knowledge black-box simulation constant-round

An ID-based authenticated dynamic group key agreement with optimal round

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2012年第11期55卷 2542-2554页

作者： TENG JiKai1,2,WU ChuanKun1 & TANG ChunMing3 1state key laboratory of information security,Institute of Software of chinese academy of sciences,beijing 100090,china 2graduate university of chinese academy of sciences,beijing 100049,china 3Faculty of Mathematic and information Science,Guangzhou university,Guangzhou 510006,china state key laboratory of information security Institute of Software of Chinese Academy of Sciences Beijing China graduate university of chinese academy of sciences Beijing China Faculty of Mathematic and information Science Guangzhou University Guangzhou China

Group key agreement protocols are crucial for achieving secure group *** are designed to provide a set of users with a shared secret key to achieve cryptographic goal over a public *** group membership changes,the session key should be refreshed efficiently and *** previous group key agreement protocols need at least two rounds to establish or refresh session *** this paper,a dynamic authenticated group key agreement(DAGKA) protocol based on identity-based cryptography is *** making use of the members' values stored in previous sessions,our Join and Leave algorithms reduce the computation and communication costs of *** the proposed protocol,Setup and Join algorithms need one *** session key can be refreshed without message exchange among remaining users in Leave algorithm,which makes the protocol more *** security is proved under decisional bilinear Diffie-Hellman(DBDH) assumption in random oracle model.

关键词： identity-based cryptography dynamic group key agreement provably secure admissible pairing

Improved multi-pass fast correlation attacks with applications

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2011年第8期54卷 1635-1644页

作者： ZHANG Bin & FENG DengGuo state key laboratory of information security,Institute of Software,chinese academy of sciences,beijing 100190,china state key laboratory of information security Institute of Software Chinese Academy of Sciences

In this paper we propose two new algorithms for multi-pass fast correlation attacks on stream *** first algorithm aims at fast symbol-wise decoding in the circumstances that the noise is not very high and we have little resource for *** second algorithm deals with the practical decoding problem in the high noise and limited keystream *** new algorithms are applicable to arbitrary form LFSR and compare favorably to the previously known algorithms in the scenarios under *** applications,we demonstrate new key recovery attacks on one-level Bluetooth E0 and LILI-128,*** 2 37 -bit keystream and 2 28-byte memory,our attack against one-level E0 needs 2 35.1 *** 2 24-bit keystream and 2 24.5 -byte memory,our attack on LILI-128 has time complexity 2 70.6 operations.

关键词： stream cipher fast correlation attacks linear feedback shift register (LFSR) Bluetooth E0 LILI-128