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

13th Australasian Conference on Information Security and Privacy

作者： Wang, Peng Feng, Dengguo Wu, Wenling Zhang, Liting Chinese Acad Sci Grad Univ State Key Lab Informat Secur Beijing 100049 Peoples R China Chinese Acad Sci Inst Software State Key Lab Informat Secur Beijing 100080 Peoples R China

ISBN: (纸本)9783540699712

There has been extensive research focusing on improving CBC-MAC to operate on variable length messages with less keys and less blockcipher invocations. After Black and Rogaway's XCBC, Moriai and Imai proposed 2-Key XCBC, which replaced the third key of XCBC with its first key. Moriai and Imai "proved" that 2-Key XCBC is secure if the underling blockcipher is a pseudorandom permutation (PRP). Our research shows that it is not the case. The security of 2-Key XCBC can not be proved under the solo assumption of PRP, even if it is a RPR-RK secure against some related-key attack. We construct a special PRP (PRP-RK) to show that the main lemma in [14] is not true and 2-Key XCBC using this PRP (PRP-RK) is totally insecure.

关键词： blockcipher blockcipher mode of operation message authentication code provable security related-key attack

来源：评论

学校读者我要写书评

暂无评论

A One-Pass Mode of Operation for Deterministic message authentication - Security beyond the Birthday Barrier

引用

15th International Workshop on Fast Software Encryption

作者： Yasuda, Kan NTT Corp NTT Informat Sharing Platform Labs Musashino Tokyo 1808585 Japan

ISBN: (纸本)9783540710387

We present a novel mode of operation which iterates a compression function f : {0, 1}(n+b) -> {0, 1}(n) meeting a condition b >= 2n. Our construction can be viewed as a way of domain extension, applicable to a fixed-input-length PRF (pseudo-random function) f(k) : {0, 1}(b) -> {0, 1}(n) meeting the condition b >= 2n, which yields an arbitrary-input-length PRE F-k. : {0, 1}* -> {0, 1}(n). Our construction accomplishes both high security (beyond the birthday barrier) and high efficiency (onepass), with engineering considerations of being stateless, deterministic and single-keyed.

关键词： pseudo-random function domain extension birthday barrier compression function mode of operation message authentication code tweak checksum quasi-random function

来源：评论

学校读者我要写书评

暂无评论

Secure time synchronization in sensor networks

引用

ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY 2008年第4期11卷 23-23页

作者： Ganeriwal, Saurabh Poepper, Christina Capkun, Srdjan Srivastava, Mani B. Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA ETH Dept Comp Sci CH-8092 Zurich Switzerland

Time synchronization is critical in sensor networks at many layers of their design. It enables better duty-cycling of the radio, accurate and secure localization, beamforming, and other collaborative signal processing tasks. These benefits make time-synchronization protocols a prime target of malicious adversaries who want to disrupt the normal operation of a sensor network. In this article, we analyze attacks on existing time synchronization protocols for wireless sensor networks and we propose a secure time synchronization toolbox to counter these attacks. This toolbox includes protocols for secure pairwise and group synchronization of nodes that either lie in the neighborhood of each other or are separated by multiple hops. We provide an in-depth analysis of the security and the energy overhead of the proposed protocols. The efficiency of these protocols has been tested through an experimental study on Mica2 motes.

关键词： algorithms design experimentation security sensor networks time synchronization message authentication code delay

来源：评论

学校读者我要写书评

暂无评论

Study of chaos functions for their suitability in generating message authentication codes

引用

APPLIED SOFT COMPUTING 2007年第3期7卷 1064-1071页

作者： Arumugam, G. Praba, V. Lakshmi Radhakrishnan, S. Arulmigu Kalasalingam Coll Engn Dept Comp Applicat Krishnankoil Tamil Nadu India Madurai Kamaraj Univ Dept Comp Sci Madurai Tamil Nadu India Arulmigu Kalasalingam Coll Engn Dept Comp Sci & Engn Krishnankoil Tamil Nadu India

Chaos functions are mainly used to develop mathematical models of non-linear systems. They have attracted the attention of many mathematicians owing to their extremely sensitive nature to initial conditions and their immense applicability to problems in daily life. In this paper, two widely used chaos functions the Logistic equation and the Lorenz equation are taken and analyzed. We found that these equations exhibit characteristics, which satisfy the expected properties of message authentication code ( MAC). We also provide a novel approach of generating MAC with higher security but with smaller key size. This is achieved by the design of the algorithm using variable Initialization Vectors ( IV) instead of the constant IVs. Variable IV adds strength to the security of the message. The experimental results show that it satisfies the expected characteristics of a message authentication code generation algorithm. (c) 2006 Elsevier B. V. All rights reserved.

关键词： message authentication code chaos initialization vector

来源：评论

学校读者我要写书评

暂无评论

Applying Security Algorithms against Cyber Attacks in the Distribution Automation System

Applying Security Algorithms against Cyber Attacks in the Di...

引用

2008 IEEE/PES Transmission & Distribution Conference & Exposition, part 1

作者： I. H. Lim S. Hong M. S. Choi S. J. Lee S. W. Lee B. N. Ha Next-generation Power Technology Center Department of Electrical Engineering and Computer Software Engineering Myongji University Yongin si South Korea KEPRI Daejeon South Korea

As the communication technology weighs heavily in the power system, so the security issues becomes major concerns. So far most security research has focused on the SCADA system. In this paper we consider the security problems in the network environment of the distribution automation system (DAS) which is much different from the SCADA system. First we analyze the types of cyber threats in many applications of the distribution system, and formulate the security goals. Then we propose the efficient security algorithms to achieve these goals. The algorithm avoids complex computation of any encryption algorithm, considering the resource-constraint network nodes. We also propose the efficient secret key distribution algorithm without resort to the public key encryption. Finally we demonstrate the feasibility of the proposed security protocol by experiment.

关键词： Distribution automation Distribution network security Cyber attack Security algorithm Key distribution message authentication code

来源：评论

学校读者我要写书评

暂无评论

Design and performance analysis of electronic seal protection systems based on AES

引用

ETRI JOURNAL 2007年第6期29卷 755-768页

作者： Kim, Dong Kyue Lee, Mun-Kyu Kang, You Sung Chung, Sang-Hwa Ybon, Won-Ju Min, Jung-Ki Kim, Howon Hanyang Univ Div Elect & Comp Engn Seoul 133791 South Korea Inha Univ Sch Comp Sci & Engn Inchon South Korea ETRI Informat Security Res Div Taejon South Korea Pusan Natl Univ Dept Comp Engn Pusan South Korea

A very promising application of active RFID systems is the electronic seal, an electronic device to guarantee the authenticity and integrity of freight containers. To provide freight containers with a high level of tamper resistance, the security of electronic seals must be ensured. In this paper, we present the design and implementation of an electronic seal protection system. First, we propose the eSeal Protection Protocol (ePP). Next, we implement and evaluate various cryptographic primitives as building blocks for our protocol. Our experimental results show that AES-CBC-MAC achieves the best performance among various schemes for message authentication and session key derivation. Finally, we implement a new electronic seal system equipped with ePP, and evaluate its performance using a real-world platform. Our evaluation shows that ePP guarantees a sufficient performance over an ARM9-based interrogator.

关键词： active RFID electronic seal (eSeal) eSeal protection protocol AES pseudorandom function message authentication code

来源：评论

学校读者我要写书评

暂无评论

"Sandwich" is indeed secure: How to authenticate a message with just one hashing

引用

12th Australasian Conference on Information Security and Privacy

作者： Yasuda, Kan NTT Corp NTT Informat Sharing Platform Labs Kanagawa 2390847 Japan

ISBN: (纸本)9783540734574

This paper shows that the classical "Sandwich" method, which prepends and appends a key to a message and then hashes the data using Merkle-Damgard iteration, does indeed provide a secure message authentication code (MAC). The Sandwich construction offers a single-key MAC which can use the existing Merkle-Damgard. implementation of hash functions as is, without direct access to the compression function. Hence the Sandwich approach gives us an alternative for HMAC particularly in a situation where message size is small and high performance is required, because the Sandwich scheme is more efficient than HMAC: it consumes only two blocks of "waste" rather than three as in HMAC, and it calls the hash function only once, whereas HMAC requires two invocations of hash function. The security result of the Sandwich method is similar to that of HMAC;namely, we prove that the Sandwich construction yields a PRF(Pseudo-Random Functions)-based MAC, provided that the underlying compression function satisfies PRF properties. In theory, the security reduction of the Sandwich scheme is roughly equivalent to that of HMAC, but in practice the requirements on the underlying compression function look quite different. Also, the security of the Sandwich construction heavily relies on the filling and padding methods to the data, and we show several ways of optimizing them without losing a formal proof of security.

关键词： message authentication code MAC hash function compression function Merkle-Damgard envelope MAC RFC1828 HMAC

来源：评论

学校读者我要写书评

暂无评论

Multilane HMAC - Security beyond the birthday limit

Multilane HMAC - Security beyond the birthday limit

引用

8th Annual International Conference on Cryptology in India

作者： Yasuda, Kan NTT Corp NTT Informat Sharing Platform Labs Tokyo 1808585 Japan

ISBN: (纸本)9783540770251

HMAC is a popular MAC (message authentication code) that is based on a cryptographic hash function. HMAC is provided with a formal proof of security, in which it is proven to be a PRF (Pseudo-Random Function) under the condition that its underlying compression function is a PRF. Nonetheless, the security of HMAC is limited by a birthday attack, that is, HMAC using a compression function with n-bit output gets forged after about 2(n/2) queries. In this paper we resolve this problem by introducing novel construction we call L-Lane HMAC. Our construction is provided with concrete-security reduction accomplishing a security guarantee well beyond the birthday limit. L-Lane HMAC requires more invocations to the compression function than the conventional HMAC, but the performance decline is smaller than those of previous constructs. In addition, L-Lane HMAC inherits the design principles of the original HMAC, such as single-key usage and off-the-shelf hash-function calls.

关键词： message authentication code hash function birthday attack multilane NMAC HMAC failure-friendly

来源：评论

学校读者我要写书评

暂无评论

Analysis and design of secure watermark-based authentication systems

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2006年第1期1卷 43-55页

作者： Fei, Chuhong Kundur, Deepa Kwong, Raymond H. Univ Toronto Edward S Rogers Sr Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

This paper focuses on a coding approach for effective analysis and design of secure watermark-based multimedia authentication systems. We provide a design framework for semi-fragile watermark-based authentication such that both objectives of robustness and fragility are effectively controlled and achieved. Robustness and fragility are characterized as two types of authentication errors. The authentication embedding and verification structures of the semi-fragile schemes are derived and implemented using lattice codes to minimize these errors. Based on the specific security requirements of authentication, cryptographic techniques are incorporated to design a secure authentication code structure. Using nested lattice codes, a new approach, called MSB-LSB decomposition, is proposed which we show to be more secure than previous methods. Tradeoffs between authentication distortion and implementation efficiency of the secure authentication code are also investigated. Simulations of semi-fragile authentication methods on real images demonstrate the effectiveness of the MSB-LSB approach in simultaneously achieving security, robustness, and fragility objectives.

关键词： digital watermarking lattice codes message authentication code multimedia authentication semi-fragile authentication

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of pseudorandom functions for electronic seal protection protocols

引用

7th International Workshop on Information Security Applications

作者： Lee, Mun-Kyu Min, Jung Ki Kang, Seok Hun Chung, Sang-Hwa Kim, Howon Kim, Dong Kyue Inha Univ Sch Comp Sci & Engn Inchon 402751 South Korea Pusan Natl Univ Dept Comp Engn Busan South Korea Elect & Telecommun Res Inst Daejeon South Korea Hanyang Univ Div Elect & Comp Engn Seoul South Korea

ISBN: (纸本)9783540710929

One of the most promising applications of active RFID tags is electronic seal, which is an electronic device to guarantee the authenticity and integrity of freight containers and also provides physical protection like a lock. There are already many commercial electronic seal products and ongoing standardization activities such as ISO-18185 drafts. While electronic seals can provide freight containers with a high level of tamper resistance, the security problem of electronic seal itself should be solved, and a feasible solution would be to use symmetric key cryptography based primitives such as block ciphers and message authentication codes (MACs). This kind of approach has already been used in many security-related standards and it requires the implementation of pseudorandom functions (PRFs) for key derivation and authentication. In this paper, we consider secure and efficient implementation of PRFs on electronic seals and interrogators. We implement block cipher based PRFs and hash based PRFs and compare them from the viewpoint of efficiency. Since practical PRFs can be directly implemented using MACs, we consider implementation of various message authentication schemes;HMAC-MD5, HMAC-SHA1, AES-CBC-MAC, AES-CMAC and AESXCBC-MAC. For interrogators, we design FPGA modules for these MAC algorithms since an interrogator has to guarantee high throughput to communicate with many electronic seals simultaneously. According to our analysis, AES based MACs consume smaller areas and their throughputs are significantly higher than hash based ones. For electronic seals, we implement MAC algorithms as a form of software module (C and assembly codes) over a small-scale microcontroller. Our experimental results show that AES based modules show much better performance, which coincide with the results in hardware implementation. Finally, we improve the above implementations further, where we concentrate on the optimization of AES based MACs. We use several well-known techniques such

关键词： RFID electronic seal pseudorandom function message authentication code AES

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：