Anonymizable Ring Signature Without Pairing - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Anonymizable Ring Signature Without Pairing

Abstract

Ring signature is a well-known cryptographic primitive that allows any user who has a signing key to anonymously sign a message according to a group of users. Some years ago, Hoshino et al. propose a new kind of ring signature where anybody can transform a digital signature into an anonymous signature according to a chosen group of users; authors present a pairing-based construction that is secure under the gap Diffie-Hellman assumption in the random oracle model. However this scheme is quite inefficient for large group since the generation of the anonymous signature requires a number of pairing computations that is linear in the size of the group. In this paper, we give a more efficient anonymizable signature scheme without pairing. Our anonymization algorithm requires n exponentiations in a prime order group where n is the group size. Our proposal is secure under the discrete logarithm assumption in the random oracle model, which is a more standard assumption.
Fichier principal
Vignette du fichier
BBL16b.pdf (370.91 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01382951 , version 1 (12-12-2017)

Identifiers

  • HAL Id : hal-01382951 , version 1

Cite

Olivier Blazy, Xavier Bultel, Pascal Lafourcade. Anonymizable Ring Signature Without Pairing. 9th International Symposium on Foundations & Practice of Security, 2016, Québec, Canada. ⟨hal-01382951⟩
281 View
243 Download

Share

Gmail Mastodon Facebook X LinkedIn More