Proofs on encrypted values in bilinear groups and an application to anonymity of signatures

12Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a generic methodology to unlinkably anonymize cryptographic schemes in bilinear groups using the Boneh-Goh-Nissim cryptosystem and nizk proofs in the line of Groth, Ostrovsky and Sahai. We illustrate our techniques by presenting the first instantiation of anonymous proxy signatures (in the standard model), a recent primitive unifying the functionalities and strong security notions of group and proxy signatures. To construct our scheme, we introduce various efficient nizk and witness-indistinguishable proofs. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fuchsbauer, G., & Pointcheval, D. (2009). Proofs on encrypted values in bilinear groups and an application to anonymity of signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5671 LNCS, pp. 132–149). https://doi.org/10.1007/978-3-642-03298-1_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free