Short Signatures from DDH without Pairings or Random Oracles

Dario Catalano; Valentina Frasca; Emanuele Giunta

Paper 2026/449

Short Signatures from DDH without Pairings or Random Oracles

Dario Catalano

, University of Catania

Valentina Frasca

, University of Catania

Emanuele Giunta

, ETH Zurich

Abstract

We present two constructions of short signature schemes based on the polynomial hardness of decisional Diffie Hellman. Our simplest scheme guarantees selective security (i.e. the adversary has to commit to the forged message ahead of time) while the second one realizes full fledged existential unforgeability. Remarkably, our schemes can be implemented over standard prime order groups (no pairings needed) and can be proven secure without resorting to the random oracle heuristic.

Note: *EDIT*: typos correction and minor revision to the second construction

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: A major revision of an IACR publication in EUROCRYPT 2026
DOI: 10.1007/978-3-032-25291-3_11
Keywords: Digital Signature DDH pairing-free ROM-free prime-order groups
Contact author(s): dario catalano @ unict it
valentina frasca @ phd unict it
emanuele giunta @ inf ethz ch
History: 2026-05-12: revised; 2026-03-04: received; See all versions
Short URL: https://ia.cr/2026/449
License: CC BY

BibTeX

@misc{cryptoeprint:2026/449,
      author = {Dario Catalano and Valentina Frasca and Emanuele Giunta},
      title = {Short Signatures from {DDH} without Pairings or Random Oracles},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/449},
      year = {2026},
      doi = {10.1007/978-3-032-25291-3_11},
      url = {https://eprint.iacr.org/2026/449}
}