检索结果-南通市图书馆

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 1. School of Mathematics and information Science Guangzhou University Guangzhou 510006 China2. State Key Laboratory of Information Security Institute of Software Science Chinese Academy of Sciences Beijing 100049 China3. Department of Mathematical Sciences Clemson University Clemson SC 29634 USA

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 prototype auto-human support system for spatial analysis

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2006年第9期16卷 954-966页

作者： LI Lianfa and WANG Jinfeng (state key laboratory of Resources & Environmental information System, institute of Geographical sciences & Natural Resources Research, chinese academy of sciences, beijing 100101, china) [a]state key laboratory of Resources & Environmental information System Institute of Geographical Sciences & Natural Resources Research Chinese Academy Sciences Beijing China

Spatial analysis is a multidisciplinary field that involves multiple influential factors, variation and uncertainty, and modeling of geospatial data is a complex procedure affected by spatial context, mechanism and assumptions. In order to make spatial modeling easier, some scholars have suggested a lot of knowledge from exploratory data analysis (EDA), specification of the model, fitness and diagnosis of the model, to interpretation of the model. Also an amount of software has improved some functionalities of spatial analysis, e. g. EDA by the dynamic link (GeoDa) and robust statistical calculation (R). However, there are few programs for spatial analysis that can automatically deal with unstructured declarative issues and uncertainty in machine modeling using the domain knowledge. Under this context, this paper suggests a prototype support system for spatial analysis that can automatically use experience and knowledge from the experts to deal with complexity and uncertainty in modeling. The knowledge base component, as the major contribution of the system, in support of the expert system shell, codes and stores declarative modeling knowledge, e.g. spatial context, mechanisms and prior knowledge to deal with declarative issues during the modeling procedure. With the open architecture, the system integrates functionalities of other components, e.g. GIS’ visualization, DBMS, and robust calculation in an interactive environment. An application case of spatial sampling, design and implementation of spatial modeling with such a system is demonstrated.

关键词： spatial analysis automatic support system modeling of spatial data artificial inference for modeling.

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 100124, china 2 state 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 state 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 100124 China state key laboratory of Integrated Services Network Xidian University Xi’an 710071 China state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China state key laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 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

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 1. College of Computer Science and Technology Beijing University of Technology Beijing 100124 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 2. state key laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 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 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 100124,china 2 state 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 state 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 100124 China state key laboratory of Integrated Services Network Xidian University Xi’an 710071 China state key laboratory of information security (Graduate University of chinese academy of sciences) Beijing 100049 China state key laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 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 information. This protocol is feasible with the present-day technique.

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

An improved method for progressive animation models generation

在线全文

学校读者我要写书评

暂无评论

Science china(information sciences) 2010年第7期53卷 1312-1321页

作者： ZHANG ShiXue1,2, ZHAO JinYu1 & WU EnHua2,3 1Changchun institute of Optics, Fine Mechanics and Physics, chinese academy of sciences, Changchun 130033, china 2Department of Computer and information Science, University of Macau, Macao, china 3state key laboratory of Computer Science, institute of software, chinese academy of sciences, beijing 100190, china 1. Changchun institute of Optics Fine Mechanics and Physics Chinese Academy of Sciences Changchun 130033 China2. Department of Computer and Information Science University of Macau Macao China3. State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

In computer graphics, animated models are widely used to represent time-varying data. And the progressive representation of such models can accelerate the speed of processing, transmission and storage. In this paper, we propose an efficient method to generate progressive animation models. Our method uses an improved curvature sensitive quadric error metric (QEM) criterion as basic measurement, which can preserve more local features on the surface. We append a deformation weight to the aggregated edge contraction cost during the whole animation to preserve more motion features. At last, we introduce a mesh optimization method for the animation sequence, which can efficiently improve the temporal coherence and reduce visual artifacts between adjacent frames. The results show our approach is efficient, easy to implement, and good quality progressive animation models can be generated at any level of detail.

关键词： animation models LOD progressive mesh mesh optimization

Seasonal patterns of spatial differentiation of landcover change in china

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

chinese Science Bulletin 1999年第4期44卷 362-364页

作者： CHEN Yufengstate key laboratory of Resource and Environment information System , institute of Geography, chinese academy of sciences, beijing 100101, china state key laboratory of Resource and Environment information System Institute of Geography Chinese Academy of Sciences Beijing China

Using the 1°×1° NOAA AVHRR NDVI data set in china, an index on the spatial different gradient of landcover is created. Then based on the index and supported by the geographical information system, it is revealed through principal component and factor analyses methods that there exist four types of seasonal patterns of spatial differentiation of landcover change in china, i.e. November to next March type, June to September type, May or October type and April type.

关键词： landcover spatial differentiation seasonal pattern.

PARALLEL CHAOTIC MULTISPLITTING ITERATIVE METHODS FOR THE LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEM

在线全文

学校读者我要写书评

暂无评论

Journal of Computational Mathematics 2001年第3期19卷 281-292页

作者： Zhong-zhi Bai (state key laboratory of Scientific/Engineering Competing institute of Computational Mathematics and Scientific/Engineering Computing, academy of Mathematics and Systems sciences, chinese academy of sciences, beijing 100080, china) 中科院计算数学与工程计算数学所科学与工程计算国家重点实验室北京 100080

Focuses on a study which presented a parallel chaotic multisplitting method for solving the large sparse linear complementarity problem. Preliminaries of the study; Equations of the parallel chaotic multisplitting met... 详细信息

关键词： linear complementarity problem matrix multisplitting chaotic iteration relaxed method convergence property

Weight hierarchies of linear codes satisfying the Near-Chain condition

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2005年第9期15卷 784-792页

作者： LIU Zihui1** and CHEN Wende2(1. School of Mathematical sciences, Peking University, beijing 100871, china 2. laboratory of Systems and Control and key state laboratory of information security, institute of Systems Science, academy of Mathematics and Systems Science, chinese academy of sciences, beijing 100080, china) School of Mathematical sciences Peking University Beijing 100871 China. laboratory of Systems and Control and key state laboratory of information security Institute of Systems Science Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100080 China

The weight hierarchies of a linear [n,k;q] code C satisfying the Near-Chain condition are studied, almost all the weight hierarchies of such code are determined.

关键词： weight hierarchy Near-Chain condition difference sequence linear code.