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

International Journal of Digital Content technology and its Applications 2012年第3期6卷 148-157页

作者： Yang, Lei Qin, Zhi-Guang Wang, Can Yang, Hao School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Network and Data Security Key Laboratory of Sichuan Province Chengdu 611731 China

P2P storage architecture plays an important role in distributed storage systems. For P2P dynamic environment, the sufficient redundant data must be maintained to ensure the data availability. System will pay various costs to maintain redundant data. In this paper, the costs of the bandwidth that are respectively caused by the methods of replication and erasure coding are qualitatively analyzed based on Markov chain model. Combined the advantage of replication and erasure coding, a new hybrid redundancy strategy is proposed. Just as replication, the downloaded files automatically are viewed as shared files for next downloading. Like erasure coding, when the availability of one file needs to be repaired, anyone of peers which store the fully copy of this file is assigned to generate and distribute new fragments. The analysis result shows that the hybrid redundancy strategy can maintain the appropriate level of redundancy and save more bandwidth than the traditional redundancy strategy in a variety of network environment.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

A secure message delivery scheme with path tracking for delay tolerant networks

A secure message delivery scheme with path tracking for dela...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Zhongtian Jia Muhammad Ali Raffay Lixiang Li Xiaodong Lin Yixian Yang Information Security Center Beijing University of Posts and Telecommunications China Shandong Provincial Key Laboratory of Network based Intelligent Computing University of Jinan Jinan China Faculty of Business and Information Technology Institute of Technology University of Ontario Oshawa ONT Canada

In delay tolerant networks (DTNs), message delivery is operated in an opportunistic way through store-carry and forward relaying, and every DTN node is in anticipation of cooperation for data forwarding from others. Unfortunately, there always exist some selfish nodes that are reluctant to contribute to this cooperative data forwarding procedure so as to save their valuable storage buffer, limited computation power and precious energy. In order to stimulate nodes' willingness to participate in data forwarding, a number of incentive schemes have been proposed recently. However, most existing incentive schemes simply ignore efforts of nodes involved in message delivery if messages delivered fail to reach their destinations. Due to the nature of DTN, such as intermittent connectivity, it is not unusual to have unreliable message delivery, which results in unrewarded or wasted efforts for participating nodes and may discourage them from participating in future data forwarding. Therefore, it is crucial to recognize contribution of every node involved in a data forwarding procedure even the message it helps to forward doesn't successfully reach its destination. However, how to track all delivery paths so as to give every intermediate node some incentive for their cooperative efforts of data forwarding is still an open research problem. To address this problem, we propose a secure message forwarding scheme with path tracking. The proposed method is end-to-end secure with data source and identity authentication. In addition, it can thwart some well known attacks including edge inserting attack, sibling inserting attack and free riding attack.

关键词： Nickel Public key Protocols Relays Joining processes

来源：评论

学校读者我要写书评

暂无评论

High Capacity Steganographic Method Based upon Quantization Error of JPEG

High Capacity Steganographic Method Based upon Quantization ...

引用

2012年计算机应用与系统建模国际会议

作者： Dong Xiuze Liu Shu Zhang Ru Niu Xinxin Wang Lifeng Information Security Center Beijing University of Posts and Telecommunications Electronic and Information Engineering Department Beijing Electronic Science and Technology Institute Key Laboratory of Information Network Security Ministry of Public Security Computer Science and Technology Department Beijing Electronic Science and Technology Institute

Quantizing Error during the process of JPEG compression is analyzed, and a new information hiding algorithm is proposed based on Quantizing Error of JPEG image. Experimental results show that the proposed algorithm can provide a high capacity information hiding and keep the visual quality well, also the produced stego-image are almost identical to the original cover images.

关键词： Quantization Error, Steganography, Cover-Image, Stego-Image

来源：评论

学校读者我要写书评

暂无评论

Practical privacy for value-added applications in vehicular ad hoc networks 5th

引用

5th International Conference on Internet and Distributed computing Systems, IDCS 2012

作者： Zhang, Lei Wu, Qianhong Qin, Bo Domingo-Ferrer, Josep Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Dept. of Comp. Eng. and Maths Universitat Rovira i Virgili TarragonaCatalonia Spain Key Lab. of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan University School of Computer China Department of Maths School of Science Xi’an University of Technology China

ISBN: (纸本)9783642348822

Advances in mobile networking and information processing technologies have triggered vehicular ad hoc networks (VANETs) for traffic safety and value-added applications. Most efforts have been made to address the security concerns while little work has been done to investigate security and privacy for value-added applications in VANETs. To fill this gap, we propose a value-added application, specifically, a security and privacy preserving location-based service (LBS) scheme for VANETs. For each LBS transaction, the scheme provides authentication, integrity and non-repudiation for both the service provider and the user. A user can obtain the service in an anonymous way and hence user privacy is well protected. However, a tracing procedure can be invoked to find malicious users, thereby efficiently preventing users from abusing the anonymity provided by the system. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

A Framework to Eliminate Backdoors from Response-Computable Authentication

A Framework to Eliminate Backdoors from Response-Computable ...

引用

IEEE Symposium on security and Privacy

作者： Shuaifu Dai Tao Wei Chao Zhang Tielei Wang Yu Ding Zhenkai Liang Wei Zou Beijing Key Laboratory of Internet Security Technology Institute of Computer Science and Technology Peking University China University of California Berkeley USA College of Computing Georgia Institute of Technology USA School of Computing National University of Singapore Singapore

Response-computable authentication (RCA) is a two-party authentication model widely adopted by authentication systems, where an authentication system independently computes the expected user response and authenticates a user if the actual user response matches the expected value. Such authentication systems have long been threatened by malicious developers who can plant backdoors to bypass normal authentication, which is often seen in insider-related incidents. A malicious developer can plant backdoors by hiding logic in source code, by planting delicate vulnerabilities, or even by using weak cryptographic algorithms. Because of the common usage of cryptographic techniques and code protection in authentication modules, it is very difficult to detect and eliminate backdoors from login systems. In this paper, we propose a framework for RCA systems to ensure that the authentication process is not affected by backdoors. Our approach decomposes the authentication module into components. Components with simple logic are verified by code analysis for correctness, components with cryptographic/ obfuscated logic are sand boxed and verified through testing. The key component of our approach is NaPu, a native sandbox to ensure pure functions, which protects the complex and backdoor-prone part of a login module. We also use a testing-based process to either detect backdoors in the sand boxed component or verify that the component has no backdoors that can be used practically. We demonstrated the effectiveness of our approach in real-world applications by porting and verifying several popular login modules into this framework.

关键词： Authentication Cryptography Servers Testing Databases Upper bound

来源：评论

学校读者我要写书评

暂无评论

Trust Model Based on Structured Protection for High Level security System

引用

China Communications 2012年第11期9卷 70-77页

作者： Liao Jianhua Zhao Yong Zhan Jing School of Electronics Engineering and Computer Science Peking University Beijing 100871 P. R. China School of Computer Science and Technology Beijing University of Technology Beijing 100124 P. R. China Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou 350007 P. R. China State Key Laboratory of Information Security Institute of So ware Chinese Academy of Sciences Beijing 100049 P. R. China

In order to ensure the security of information systems, it's essential to make sure that system behaviors are trusted. By analyzing threats that exist in executing procedures, a trust model based on structured protection is proposed. We consider that functional components, system actions and message flows between components are three key factors of information systems. Structured protection requirements on components, connections and action parameters are also provided. Four trusted properties of the model are deducted through formal analysis, and trusted system behavior is defined based on these properties. Furthermore, decision theorem of trusted system behavior is proved. The developed prototype system indicates the model is practical. It is a general theory model built on logic deduction and independent on specific environment and the behaviors of the system designed and implemented following the model are trusted.

关键词： trusted computing security assurance structured protection

来源：评论

学校读者我要写书评

暂无评论

A generic approach for providing revocation support in secret handshake

A generic approach for providing revocation support in secre...

引用

14th International Conference on Information and Communications security, ICICS 2012

作者： Yang, Yanjiang Lu, Haibing Weng, Jian Ding, Xuhua Zhou, Jianying Institute for Infocomm Research Singapore Singapore Dept. of Operations Management and Information Systems Leavey School of Business Santa Clara University United States Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Shanghai China School of Information Systems Singapore Management University Singapore Singapore

ISBN: (纸本)9783642341281

Privacy protection and user revocation are essentially conflicting requirements in many cryptographic protocols. It is a particularly challenging problem to harmonize them in a secret handshake protocol that is geared to offering strong privacy protection on the participants' group membership in the protocol execution. In this paper, we study this problem and propose a generic approach to provide revocation support in secret handshake protocols, without sacrificing the notion of privacy preserving. The main building block of our approach is CGC (Confidential Group Communication), a primitive formulated in this paper, and we present a concrete instantiation so as to realize our generic approach. © 2012 Springer-Verlag.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Analysis on Token-Controlled Public key Encryption

Analysis on Token-Controlled Public Key Encryption

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Changlu Lin Yong Li Sriramkrishnan Srinivasan Li Lu Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China Key Laboratory of Communication & Information Systems Beijing Municipal Commission of Education Beijing Jiaotong University Beijing China Department of Computing University of Surrey Guildford UK School of Computer Science University of Electronic Science and Technology Chengdu China

ISBN: (纸本)9781467358088

In this paper, we analyze on the use of token-controlled public key encryption (TCE)schemes. We argue that for many of the applications in some possibilities of application in financial or legal scenarios, for example, the millionaire's will problem, the `private-opening' commitment, the scheduled payment problem, and the sealed-bid auctions and electronic lotteries problem, in the literature, the use of token-controlled public key encryption on its own, leads to inadequate solutions. We suggest that when considering applications of TCE, it is advisable to pay close attention to the lack of authentication and incorporate defences against the problems highlighted in this paper.

关键词： Public key encryption Token-controlled public key encryption Authentication security and privacy Public key encryption Authentication Trichloroethylene

来源：评论

学校读者我要写书评

暂无评论

security Analysis of an Electronic Commerce Protocol Using Casper/FDR2

Security Analysis of an Electronic Commerce Protocol Using C...

引用

第六届中国可信计算与信息安全学术会议

作者： CHANG Yinlong HU Huaping Department of Mathematics and Computer Science/Key Laboratory of Information Security of Network Sys School of Computer Science National University of Defense TechnologyChangsha 410073HunanChina

Researchers have proposed several security protocols to protect the electronic commerce security in these years;however,not all of them are secure *** article extends model checking method with Casper/FDR2 to model and analyze a new electronic *** are found in the protocol and their mechanisms are discussed.A variety of solutions are given to different security *** improved protocol is proven to be robust and secure.

关键词： Casper FDR2 electronic commerce model checking formal analysis

来源：评论

学校读者我要写书评

暂无评论

Productive information system oriented trust chain scheme

引用

Telkomnika 2012年第5期10卷 1093-1100页

作者： Tian, Li-Ye Shen, Chang-Xiang Department of Electronic and Information Engineering Naval Aeronautical and Astronautical University China Beijing Key Laboratory of Trusted Computing College of Computer Science and Technology Beijing University of Technology China State Key Laboratory of Information Security Chinese Academy of Sciences Institute of Software China

Productive information system has high-level security requirements, but Trusted computing Group's solution of trust chain isn't competent. After analysis and comparison of two different trust transfer ways, a new trust chain scheme was designed and its architecture was shown. With independent TPCM as a trust root, this scheme combined the advantages of linear and radial transfer. So that stronger cryptographic algorithm could be adopted by TPCM and applications' trust attenuation decreased a lot. This scheme was described formally by 6 linear temporal logic rules. It was proved that based on these rules, this scheme could transfer trust from trust root to applications. Meanwhile, it could actively report and handle exceptions in trust chain building and system running. Conclusion and future work were given at the end of this manuscript. © 2012 Universitas Ahmad Dahlan.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：