Incrementally executable signcryptions

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

Abstract

We present the concept of incrementally executable signcryptions, which is a generalization of traditional on-line/off-line signcryption and facilitates optimizing the sender's off-line computation. With an incrementally executable signcryption scheme, the sender can activate signcryption process incrementally by its given sequential input: the sender's key pair, a recipient's public key, and a plaintext message to be sent to the recipient. Furthermore, we present an efficient generic construction of incrementally executable signcryption scheme. In our construction, the signing process can be done before being given the recipient's public key as well as the message to be sent. This feature enables us to accelerate the subsequent processes. Moreover, our construction achieves the strongest security notions without relying on random oracles. In addition, it requires a weak assumption for the underlying signature scheme, i.e., the underlying signature scheme is sufficient to be unforgeable under generic chosen message attack. Furthermore, it supports the parallel un-signcryption feature, which allows receivers to perform two potentially expensive computations, i.e., the verification of off-line signature and the key-decapsulation, in parallel. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Yamamoto, D., Sato, H., & Fukuzawa, Y. (2014). Incrementally executable signcryptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8544 LNCS, pp. 226–241). Springer Verlag. https://doi.org/10.1007/978-3-319-08344-5_15

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