Plaintext checkable signcryption

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Digital signature guarantees the authenticity and encryption ensures the confidentiality of a transmitted message. Signcryption, as the name indicates, is a primitive which serves both these purpose with added efficiency and features. In this paper, we introduce a variant of signcryption called Plaintext Checkable Signcryption (PCSC), which extends signcryption by the following functionality: given a signcryptext c, a plaintext m and the corresponding public values, it is universally possible to check whether c is a signcryption of m. The security requirements of such a primitive is studied and a suitable model of security is proposed. Moreover, we provide efficient generic model construction for PCSC based on “Encrypt-then-Sign” paradigm using an arbitrary partially trapdoor one-way function and a signature scheme. Finally, the construction is shown to be secure in the proposed model.

Cite

CITATION STYLE

APA

Das, A., & Adhikari, A. (2015). Plaintext checkable signcryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9478, pp. 324–333). Springer Verlag. https://doi.org/10.1007/978-3-319-26961-0_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free