New results on multi-receiver authentication codes

Wang, Huaxiong

doi:10.1007/bfb0054151

Cited by 56 publications

(58 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So the way of theoretic strength provides another method to achieve secure network coding. The papers [6] [7][8] promote the development of multi-receiver authentication code. Frederique et al proposed a method [9] to prevent pollution attacks for single source node network coding, the scheme introduces unconditionally secure authentication code in multicast network, and it is robust against pollution attacks.…”

Section: Unconditionally Secure Authentication Codementioning

confidence: 99%

An Unconditionally Secure Authentication Code For Multi-Source Network Coding

Yang¹,

Yang²

2012

IJWMT

View full text Add to dashboard Cite

In network system, network coding allows intermediate nodes to encode the received messages before forwarding them, thus network coding is vulnerable to pollution attacks. Besides, the attacks are amplified by the network coding process with the result that the whole network maybe pollutes. In this paper, we proposed a novel unconditionally secure authentication code for multi-source network coding, which is robust against pollution attacks. For the authentication scheme based on theoretic strength, it is robust against those attackers that have unlimited computational resources, and the intermediate nodes therein can verify the integrity and origin of the encoded messages received without having to decode them, and the receiver nodes can check them out and discard the messages that fail the verification. By this way, the pollution is canceled out before reaching the destinations.

show abstract

Section: Unconditionally Secure Authentication Codementioning

confidence: 99%

An Unconditionally Secure Authentication Code For Multi-Source Network Coding

Yang¹,

Yang²

2012

IJWMT

View full text Add to dashboard Cite

show abstract

“…Significant efforts have been made to construct nontrivial (more efficient and/or more secure) MRAs. Existing work on them in the information theoretic model includes [8][9][10], providing unconditional security. Note that all the existing MRAs were done in the shared key communication model where secrets are pre-distributed to participants.…”

Section: Introductionmentioning

confidence: 99%

New Results on Unconditionally Secure Multi-receiver Manual Authentication

Wang

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Manual authentication is a recently proposed model of communication motivated by the settings where the only trusted infrastructure is a low bandwidth authenticated channel, possibly realized by the aid of a human, that connects the sender and the receiver who are otherwise connected through an insecure channel and do not have any shared key or public key infrastructure. A good example of such scenarios is pairing of devices in Bluetooth. Manual authentication systems are studied in computational and information theoretic security model and protocols with provable security have been proposed. In this paper we extend the results in information theoretic model in two directions. Firstly, we extend a single receiver scenario to multireceiver case where the sender wants to authenticate the same message to a group of receivers. We show new attacks (compared to single receiver case) that can launched in this model and demonstrate that the single receiver lower bound 2 log(1/ ) + O(1) on the bandwidth of manual channel stays valid in the multireceiver scenario. We further propose a protocol that achieves this bound and provides security, in the sense that we define, if up to c receivers are corrupted. The second direction is the study of non-interactive protocols in unconditionally secure model. We prove that unlike computational security framework, without interaction a secure authentication protocol requires the bandwidth of the manual channel to be at least the same as the message size, hence non-trivial protocols do not exist.

show abstract

“…However in this model the sender is fixed. In [18] this limitation is removed and the sender can be any group member. The extended model is called MRA-code with dynamic sender, or DMRA-codes for short.…”

Section: Introductionmentioning

confidence: 99%

“…DMRA-codes capture the essential aspect of authentication in group communication but the model allows only one sender while in many applications such as dynamic conference key distributions, group members interact with each other and more than one sender exists. Moreover, the only known non-trivial construction [18] is very inflexible and for large size groups, or large size sources, results in very inefficient constructions with many key bits and long authenticators. In summary, although DMRA-codes do provide a promising starting point for authentication in group communication, for practical applications more general, flexible and efficient models and constructions are required.…”

Section: Introductionmentioning

confidence: 99%

“…This could give P i a higher success chance if P i and P j share some key information which is used for generation of authenticators. This observation immediately rules out direct application of schemes that establish a common key among two or more users, including the scheme described above, the construction based on symmetric polynomial [18], or application of KDP and its more general form (i, j)-cover-free family [23] for key distribution. It is worth noting that all such constructions can be immediately used to provide confidentiality in group communication, but exactly because they result in a shared key among two or more participants they cannot be used in group authentication systems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Broadcast Authentication in Group Communication

Wang

1999

Advances in Cryptology - ASIACRYPT’99

View full text Add to dashboard Cite

Abstract. Traditional point-to-point message authentication systems have been extensively studied in the literature. In this paper we consider authentication for group communication. The basic primitive is a multireceiver authentication system with dynamic sender (DMRA-code). In a DMRA-code any member of a group can broadcast an authenticated message such that all other group members can individually verify its authenticity. In this paper first we give a new and flexible 'synthesis' construction for DMRA-codes by combining an authentication code (Acode) and a key distribution pattern. Next we extend DMRA-codes to tDMRA-codes in which t senders are allowed. We give two constructions for tDMRA-codes, one algebraic and one by 'synthesis' of an A-code and a perfect hash family. To demonstrate the usefulness of DMRA systems, we modify a secure dynamic conference key distribution system to construct a key-efficient secure dynamic conference system that provides secrecy and authenticity for communication among conferencees. The system is key-efficient because the key requirement is essentially the same as the original conference key distribution system and so authentication is effectively obtained without any extra cost. We show universality of 'synthesis' constructions for unconditional and computational security model that suggests direct application of our results to real-life multicasting scenarios in computer networks. We discuss possible extensions to this work.

show abstract

New results on multi-receiver authentication codes

Cited by 56 publications

References 14 publications

An Unconditionally Secure Authentication Code For Multi-Source Network Coding

An Unconditionally Secure Authentication Code For Multi-Source Network Coding

New Results on Unconditionally Secure Multi-receiver Manual Authentication

Broadcast Authentication in Group Communication

Contact Info

Product

Resources

About