Paper 2026/449 Original: eprint.iacr.org/2026/449 ↗
Short Signatures from DDH without Pairings or Random Oracles
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2026-05-12: last updated
- 2026-03-04: published
- Short URL
- https://ia.cr/2026/449
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2026/449}
}