2010•Jisuanji gongchengRequires access

Verifiable Signcryption Scheme Based on Bilinear Pairs

Changshe Ma

Abstract

In traditional signcryption scheme,signature can only be verified by the recipient,which implicates that signcryption can not be used to construct fair exchange protocols directly.Aiming at such problem,this paper presents a verifiable signcryption scheme and its security model.Based on bilinear pairs,an efficient verifiable signcryption algorithm is proposed.And the unforgeablity and security of the scheme in the random oracle model is proved.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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

Key concepts: Signcryption, Verifiable secret sharing, Random oracle, Computer science, Scheme (mathematics), Bilinear interpolation, Construct (python library), Signature (topology)