Providing authentication for messages shared among a group of users is critical in safe group communication. With less than k users, we develop multiuser authentication approaches that are impermeable to conspiring hostile users, where all n users are authorised to transmit messages (simultaneously with being receivers). Each user must store 2k log2 q1 bits of secret information in our method, and authentication tags must be k log2 q lengthy. We use this to create a secret sharing system that is non-interactive and verifiable. In a case where participants are allowed to use previously revealed private keys, a scheme for numerous dealers exists in which shares reveal no information about the secret and dealers are unable to trade inconsistent shares. We also give authentication to the Blundo et al. and Fiat-Naor group key management systems without incurring additional storage expenditures.
Author (S) Details
Dr. 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.
View Book :- https://stm.bookpi.org/CTMCS-V4/article/view/2281