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

IEEE Global Communications Conference

作者： A. M. Rashwan A-E. M. Taha H. S. Hassanein Telecommunications Research Lab School of Computing Queen's University Electrical Engineering Department Alfaisal University

ISBN: (纸本)9781467309202

With the increased popularity of both Internet and mobile computing, several security mechanisms, each using various cryptography functions, have been proposed to ensure that future generation Internets will guarantee both authenticity and data integrity. These functions are usually computationally intensive resulting in large communication delays and energy consumption for the power-limited mobile systems. The functions are also implemented in variety of ways with different resource demands, and may run differently depending on platform, Since communications within the next generation Internet are to be secured, it is important for a mobile system to be suited to the function that provide sufficient communication security while maintaining both power-efficiency and delay requirements. This paper benchmarks mobile systems with cryptographic functions used in message authentication. This paper also introduces a metric, namely apparent processing, that makes benchmarking meaningful for mobile systems with multiple processing cores or utilizing hardware-based cryptography. In addition, this paper discusses some of evaluated functions' computational characteristics observed through benchmarking on selected mobile computing architectures.

关键词： message authentication code message hashing Next generation Internet security Mobile security

来源：评论

学校读者我要写书评

暂无评论

An Area-Efficient Implementation of a message authentication code (MAC) Algorithm for Cryptographic Systems

An Area-Efficient Implementation of a Message Authentication...

引用

IEEE Region 10 Conference

作者： Jingjing Lan Jun Zhou Xin Liu Institute of Microelectronics Agency for Science Technology and Research (A*STAR)

ISBN: (纸本)9781509025985

In this paper, an area-efficient hardware implementation of the lightweight Chaskey algorithm is present. The major targets of this work are resource-constrained devices. An efficient and simple design scheme is employed in order to achieve the goal. Different implementation methods of Chaskey algorithm are investigated. A hardware implementation that requires only 3334.33 gate equivalent is achieved with an operating clock frequency of 1 MHz.

关键词： message authentication code Permutation-Based lightweight ASIC

来源：评论

学校读者我要写书评

暂无评论

LMAC:A Lightweight message authentication code for Wireless Sensor Network

LMAC:A Lightweight Message Authentication Code for Wireless ...

引用

IEEE Global Communications Conference

作者： Amrita Roy Chowdhury Sipra DasBit Dept. of Computer Sc. & Tech. Indian Institute of Engineering Science & Technology

ISBN: (纸本)9781479959532

message authentication codes (MACs) are classically used for preventing unauthorized and corrupted messages from being forwarded in a network. However, inherent energy limitations of wireless sensor networks (WSNs) make the application of most of the state-of-the art MACs unaffordable due to their large computation overhead. Therefore in this paper, in order to cope with this challenging concern, we have proposed a lightweight hash based symmetric key message authentication code. The primary focus is on making the algorithm lightweight so that on using it in achieving secured communication in energy starved networks like WSNs, the resource constrained nodes can successfully run the algorithm. Detailed security analysis shows that LMAC also thwarts passive attack as well as active attack. Finally the comparative usability of the MAC in the said application domain is worked out and that shows the dominance of LMAC over several state-of-the-art MACs. We claim that on an average LMAC requires 61% less overhead compared to its competitors.

关键词： Wireless Sensor Network message authentication code authentication Integrity Passive Attack Active Attack message authentication code Wireless sensor networks Passive attack authentication message authentication Lightweight

来源：评论

学校读者我要写书评

暂无评论

Payload Processor: message authentication for in-vehicle CAN bus using data compression and tag filling

引用

COMPUTER NETWORKS 2025年 259卷

作者： Zhang, Guiqi Shen, Jun Li, Jiangtao Qin, Wutao Li, Yufeng Shanghai Univ Shanghai Peoples R China Purple Mt Labs Nanjing Jiangsu Peoples R China

The Controller Area Network (CAN) is the dominant in-vehicle communication protocol, facilitating information exchange between electronic control units (ECUs). However, its inherent lack of security mechanisms makes it susceptible to cyberattacks. While numerous message authentication code (MAC) methods have been proposed to enhance CAN bus security, existing solutions often reduce the available payload of frames or require hardware modifications to ECUs. In this paper, we propose a novel message authentication method, Payload Processor, which leverages data compression and hash-based MAC. Specifically, we introduce a dictionary-based data compression technique that exploits the sparsity of CAN message payloads. The authentication tag is then seamlessly embedded within the freed payload space. Our proposed method effectively authenticates messages without compromising the available payload or altering hardware. To validate its effectiveness, extensive experiments are conducted using real data collected from 20 distinct vehicles. The results demonstrate that our method significantly improves the compression lower limit compared to existing state-of-the-art compression methods. In terms of security enhancement, our method provides at least 12 bits of authentication data per message in the best-case scenario, without increasing the bus load. In the worst-case scenario, it offers at least 4 bits of authentication data per message. We emphasize that our method serves as an alternative authentication approach and can complement existing solutions in the field.

关键词： Vehicle security Controller Area Network Data compression message authentication code Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Toward Full n-bit Security and Nonce Misuse Resistance of Block Cipher-Based MACs 30th

Toward Full n-bit Security and Nonce Misuse Resistance of Bl...

引用

30th International Conference on the Theory and Application of Cryptology and Information Security

作者： Choi, Wonseok Lee, Jooyoung Lee, Yeongmin Purdue Univ W Lafayette IN 47907 USA Georgia Inst Technol Atlanta GA 30332 USA Korea Adv Inst Sci & Technol Daejeon South Korea DESILO Inc Seoul South Korea

ISBN: (纸本)9789819609468;9789819609475

In this paper, we study the security of MAC constructions among those classified by Chen et al. in ASIACRYPT '21. Precisely, F-B2(EDM) (or EWCDM as named by Cogliati and Seurin in CRYPTO '16), F-B3(EDM), F-B2(SoP) , F-B3(SoP) (all as named by Chen et al.) are proved to be fully secure up to 2(n) MAC queries in the nonce-respecting setting, improving the previous bound of 3n/4 -bit security. In particular, F-B2(So) and F-B3(SoP) enjoy graceful degradation as the number of queries with repeated nonces grows (when the underlying universal hash function satisfies a certain property called multi-xor-collision resistance). To do this, we develop a new tool, namely, extended Mirror theory for two independent permutations with a wide range *** including inequalities. We also present matching attacks on F-B4(EDM) and F-B5(EDM) using O(2(3n/4)) MAC queries and O(1) verification query without using repeated nonces.

关键词： message authentication code beyond birthday bound security Mirror theory

来源：评论

学校读者我要写书评

暂无评论

Security Analysis of CMAC in the Multi-user Model 27th

Security Analysis of CMAC in the Multi-user Model

引用

27th International Conference on Information Security

作者： Zhang, Xiangyang Shen, Yaobin Wang, Lei Shanghai Jiao Tong Univ Shanghai 200240 Peoples R China Xiamen Univ Xiamen 361005 Peoples R China

ISBN: (纸本)9783031757563;9783031757570

CMAC, also known as OMAC1, is an efficient message authentication code (MAC) and has been standardized by NIST and other organizations. It has been widely applied in IPSec, IKE and many wireless networks. Multi-user security captures a practical scenario where an adversary targets a particular service related to multiple users. Lots of MAC constructions have been rigorously analyzed in the multi-user model. However, the concrete analysis for CMAC in the multi-user model is still a blank in the literature. To fill the gap, we provide a concrete multi-user security bound for CMAC in this paper. Our bound is better than that from generic reduction and we observe that the online security of CMAC in the multi-user model does not degrade from the single-user model.

关键词： CMAC OMAC1 Multi-User Security MAC message authentication code

来源：评论

学校读者我要写书评

暂无评论

message authentication codes Against Related-Key Attacks Under LPN and LWE

引用

Chinese Journal of Electronics 2021年第4期30卷 697-703页

作者： CUI Nan LIU Shengli Department of Computer Science and Engineering Shanghai Jiao Tong University State Key Laboratory of Cryptology Westone Cryptologic Research Center

message authentication code(MAC)guarantees the authenticity of messages and is one of the most important primitives in cryptography. We study related-key attacks with which the adversary is able to choose function f and observe the behavior of the MAC under the modified authenticated key f(k), and consider unforgeability of MAC under(selectively) chosen message attack with f(k). We focus on MAC schemes from the Learning parity with noise(LPN) and the Learning with errors(LWE) problem by Kiltz et al. in EUROCRYPT2011. We first prove that the MAC schemes from LPN/LWE can resist key-shift attacks and enlarge the key-shift function set to support a subclass of affine functions.

关键词： Related key attack message authentication code Affine functions

来源：评论

学校读者我要写书评

暂无评论

TuLP: A Family of Lightweight message authentication codes for Body Sensor Networks

引用

Journal of Computer Science & Technology 2014年第1期29卷 53-68页

作者：龚征 Pieter Hartel Svetla Nikova 唐韶华朱博 School of Computer Science South China Normal University Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Department of ESAT/SCD-COSIC Katholieke Universiteit Leuven IEEE School of Computer Science and Engineering South China University of Technology Department of Electrical and Computer Engineering University of Waterloo

A wireless sensor network （WSN） commonly whilst a body sensor network （BSN） must be secured with requires lower level security for public information gathering, strong authenticity to protect personal health information. In this paper, some practical problems with the message authentication codes （MACs）, which were proposed in the popular security architectures for WSNs, are reconsidered. The analysis shows that the recommended MACs for WSNs, e.g., CBC- MAC （TinySec）, OCB-MAC （MiniSec）, and XCBC-MAC （SenSee）, might not be exactly suitable for BSNs. Particularly an existential forgery attack is elaborated on XCBC-MAC. Considering the hardware limitations of BSNs, we propose a new family of tunable lightweight MAC based on the PRESENT block cipher. The first scheme, which is named TukP, is a new lightweight MAC with 64-bit output range. The second scheme, which is named TuLP-128, is a 128-bit variant which provides a higher resistance against internal collisions. Compared with the existing schemes, our lightweight MACs are both time and resource efficient on hardware-constrained devices.

关键词： message authentication code body sensor network low-resource implementation

来源：评论

学校读者我要写书评

暂无评论

A TIGHT BOUND FOR EXHAUSTIVE KEY SEARCH ATTACKS AGAINST message authentication codeS

引用

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 2013年第2期47卷 171-180页

作者： de Sa, Vinicius G. P. Boccardo, Davidson R. Rust, Luiz Fernando Machado, Raphael C. S. Univ Fed Rio de Janeiro Dept Ciencia Comp BR-21941 Rio De Janeiro Brazil

A message authentication code (MAC) is a function that takes a message and a key as parameters and outputs an authentication of the message. MAC are used to guarantee the legitimacy of messages exchanged through a network, since generating a correct authentication requires the knowledge of the key defined secretly by trusted parties. However, an attacker with access to a sufficiently large number of message/authentication pairs may use a brute force algorithm to infer the secret key: from a set containing initially all possible key candidates, subsequently remove those that yield an incorrect authentication, proceeding this way for each intercepted message/authentication pair until a single key remains. In this paper, we determine an exact formula for the expected number of message/authentication pairs that must be used before such form of attack is successful, along with an asymptotical bound that is both simple and tight. We conclude by illustrating a modern application where this bound comes in handy, namely the estimation of security levels in reflection-based verification of software integrity.

关键词： Cryptography message authentication code asymptotic analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：