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

A general construction of tweakable block ciphers and different modes of operations

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第5期54卷 1991-2006页

作者： Chakraborty, Debrup Sarkar, Palash CINVESTAV IPN Dept Comp Sci Mexico City 07360 DF Mexico Indian Stat Inst Appl Stat Unit Kolkata 700108 India

This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway's TBC construction by working over a ring R and by the use of a masking sequence of functions. The ring R can be instantiated as either GF(2(n)) or as Z(2n). Further, over GF(2(n)), efficient instantiations of the masking sequence of functions can be done using either a binary linear feedback shift register (LFSR);a powering construction;a cellular automata map;or by using a word-oriented LFSR. Rogaway's TBC construction was built from the powering construction over GF(2(n)). Our second contribution is to use the general TBC construction to instantiate constructions of various modes of operations including authenticated encryption (AE) and message authentication code (MAC). In particular, this gives rise to a family of efficient one-pass AE modes of operation. Out of these, the mode of operation obtained by the use of word-oriented LFSR promises to provide a masking method which is more efficient than the one used in the well known AE protocol called OCB1.

关键词： authenticated encryption with associated data message authentication code modes of operations tweakable block cipher (TBC)

来源：评论

学校读者我要写书评

暂无评论

MAC Based Energy Efficiency in Cooperative Cognitive Radio Network in the Presence of Malicious Users

引用

IEEE ACCESS 2018年 6卷 5666-5677页

作者： Dai, Jianxin Liu, Juan Pan, Cunhua Wang, Jiangzhou Cheng, Chonghu Huang, Zhiliang Nanjing Univ Posts & Telecommun Sch Sci Nanjing 210023 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing 210003 Jiangsu Peoples R China Queen Mary Univ London London E1 4NS England Univ Kent Sch Engn & Digital Arts Canterbury CT2 7NZ Kent England Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Peoples R China

In cognitive radio networks, cooperative spectrum sensing (CSS) is generally adopted for improving spectrum sensing accuracy to increase spectrum utilization and avoid interference with the primary users. However, some malicious secondary users (SUs) may affect the CSS performance by inducing false observation bits for fusion. The message authentication code (MAC) is a promising technique to avoid the damage from the spectrum sensing data falsification (SSDF) attacks. In this paper, as both the more spectrum sensing nodes and the MAC reporting bits result in extra energy consumption, we propose an energy efficiency model to capture the effects of the length of MAC and the number of cooperative SUs under independent and collaborative SSDF attacks, respectively, and analyze the existence of the optimal length of MAC and the optimal number of cooperative SUs that can achieve the maximum value of energy efficiency, respectively. Simulation results are provided to show that the CSS scheme based on MAC can resist SSDF attacks and the accuracy of the theoretical analysis is also validated.

关键词： Cooperative spectrum sensing spectrum sensing data falsification (SSDF) attack message authentication code energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

More Reliable Approach for Detecting Data Alterations in Communication Networks

引用

INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS 2016年第6期10卷 55-63页

作者： Dhawan, Vikas Gaba, Gurjot Singh Lovely Profess Univ Discipline Elect & Commun Engn Jalandhar 144411 India

Security of precious data is the most critical design parameter of a communication network. Applications like online banking and military information exchange requires more concern over security regardless of other design issues like power and energy consumption. Data alterations in some applications can lead to severe irreparable losses. This paper presents a novel and reliable Hash algorithm which inherits the basic architecture of MD5. Performance of proposed technique is compared with existing MD5, SHA-160, SHA-256 and SHA-384 techniques through statistical test suite for random numbers. Results reveal that the suggested technique is more effective in terms of randomness than the MD5, SHA-160, SHA-256 and SHA-384. The proposed technique thus finds its applicability in the sensitive data environment.

关键词： Hash Data Integrity message Digest message authentication code Security

来源：评论

学校读者我要写书评

暂无评论

Parallel Sponge-Based Authenticated Encryption With Side-Channel Protection and Adversary-Invisible Nonces

引用

IEEE ACCESS 2022年 10卷 50819-50838页

作者： Jimale, Mohamud Ahmed Z'aba, Muhammad Reza Kiah, Miss Laiha Binti Mat Idris, Mohd Yamani Idna Jamil, Norziana Mohamad, Moesfa Soeheila Rohmad, Mohd Saufy Univ Malaya Fac Comp Sci & Informat Technol Dept Comp Syst & Technol Kuala Lumpur 50603 Malaysia Univ Tenaga Nas Coll Comp & Informat Kajang 43000 Selangor Malaysia MIMOS Berhad Informat Secur Lab Kuala Lumpur 57000 Malaysia Univ Teknol MARA Fac Elect Engn Shah Alam 40450 Selangor Malaysia

Since its birth in 2000, authenticated encryption (AE) has been a hot research topic, and many new features have been proposed to boost its security or performance. The Block cipher was the dominant primitive in constructing AE schemes, followed by stream ciphers and compression functions until the sponge construction emerged in 2011. Sponge-based AE schemes provide functional characteristics such as parallelizability, incrementality, and being online. They also offer security features for protection against active or passive adversaries. Currently, there exist parallel sponge-based AE schemes, but they are not protected against simple power analysis (SPA) and differential power analysis (DPA). On the other hand, sponge-based AE schemes that protect against such attacks are serial and cannot be parallelized. Furthermore, sponge-based AE schemes handle the nonces in a way that could allow misuse. So, sponge-based AE schemes that hide the nonce from adversaries are also an open problem. This work aims to bridge these gaps by proposing a parallel sponge-based AE with side-channel protection and adversary-invisible nonces (PSASPIN), using parallel fresh rekeying and the duplex mode of the sponge construction. A leveled implementation is used to implement the key generation part using a pseudorandom function (PRF) based on the Galois field multiplication. The data processing (the rekeyed) part is implemented using the sponge-based duplex mode. Finally, the security proof of the proposed scheme is provided using game-based theory according to the PRP/PRF switching lemma, and its performance is analyzed.

关键词： Cryptography Security Encryption Ciphers NIST codes authentication Integrity authenticated encryption authentication confidentiality CAESAR competition message authentication code NIST-LW competition cryptographic sponge function

来源：评论

学校读者我要写书评

暂无评论

Secured routing in wireless sensor networks using fault-free and trusted nodes

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2016年第1期29卷 170-193页

作者： Devanagavi, Geetha D. Nalini, N. Biradar, Rajashekhar C. Jain Univ Reva Inst Technol & Management Bangalore 560064 Karnataka India Nitte Meenakshi Inst Technol & Management Dept Comp Sci & Engn Bangalore Karnataka India Reva Inst Technol & Management Dept Informat Sci & Engn Bangalore 560064 Karnataka India

Wireless sensor network (WSN) should be designed such that it is able to identify the faulty nodes, rectify the faults, identify compromised nodes from various security threats, and transmit the sensed data securely to the sink node under faulty conditions. In this paper, we propose an idea of integrating fault tolerance and secured routing mechanism in WSN named as fault tolerant secured routing: an integrated approach (FASRI) that establishes secured routes from source to sink node even under faulty node conditions. Faulty nodes are identified using battery power and interference models. Trustworthy nodes (non-compromised) among fault-free nodes are identified by using agent-based trust model. Finally, the data are securely routed through fault-free non-compromised nodes to sink. Performance evaluation through simulation is carried out for packet delivery ratio, hit rate, computation overhead, communication overhead, compromised node detection ratio, end-to-end delay, memory overhead, and agent overhead. We compared simulation results of FASRI with three schemes, namely multi-version multi-path (MVMP), intrusion/fault tolerant routing protocol (IFRP) in WSN, and active node-based fault tolerance using battery power and interference model (AFTBI) for various measures and found that there is a performance improvement in FASRI compared with MVMP, IFRP, and AFTBI. Copyright (c) 2014 John Wiley & Sons, Ltd.

关键词： wireless sensor networks active nodes battery power model interference model software agents trust model message authentication code secured routing

来源：评论

学校读者我要写书评

暂无评论

Arbitrated unconditionally secure authentication scheme with multi-senders

引用

INFORMATION PROCESSING LETTERS 1998年第4期65卷 189-193页

作者： Hwang, TL Wang, CH Natl Cheng Kung Univ Inst Informat Engn Tainan 70101 Taiwan

Previously, Desmedt and Seberry developed a practical proven secure authentication scheme with arbitration. Their scheme, however, only provides an environment for a single sender. Nevertheless, in real applications, many senders may collaboratively send a message to the receiver and convince the receiver that the message is actually transmitted by them. In this paper, we present an efficient scheme which (a) is unconditionally secure against denial by the senders having sent a message and (b) reduces the size of evidence for the authentic message and the number of enciphering keys to be held by the senders in a multi-senders environment. (C) 1998 Published by Elsevier Science B.V.

关键词： authentication scheme unconditionally secure message authentication code safety/security in digital systems

来源：评论

学校读者我要写书评

暂无评论

A note on the fragility of the "Michael" message integrity code

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2004年第5期3卷 1459-1462页

作者： Wool, A Tel Aviv Univ Dept Elect Engn Syst IL-69978 Ramat Aviv Israel

The IEEE 802.11 wireless local area network standard did not incorporate a cryptographic message integrity code into its wired equivalent privacy (WEP) protocol, and relied upon CRC-32 for message integrity. This was shown to be completely insecure since WEP uses a stream cipher (RC4) for encryption. The latest IEEE 802.11i draft addresses this, and other, weaknesses discovered in WEP. IEEE 802.11i suggests three new modes of operation: two based on the Advanced Encryption Standard cipher and one [temporal key integrity protocol (TKIP)] still based on RC4. The TKIP mode is intended for use on legacy hardware, which is computationally weak. TKIP uses a new, keyed, 64-b, message integrity code called Michael. In this letter, we highlight a weakness in Michael and suggest a simple fix.

关键词： message authentication code wireless security

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：