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

Security and trust in digital rights management: A survey

International Journal of network Security 2009年第3期9卷 247-263页

作者： Zhang, Zhiyong Pei, Qingqi Ma, Jianfeng Yang, Lin Ministry Of Education Key Laboratory of Computer Network and Information Security Xidian University Taibai South Road No.2 Xi'an Shannxi 710071 China Electronic Information Engineering College Henan University of Science and Technology Xiyuan Road No.48 Luoyang Henan 471003 China The Research Institute China Electronic Equipment and Systems Engineering Corporation Dacheng Road 13 Beijing 100141 China

A successful transaction of digital contents is primarily dependent on security policies, trust relationships and benefit equilibriums among various participants in a DRM (Digital Rights Management)-enabling contents value chain ecosystem. We first analyzed basic value chain architectures in existence, together with some fundamental security and trust requirements. And then, a state-of- the-art anatomy of the security and trust related to DRM was presented from different stakeholder' perspectives. Next, some challenges for multi-party mutual trust, not just inclined to any of participants, were proposed based on the holistic consideration of the digital contents/rights protection and the benefits balance. Finally, a conclusion was drawn that the rights-benefits-centric DRM ecosystem and the resulting trust relationship are crucial for the survivability of the contents industry.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

An Efficient Mesh Simplification Algorithm

An Efficient Mesh Simplification Algorithm

引用

International Conference on Internet Computing in Science and Engineering (ICICSE)

作者： Hailing Wang Guisheng Yin Jing Zhang Decai Wang Jian Wang National Defence Key Laboratory of Autonomous Underwater Vehicle Technology Harbin Engineering of Technology Harbin Heilongjiang China Harbin Engineering University Harbin Heilongjiang CN College of Computer Science and Technology Harbin Engineering of Technology Harbin Heilongjiang China Network and Information center Harbin Engineering of Technology Harbin Heilongjiang China

This paper presents a new mesh simplification algorithm based on edge collapse, it combines surface curvature and quadric error metric, the position of a new vertex for edge collapse depends on multiple-weighted approach. The new algorithm can improve simplification rationality in procedure and preserve important features after simplification. In an addition, we do some experiments with comparing different simplified models, the results show that the new algorithm not only maintains the overall appearance for models, but also obtains better effectiveness.

关键词： Automotive engineering Maintenance engineering computer errors Solid modeling Iterative algorithms IP networks computer networks Laboratories Underwater vehicles Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Modeling and Defending Passive Worms over Unstructured Peer-to-Peer networks

引用

Transactions of Tianjin University 2008年第1期14卷 66-72页

作者：王方伟张运凯马建峰 Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Network Center Hebei Normal University

Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly analyzes and obtains the average delay for all peers in the whole transmitting process due to the limitation of network throughput, and then proposes a mathematical model for the propagation of passive worms over the unstructured P2P networks. The model mainly takes the effect of the network throughput into account, and applies a new healthy files dissemination-based defense strategy according to the file popularity which follows the Zipf distribution. The simulation results show that the propagation of passive worms is mainly governed by the number of hops, initially infected files and uninfected files. The larger the number of hops, the more rapidly the passive worms propagate. If the number of the initially infected files is increased by the attackers, the propagation speed of passive worms increases obviously. A larger size of the uninfected file results in a better attack performance. However, the number of files generated by passive worms is not an important factor governing the propagation of passive worms. The effectiveness of healthy files dissemination strategy is verified. This model can provide a guideline in the control of unstructured P2P networks as well as passive worm defense.

关键词： network security unstructured peer-to-peer networks passive worms propagationmodel patch dissemination strategy

来源：评论

学校读者我要写书评

暂无评论

computer network defense policy specification language

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2009年第1期46卷 89-99页

作者： Xia, Chunhe Wei, Yudi Li, Xiaojian Wang, Haiquan He, Wei State Key Laboratory of Virtual Reality Technology Beihang University Beijing 100083 China Key Laboratory of Beijing Network Technology Beihang University Beijing 100083 China College of Computer Science and Information Technology Guilin 541000 China College of Software Beihang University Beijing 100083 China

Policy is an essential part of computer network defense, which has important directive to the deployment, implementation, configuration and effects of defense systems. Presently, models and specifications on access control policy work well. However, they can not be directly applied to the whole defense policy area. In this paper, a new computer network defense policy specification language called CNDPSL is proposed to provide a common method of specifying protection, detection and response policies according to a new defined model called CNDPM, which is put forward by extending Or-BAC (organization based access control model). In CNDPM, automatic assignment mechanism is introduced to improve efficiency, and derivative principles are presented to refine abstract policies to concrete rules. Moreover, completeness, validity and consistency of policy are also formally analyzed and demonstrated. CNDPSL is declarative and able to abstract defense control behaviors of network, which makes this language flexible, extensible and adaptable to network defense requirements. Finally, a policy engine is implemented. Detailed experiments in GTNetS platform indicate that CNDSPL can be refined to concrete technical rules automatically, such as ACL (access control list) in firewall, IDS detection rules, response rules, etc, and obtain defense effects it expresses. The above information proves its effectiveness and efficiency.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

引用

Science in China(Series F) 2008年第7期51卷 896-909页

作者： LI XiaoPing1,2 & WU Cheng3 1 School of computer Science & Engineering, Southeast University, Nanjing 210096, China 2 key laboratory of computer network and information integration (Southeast University), Ministry of Education, Nanjing 210096, China 3 Department of Automation, Tsinghua University, Beijing 100084, China 1. School of Computer Science & Engineering Southeast University Nanjing 210096 China 2. Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing 210096 China 3. Department of Automation Tsinghua University Beijing 100084 China

No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH （fast composite heuristic） is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.

关键词： no-wait flow shops heuristic makespan Tabu search

来源：评论

学校读者我要写书评

暂无评论

Resource allocation model based on non-cooperative bidding game in P2P network

Resource allocation model based on non-cooperative bidding g...

引用

International Symposium on Advances in computer and Sensor networks and Systems, 2008

作者： Jun, Tao Hang, Chen JiaGao, Wu School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing 210096 China College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

ISBN: (纸本)9781427629807

Game theory is applied to studying the P2P resource allocation technologies further in this paper. The mechanism of P2P resource pricing, which shows the relation of supply and demand, was presented based on bidding. Subsequently, we designed the utility function of end system and proved the existence and uniqueness of Nash Equilibrium in P2P resource allocation game. At last, we present a P2P resource allocation algorithm (PRANG) based on the resource allocation game model. The results of experiment and simulation show that PRANG algorithm can provide references for the quantity of resource that users demand and regularize the users' bids. Consequently, the allocation of the whole P2P resource tends to be more reasonable.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Fast access control algorithm in wireless network

Fast access control algorithm in wireless network

引用

3rd International Conference on Grid and Pervasive Computing Symposia/Workshops, GPC 2008

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

ISBN: (纸本)9780769531779

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. © 2008 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of a Type of CRT-Based RSA Algorithms

引用

Journal of computer Science & Technology 2008年第2期23卷 214-221页

作者：秦宝东李明孔凡玉 College of Computer Science and Technology Southwest University of Science and TechnologyMianyang 621010China Institute of Network Security Shandong UniversityJinan 250100China Key Laboratory of Cryptographic Technology and Information SecurityJinan 250100China

It is well known that the Chinese Remainder Theorem （CRT） can greatly improve the performances of RSA cryptosystem in both running times and memory requirements. However, if the implementation of CRT-based RSA is careless, an attacker can reveal some secret information by exploiting hardware fault cryptanalysis. In this paper, we present some fault attacks on a type of CRT-RSA algorithms namely BOS type schemes including the original BOS scheme proposed by Blomer, Otto, and Seifert at CCS 2003 and its modified scheme proposed by Liu et al. at DASC 2006. We first demonstrate that if some special signed messages such as m = 0, ±1 are dealt carelessly, they can be exploited by an adversary to completely break the security of both the BOS scheme and Liu et al.＇s scheme. Then we present a new permanent fault attack on the BOS scheme with a success probability about 25%. Lastly, we propose a polynomial time attack on Liu et al.＇s CRT-RSA algorithm, which combines physical fault injection and lattice reduction techniques when the public exponent is short.

关键词： Chinese remainder theorem RSA BOS scheme cryptanalysis fault attack LLL

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：