检索结果-内蒙古大学图书馆

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

来源：评论

学校读者我要写书评

暂无评论

A Benefits-centric Multi-participant Trust Architecture for DRM-Enabling Digital Contents Value Chain Ecosystem

A Benefits-centric Multi-participant Trust Architecture for ...

引用

International Seminar on Business and information Management, ISBIM

作者： Zhiyong Zhang Qingqi Pei Jianfeng Ma Lin Yang Ministry of Education Key Laboratory of Computer Network & Information Security Xidian University Xi'an China

A multi-participant trust relationship is essential to implement a successful business transaction in DRM (digital rights management)-enabling digital contents industry. The simple adoption of several increasingly enhanced security policies does not necessarily establish the mutual trust relationship ultimately, and even has a negative effect on the usability and acceptability of DRM system. Therefore, various participantspsila benefits should be emphasized in the contents value chain. First, a general DRM contents value chain ecosystem was presented without a loss of generality. Then, a benefits-centric multi-participant trust architecture (abbr. MPTA), which is based on game-theoretic rational adoptions of security policies for participants, was proposed through an anatomy of existing value chain ecosystems. Finally, we formalized the definitions of the security component and service, the security policy and its utility, as well as the Nash equilibriums of the multi-participant game under pure and mixed security policy profile. Due to the introduction to game theory, MPTA enables participants to acquire optimal benefits balance when fundamental security requirements are met, and Nash equilibrium of the game is the chosen security policies combinations from the participantspsila perspectives.

关键词： Ecosystems Nash equilibrium Game theory computer network management information security Intellectual property Application software Seminars information management computer architecture

来源：评论

学校读者我要写书评

暂无评论

Fair Exchange Signature Schemes

Fair Exchange Signature Schemes

引用

International Conference on Advanced information networking and Applications Workshops (AINAW)

作者： Jingwei Liu Rong Sun Wenping Ma Ying Li Xinmei Wang Key Laboratory of Computer Network and Information Security Ministry of Education Xidian University Xi'an China

In this paper we propose an efficient Fair Exchange Signature Scheme(FESS) that allows two players to exchange digital signatures in a fair way. It may be considered as an interesting extension of concurrent signature presented in EURO CRYPT 2004 that is constructed from ring signatures. In our scheme, two unwakened signatures signed separately by two participants can be verified easily by the other player, but it would not go into effect until an extra piece of commitment keystone is released by one of the players. Once the keystone revealed, two signatures are both aroused and become effective. A key feature of the proposed scheme is that two players can exchange digital signatures simultaneously through a secret commitment keystone without involvement of any Trusted Third Party. Moreover, the efficiency of our signature scheme is higher than that of concurrent signature.

关键词： Protocols Digital signatures computer networks Application software laboratories information security computer science education Electronic commerce Internet computer crashes

来源：评论

学校读者我要写书评

暂无评论

Fast Access Control Algorithm in Wireless network

Fast Access Control Algorithm in Wireless Network

引用

International Conference on Grid and Pervasive Computing Workshops, GPC

作者： Kun Wang Zhixin Ma Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an China

This paper presents an access control algorithm which bases on artificial neural network (ANN). It uses selected roles as input vectors. Then, considering role inheritance, the matching roles that may mutual exclude are picked as the output vectors to train the role-role ANN. After that, it removes all conflicts from the output of the former ANN and makes them as the new input vectors. And it employs users' final permissions as the output vectors to train the role- permission ANN according to users' current sessions. This algorithm has high efficiency and can assign users various permissions in different session. It need not re-compute trained ANN if we add or delete users in the system without changing the mapping between the roles and permissions. It exploits bit strings to express roles and permissions, which reduces the data transmission and fits for low bandwidth networks.

关键词： Access control Wireless networks Permission Artificial neural networks laboratories computer networks information security computer science education Data communication Bandwidth

来源：评论

学校读者我要写书评

暂无评论

ECC-Based Threshold Digital Signature Scheme without a Trusted Party

ECC-Based Threshold Digital Signature Scheme without a Trust...

引用

International Conference on Computational Intelligence and security

作者： Qingqi Pei Jianfeng Ma Key Lab of Computer Networks and Information Security (Ministry of Education) Xidian University

ISBN: (纸本)9781424441969

Based on the elliptic curve logarithm problem, a (t, n) threshold digital signature scheme was proposed in this paper. In the key generation phase, each participant's public and private keys, and the group public key are negotiated among all the participants with no trusted party required. In the signature generation phase, no secure communication is needed between any two participants. This scheme provides the capability of detecting cheating and identifying the cheat that may be from the internal participants or the external attackers. At the same time, this scheme has the advantages of elliptic curve cryptography. The security of this scheme is based on the difficulty of solving the elliptic curve discrete logarithm problem. Analyses show that this scheme is a computationally secure and efficient scheme.

关键词： Digital signatures Elliptic curve cryptography Elliptic curves Public key information security Galois fields Communication system security Broadcasting Protocols Polynomials

来源：评论

学校读者我要写书评

暂无评论

Data reduction and classification based on multiple classifier behavior

Data reduction and classification based on multiple classifi...

引用

2008 International Conference on Data Mining, DMIN 2008

作者： Zhao, Chunying Guo, Gongde Huang, Xuming Huang, Tianqiang Neagu, Daniel School of Math. and Computer Science Fujian Normal Univ. China Key Lab. of Network Security and Cryptography Fujian Normal Univ. China Department of Computing University of Bradford United Kingdom

ISBN: (纸本)1601320620

A novel method, multiple classifier behavior-based data reduction and classification algorithm, called DRC, is proposed in this paper. It arrived at the transformation of the data-space by suing of the multiple classifier behavior vector so that data-sets transform from the original spaces to the behavior spaces. It aims to find some more meaningful representatives to replace the original dataset via classifier behavior vector for further classification. Each representative is formed by its multiple classifier behavior and its neighborhood which satisfies a predefined threshold. Inspired by the spirits of data reduction and classifier selection methods, the proposed DRC not only reduces the cost but also uses the advantage of each single classifier to improve the classification accuracy to a certain extent. This is proved by real world applications such as toxicity prediction of chemical compounds in predictive toxicology.

关键词： Toxicity

来源：评论

学校读者我要写书评

暂无评论

New ECDSA-Verifiable Multi-receiver Generalization Signcryption

New ECDSA-Verifiable Multi-receiver Generalization Signcrypt...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Xiaoyuan Yang Maotang Li Lixian Wei Yiliang Han Key Laboratory of Network & Information Security of APF Engineering College of APF Xi'an China Key Lab. of Network & Inf. Security of APF Eng. Coll. of APF Xian Engineering College of APF Key Laboratory of Network and Information Security of APF Xi'an China

Multi-receiver signcryption is a new cryptographic primitive that simultaneously fulfills both the functions of signature and multi-receiver encryption. Generalized Multi-Receiver signcryption can provide authenticity or confidentiality separately under specific inputs. Based on ECDSA, a generalized Multi-Receiver signcryption scheme is designed. It will be equivalent to ECDSA or multi-receiver encryption when one of party is absent. Compared with others, this scheme is based on the efficient and provably secure scheme ECDSA. It can work with three modes: signcryption, signature and encryption. A trusted party can verify the signcryption text publicly in the method of ECDSA.

关键词： Cryptography Receivers security Public key Elliptic curve cryptography Algorithm design and analysis Elliptic curves

来源：评论

学校读者我要写书评

暂无评论

A time weighted neighbourhood counting similarity for time series analysis

引用

3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008

作者： Wang, Hui Lin, Zhiwei School of Computing and Mathematics University of Ulster Jordanstown BT37 0QB United Kingdom Key Lab. of Network Security and Cryptology School of Mathematics and Computer Science Fujian Normal University China

ISBN: (纸本)3540797203

Time series data abound and analysis of such data is challenging and potentially rewarding. One example is financial time series analysis. In time series analysis there is the issue of time dependency, that is, the state in the nearer past is more relevant to the current state than that in the more distant past. In this paper we study this issue by introducing time weighting into similarity measures, as similarity is one of the key notions in time series analysis methods. We consider the generic neighbourhood counting similarity as it can be specialised for various forms of data by defining the notion of neighbourhood in a way that satisfies different requirements. We do so with a view to capturing time weights in time series. This results in a novel time weighted similarity for time series. A formula is also discovered for the similarity so that it can be computed efficiently. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Data reduction

来源：评论

学校读者我要写书评

暂无评论

五谱值函数的构造

五谱值函数的构造

引用

中国密码学会2009年会

作者： Xie Min 谢敏 Li Juan 李娟 Zhang Feng-rong 张凤荣 Key laboratory of computer network and information security(Xidian University) Xi'an 710071 Guangdo 西安电子科技大学计算机网络与信息安全教育部重点实验室西安 710071 广东省信息安全技术重点实验室(广州大学)广州 510405 School of Electrical Engineering(Northwest University of Nationalities) Lanzhou 730030 西北民族大学电气工程学院兰州 730030 Key laboratory of computer network and information security(Xidian University) Xi'an 710071 西安电子科技大学计算机网络与信息安全教育部重点实验室西安 710071

在密码体制的构造中，布尔函数被广泛地应用，对分组密码中S-盒和流密码中组合生成器等的研究，实质上可归结为对布尔函数的分析.通过分析Bent函数的性质，利用级联的方法，构造了一类五谱值函数.该类函数没有非零线性结构、平衡、代数... 详细信息

在密码体制的构造中，布尔函数被广泛地应用，对分组密码中S-盒和流密码中组合生成器等的研究，实质上可归结为对布尔函数的分析.通过分析Bent函数的性质，利用级联的方法，构造了一类五谱值函数.该类函数没有非零线性结构、平衡、代数次数可达到变元个数的一半.并且，该类函数的代数免疫阶等于所级联的Bent函数的代数免疫阶加1.

关键词：密码学五谱值函数代数次数代数免疫阶

来源：评论

学校读者我要写书评

暂无评论

Modeling and Analysis of a Self-Learning Worm Based on Good Point Set Scanning

Modeling and Analysis of a Self-Learning Worm Based on Good ...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Fangwei Wang Yunkai Zhang Jianfeng Ma Network Center Hebei Normal University Shijiazhuang China Key Laboratory of Computer Networks and Information Security Xidian University Xi'an China Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an China

In order to speed up the propagating process, the worms need to scan many IP addresses to target vulnerable hosts. However, the distribution of IP addresses is highly nonuniform, which results in many scans wasted on invulnerable addresses. Inspired by the theory of good point set, this paper proposes a new scanning strategy, referred to as good point set scanning (GPSS), for worms. Experimental results show that GPSS can generate more distinct IP addresses and less unused IP addresses than the permutation scanning. Combined with group distribution, a static optimal GPSS is derived. Since the information can not be easily collected before a worm is released, a self-learning worm with GPSS is designed. Such worm can accurately estimate the underlying vulnerable-host distribution when a sufficient number of IP addresses of infected hosts are collected. We use a modified Analytical Active Worm Propagation (AAWP) to simulate data of Code Red and the performance of different scanning strategies. Experimental results show that once the distribution of vulnerable hosts is accurately estimated, a self- learning worm can propagate much faster than other worms.

关键词： Grippers IP networks Internet Routing Servers Equations Web server

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：