A practical non-interactive scheme is proposed to simultaneously solve several open problems in group oriented cryptography. The sender of the information is allowed to determine the encyption/decyption keys as well as the information destination without any coordination with the receiving group. The encrypted message is broadcasted to the receiving group and the receivers may authenticate themselves for legitimacy of the infornation directly from the ciphertezt. The security of the scheme can be shown to be equivalent to the difficulty of solving the discrete logarithm problem.
CITATION STYLE
Hwang, T. (1991). Cryptosystem for group oriented cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 473 LNCS, pp. 352–360). Springer Verlag. https://doi.org/10.1007/3-540-46877-3_32
Mendeley helps you to discover research relevant for your work.