Skip to Main content Skip to Navigation
Conference papers

Short Undeniable Signatures Without Random Oracles: the Missing Link

Fabien Laguillaumie 1 Damien Vergnaud 2
1 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : We introduce a new undeniable signature scheme which is existentially unforgeable and invisible under chosen message attacks without using any random oracle. The scheme is a simple embedding of Boneh and Boyen's recent short signature scheme in a group where the decisional Diffie-Hellman problem is assumed to be difficult. The invisibility of our scheme relies on a decisional variant of the strong Diffie-Hellman assumption, while its unforgeability relies on the strong Diffie-Hellman assumption.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Fabien Laguillaumie <>
Submitted on : Saturday, February 18, 2006 - 2:47:27 PM
Last modification on : Monday, April 27, 2020 - 4:14:03 PM
Long-term archiving on: : Saturday, April 3, 2010 - 10:29:16 PM


  • HAL Id : inria-00001122, version 1



Fabien Laguillaumie, Damien Vergnaud. Short Undeniable Signatures Without Random Oracles: the Missing Link. Indocrypt 2005, Dec 2005, Bangalore, India. ⟨inria-00001122⟩



Record views


Files downloads