Journals Information
Computer Science and Information Technology Vol. 1(2), pp. 97 - 104
DOI: 10.13189/csit.2013.010204
Reprint (PDF) (111Kb)
Multiuser Message Authentication, Application to Verifiable Secret Sharing and Key Management Schemes
Aparna Ram1,*, B.B. Amberker 2
1 Dept. of Computer Science and Engg. Siddaganga Institute of Technology, Tumkur, Karnataka, India
2 Dept. of Computer Science and Engg. National Institute of Technology, Warangal, Andhra Pradesh, India
ABSTRACT
Providing authentication for the messages exchanged among a group of users is an important issue in secure group communication. We develop multiuser authentication schemes with perfect protection against colluding malicious users numbering fewer than k, where all the n users are allowed to be senders (simultaneously with being receivers). In our scheme each user is required to store secret information of size 2k log2 q1 bits, and tags to authenticate messages are of length k log2 q. We use this to obtain, in the setup in which the participants are allowed to employ previously distributed private keys, a non-interactive verifiable secret sharing scheme for multiple dealers, in which shares reveal no information about the secret, and dealers cannot deal inconsistent shares. We also provide authentication to the group key management schemes proposed by Blundo et al. and Fiat-Naor without incurring extra storage cost.
KEYWORDS
Authentication Code, Multiuser Authentication, Message, Verifiable Secret Sharing, Key Management, Threshold
Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Aparna Ram , B.B. Amberker , "Multiuser Message Authentication, Application to Verifiable Secret Sharing and Key Management Schemes," Computer Science and Information Technology, Vol. 1, No. 2, pp. 97 - 104, 2013. DOI: 10.13189/csit.2013.010204.
(b). APA Format:
Aparna Ram , B.B. Amberker (2013). Multiuser Message Authentication, Application to Verifiable Secret Sharing and Key Management Schemes. Computer Science and Information Technology, 1(2), 97 - 104. DOI: 10.13189/csit.2013.010204.