Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Olivier Blazy <>
Submitted on : Tuesday, December 12, 2017 - 4:27:06 PM
Last modification on : Wednesday, April 21, 2021 - 8:52:05 AM


Files produced by the author(s)


  • HAL Id : hal-01382951, version 1


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⟩



Record views


Files downloads