Results 11 to 20 of about 5,296 (299)
Quantum Message Authentication Code Independent of Computational Difficulty
The rise of quantum computing poses significant challenges to security systems, with traditional message authentication codes (MACs) at unprecedented risk of compromise.
Ping Wang +3 more
doaj +2 more sources
The Message Authentication Code Based on Universal Hashing
The article covers the research of message authentication codes based on universal hashing. The new message authentication code algorithm is described here. The analysis of the algorithm is also provided in this article.
T. A. Bilyk, A. U. Nesterenko
doaj +1 more source
Information security with message authentication code
This article describes three Message authentication code algorithms. These algorithms ensure the authenticity of the message between two or more parties to the transaction and can be applied in such information bank systems as CFT and so on.
T A Bilyk, A A Vnukov
doaj +1 more source
Unconditional Authentication Based on Physical Layer Offered Chain Key in Wireless Communication
Authentication is a critical issue in wireless communication due to the impersonation and substitution attacks from the vulnerable air interface launched by the malicious node.
Shaoyu Wang +5 more
doaj +1 more source
A Study of Blind Message Authentication Codes [PDF]
Blind signatures allow a signer to digitally sign a document without being able to glean any information about the document. In this paper, we investigate the symmetric analog of blind signatures, namely blind message authentication codes (blind MACs). One may hope to get the same efficiency gain from blind MAC constructions as is usually obtained when
Chanathip Namprempre +2 more
openaire +1 more source
Highly Secure Nonce-based MACs from the Sum of Tweakable Block Ciphers
Tweakable block ciphers (TBCs) have proven highly useful to boost the security guarantees of authentication schemes. In 2017, Cogliati et al. proposed two MACs combining TBC and universal hash functions: a nonce-based MAC called NaT and a deterministic ...
Wonseok Choi +6 more
doaj +3 more sources
A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify the authenticity of the received message.
Xiuli Wang
doaj +1 more source
Approximate Message Authentication and Biometric Entity Authentication [PDF]
Approximate Message Authentication Code (AMAC) is a recently introduced cryptographic primitive with several applications in the areas of cryptography and coding theory.
R. Graveman +3 more
core +1 more source
Multisender authentication codes allow a group of senders to construct an authenticated message for one receiver such that the receiver can verify authenticity of the received message.
Xiuli Wang
doaj +1 more source
Cryptanalysis of message authentication codes [PDF]
This paper gives a survey of attacks on Message Authentication Codes (MACS). First it defines the required security properties. Next it describes generic forgery and key recovery attacks on MACS. Subsequently an overview is presented of most MAC constructions and on attacks on these algorithms.
openaire +2 more sources

