搜索结果: 1-15 共查到“军事学 message authentication”相关记录31条 . 查询时间(1.352 秒)
Substitution Attacks against Message Authentication
Algorithm Substitution Attacks Authentication Mass Surveillance
font style='font-size:12px;'>
2019/9/3
This work introduces Algorithm Substitution Attacks (ASAs) on message authentication schemes. In light of revelations concerning mass surveillance, ASAs were initially introduced by Bellare, Paterson ...
Efficient Message Authentication Codes with Combinatorial Group Testing
Message authentication code Combinatorial group testing Data corruption
font style='font-size:12px;'>
2019/4/23
Message authentication code, MAC for short, is a symmetric-key cryptographic function for authenticity. A standard MAC verification only tells whether the message is valid or invalid, and thus we can ...
Message Authentication (MAC) Algorithm For The VMPC-R (RC4-like) Stream Cipher
stream cipher RC4 VMPC-R
font style='font-size:12px;'>
2019/1/18
We propose an authenticated encryption scheme for the VMPC-R stream cipher. VMPC-R is an RC4-like algorithm proposed in 2013. It was created in a challenge to find a bias-free cipher within the RC4 de...
Quantum-secure message authentication via blind-unforgeability
quantum quantum access model unforgeability
font style='font-size:12px;'>
2018/12/3
Formulating and designing unforgeable authentication of classical messages in the presence of quantum adversaries has been a challenge, as the familiar classical notions of unforgeability do not direc...
复旦大学计算机科学与技术学院信息安全课件 Message authentication and Hash function
复旦大学计算机科学与技术学院 信息安全 课件 Message authentication and Hash function
font style='font-size:12px;'>
2018/7/20
复旦大学计算机科学与技术学院信息安全课件 Message authentication and Hash function。
Universal Forgery with Birthday Paradox: Application to Blockcipher-based Message Authentication Codes and Authenticated Encryptions
Universal forgery birthday attack CBC-MAC
font style='font-size:12px;'>
2017/7/6
We also propose another some generic universal forgery attacks using collision finding with structural input messages, by birthday paradox in the classic setting. Since our attacks are based on the co...
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication
message authentication code tweakable block cipher authenticated encryption
font style='font-size:12px;'>
2017/6/8
We propose a new mode of operation called ZMAC allowing to construct a (stateless and deterministic) message authentication code (MAC) from a tweakable block cipher (TBC). When using a TBC with n-bit ...
EHE: nonce misuse-resistant message authentication
message authentication authenticated encryption polynomial hashing
font style='font-size:12px;'>
2017/3/9
We propose a nonce misuse-resistant message authentication scheme called EHE (Encrypt-Hash-Encrypt). In EHE, a message-dependent polynomial is evaluated at the point which is an encrypted nonce. The r...
On The Exact Security of Message Authentication Using Pseudorandom Functions
MAC CBC EMAC
font style='font-size:12px;'>
2017/2/28
Traditionally, modes of Message Authentication Codes(MAC) such as Cipher Block Chaining (CBC) are instantiated using block ciphers or keyed Pseudo Random Permutations(PRP). However, one can also use d...
Key-Indistinguishable Message Authentication Codes
authentication codes anonymity
font style='font-size:12px;'>
2016/1/25
While standard message authentication codes (MACs) guarantee authenticity of messages,
they do not, in general, guarantee the anonymity of the sender and recipient. For example it may be
easy for an...
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
IBE HIBE standard model
font style='font-size:12px;'>
2016/1/8
We provide a generic transformation from any affine message authentication code (MAC) to an
identity-based encryption (IBE) scheme over pairing groups of prime order. If the MAC satisfies
a security...
Cryptographically Secure CRC for Lightweight Message Authentication
Hash function message authentication CRC
font style='font-size:12px;'>
2016/1/5
A simple and practical hashing scheme based on Cyclic Redundancy Check (CRC) is presented. Similarly to
previously proposed cryptographically secure CRCs, the presented one detects both, random and m...
A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys
message authentication codes weak keys entropy
font style='font-size:12px;'>
2015/12/31
In this note, we prove lower bounds on the amount of entropy of random sources necessary for
secure message authentication. We consider the problem of non-interactive c-time message authentication
u...
Interactive Encryption, Message Authentication, and Anonymous Key Exchange
digital signatures chosen-ciphertext security man-in-the-middle attacks
font style='font-size:12px;'>
2014/3/5
Public-Key Encryption (PKE) and Message Authentication (PKMA, aka as digital signatures) are fundamental cryptographic primitives. Traditionally, both notions are defined as non-interactive (i.e., sin...
Sequential message authentication code without random oracles
Message authentication code Sequential aggregate
font style='font-size:12px;'>
2014/3/11
Katz et al. provided a generic transform to construct aggregate message authentication codes and imposed a lower bound on the length of one aggregate MAC tag. The lower bound shows that the required t...