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

A new multi-linear universal hash family

DESIGNS codeS AND CRYPTOGRAPHY 2013年第3期69卷 351-367页

作者： Sarkar, Palash Indian Stat Inst Appl Stat Unit Kolkata 700108 India

A new universal hash family is described which generalises a previously known multi-linear hash family. messages are sequences over a finite field while keys are sequences over an extension field . A linear map from to itself is used to compute the output digest. Of special interest is the case q = 2. For this case, we show that there is an efficient way to implement using a tower field representation of . From a practical point of view, the focus of our constructions is small hardware and other resource constrained applications. For such platforms, our constructions compare favourably to previous work.

关键词： Universal hash function Tower field message authentication code Resource constrained devices

来源：评论

学校读者我要写书评

暂无评论

Integrity in Embedded Control Networks

引用

IEEE SECURITY & PRIVACY 2013年第3期11卷 61-63页

作者： Koopman, Philip Szilagyi, Christopher Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

As threats from malicious attackers increase, integrity approaches in networked embedded systems will have to evolve to provide both the security and safety aspects of integrity in a unified approach. And they"ll have to do it on a shoestring, using only a few bits per message. To help achieve this, you can exploit two embedded-systems characteristics: the periodic sampling of messages and the system"s inertia.

关键词： Computer hacking Computer security Computer viruses Controller Area Network Internet MAC Malware Online services authentication computer safety integrity message authentication code networked embedded systems spoofing

来源：评论

学校读者我要写书评

暂无评论

The Security of Key Derivation Functions in WINRAR

引用

JOURNAL OF COMPUTERS 2013年第9期8卷 2262-2268页

作者： Chen, Jie Zhou, Jun Pan, Kun Lin, Shuqiang Zhao, Cuicui Li, Xiaochao Xiamen Univ Dept Elect Engn Xiamen Peoples R China

In various versions of WINRAR, the file security is mainly protected by user authentication and files encryption. Password based key derivation function (PBKDF) is the core of the WINRAR security mechanism. In this paper, the security of PBKDF algorithm and the encrypted file in WINRAR are analyzed by the Game-Playing approach. We show the upper boundary of the Adversary's Advantage over the random function. With the theoretical derivation, the actual safety of the WINRAR encrypted files has been discussed. According to the latest developments for GPU-based exhaustive password search attacks, we do some experiments and draw a conclusion that if the length of password is longer than 6, the WINRAR and later versions are secure.

关键词： message authentication code Key Derivation Functions Provable Security Adversary's Advantage Random Oracle Model

来源：评论

学校读者我要写书评

暂无评论

A Double Key-sharing Based False Data Filtering Scheme in Wireless Sensor Networks

引用

JOURNAL OF COMPUTERS 2013年第2期8卷 388-398页

作者： Sun, Qian Wu, Min Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China

In wireless sensor networks, the attackers can easily inject false data reports from compromising nodes. Previous approaches to filtering false data reports, notably statistical en-route filtering, usually share keys among the nodes in low probabilities, and rely on the forwarding nodes to verify the correctness of the MACs (message authentication codes) carried in each report. Although the results of the notably approach are conspicuous, there still exists several drawbacks. Firstly, compromised nodes from different regions can collaboratively forge false reports such that forwarding nodes cannot detect and filter for not binding the key to their geographical coordinate. Secondly, false reports have to travel several hops before being detected and filtered. In this paper, we propose a Double key-Sharing based false data Filtering scheme (DSF) to cope with those problems. In DSF, nodes are grouped into clusters after deployment, and a blocked region is formed through pair-wise keys closer to the source node. When an event occurs, a legitimate report must carry two types of MACs. In addition, we bind the symmetric keys with the clusters by pre-distributing the key indexes of in-cluster nodes to forwarding nodes. In filtering phase, each forwarding node has to validate not only the correctness of the MACs carried in the report, but also the legitimacy of related locations of all detecting nodes. Moreover, the tail of the data reports can be dropped just outside the blocked region. Extensive analyses and simulations demonstrate that DSF can detect and filter out false reports forged by multiple compromised nodes from different geographical regions, and also outperforms existing schemes in terms of filtering efficiency and energy consumption.

关键词： wireless sensor network double key-sharing false data filtering message authentication code

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Secure Communication Protocol for Vehicular Ad Hoc Networks

Privacy Preserving Secure Communication Protocol for Vehicul...

引用

7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)

作者： Mikki, Mohammad Mansour, Yousif M. Yim, Kangbin Islamic Univ Gaza Dept Comp Engn Gaza Israel Governmental Comp Ctr Gaza Israel Soonchunhyang Univ Dept Informat Secur Engn Soonchunhyang South Korea

ISBN: (纸本)9780769549743

Vehicular Ad-hoc Networks (VANETs) have attracted much attention recently because of its applications and features. The main purpose of adopting VANET technology is to increase safety and efficiency on roads. In this paper, a privacy preserving secure communication protocol (PPSCP) for VANETs is proposed. PPSCP authenticates safety messages anonymously to preserve vehicle privacy and prevent unauthorized tracking, balances between privacy and identification, and makes a new efficient vehicle revocation scheme that reduces revocation lists size. The protocol is resistant to attacks like replay attack and Denial of Service (DoS) attack. A security performance analysis to compare between PPSCP and S3P was performed through simulation which demonstrates that PPSCP is more robust, efficient, secure and provides more privacy preservation and liability.

关键词： VANET privacy message authentication code certificate authority cryptography

来源：评论

学校读者我要写书评

暂无评论

Ultra-lightweight authentication protocol based on distribution terminal fingerprint

引用

2nd International Conference on Energy, Environment and Sustainable Development (EESD 2012)

作者： Cheng Chunling Wang Yashi Sun Chunju Zhang Zhihua Wang Jiangning Nanjing Univ Posts & Telecommun Coll Comp Nanjing 210003 Jiangsu Peoples R China

ISBN: (纸本)9783037855522

With the development of information technology in power industry, information security of the distribution automation system is facing increasing challenge. To meet the device authentication demand and the limited resources in power distribution terminal, the concept of distribution terminal fingerprint is presented according to the physical and behavioral features in terminal. And then, an ultra-lightweight mutual authentication protocol based on the message authentication code algorithm is proposed. The message authentication code of the messages sent by both communication parties is calculated with the distribution terminal fingerprint as the key to achieve mutual authentication of the terminal and the master station without any cryptosystems. Finally, security and performance analysis is given. The results show that the proposed protocol can provide mutual authentication of the communicating parties, resist several attacks with small amount of calculation and simple protocol. Therefore, it can meet the resource requirements of the distribution terminal.

关键词： distribution automation authentication protocol message authentication code distribution terminal fingerprint ultra-lightweight

来源：评论

学校读者我要写书评

暂无评论

MISRs for Fast authentication of Long messages

MISRs for Fast Authentication of Long Messages

引用

16th Euromicro Conference on Digital System Design (DSD)

作者： Katti, Rajendra S. Sule, Rucha N Dakota State Univ Dept ECE Fargo ND 58105 USA

ISBN: (纸本)9780769550749

In this paper we investigate the performance of using Multiple Input Shift Registers (MISRs) for message authentication. Linear Feedback Shift Registers (LFSRs) have been shown to be an efficient mechanism for authentication. Inspired by literature in digital system testing we present the use of MISRs for authentication. Such schemes are useful in sensor networks, the smart-grid, and multimedia authentication. n-bit MISRs have n, s-bit input streams while LFSRs have only one input bit stream. Therefore, MISRs present a potential for an n-fold speedup while maintaining similar hardware complexity as an LFSR. We first show that the MISR is a hash function that is epsilon-almost universal, epsilon-opt secure, and epsilon-balanced. We then use a pseudorandom function along with an MISR to generate a message authentication code (MAC) that is provably secure. We compare the software and hardware implementation of our MAC with other schemes. In software our scheme requires 8ms to compute a tag for a message of size 4MB (megabytes). In hardware our method results in a speedup of at least 10 over other methods.

关键词： message authentication code hash functions multiple input shift registers provable security

来源：评论

学校读者我要写书评

暂无评论

A combined approach to ensure data security in cloud computing

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2012年第6期35卷 1831-1838页

作者： Sood, Sandeep K. GNDU Dept Comp Sci & Engn Gurdaspur 143521 Punjab India

Cloud computing is a forthcoming revolution in information technology (IT) industry because of its performance, accessibility, low cost and many other luxuries. It is an approach to maximize the capacity or step up capabilities vigorously without investing in new infrastructure, nurturing new personnel or licensing new software. It provides gigantic storage for data and faster computing to customers over the internet. It essentially shifts the database and application software to the large data centers, i.e., cloud, where management of data and services may not be completely trustworthy. That is why companies are reluctant to deploy their business in the cloud even cloud computing offers a wide range of luxuries. Security of data in cloud is one of the major issues which acts as an obstacle in the implementation of cloud computing. In this paper, a frame work comprising of different techniques and specialized procedures is proposed that can efficiently protect the data from the beginning to the end, i.e., from the owner to the cloud and then to the user. We commence with the classification of data on the basis of three cryptographic parameters presented by the user, i.e.. Confidentiality (C), Availability (A) and Integrity (I).The strategy followed to protect the data utilizes various measures such as the SSL (Secure Socket Layer) 128-bit encryption and can also be raised to 256-bit encryption if needed, MAC (message authentication code) is used for integrity check of data, searchable encryption and division of data into three sections in cloud for storage. The division of data into three sections renders supplementary protection and simple access to the data. The user who wishes to access the data is required to provide the owner login identity and password, before admittance is given to the encrypted data in Section 1, Section 2, and Section 3. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Cloud security Encryption message authentication code Virtualization Secured socket layer

来源：评论

学校读者我要写书评

暂无评论

A key distribution scheme using network coding for mobile ad hoc network

引用

SECURITY AND COMMUNICATION NETWORKS 2012年第1期5卷 59-67页

作者： Liu, Jianwei Du, Ruiying Chen, Jing He, Kun Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Wuhan Univ Sch Comp Sci Wuhan 430072 Peoples R China

Network coding offers an excellent solution for maximizing throughput in various networks. Because of its simplicity and high efficiency, the idea of network coding can also be used for designing lightweight key distribution schemes for wireless ad hoc network. This paper presents a key distribution scheme that exploits the inherent security properties of network coding. The new scheme relies on simple XOR network coding operations to provide data confidentiality and uses message authentication codes to guarantee the integrity of the distributed keys. We also show that our scheme can resist a series of attacks in wireless ad hoc network and has better performance compared with previous schemes proposed in the literature. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： network coding key distribution scheme message authentication code wireless ad hoc network

来源：评论

学校读者我要写书评

暂无评论

CSP-DHIES: a new public-key encryption scheme from matrix conjugation

引用

SECURITY AND COMMUNICATION NETWORKS 2012年第7期5卷 809-822页

作者： Pan, Ping Wang, Lihua Wang, Licheng Li, Lixiang Yang, Yixian Beijing Univ Posts & Telecommun Informat Secur Ctr State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Natl Inst Informat & Commun Technol NICT Koganei Tokyo 1848795 Japan

We propose a new public-key cryptosystem named conjugacy search problem-based DiffieHellman integrated encryption scheme (CSP-DHIES), by using conjugation-related assumptions for a special monoid of matrices of truncated multi-variable polynomials over the ring Z12 where the CSP is assumed to be intractable. Our construction can be viewed as the first noncommunicative variant of the well-known DHIES cryptosystem. Under the assumptions of the intractability of the CSP-based hash DiffieHellman problem and the CSP-based oracle DiffieHellman problem, our scheme is provably secure against both chosen-plaintext attacks and secure against chosen-ciphertext attacks. Our proofs are constructed in the standard model. We also discuss the possibility of implementing our proposal using braid groups. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： conjugacy search problem (a)symmetric encryption message authentication code truncated multi-variable polynomials over a ring braid groups

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：