ScholarLens Back to search
2010•Intelligent Automation & Soft ComputingRequires access

Efficient Online/Offline Signcryption Scheme

Baodian Wei, Fangguo Zhang, Xiaofeng Chen

Open publisher page 1 citations

Abstract

Abstract In this paper, we propose a new signcryption scheme and its online/offline version from pairings. Based on the assumption of k’1 square roots, the scheme is proven, without random oracles, to be secure against the existential forgery under an adaptive chosen-message attack. It is also proven that its IND-CPA security also implies its IND-CCA2 security. A comparison is made with existing schemes from the viewpoint of computational cost and the size of ciphertexts.

About this research paper

What this paper is about

Abstract In this paper, we propose a new signcryption scheme and its online/offline version from pairings. Based on the assumption of k’1 square roots, the scheme is proven, without random oracles, to be secure against the existential forgery under an adaptive chosen-message attack. It is also proven that its IND-CPA security also implies its IND-CCA2 security. A comparison is made with existing schemes from the viewpoint of computational cost and the size of ciphertexts.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract In this paper, we propose a new signcryption scheme and its online/offline version from pairings. Based on the assumption of k’1 square roots, the scheme is proven, without random oracles, to be secure against the existential forgery under an adaptive chosen-message attack. It is also proven that its IND-CPA security also implies its IND-CCA2 security. A comparison is made with existing schemes from the viewpoint of computational cost and the size of ciphertexts.

Key concepts: Signcryption, Computer science, Scheme (mathematics), Online and offline, Computer security, Theoretical computer science, Encryption, Operating system

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient Online/Offline Signcryption Scheme — Research Paper | ScholarLens