Signcryption, achieves confidentiality and authenticity simultaneously in an efficient manner, is a novel cryptographic primitive in a single logic step with more efficient computation and communication cost to support the security. In this paper, we analyze two identity based signcryption schemes under the without random oracles model including a signcryption scheme by Yu et al. [11] and a certificateless signcryption scheme by Liu et al. [12]. We give the chosen plaintext attacks to prove that the proposed previous schemes cannot resist on the indistinguishability on chosen ciphertext attack to support semantic secure for confidentiality. © 2010 Springer-Verlag.
CITATION STYLE
Zhang, M., Li, P., Yang, B., Wang, H., & Takagi, T. (2010). Towards confidentiality of ID-based signcryption schemes under without random oracle model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6122 LNCS, pp. 98–104). https://doi.org/10.1007/978-3-642-13601-6_12
Mendeley helps you to discover research relevant for your work.