Sub-linear blind ring signatures without random oracles

Ghadafi, Essam M.

Abstract

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. © 2013 Springer-Verlag Berlin Heidelberg.

Citation

Ghadafi, E. M. (2013). Sub-linear blind ring signatures without random oracles. In M. Stam (Ed.), https://doi.org/10.1007/978-3-642-45239-0_18

• Publication Date: Jan 1, 2013
• Deposit Date: Mar 27, 2017
• Publisher: Springer Verlag (Germany)
• Volume: 8308 LNCS
• Pages: 304-323
• Series Title: Lecture Notes in Computer Science (LNCS)
• Series Number: 8308
• ISBN: 9783642452383
• DOI: https://doi.org/10.1007/978-3-642-45239-0_18
• Keywords: sub-linear, blind, ring, signatures, random, oracles
• Public URL: https://uwe-repository.worktribe.com/output/938137
• Publisher URL: http://dx.doi.org/10.1007/978-3-642-45239-0_18