Sub-linear Blind Ring Signatures without Random Oracles

Essam M O Ghadafi

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

9 Citations (Scopus)


In this paper we provide the first provably secure blind ring signature construction that does not rely on random oracles, which solves an open problem raised by Herranz and Laguillaumie at ISC 2006. We present different instantiations all of which are round-optimal (i.e. have a two-move signing protocol), yield sub-linear size signatures, and meet strong security requirements. In order to realize our constructions efficiently, we construct a sub-linear size set membership proof which works in the different bilinear group settings, which may be of independent interest.

As a secondary contribution, we show how to generically combine our set membership proof with any secure signature scheme meeting some conditions to obtain ring signatures whose security does not rely on random oracles. All our constructions work over the efficient prime-order bilinear group setting and yield signatures of sub-linear size. In addition, our constructions meet strong security requirements: namely, anonymity holds under full key exposure and unforgeability holds against insider-corruption. Finally, we provide some example instantiations of the generic construction.
Original languageEnglish
Title of host publicationCoding and Cryptography - IMACC 2013
PublisherSpringer Berlin Heidelberg
Number of pages19
ISBN (Electronic)978-3-642-45239-0
ISBN (Print)978-3-642-45238-3
Publication statusPublished - 2013

Publication series

NameLecture Notes in Computer Science

Cite this