A survey of information authentication

Simmons, Gustavus J.

doi:10.1109/5.4445

Cited by 155 publications

(69 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Our bound for the TW model is much more tight than the previous bound [B]. Our scheme and bound are closely related to unconditionally secure authentication codes [12]- [16]. Especially, our bound on IKl is derived from a bound for splitting authentication codes shown in [16].…”

mentioning

confidence: 73%

t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes

Kurosawa

Obana

Ogata

1995

Advances in Cryptology — CRYPT0’ 95

View full text Add to dashboard Cite

Abstract. In this paper, we show that there exists a &cheater identifiable (k, n) threshold secret sharing scheme such as follows for cheating probability e > 0. If k 2 31 + 1, then 1. Just k participants are enough to identify who are cheaters.2. 1x1 is independent of n. That is, 1x1 = lSl(l/e)(t+2), where S denotes the set of secrets and V, denotes the set of shares of a participant Pi, respectively.(Previously, no schemes were known which satisfy both requirements.)Further, we present a lower bound on lvtl for our model and for the model of Tompa and Woll. Our bound for the TW model is much more tight than the previous bound.

show abstract

mentioning

confidence: 73%

t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes

Kurosawa

Obana

Ogata

1995

Advances in Cryptology — CRYPT0’ 95

View full text Add to dashboard Cite

show abstract

“…These types of protocols are first suggested by Simmons [9] and later used for multicast environments by Desmedt et. al [18].Unconditionally secure protocols guarantee strong authentication but are not practical in the real world due to their unsubstantial resource needs.…”

Section:  Unconditionally Secure Protocolsmentioning

confidence: 99%

MAC based Approaches for Multicast Source Authentication

Kaur¹,

Sangal²,

Kumar³

2012

IJCA

View full text Add to dashboard Cite

Due to increased use of internet for novel types of group communication and bandwidth constraints an urgent need of simultaneous transmission of digital data arises. The applications of multicasting involve TV over internet, videoconferencing, news feeds, stock quotes, online video games and software updates. Some of these applications follow one to many models while others use many to many communications. But success of these applications depends on the factor that how secure they are. Each application has its own security requirements. Many applications require authenticating the source of received traffic to verify that it is originated from the valid member. Till date a large number of protocols have been proposed to support source authentication in multicasting. But each protocol has its advantages and disadvantages. Existing literature classify these protocols into two categories: MAC based approaches and Hash based approaches. This paper give a brief review of MAC based protocols to verify the authenticity of the sender along with their performance comparison based on security level, vulnerability to collusion,Laency at the source and receiver end ,tolerance to packet loss ,Time synchronization requirement and computation overhead parameters.

show abstract

“…Now suppose that Alice and Bob agree on a keyed authentication scheme that allows Bob to verify that the messages he receives are from Alice. In order to authenticate, Alice sends a proof of authentication, called a tag, 1 together with each message for Bob's verification. We call the transmitted signal under this scheme as the tagged signal.…”

Section: A Scenariomentioning

confidence: 99%

“…Some examples of multiplexed authentication are message authentication codes or authentication protocols that require a series of messages devoted to authentication. An overview of these methods may be found in [1] and in [2,Ch. 9 and 10].…”

Section: Introductionmentioning

confidence: 99%

Physical-Layer Authentication

Baras

Sadler

2008

IEEE Trans.Inform.Forensic Secur.

228

133

View full text Add to dashboard Cite

Abstract-Authentication is the process where claims of identity are verified. Most mechanisms of authentication (e.g., digital signatures and certificates) exist above the physical layer, though some (e.g., spread-spectrum communications) exist at the physical layer often with an additional cost in bandwidth. This paper introduces a general analysis and design framework for authentication at the physical layer where the authentication information is transmitted concurrently with the data. By superimposing a carefully designed secret modulation on the waveforms, authentication is added to the signal without requiring additional bandwidth, as do spread-spectrum methods. The authentication is designed to be stealthy to the uninformed user, robust to interference, and secure for identity verification. The tradeoffs between these three goals are identified and analyzed in block fading channels. The use of the authentication for channel estimation is also considered, and an improved bit-error rate is demonstrated for time-varying channels. Finally, simulation results are given that demonstrate the potential application of this authentication technique.

show abstract

A survey of information authentication

Cited by 155 publications

References 7 publications

t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes

t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes

MAC based Approaches for Multicast Source Authentication

Physical-Layer Authentication

Contact Info

Product

Resources

About