Approximate Message Authentication Code (AMAC) is a recently introduced cryptographic primitive with several applications in the areas of cryptography and coding theory. Briefly speaking, AMACs represent a way to provide data authentication that is tolerant to acceptable modifications of the original message. Although constructs had been proposed for this primitive, no security analysis or even...

Conventionally, mutual entity authentication is seen as the necessary precursor to the establishment of a secure connection. However, there exist examples of cases where authentication is not needed. The purpose of this paper is to consider this proposition, illustrated by case studies, and to use the findings of this investigation as input for the design of authentication protocols suitable fo...

We study the roles of message components in authentication protocols. In particular, we investigate how a certain component contributes to the task of achieving entity authentication. To this aim, we isolate a core set of roles that enables us to extract general principles that should be followed to avoid attacks. We then formalize these principles in terms of rules for protocol parties and we ...

This paper studies the entity-authentication problem in an information theoretic framework, where adversaries are innnitely powerful. We rst derive lower bounds on the cheating probability and the size of keys. Next, we show an unconditionally secure and optimum entity-authentication scheme that meets all our bounds.

The widespread use of wireless cellular networks has made security an ever increasing concern. GSM is the most popular wireless cellular standard, but security is an issue. The most critical weakness in the GSM protocol is the use of one-way entity authentication, i.e., only the mobile station is authenticated by the network. This creates many security problems including vulnerability against m...

We propose a new method for the static analysis of entity authentication protocols. We develop our approach based on a dialect of the spi-calculus as the underlying formalism for expressing protocol narrations. Our analysis validates the honest protocol participants against static (hence decidable) conditions that provide formal guarantees of entity authentication. The main result is that the v...

ESOP 2004, LNCS 2986, pages 140–154, 2004. c © Springer–Verlag, Berlin Heildelberg 2003. We propose a new method for the static analysis of entity authentication protocols. We develop our approach based on a dialect of the spi-calculus as the underlying formalism for expressing protocol narrations. Our analysis validates the honest protocol participants against static (hence decidable) conditio...

Authentication is one of the essential tools available for security in WLANs. Access control authentication mechanisms provides entity authentication, access into the network and key evolving for data frames protection. Secure WLAN Authentication Scheme (SWAS) is one such access control authentication mechanism. It provides entity authentication along with per frame authentication. All the part...

In networks and entity groupings that have sensitive resources, user identification is a crucial requirement for secure access, communication and transactions involving those resources. However, there are networks and entity groupings that require entity authentication while preserving the privacy of the entity being authenticated. There are several zero-knowledge protocols (ZKP) including the ...