检索结果-南通市图书馆

A two-round honest-verifier zero-knowledge protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information sciences) 2010年第5期53卷 954-963页

作者： LIU HanWu 1,2.& LIN DongDai 1 1 The State key {2. of Information security, Institute of Software, {3. academy of sciences, beijing 100190, China 2.graduate university of the {3. academy of sciences, beijing 100049, China The State key {2. of Information {3. Institute of Software Chinese Academy of Sciences graduate university of the {2. {3. of sciences

Since the concept of zero-knowledge protocols was introduced, it has attracted a lot of attention and in turn showed significant effect on the development of cryptography, complexity theory and other areas. The round complexity of a zero-knowledge protocol is a very important efficiency consideration, and it is required to be as small as possible. Generally, it is desirable to have zero-knowledge protocols with constant numbers of rounds. Goldreich and Oren proved that only languages in BPP have one-round and two-round zero-knowledge protocols. Moreover, they also showed that only languages in BPP have one-round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself, and has many other uses. Thus, the problem as to whether there exist two-round honest-verifier zero-knowledge protocols becomes an important open problem. In this paper, we introduce a new simulation technique and present a two-round honest-verifier zero-knowledge protocol for any language in N P under a standard complexity assumption based on this technique.

关键词： proof system argument system zero-knowledge witness indistinguishability black-box one-way permutation commitment scheme zap

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 Information {3.,{3.,beijing 100049,China China academy of Space Technology,beijing 100094,China State key {2. of Information {3. Graduate University of Chinese Academy of Sciences China academy of Space Technology

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

Dynamic tree-based authenticated group key exchange protocol

在线全文

学校读者我要写书评

暂无评论

Science China(Information sciences) 2010年第8期53卷 1591-1602页

作者： LI Hui 1,2., WU ChuanKun 1 & TENG JiKai 1,2.1 State {3. {2. of Information security, Institute of Software, {3. academy of sciences, beijing 100190, China 2.graduate university of chinese academy of sciences, beijing 100049, China State key {2. of Information {3. Institute of Software Chinese Academy of Sciences graduate university of chinese academy of sciences

Authenticated group key exchange protocols allow a group of users over a public network to establish a shared secret key for the subsequent cryptographic goals. In this paper, we extend BD-II scheme into a dynamic setting, and propose a tree-based authenticated key exchange protocol which is more suitable for dynamic groups in such as ad hoc networks. Our protocol is proven secure in random-oracle model. Additionally, we analyze the costs of our protocols in both communication and computation terms, and compare its performance with three well-known protocols.

关键词： tree-based group key exchange dynamic provable security

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.S{3. 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 Information {3. 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

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 2. State {3. {2. of Information security,Institute of Software,{3. academy of sciences,beijing 100190,China 2.graduate university of chinese academy of sciences,beijing 100049,China State key {2. of Information {3. 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

Paillier's trapdoor function hides Θ(n) bits

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information sciences) 2011年第9期54卷 1827-1836页

作者： SU Dong & Lü KeWei State key {2. of Information {3.,{3.,beijing 100049,China State key {2. of Information {3. 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

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 ({13. School of chinese {12. of sciences), beijing 100049, China College of Computer Science and Technology Beijing University of Technology Beijing China State key {2. of Information {3. ({3. 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

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 Information security, {3., beijing 100049, China 2.tate key {2. of Information security, Institute of Software of chinese academy of {12., beijing 100080, China State key {2. of Information {3. Graduate University of Chinese Academy of Sciences

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 QiaoYan3. College of Computer Science and Technology, beijing university of Technology, beijing 10002., China 2.S{3. key laboratory of Information security, graduate university of the chinese {13. of sciences, {12., 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 {2. of Information {3. 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