An Efficient and Publicly Verifiable Id-Based Multi-Signcryption Scheme

TL;DR

This paper introduces an efficient id-based multi-signcryption scheme that eliminates pairing computations during signcryption and allows for public verification, enhancing security and efficiency in multi-sender authentication.

Contribution

The scheme is novel in removing pairing computations at signcryption and enabling public verification, improving efficiency and practicality over existing methods.

Findings

No pairing computation during signcryption

Publicly verifiable signatures

Enhanced efficiency in multi-sender authentication

Abstract

Multi-signcryption is used when different senders wants to authenticate a single message without revealing it. This paper proposes a multi signcryption scheme in which no pairing is computed on the signcryption stage and the signatures can be verified publicly.