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

6th International Conference on Anti-Counterfeiting, Security and Identification (ASID)

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

ISBN: (纸本)9781467321433

In Microsoft Office, the file security is mainly protected by user authentication and files encryption. The cryptographic keys are usually derived from a password. Thus, password based key derivation function (PBKDF) is the core of the security scheme. However, the security of the PBKDF of Office is not yet ensured. In this paper, the PBKDF algorithm is analyzed through the game-playing approach and upper bounded of the Adversary's Advantage over the KDF and random function. Based on that, we discussed the practical safety of the Office encrypted files, and show that Office is secure when the user password is longer than 6 characters.

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

来源：评论

学校读者我要写书评

暂无评论

On Generic Construction for Private Designated Verifier Signatures

On Generic Construction for Private Designated Verifier Sign...

引用

8th International Conference on Computational Intelligence and Security (CIS)

作者： Gao, Wei Wang, Zhenyou Li, Fei Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China Ludong Univ Sch Math & Informat Yantai Peoples R China Guangdong Univ Technol Fac Appl Math Guangzhou Peoples R China Ludong Univ Sch Math & Informat Yantai Peoples R China

ISBN: (纸本)9780769548968;9781467347259

This paper finds the same framework underlying some designated verifier signature schemes: each of them can be seen as a message authentication code scheme (MAC) where the private key is generated by the Diffie-Hellman key agreement protocol. So all these schemes could have been very simply constructed. Utilizing this framework, we can modularly construct private designated verifier signature schemes with better efficiency.

关键词： Designated verifier signature message authentication code Diffie-Hellman assumption

来源：评论

学校读者我要写书评

暂无评论

Throughput optimization of the cipher message authentication code

Throughput optimization of the cipher message authentication...

引用

15th International Conference on Digital Signal Processing

作者： Michail, H. E. Kakarountas, A. P. Selimis, G. Goutis, C. E. Univ Patras Dept Elect & Comp Engn VLSI Design Lab GR-26110 Patras Greece

ISBN: (纸本)9781424408818

A new algorithm for producing message authenticating code (MAC) was recently proposed by NIST. The MAC protects both a message's integrity - by ensuring that a different MAC will be produced if the message has changed - as well as its authenticity - because only someone who knows the secret key could be able to generate a valid MAC. The proposed process incorporates a FIPS approved and secure block cipher algorithm which was standardized by NIST in May, 2005. The first implementation of the CMAC is presented in this paper. Throughput has been the main design target. The proposed implementation goes one step further introducing an optimized ciphering core to achieve competitive throughput for CMAC, compared to alternative MACs.

关键词： message authentication code CMAC AES hardware implementation

来源：评论

学校读者我要写书评

暂无评论

Anonymous Communication in Ubiquitous Computing Environments

引用

WIRELESS PERSONAL COMMUNICATIONS 2011年第1期56卷 21-36页

作者： Park, Min-Ho Son, Ju-Hyung Seo, Seung-Woo Seoul Natl Univ Sch Elect Engn & Comp Sci Seoul 151742 South Korea

Wireless networks such as WLANs which have already been commonplace will play an important role in providing the last mile access for ubiquitous computing environments. However, the wireless access technologies are accompanied with some security vulnerabilities that stem from the broadcasting medium. Although most of the vulnerabilities can be solved by the existing security countermeasures, there still exists the vulnerability of a message header. In most wireless access networks, the header part of each message, including the source and destination addresses, is transmitted in a plain-text format. This can be a security hole with adversaries collecting the revealed header information for a traffic analysis attack that can breach the privacy of the transmitter and receiver. In this paper, we focus on describing a solution to this problem, namely, the undesirable loss of privacy. Our main idea is to integrate address information with a conventional message authentication code (MAC) and to replace both fields of the address and the MAC by an integrated code called the Address-embedded MAC (AMAC). Through detailed performance and security analysis of our scheme, we show that our AMAC scheme can guarantee privacy of a network while providing a provable security level with less overhead.

关键词： Ubiquitous computing Anonymous communication message authentication code Address-embedded MAC Traffic analysis attack

来源：评论

学校读者我要写书评

暂无评论

CIPHER BLOCK BASED authentication MODULE: A HARDWARE DESIGN PERSPECTIVE

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2011年第2期20卷 163-184页

作者： Michail, Harris E. Schinianakis, Dimitrios Goutis, Costas E. Kakarountas, Athanasios P. Selimis, Georgios Univ Patras Dept Elect & Comp Engn GR-26500 Patras Greece Univ Cent Greece Dept Comp Sci & Biomed Informat GR-35100 Lamia Greece IMEC Holst Ctr NL-5656 AE Eindhoven Netherlands

message authentication codes (MACs) are widely used in order to authenticate data packets, which are transmitted thought networks. Typically MACs are implemented using modules like hash functions and in conjunction with encryption algorithms (like Block Ciphers), which are used to encrypt the transmitted data. However NIST in May 2005 issued a standard, addressing certain applications and their needs, defining a way to implement MACs through FIPS-approved and secure block cipher algorithms. In this paper the best performing implementation of the CMAC standard is presented, in terms of throughput, along with an efficient AES design and implementation.

关键词： message authentication code VLSI cryptography

来源：评论

学校读者我要写书评

暂无评论

CBCR:CBC MAC with rotating transformations

引用

Science China(Information Sciences) 2011年第11期54卷 2247-2255页

作者： ZHANG LiTing 1,2,WU WenLing 1,ZHANG Lei 1 & WANG Peng 21 State Key Laboratory of Information Security,Institute of Software,Chinese Academy of Sciences,Beijing 100190,China 2 Graduate University of Chinese Academy of Sciences,Beijing 100049,China 1. State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China2. Graduate University of Chinese Academy of Sciences Beijing 100049 China

message authentication codes (MACs) are widely used to protect data integrity and data origin authentication in *** this paper,we propose a new block-cipher-based MAC algorithm,CBCR,with provable security for arbitrary-length *** adopts rotating operations in the end of cipherblock-chaining structure,and it appends fixed-length prefixes to all messages,which implies flexible usages in *** example,these fixed-length prefixes can be filled with some security parameters,message redundancies,*** also propose CBCR0,a special case of CBCR that sets its prefix to be an all-zero *** with CMAC,a recommended standard by the US National Institute of Standards and Technology (NIST),CBCR0 enjoys all the advantages that CMAC has,but requires less memory;so,in practical applications,CBCR0 behaves as well as CMAC does,and it is even more suitable for environments with limited memory resources,*** cards.

关键词： message authentication code cipher block chaining block cipher provable security

来源：评论

学校读者我要写书评

暂无评论

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

A Double Key-Sharing Based False Data Filtering Scheme in Wi...

引用

Int Joint Conference of 10th IEEE Int Conf on Trust, Security and Privacy in Computing and Communications (TrustCom) / 8th IEEE Int Conf on Embedded Software and Systems (ICESS) / 6th Int Conf on Frontier of Computer Science and Technology (FCST)

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

ISBN: (纸本)9780769546001

In wireless sensor networks, the attackers can inject false data reports containing bogus readings or nonexistent events from compromising nodes, which may result in false alarms, interfere decision making, and drain out the limited energy of the network. Existing approaches to filter false reports, notably statistical en-route filtering, share keys between 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. As a result, false reports have to travel multiple hops before being detected and filtered, and thus lead to the waste of energy of the network. A Double key-Sharing based false data Filtering scheme (DSF) in this paper is proposed to cope with this problem, in which nodes are grouped into clusters and each cluster head establishes relationship with the nodes closer through pairwise keys to form a blocked region. Furthermore, each pair of nodes shares symmetric keys randomly. When an event occurs, a legitimate report must carry two types of MACs. In filtering phase, each forwarding node validates not only the correctness of these two types of MACs carried in the report, but also drops part of the tail of the reports just outside the blocked region. Extensive analyses and simulations show that DSF outperforms existing schemes in terms of filtering efficiency and energy consumption.

关键词： wireless sensor network false data filtering key sharing compromised node message authentication code

来源：评论

学校读者我要写书评

暂无评论

A fast image encryption and authentication scheme based on chaotic maps

引用

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2010年第11期15卷 3507-3517页

作者： Yang, Huaqian Wong, Kwok-wo Liao, Xiaofeng Zhang, Wei Wei, Pengcheng Chongqing Educ Coll Dept Comp & Modern Educ Technol Chongqing 400067 Peoples R China City Univ Hong Kong Dept Elect Engn Kowloon Tong Hong Kong Peoples R China Chongqing Univ Coll Comp Sci & Engn Chongqing 400044 Peoples R China

In recent years, a variety of chaos-based image cryptosystems have been proposed The key used for encryption/decryption is usually independent of the plain-image To achieve a satisfactory level of security, at least two overall rounds of the substitution-diffusion process are required so that a change in any pixels of the plain-image spreads over the whole cipher-image Moreover, the receiver IS not able to determine whether the decrypted image is exactly the one sent. In this paper, a fast image encryption and authentication scheme is proposed In particular, a keyed hash function is introduced to generate a 128-bit hash value from both the plain-image and the secret hash keys The hash value plays the role of the key for encryption and decryption while the secret hash keys are used to authenticate the decrypted image Simulation results show that satisfactory security performance is achieved in only one overall round. The speed efficiency is thus improved (C) 2010 Elsevier B V All rights reserved

关键词： Image encryption Chaotic map Hash function message authentication code

来源：评论

学校读者我要写书评

暂无评论

SEAODV: A SECURITY ENHANCED AODV ROUTING PROTOCOL FOR WIRELESS MESH NETWORKS

SEAODV: A SECURITY ENHANCED AODV ROUTING PROTOCOL FOR WIRELE...

引用

6th Annual IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)/STMWC/NASSUE/CMPA/VECON/AWSAN/AWSAN

作者： Li, Celia Wang, Zhuang Yang, Cungang York Univ Dept Comp Sci & Engn N York ON M3J 1P3 Canada Ryerson Univ Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781424477425

In this paper, we propose a Security Enhanced AODV routing protocol (SEAODV) for wireless mesh networks (WMN). SEAODV employs Blom's key pre-distribution scheme to compute the pairwise transient key (PTK) through the flooding of enhanced HELLO message and subsequently uses the established PTK to distribute the group transient key (GTK). PTK and GTK authenticate unicast and broadcast routing messages respectively. In WMN, a unique PTK is shared by each pair of nodes, while GTK is shared secretly between the node and all its one-hop neighbours. A message authentication code (MAC) is attached as the extension to the original AODV routing message to guarantee the message's authenticity and integrity in a hop-by-hop fashion. Security analysis and performance evaluation show that SEAODV is more effective in preventing identified routing attacks and outperforms ARAN and SAODV in terms of computation cost and route acquisition latency.

关键词： SEAODV group transient key message authentication code pairwise transient key performance evaluation routing protocols security analysis security enhanced AODV routing protocol telecommunication security wireless mesh network wireless mesh networks

来源：评论

学校读者我要写书评

暂无评论

How to Thwart Birthday Attacks against MACs via Small Randomness

How to Thwart Birthday Attacks against MACs via Small Random...

引用

17th International Workshop on Fast Software Encryption

作者： Minematsu, Kazuhiko NEC Corp Ltd Nakahara Ku Kawasaki Kanagawa 213 Japan

ISBN: (纸本)9783642138577

The security of randomized message authentication code, MAC for short, is typically depending on the uniqueness of random initial vectors (IVs). Thus its security bound usually contains O(q(2)/2(n)), when random IV is n bits and q is the number of MACed messages. In this paper, we present how to break this birthday barrier without increasing the randomness. Our proposal is almost as efficient as the well-known Carter-Wegman MAC, uses n-bit random IVs, and provides the security bound roughly O(q(3)/2(2n)) We also provide blockcipher-based instantiations of our proposal. They are almost as efficient as CBC-MAC and the security is solely based on the pseudorandomness of the blockcipher.

关键词： message authentication code Birthday Bound Mode of Operation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：