A Directly Public Verifiable Signcryption Scheme based on Elliptic Curves
M. Toorani, A. A. Beheshti

TL;DR
This paper introduces a new elliptic curve-based signcryption scheme that enables public verification without secret keys, ensuring security attributes like confidentiality, authentication, and forward secrecy, suitable for resource-limited environments.
Contribution
It presents a novel directly public verifiable signcryption scheme based on elliptic curves, enhancing security and efficiency for constrained environments.
Findings
Provides public verifiability without secret keys
Ensures message confidentiality, authentication, and non-repudiation
Suitable for resource-constrained environments
Abstract
A directly public verifiable signcryption scheme is introduced in this paper that provides the security attributes of message confidentiality, authentication, integrity, non-repudiation, unforgeability, and forward secrecy of message confidentiality. It provides the attribute of direct public verifiability so anyone can verify the signcryption without any need for any secret information from the corresponding participants. The proposed scheme is based on elliptic curve cryptography and is so suitable for environments with resource constraints.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
