Authors - Konstantina Karathanasopoulou, Ioannis Vondikakis, Dimitris Georgiadis, George Dimitrakopoulos Abstract - Digital signatures are fundamental public-key cryptographic primitives used for message authentication and integrity. A message’s recipient must be able to validate that it comes from the reported sender and hasn’t been altered by anybody else. Pairing-based cryptography provides elegant and efficient mechanisms for constructing compact dig ital signature schemes. Inspired by isogeny structures on elliptic curves, we present a pairing-based digital signature system in this study. Our construction targets classical security settings and is analyzed under standard computational hardness assumptions related to bilinear groups and isogeny-based mappings. We demonstrate that the proposed ap proach attains “existential unforgeability under adaptive chosen-message attacks (UF-CMA)” within the random oracle model and address the construction’s soundness and security. Moreover, the scheme offers com pact public key and signature sizes, making it suitable for lightweight cryptographic applications.
Open Zoom