Abstract
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by using a new NIZK proof technique, related to the BGN cryptosystem and the GOS proof system, but that allows us to hide integers from the full domain rather than individual bits. © International Association for Cryptologic Research 2007.
Cite
CITATION STYLE
Boyen, X., & Waters, B. (2007). Full-domain subgroup hiding and constant-size group signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4450 LNCS, pp. 1–15). Springer Verlag. https://doi.org/10.1007/978-3-540-71677-8_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
