检索结果-南通市图书馆

Secure multi-party computation protocol for sequencing problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2011年第8期54卷 1654-1662页

作者： TANG ChunMing 1,2,SHI GuiHua 1 & YAO ZhengAn 3 1 School of Mathematics and information Science,Guangzhou University,Guangzhou 510006, china 2state key laboratory of information security, institute of software Science,chinese academy of sciences,beijing 100080,china 3 School of Mathematics and Computational Science,Sun Yat-Sen University,Guangzhou 510275,china School of Mathematics and information Science Guangzhou University state key laboratory of information security Institute of Software Science Chinese Academy of Sciences School of Mathematics and Computational Science Sun Yat-Sen University

In the field of multi-party computation,an important problem is how to construct an efficient and secure multi-party computation protocol for certain specific *** the present study,we make use of a secret sharing scheme to construct an efficient and secure multi-party computation protocol for sequencing *** protocols are perfectly secure against both a passive adversary that can corrupt at most t (n-1)/2 participants, and an active adversary that can corrupt at most t < n/3 *** simplest sequencing problem is the Millionaires' problem.

关键词： secure multi-party computation sequencing problem secret sharing

Nondegenerative ML-sequences over ring Z/(2~e)

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

chinese Science Bulletin 1999年第17期44卷 1557-1561页

作者： YANG Junhui and ZHAI Qibininstitute of software , chinese academy of sciences , beijing 100080, china state key laboratory of information security , beijing 100080, china chinese Acad Sci Inst Software Beijing 100080 Peoples R China state key Lab Informat Secur Beijing 100080 Peoples R China

The so-called quasi-period of an ML-sequence has been introduced. It is noted that an ML-sequence may degenerate in the sense that it has the quasi-period shorter than its period, and the problem of constructing the n... 详细信息

关键词： nondegenerate ML-sequence quasi-period.

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

security model and modular design of fair authentication key exchange protocols

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2010年第2期53卷 278-287页

作者： FENG DengGuo & CHEN WeiDong 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

It is traditionally assumed that the legal two parties in authentication key exchange (AKE) communications are both credible. However, in more and more network applications nowadays, it is often required that such protocols be run under the circumstances where ones do not trust in each other. Therefore, in this paper we propose the idea of fair authentication key exchange (FAKE), which has not only the basic properties of AKE protocols, but also some new properties: the "session proof" embedded in the input of protocols by the customer; and if not revealed, the protocols have the deniability, otherwise the transcript of protocol is binding for the identifications. Such a method is capable of solving the contradiction between protecting privacy and the dissension on network service. Then the security model of FAKE protocols is formulated systematically and a flaw of the security model of current signature schemes proposed by Kudla is also corrected. Finally, a kind of FAKE protocol based on current signature schemes is designed and the mBJM-AK security, conditional deniability and fairness of FAKE protocols are proved in the random oracle model.

关键词： authentication key exchange protocols deniability fairness concurrent signature provable security

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

CMQV+:An authenticated key exchange protocol from CMQV

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2012年第7期55卷 1666-1674页

作者： LI Hui 1,2 & WU ChuanKun 1 1 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 Beijing China Graduate University of chinese academy of sciences Beijing China

Ustaoglu presents a secure and efficient key exchange protocol named CMQV,based on the design rationales of HMQV and *** with the latter two protocols,on one hand,CMQV achieves high performance of HMQV,and on the other,it is proven secure in eCK model as NAXOS ***,CMQV enjoys the security proof under gap Diffie-Hellman assumption as indicated by its *** this paper,we propose a variant of CMQV,called CMQV+,which is proven secure under a weaker assumption (*** Diffie-Hellman assumption) in eCK model with random oracles while maintaining the high-performance feature of CMQV as much as possible.

关键词： key exchange eCK model trapdoor-test technique provable security CDH assumption

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 laboratory of information security, institute of software, chinese academy of sciences, beijing 100190, china 2 Graduate University of the chinese academy of sciences, beijing 100049, china The state key laboratory of information security Institute of Software Chinese Academy of Sciences Graduate University of the chinese academy 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

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 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

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

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 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

维普期刊数据库