Topic
Data Authentication Algorithm
About: Data Authentication Algorithm is a research topic. Over the lifetime, 4593 publications have been published within this topic receiving 87271 citations. The topic is also known as: DAA.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: An efficient and security dynamic identity based authentication protocol for multi-server architecture that removes the aforementioned weaknesses and is extremely suitable for use in distributed multi- server architecture.
265 citations
01 Dec 2005
TL;DR: This document describes an algorithm to generate one-time password values, based on Hashed Message Authentication Code (HMAC), which will facilitate adoption of two-factor authentication on the Internet by enabling interoperability across commercial and open-source implementations.
Abstract: This document describes an algorithm to generate one-time password
values, based on Hashed Message Authentication Code (HMAC). A security
analysis of the algorithm is presented, and important parameters
related to the secure deployment of the algorithm are discussed. The
proposed algorithm can be used across a wide range of network
applications ranging from remote Virtual Private Network (VPN) access,
Wi-Fi network logon to transaction-oriented Web applications. This
work is a joint effort by the OATH (Open AuTHentication) membership to
specify an algorithm that can be freely distributed to the technical
community. The authors believe that a common and shared algorithm will
facilitate adoption of two-factor authentication on the Internet by
enabling interoperability across commercial and open-source
implementations. This memo provides information for the Internet
community.
261 citations
••
01 May 2006TL;DR: The new split counters for counter-mode encryption simultaneously eliminate counter overflow problems and reduce per-block counter size and dramatically improve authentication performance and security by using the Galois/counter mode of operation (GCM), which leverages counter- mode encryption to reduce authentication latency and overlap it with memory accesses.
Abstract: Protection from hardware attacks such as snoopers and mod chips has been receiving increasing attention in computer architecture. This paper presents a new combined memory encryption/authentication scheme. Our new split counters for counter-mode encryption simultaneously eliminate counter overflow problems and reduce per-block counter size, and we also dramatically improve authentication performance and security by using the Galois/Counter Mode of operation (GCM), which leverages counter-mode encryption to reduce authentication latency and overlap it with memory accesses. Our results indicate that the split-counter scheme has a negligible overhead even with a small (32KB) counter cache and using only eight counter bits per data block. The combined encryption/authentication scheme has an IPC overhead of 5% on average across SPEC CPU 2000 benchmarks, which is a significant improvement over the 20% overhead of existing encryption/authentication schemes.
261 citations
••
13 Apr 2003TL;DR: This paper provides a comprehensive treatment of forwardsecurity, as a practical means to mitigate the damage caused by key-exposure, in the context of shared-key based cryptographic primitives, by identifying forwardsecure pseudorandom bit generators as the central primitive and showing how forward-secure message authentication schemes and symmetric encryption schemes can be built based on standard schemes.
Abstract: This paper provides a comprehensive treatment of forwardsecurity in the context of shared-key based cryptographic primitives, as a practical means to mitigate the damage caused by key-exposure. We provide definitions of security, practical proven-secure constructions, and applications for the main primitives in this area. We identify forwardsecure pseudorandom bit generators as the central primitive, providing several constructions and then showing how forward-secure message authentication schemes and symmetric encryption schemes can be built based on standard schemes for these problems coupled with forwardsecure pseudorandom bit generators. We then apply forward-secure message authentication schemes to the problem of maintaining secure access logs in the presence of break-ins.
261 citations
••
18 Aug 1996
TL;DR: The basic construction and some variants under more realistic and practical assumptions are analyzed, and the results of empirical performance tests demonstrate that these schemes arc competitive with other commonly employed schemes whose security is less well-established.
Abstract: There are well-known techniques for message authentication using universal hash functions. This approach seems very promising, as it provides schemes that, are: both efficient and provably secure under reasonable assumptions. This paper contributes to this line of research in two ways. First, it analyzes the basic construction and some variants under more realistic and practical assumptions. Second, it shows how these schemes can be efficiently implemented, and it reports on the results of empirical performance tests that demonstrate that these schemes arc competitive with other commonly employed schemes whose security is less well-established.
253 citations