Abstract
An identity-based threshold unsigncryption scheme is proposed, which is the integration of the signcryption scheme, the (t,n) threshold scheme and zero knowledge proof for the equality of two discrete logarithms based on the bilinear map. In this scheme, a signcrypted message is decrypted only when more than t members join an unsigncryption protocol and the signature can be verified by any third party. A formal proof of security of this scheme is provided in the random oracle model, assuming the Decisional Bilinear Dime-Hellman problem is computationally hard. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
Li, F., Gao, J., & Hu, Y. (2005). ID-based threshold unsigncryption scheme from pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3822 LNCS, pp. 242–253). Springer Verlag. https://doi.org/10.1007/11599548_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
