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

2009/09/08 by Munendra Agrawal, Agrawal, Munendra, Prashant Kushwah +3
Computer Science · #Coding theory and cryptography #Complexity and Algorithms in Graphs #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR

paper · pdf · doi:10.48550/arxiv.0909.1412

arxiv created 2009/09/08 · openalex publication_date 2009/09/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• New ID Based Multi-Proxy Multi-Signcryption Scheme from Pairings
• Efficient Identity Based Public Verifiable Signcryption Scheme
• Multi-Proxy Multi-Signcryption Scheme from Pairings
• Provable Secure Identity Based Generalized Signcryption Scheme
• Multi-signer Strong Designated Multi-verifier Signature Schemes based on Multiple Cryptographic Algorithms