TY - GEN
T1 - Anonymizable ring signature without pairing
AU - Blazy, Olivier
AU - Bultel, Xavier
AU - Lafourcade, Pascal
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - 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.
AB - 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.
U2 - 10.1007/978-3-319-51966-1_14
DO - 10.1007/978-3-319-51966-1_14
M3 - Conference contribution
AN - SCOPUS:85009507977
SN - 9783319519654
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 214
EP - 222
BT - Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers
A2 - Garcia-Alfaro, Joaquin
A2 - Cuppens, Frederic
A2 - Cuppens-Boulahia, Nora
A2 - Wang, Lingyu
A2 - Tawbi, Nadia
PB - Springer Verlag
T2 - 9th International Symposium on Foundations and Practice of Security, FPS 2016
Y2 - 24 October 2016 through 26 October 2016
ER -