Results 261 to 270 of about 5,296 (299)
Some of the next articles are maybe not open access.
Key-Indistinguishable Message Authentication Codes
2014While standard message authentication codes (MACs) guarantee authenticity of messages, they do not, in general, guarantee the anonymity of the sender and the recipient. For example it may be easy for an observer to determine whether or not two authenticated messages were sent by the same party even without any information about the secret key used ...
Joël Alwen +4 more
openaire +2 more sources
Trust in corrected messages protected by message authentication codes
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, 2011An algorithm for correction and soft verification of message protected by cryptographic check values like MAC is presented. The algorithm uses soft output values of the channel decoder which are given as input of the cryptographic verification module. The criterion of standard verification becomes less strict, when the algorithm for correction and soft
openaire +1 more source
Homomorphic Signatures and Message Authentication Codes
2014Homomorphic message authenticators allow to validate computation on previously signed data. The holder of a dataset {m 1, …, m l} uses her secret key sk to produce corresponding tags (σ 1, …, σ l) and stores the authenticated dataset on a remote server. Later the server can (publicly) compute m = f(m 1, …, m l) together with a succinct tag σ certifying
openaire +1 more source
Security of message authentication codes in the presence of key-dependent messages
Designs, Codes and Cryptography, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Madeline González Muñiz +1 more
openaire +1 more source
Message Authentication Codes (MACs)
2010A Message Authentication Code (MAC), also known as a cryptographic checksum or a keyed hash function, is widely used in practice. In terms of security functionality, MACs share some properties with digital signatures, since they also provide message integrity and message authentication. However, unlike digital signatures, MACs are symmetric-key schemes
Christof Paar, Jan Pelzl
openaire +1 more source
Reliability of Soft Verification of Message Authentication Codes
2013 Fifth International Conference on Computational Intelligence, Communication Systems and Networks, 2013It is known that Message Authentication Codes are extremely sensitive to any change of the message they are appended to. Even one or more bits of the changed message invert about 50% of bits of Message Authentication Codes, making in such a way the message useless.
openaire +1 more source
Message Authentication Codes with Error Correcting Capabilities
2002In this paper, we propose classes of Message Authentication Codes (MAC) based on error correcting-codes. We introduce a new notion of error tolerant forgery of hash messages. These MACs allow full error recovery for all applications, while being error-tolerant for less information-sensitive applications.
Charles C. Y. Lam +2 more
openaire +1 more source
History-Free Aggregate Message Authentication Codes
2010Aggregate message authentication codes, as introduced by Katz and Lindell (CT-RSA 2008), combine several MACs into a single value, which has roughly the same size as an ordinary MAC. These schemes reduce the communication overhead significantly and are therefore a promising approach to achieve authenticated communication in mobile ad-hoc networks ...
Oliver Eikemeier +6 more
openaire +1 more source