Recent Development of Multiuser Message Authentication, Application to Verifiable Secret Sharing and Key Management Schemes

Authors

  • R. Aparna Department of Information Science and Engg., Siddaganga Institute of Technology, Tumakuru, Karnataka, India.
  • B. B. Amberker Department of Computer Science and Engg., National Institute of Technology, Warangal, Andhra Pradesh, India.

DOI:

https://doi.org/10.9734/bpi/ctmcs/v4/2101F

Keywords:

Authentication code, multiuser authentication, message, verifiable secret sharing, key management, threshold

Abstract

In secure group communication, providing authentication for messages exchanged among a group of users is important. We create multiuser authentication techniques that are impenetrable to colluding malevolent users with fewer than k users, where all n users are allowed to transmit messages (simultaneously with being receivers). In our method, each user must keep2k log2 q1 bits of secret information, and tags to authenticate communications must be k log2 q long.. We use this to achieve a non-interactive verifiable secret sharing scheme for many dealers, in which shares reveal no information about the secret and dealers cannot trade inconsistent shares, in the scenario where participants are allowed to use previously released private keys. Without incurring additional storage costs, we also provide authentication to the group key management systems proposed by Blundo et al. and Fiat-Naor.

Published

2021-07-10

How to Cite

R. Aparna, & B. B. Amberker. (2021). Recent Development of Multiuser Message Authentication, Application to Verifiable Secret Sharing and Key Management Schemes. Current Topics on Mathematics and Computer Science Vol. 4, 57–69. https://doi.org/10.9734/bpi/ctmcs/v4/2101F