检索结果-南通市图书馆

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

Secure network coding in the presence of eavesdroppers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information Sciences) 2010年第3期53卷 648-658页

作者： LUO MingXing1,2,3, YANG YiXian1,2,3, WANG LiCheng1,2,3 & NIU XinXin1,2,3 1information security Center, state key laboratory of Networking and Switching Technology, beijing University of Posts and Telecommunications, beijing 100876, china 2key laboratory of Network and information Attack and Defence Technology of MOE, beijing University of Posts and Telecommunications, beijing 100876, china 3National Engineering laboratory for Disaster Backup and Recovery, beijing University of Posts and Telecommunications, beijing 100876, china information security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications key laboratory of Network and information Attack and Defence Technology of MOE Beijing University of Posts and T

Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.

关键词： all-or-nothing transformation secure network coding eavesdropping

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

Wide/narrow azimuth acquisition footprints and their effects on seismic imaging

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Petroleum Science 2008年第4期5卷 308-313页

作者： Di Bangrang Xu Xiucang Wei Jianxin key laboratory of CNPC Geophysical Exploration China University of Petroleum Beijing 102249 China state key laboratory of Petroleum Resource and Prospecting China University of Petroleum Beijing 102249 China key laboratory of Earth Prospecting and information Technology China University of Petroleum Beijing 102249 China

Acquisition footprint is a new concept to describe the seismic noise in three-dimensional seismic exploration and it is closely related to geometry and observation shuttering. At present, the study on acquisition footprints has become a hot spot. In partnership with the Dagang Oilfield, we used the channel sand body seismic physical model to study the characteristics of wide/narrow azimuth acquisition footprints and analyzed and compared the two types of footprints and their effects on target imaging. In addition, the footprints caused by data processing of the normal moveout offset （NMO） stretching aberration were discussed. These footprints are located only in the shallow or middle layer in the time slice, and possibly affect the imaging of shallow target layers, and have no influence on deep target imaging. Seismic physical modeling has its advantages in the study of acquisition footprints.

关键词： Wide/narrow azimuth geometry acquisition footprint stretching aberration time slice seismic imaging

Study on NDVI-T_s space by combining LAI and evapotranspiration

在线全文

学校读者我要写书评

暂无评论

Science china Earth Sciences 2006年第7期49卷 747-754页

作者： HAN Lijuan1,2,3, WANG Pengxin4, YANG Hua1,2,3, LIU Shaomin1,2,3 & WANG Jindi1,2,3 1. Research Center for Remote Sensing and GIS, School of Geography, beijing Normal University, beijing 100875, china 2. state key laboratory of Remote Sensing Science, beijing 100875, china 3. beijing key laboratory for Remote Sensing of Environment and Digital Cities, beijing 100875, china 4. Department of {13. Management, College of {13. and Electronic Engineering, china Agricultural University, beijing 100083, china Research Center for Remote Sensing and GIS School of Geography Beijing Normal University Beijing China state key laboratory of Remote Sensing Science Beijing China beijing key laboratory for Remote Sensing of Environment and Digital Cities Beijing China Department of information Management College of Information and Electronic Engineering China Agricultural University Beijing China

This paper focuses on interpreting the different spatial relationships between NDVI and Ts, a triangular or a trapezoid, and on analyzing transformation conditions, the physical and ecological meanings of the vegetation index-surface temperature space as well. Further, we use the Tempera-ture-Vegetation Dryness Index (TVDI) to explain the existent meaning of a triangular space after NDVI reaches its saturated state by employing the relationships between NDVI, LAI and evapotranspiration. The specific relations between NDVI and Ts are useful for describing, validating and updating land surface models.

关键词： NDVI, land surface temperature, evapotranspiration, leave area index.

Leakproof secret sharing protocols with applications to group identification scheme

在线全文

学校读者我要写书评

暂无评论

Science china(information Sciences) 2012年第5期55卷 1172-1185页

作者： TANG ChunMing 1,2 & GAO ShuHong 3 1 School of Mathematics and information Science,Guangzhou University,Guangzhou 510006,china 2 state key laboratory of information security,Institute of Software Science,Chinese Academy of Sciences,beijing 100049,china 3 Department of Mathematical Sciences,Clemson University,SC 29634,USA School of Mathematics and information Science Guangzhou University state key laboratory of information security Institute of Software Science Chinese Academy of Sciences Department of Mathematical Sciences Clemson University

In a traditional (t,n)-threshold secret sharing scheme,t or more honest participants can reconstruct the secret *** the reconstruction process,the individual shares and the secret key K are revealed,hence K is shared once *** this paper,we firstly give the definition of leakproof secret sharing scheme which is composed of a distribution protocol and a proof protocol,then propose two leakproof secret sharing protocols,a computationally secure protocol and an information-theoretically secure *** our protocols,t or more participants can jointly prove that they hold the secret K by using a multi-prover zero-knowledge argument of *** a result,the secret K will be shared for as many times as ***,each participant can detect the dealer in the distribution protocol from cheating,and any verifier can prevent non-qualified set of participants in proof protocol from *** an example of the practical impact of our work we use our techniques to construct group identification schemes with zero-knowledge.

关键词： secret sharing leakproof secret sharing multi-prover zero-knowledge argument proof of knowl-edge group identification scheme

A Sensor-Service Collaboration Approach for Target Tracking in Wireless Camera Networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

china Communications 2017年第7期14卷 44-56页

作者： Shuai Zhao Le Yu state key laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications china Mobile information security Center

Mobile target tracking is a necessary function of some emerging application domains, such as virtual reality, smart home and intelligent healthcare. However, existing portable devices for target tracking are resource intensive and high-cost. Camera tracking is an effective location tracking way for those emerging applications which can reuse the existing ubiquitous video monitoring system. This paper proposes a dynamic community-based camera collaboration(D3C) framework for target location and tracking. The contributions of D3C mainly include that(1) nonlinear perspective projection model is selected as the camera sensing model and sequential Monte Carlo is employed to predict the target location;(2) a dynamic collaboration scheme is proposed, it is based on the local community-detection theory deriving from social network analysis. The performance of proposed approach is validated by both synthetic datasets and real-world application. The experiment results show that D3C meets the versatility, real-time and fault tolerance requirements of target tracking applications.

关键词： service collaboration camera tracking community detection sequential monte carlo

A construction of hyperbent functions with polynomial trace form

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2011年第10期54卷 2229-2234页

作者： CAO XiWang1,2,3,& HU Lei3 1Department of Mathematics,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,china 2LMIB of Ministry of Education,beijing University of Aeronautics and Astronautics,beijing 100191,china 3state key laboratory of information security,Graduate School of Chinese Academy of Sciences,beijing 100049,china Department of Mathematics Nanjing University of Aeronautics and Astronautics LMIB of Ministry of Education Beijing University of Aeronautics and Astronautics state key laboratory of information security Graduate School of Chinese Academy of Sciences

This paper presents a construction of infinite classes of binary and p-ary hyperbent functions of polynomial trace form,based on finding a zero of a Kloosterman sum.

关键词： bent function hyperbent function Kloosterman sums

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