Open AccessJournal Article
Broadcast authentication in group communication
Reads0
Chats0
TLDR
In this paper, the authors considered authentication for group communication and proposed a multireceiver authentication system with dynamic sender (DMRA-code) in which each member of a group can broadcast an authenticated message such that all other group members can individually verify its authenticity.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 (A-code) 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 multi-casting scenarios in computer networks We discuss possible extensions to this workread more
Citations
More filters
BookDOI
Topics in Geometry, Coding Theory and Cryptography
TL;DR: This book presents survey articles on some of the new developments in the theory of algebraic function fields over finite fields, which have not yet been presented in other books or survey articles.
Book ChapterDOI
Unconditionally Secure Digital Signature Schemes Admitting Transferability
TL;DR: This work establishes a model for unconditionally secure digital signatures in a group, and demonstrates practical schemes in that model that represents the first unconditionallySecure signature that admits provably secure transfer of signatures.
Book
Combinatorial Designs for Authentication and Secrecy Codes
TL;DR: This monograph brings together in one source foundational and current contributions concerning design-theoretic constructions and characterizations of authentication and secrecy codes of combinatorial designs.
Book ChapterDOI
General Group Authentication Codes and Their Relation to “Unconditionally-Secure Signatures”
TL;DR: A novel “general group–based A–code” framework is developed which includes known types of group A–codes and their extensions, including the newly proposed USDS, and also allows other models to be systematically described and analysed.
Proceedings Article
Efficient Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code
TL;DR: This paper proposes two novel unconditionally secure digital signature schemes that have significantly shortened secret information for users and demonstrates an attack on a multireceiver authentication code proposed by Safavi-Naini and Wang and a method to fix the problem of the code.
References
More filters
Book
Data Structures and Algorithms
TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Journal ArticleDOI
New hash functions and their use in authentication and set equality
TL;DR: Several new classes of hash functions with certain desirable properties are exhibited, and two novel applications for hashing which make use of these functions are introduced, including a provably secure authentication technique for sending messages over insecure lines and the application of testing sets for equality.
Proceedings Article
Broadcast encryption
Amos Fiat,Moni Naor +1 more
TL;DR: Several schemes are presented that allow a center to broadcast a secret to any subset of privileged users out of a universe of size n so that coalitions of k users not in the privileged set cannot learn the secret.
Book ChapterDOI
Perfectly-Secure Key Distribution for Dynamic Conferences
TL;DR: This paper considers the model where interaction is allowed in the common key computation phase, and shows a gap between the models by exhibiting an interactive scheme in which the user's information is only k + t - 1 times the size of the commonKey.
Book ChapterDOI
An optimal class of symmetric key generation systems
TL;DR: In this article, a symmetric key generation system (SKGS) was proposed, in which the amount of secret information needed by each user to generate his keys is the least possible while at the same time a certain minimum number of users have to cooperate to resolve the uncertainty of unknown keys.