Encrypting Proofs on Pairings and Its Application to Anonymity for Signatures

Download Now Free registration required

Executive Summary

The authors 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. They illustrate the techniques by presenting the first instantiation of anonymous proxy signatures, a recent primitive unifying the functionalities and strong security notions of group and proxy signatures. To construct the scheme, they introduce various efficient nizk and witness-indistinguishable proofs, and a relaxed version of simulation soundness.

  • Format: PDF
  • Size: 401.5 KB