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

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

来源：评论

学校读者我要写书评

暂无评论

Lightweight authentication with key-agreement protocol for mobile network environment using smart cards

引用

IET INFORMATION SECURITY 2016年第5期10卷 272-282页

作者： Reddy, Alavalapati Goutham Yoon, Eun-Jun Das, Ashok Kumar Yoo, Kee-Young Kyungpook Natl Univ Sch Engn & Comp Sci Daegu South Korea Kyungil Univ Dept Cyber Secur Gyeonbuk South Korea Int Inst Informat Technol Ctr Secur Theory & Algorithm Res Hyderabad 500032 Andhra Pradesh India

In 2012, Mun et al. proposed an enhanced secure authentication with key-agreement protocol for roaming service in global mobility networks environment based on elliptic curve cryptography. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful analysis of this study proves that Mun et al.'s protocol is susceptible to several attacks such as replay attack, man-in-middle attack, user impersonation attack, privileged insider attack, denial-of-service attack, no login phase and imperfect mutual authentication phase. In addition, this study proposes an enhanced lightweight authentication with key-agreement protocol for mobile networks based on elliptic curve cryptography using smart cards. The proposed protocol is lightweight and perfectly suitable for real-time applications as it accomplishes simple one-way hash function, message authentication code and exclusive-OR operation. Furthermore, it achieves all the eminent security properties and is resistant to various possible attacks. The security analysis and comparison section demonstrates that the proposed protocol is robust compared with Mun et al.'s protocol.

关键词： cryptographic protocols mobile radio smart cards telecommunication security data privacy public key cryptography message authentication file organisation key agreement protocol smart card enhanced secure lightweight authentication roaming service global mobile network environment elliptic curve cryptography security attack man-in-middle attack user impersonation attack privileged insider attack denial-ofservice attack no login phase imperfect mutual authentication phase one-way hash function message authentication code exclusive-OR operation

来源：评论

学校读者我要写书评

暂无评论

Physical-Layer authentication via a Dynamic Scaling

引用

Chinese Journal of Electronics 2020年第4期29卷 651-659页

作者： LI Min JIANG Shaoquan LIAO Yongjian Institute of Information Security Mianyang Normal University School of Information and Software Engineering University of Electronic Science and Technology of China

message authentication is a process that allows sender Alice to transmit a source state to receiver Bob such that the latter is assured of the *** study this problem in the physical-layer where the channel is degraded by a Rayleigh fading and a Gaussian *** propose an efficient construction for our *** idea is to amplify a basic codeword of the source state with a small but dynamic scaling *** scaling factor is asymptotically *** thus essentially incurs no power *** authentication is achieved through a statistical *** scheme is provably secure and performs better than the related existing ***,our error analysis allows it to be realized with very practical parameters.

关键词： Physical-layer authentication Information security message authentication code

来源：评论

学校读者我要写书评

暂无评论

MacDES: MAC algorithm based on DES

引用

ELECTRONICS LETTERS 1998年第9期34卷 871-873页

作者： Knudsen, LR Preneel, B Univ Bergen Dept Informat N-5020 Bergen Norway Katholieke Univ Leuven Dept Elect Engn ESAT COSIC B-3001 Heverlee Belgium

A new message authentication code (MAC) algorithm is proposed, which improves the popular retail MAC based on the data encryption standard;it has the same complexity, but provides better resistance against key recovery attacks. Ln addition, a new key recovery attack on the retail MAC is presented, requiring a single known text-MAC pair and 2(56) online MAC verifications.

关键词： message authentication message authentication code data encryption standard MacDES standards Data security public key cryptography codes DES online MAC verifications MAC algorithm single known text-MAC pair key recovery attacks

来源：评论

学校读者我要写书评

暂无评论

Evaluating Bernstein-Rabin-Winograd polynomials

引用

DESIGNS codeS AND CRYPTOGRAPHY 2019年第2-3期87卷 527-546页

作者： Ghosh, Sebati Sarkar, Palash Indian Stat Inst 203 BT Rd Kolkata 700108 India

We describe an algorithm which can efficiently evaluate Bernstein-Rabin-Winograd (BRW) polynomials. The presently best known complexity of evaluating a BRW polynomial on m3 field elements is m/2 field multiplications. Typically, a field multiplication consists of a basic multiplication followed by a reduction. The new algorithm requires m/2 basic multiplications and 1+m/4 reductions. Based on the new algorithm for evaluating BRW polynomials, we propose two new hash functions BRW128 and BRW256 with digest sizes 128 bits and 256 bits respectively. The practicability of these hash functions is demonstrated by implementing them using instructions available on modern Intel processors. Timing results obtained from the implementations suggest that BRW based hashing compares favourably to the highly optimised implementation by Gueron of Horner's rule based hash function.

关键词： Almost universal hash function BRW polynomials Field multiplication Reduction message authentication code

来源：评论

学校读者我要写书评

暂无评论

A MAC forgery attack on SOBER-128

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2005年第5期E88A卷 1166-1172页

作者： Watanabe, D Furuya, S Kaneko, T Hitachi Ltd Syst Dev Lab Yokohama Kanagawa 2440817 Japan Tokyo Univ Sci Noda Chiba 2788510 Japan

SOBER-128 is a stream cipher designed by Rose and Hawkes in 2003. It can be also used for generating message authentication codes (MACs) and an authenticated encryption. The developers claimed that it is difficult to forge MACs generated by both functions of SOBER-128, though, the security assumption in the proposal paper is not realistic in some instances. In this paper, we examine the security of these message authentication mechanisms of SOBER-128 under security channel model. As a result, we show that both a MAC generation and an authenticated encryption are vulnerable against differential cryptanalysis. The success probabilities of the MAC forgery attack are estimated at 2(-6) and 2(-27) respectively. In addition, we show that some secret bits are revealed if a key is used many times.

关键词： stream cipher message authentication code authenticated encryption differential cryptanalysis SOBER

来源：评论

学校读者我要写书评

暂无评论

Trusted Neighbors Based Secured Routing Scheme in Wireless Sensor Networks Using Agents

引用

WIRELESS PERSONAL COMMUNICATIONS 2014年第1期78卷 1-28页

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

In Wireless Sensor Network (WSN) applications, nodes are deployed in public domains that are prone to be attacked by various types of attacks wherein the data confidentiality, integrity and authentication are compromised. In this paper, we propose Agent based SEcured Routing using Trusted neighbors (ASERT) in WSN. ASERT selects trustworthy neighbors and establishes secured routes using software agents. ASERT operates in following phases. (1) Defining Safeguard Agency (SA) and Routing Agency (RA), both consisting of static and mobile agents and a knowledge base. (2) Identification of trustworthy neighbor nodes by SA with trust model that consists of probability and message authentication codes (MAC) model. (3) Probability model estimates the trustworthy channel and trustworthy nodes whereas MAC model ensures them. (4) MAC's are dynamically computed by agents by generating the keys with the help of Random Oracle Extractor (ROE). (5) RA establishes secured routes from source to the sink node using agents. (6) Agents effectively identify possible security threats on wireless channel and node. (7) An improvement in packet delivery ratio, packet delivery latency, route maintenance overhead, memory overhead and energy consumption is achieved in ASERT as compared to two protocols, namely, Bio-inspired Trust and Reputation model in WSN (BTRM-WSN) using ant colony based approach and Ambient Trust Sensor Routing that uses trust combined with location information for routing.

关键词： Wireless sensor network Trusted neighbors Software agents Trust model message authentication code Secured routing

来源：评论

学校读者我要写书评

暂无评论

Leveraging quantum uncertainty: Quantum randomness through the lens of classical communication networks

引用

COMPUTER NETWORKS 2024年 254卷

作者： Das, Siddharth Krause, Stefan Giering, Kay-Uwe Pousa, Ricardo J. B. Bassoli, Riccardo Fitzek, Frank H. P. Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Saxony Germany Tech Univ Dresden Ctr Tactile Internet CeTi Dresden Saxony Germany Tech Univ Dresden Quantum Commun Networks Res Grp Dresden Saxony Germany Fraunhofer IIS Inst Steil Entwicklung Adaptiver Syst EAS Dresden Saxony Germany

The generation of random numbers and the study of its properties have been an elusive field for a fair portion of the century. The application of random numbers is employed in many use cases such as cryptography, neural networks, numerical simulation, and gambling. The performance of each of these use cases is profoundly impacted by the employed random numbers;henceforth, the quality of randomness is of critical importance when it comes to their usage. A poorly generated random number can make a security system vulnerable, or any numerical or statistical evaluation misleading. Although various modes of classical random number generators exist and still function to provide strong cryptographic properties, emergence of quantum mechanical randomness has shed light on a novel path of generating certified randomness which supersedes the classical counterpart in terms of security. Harnessing quantum mechanical phenomena enables generation of true random numbers which can be certified and further implemented to elevate the net quality of the specific use cases. In this work, we generate and analyze random numbers from three different sources - 50: 50 beam splitter (BS), quantum key distribution (QKD) setup with classical post-processing scheme, and a commercially available quantum random number generator (QRNG) (ID Quantique (IDQ)). The quality of the generated random numbers from the various sources is checked in statistical tests and compared. Further on, we have developed a system which implements the QRNG-based random numbers to facilitate message authentication code (MAC) and one time password (OTP) protocols, demonstrating a communication network application. In this manner we discuss about a network which integrates quantum mechanics to the current classical networking approaches to enhance certain aspects of the networking protocol - in this case, the

关键词： Quantum randomness Randomness testing Quantum random number generators message authentication code One time pass Quantum communication network

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Security analysis of GCM for communication

引用

SECURITY AND COMMUNICATION NETWORKS 2014年第5期7卷 854-864页

作者： Yap, Wun-She Yeo, Sze Ling Heng, Swee-Huay Henricksen, Matt ASTAR Inst Infocomm Res Singapore Singapore Multimedia Univ Fac Informat Sci & Technol Ayer Keroh Melaka Malaysia

The Galois/Counter Mode of operations (GCM) is constructed by combining the counter mode encryption and the authentication component (i.e., GTAG) to provide both privacy and authenticity. GTAG can be used as a stand-alone message authentication code. In this paper, we analyze the security of GTAG and GCM with respect to the forgery and distinguishing attacks. More precisely, We generalize the set of weak key classes proposed by Saarinen in FSE 2012 to include all subsets of nonzero keys. Hence, we remove the condition on the smoothness of 2(n)-1, where n denotes the block size, for the existence of weak key classes. By considering powers of suitable field elements and linearized polynomials, we further exploit some specific weak key classes to present a universal forgery attack on GTAG. By invoking the birthday paradox arguments, we show that a chosen message attack can be used to distinguish GTAG from a random function. To relax the assumptions required in the universal forgery attack, we show that we can utilize the uniqueness of the counter mode encryption to launch a known ciphertext attack against GCM itself when the initial vector is restricted to *** first three attacks can be applied to other Wegman-Carter polynomial message authentication codes. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： communication network authenticated encryption message authentication code forgery attack distinguishing attack weak key attack

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：