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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

76 篇 会议
74 篇 期刊文献
1 册 图书
1 篇 学位论文

馆藏范围

152 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

142 篇 工学
- 109 篇 计算机科学与技术...
- 59 篇 电气工程
- 41 篇 信息与通信工程
- 15 篇 电子科学与技术（可...
- 12 篇 软件工程
- 4 篇 仪器科学与技术
- 3 篇 机械工程
- 3 篇 控制科学与工程
- 3 篇 网络空间安全
- 2 篇 交通运输工程
- 2 篇 航空宇航科学与技...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 石油与天然气工程
- 1 篇 环境科学与工程（可...
17 篇 理学
- 14 篇 数学
- 3 篇 化学
- 3 篇 生物学
- 1 篇 物理学
7 篇 管理学
- 6 篇 管理科学与工程(可...
- 1 篇 公共管理
- 1 篇 图书情报与档案管...
2 篇 医学
- 2 篇 临床医学
1 篇 军事学
- 1 篇 军队指挥学

主题

152 篇 message authenti...
16 篇 cryptography
13 篇 authentication
12 篇 wireless sensor ...
10 篇 message authenti...
9 篇 mac
8 篇 authenticated en...
8 篇 provable securit...
7 篇 integrity
7 篇 wireless sensor ...
7 篇 encryption
7 篇 hash function
6 篇 data integrity
6 篇 security
6 篇 zone routing pro...
5 篇 manet
5 篇 codes
4 篇 denial-of-servic...
4 篇 data aggregation
4 篇 aes

机构

3 篇 chinese acad sci...
3 篇 chinese acad sci...
3 篇 mimos berhad inf...
3 篇 univ malaya fac ...
3 篇 univ teknol mara...
3 篇 shanghai jiao to...
2 篇 rhein westfal th...
2 篇 hanyang univ div...
2 篇 queens univ sch ...
2 篇 rhein westfal th...
2 篇 ibaraki univ dep...
2 篇 nitte meenakshi ...
2 篇 univ chinese aca...
2 篇 manipal univ mit...
2 篇 shanghai jiao to...
2 篇 indian stat inst...
2 篇 xiamen univ dept...
2 篇 ntt corp ntt inf...
2 篇 jnt univ dept ec...
2 篇 univ tenaga nas ...

作者

6 篇 yasuda kan
4 篇 dilli ravilla
4 篇 wang peng
3 篇 minematsu kazuhi...
3 篇 wu wenling
3 篇 biradar rajashek...
3 篇 rashwan a. m.
3 篇 sarkar palash
3 篇 jimale mohamud a...
3 篇 hassanein h. s.
3 篇 taha a-e m.
3 篇 zhang liting
3 篇 nalini n.
3 篇 kiah miss laiha ...
3 篇 rohmad mohd sauf...
3 篇 li xiaochao
3 篇 z'aba muhammad r...
3 篇 shen yaobin
3 篇 idris mohd yaman...
3 篇 jamil norziana

语言

147 篇 英文
4 篇 其他
1 篇 中文

检索条件"主题词=Message authentication code"

共 152 条记录，以下是81-90 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

"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

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Secure Communication Protocol for Vehicular Ad Hoc Networks

Privacy Preserving Secure Communication Protocol for Vehicul...

引用

7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)

作者： Mikki, Mohammad Mansour, Yousif M. Yim, Kangbin Islamic Univ Gaza Dept Comp Engn Gaza Israel Governmental Comp Ctr Gaza Israel Soonchunhyang Univ Dept Informat Secur Engn Soonchunhyang South Korea

ISBN: (纸本)9780769549743

Vehicular Ad-hoc Networks (VANETs) have attracted much attention recently because of its applications and features. The main purpose of adopting VANET technology is to increase safety and efficiency on roads. In this paper, a privacy preserving secure communication protocol (PPSCP) for VANETs is proposed. PPSCP authenticates safety messages anonymously to preserve vehicle privacy and prevent unauthorized tracking, balances between privacy and identification, and makes a new efficient vehicle revocation scheme that reduces revocation lists size. The protocol is resistant to attacks like replay attack and Denial of Service (DoS) attack. A security performance analysis to compare between PPSCP and S3P was performed through simulation which demonstrates that PPSCP is more robust, efficient, secure and provides more privacy preservation and liability.

关键词： VANET privacy message authentication code certificate authority cryptography

来源：评论

学校读者我要写书评

暂无评论

P4Chaskey: An Efficient MAC Algorithm for PISA Switches 32

P4Chaskey: An Efficient MAC Algorithm for PISA Switches

引用

32nd International Conference on Network Protocols

作者： Francisco, Martim Ferreira, Bernardo Ramos, Fernando M., V Marin, Eduard Signorello, Salvatore Univ Lisbon Fac Ciencias LASIGE Lisbon Portugal Univ Lisbon Inst Super Tecn INESC ID Lisbon Portugal Telefonica Res Barcelona Spain

ISBN: (纸本)9798350351712;9798350351729

Cryptographic primitives are of paramount importance to guarantee security properties in communication networks. The associated computational complexity of cryptography standards makes it prohibitive to execute these primitives at line rate in the network core. Existing implementations of cryptographic MAC algorithms in P4 for programmable switches impose a severe performance penalty due to packet recirculation, which may not be tolerable at those network speeds. In this paper, we propose the first data plane design in P4 of the Chaskey algorithm, a widely used secure and lightweight cryptographic MAC algorithm, tailored for the PISA switch architecture. Our P4CHASKEY is the first solution to compute MACs using 128-bit keys without packet recirculation, guaranteeing line rate Terabit speeds. As state-of-the-art solutions require recirculations for the same key size (reducing throughput performance) or offer weaker security (smaller keys), P4CHASKEY is now, to our knowledge, the most efficient MAC design for the target switch architecture.

关键词： P4 Chaskey PISA cryptography message authentication code

来源：评论

学校读者我要写书评

暂无评论

On Efficient Data Integrity and Data Origin authentication for Wireless Sensor Networks Utilising Block Cipher Design Techniques

On Efficient Data Integrity and Data Origin Authentication f...

引用

3rd International Conference on Next Generation Mobile Applications, Services, and Technologies

作者： Adekunle, A. A. Woodhead, S. R. Univ Greenwich Dept Comp & Commun Engn Chatham ME4 4TB Kent England

ISBN: (纸本)9780769537863

Analysis of the generic attacks and countermeasures for block cipher based message authentication code algorithms (MAC) in sensor applications is undertaken;the conclusions are used in the design of two new MAC constructs Quicker Block Chaining MAC1 (QBC-MAC1) and Quicker Block Chaining MAC2 (QBC-MAC2). Using software simulation we show that our new constructs point to improvements in usage of CPU instruction clock cycle and energy requirement when benchmarked against the de facto Cipher Block Chaining MAC (CBC-MAC) based construct used in the Tiny Sec security protocol for wireless sensor networks.

关键词： message authentication code data integrity data origin authentication Skipjack wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Forgery Attacks on Several Beyond-Birthday-Bound Secure MACs 29th

Forgery Attacks on Several Beyond-Birthday-Bound Secure MACs

引用

29th Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT)

作者： Shen, Yaobin Standaert, Francois-Xavier Wang, Lei UCLouvain ICTEAM Crypto Grp Louvain La Neuve Belgium Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9789819987269;9789819987276

At CRYPTO'18, Datta et al. proposed nPolyMAC and proved the security up to 2(2n/3) authentication queries and 2(n) verification queries. At EUROCRYPT'19, Dutta et al. proposed CWC+ and showed the security up to 2(2n/3) queries. At FSE'19, Datta et al. proposed PolyMAC and its key-reduced variant 2k-PolyMAC, and showed the security up to 2(2n/3) queries. This security bound was then improved by Kim et al. (EUROCRYPT'20) and Datta et al. (FSE'23) respectively to 2(3n/4) and in the multi-user setting. At FSE'20, Chakraborti et al. proposed PDM*MAC and 1k-PDM*MAC, and showed the security up to 2(2n/3) queries. Recently, Chen et al. proposed nEHtM(p)(+) and showed the security up to 2(2n/3) queries. In this paper, we show forgery attacks on nPolyMAC, CWC+, PolyMAC, 2k-PolyMAC, PDM* MAC, 1k-PDM*MAC and nEHtM(p)(+). Our attacks exploit some vulnerability in the underlying polynomial hash function Poly, and (i) require only one authentication query and one verification query;(ii) are nonce-respecting;(iii) succeed with probability 1. Thus, our attacks disprove the provable high security claims of these schemes. We then revisit their security analyses and identify what went wrong. Finally, we propose two solutions that can restore the beyond-birthday-bound security.

关键词： message authentication code Beyond-birthday-bound security Polynomial hash function Forgery attack

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Encryption Scheme Based on Hyperelliptic Curve Cryptography 9th

Encryption Scheme Based on Hyperelliptic Curve Cryptography

引用

9th International Conference on Security, Privacy, and Anonymity in Computation, Communication and Storage (SpaCCS)

作者： John, Asha Liza Thampi, Sabu M. Indian Inst Informat Technol & Management Kerala Technopk Campus Trivandrum 695581 Kerala India

ISBN: (纸本)9783319491486;9783319491479

In modern times, common man uses small computing devices like mobile phones, RFID systems and embedded systems. Such devices are resource constrained. Hence, algorithms used in such devices must consume less power and should have minimal memory requirements. But, several existing cryptosystems like RSA require more memory and other resources for operation. So, in the proposed work an optimized and secure encryption scheme is developed to ensure confidentiality in communication. This algorithm is developed with reference to Elliptic Curve Integrated Encryption Scheme (ECIES) included in standards from ANSI, IEEE, and also ISO/IEC and is integrated with the concept of hyperelliptic curve cryptography (HECC). The proposed encryption scheme based on HECC makes use of three cryptographic functions viz. key agreement, encryption/decryption algorithms and message authentication code (MAC). The key agreement function generates a l-bit secret key. For this, the existing Diffie Hellman Key Agreement Algorithm is improved suitably so as to defend Man-in-the-Middle (MitM) attack. The encryption/decryption mechanism is developed by improving the RC4 algorithm. The proposed scheme integrates the concept of hyperelliptic curves with the key stream generation process. Finally, the paper presents a proposal for MAC based on HECC.

关键词： Cryptography Encryption message authentication code Key agreement Hyperelliptic curve cryptography

来源：评论

学校读者我要写书评

暂无评论

Measuring the performance and energy consumption of AES in wireless sensor networks

Measuring the performance and energy consumption of AES in w...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Panait, Cristina Dragomir, Dan Univ Politehn Bucuresti Fac Automat Control & Comp Bucharest Romania

ISBN: (纸本)9788360810668

With WSN deployments increasing in popularity, securing those deployments becomes a necessity. This can be achieved by encrypting inter-node communications and/or using message authentication codes. AES is a well studied symmetric cipher, with no known practical vulnerabilities, that can be used to solve both problems. We provide an optimized implementation of AES, with four modes of operation (ECB, CBC, CFB and CTR), that uses the hardware accelerator available on the ATmega128RFA1 microcontroller, and compare it with the best known software implementation. We show that our hardware AES implementation is both faster and more energy efficient than a software implementation. This is not the case for previous sensor nodes and implementations, which show an improved execution speed, but with a higher energy consumption.

关键词： cryptography message authentication wireless sensor networks AES ATmega128RFA1 microcontroller WSN deployments inter-node communications message authentication codes Ciphers Encryption Energy consumption Hardware Software Wireless sensor networks Wireless sensor networks AES gene Auger electron spectroscopy cryptography message authentication energy consumption Computer hardware software implementation message authentication code computer software Passwords

来源：评论

学校读者我要写书评

暂无评论

On the Security of Key Derivation Functions in Office

On the Security of Key Derivation Functions in Office

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共16页 << < 5 6 7 8 9 10 11 12 13 14 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：