Batch Groth-Sahai - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Batch Groth-Sahai

Résumé

In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zero-knowledge (and witness-indistinguishable) proofs in bilinear groups. While avoiding expensive NP-reductions, these proof systems are still inefficient due to a number of pairing computations required for verification. We apply recent techniques of batch verification to the Groth-Sahai proof systems and manage to improve significantly the complexity of proof verification. We give explicit batch verification formulas for generic Groth-Sahai equations (whose cost is less than a tenth of the original) and also for specific popular protocols relying on their methodology (namely Groth's group signatures and Belenkiy-Chase-Kohlweiss-Lysyanskaya's P-signatures).
Fichier principal
Vignette du fichier
BatchGS.pdf (270.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00577167 , version 1 (16-03-2011)

Identifiants

Citer

Olivier Blazy, Georg Fuchsbauer, Malika Izabachène, Amandine Jambert, Hervé Sibert, et al.. Batch Groth-Sahai. Applied Cryptography and Network Security, 8th International Conference, ACNS 2010, Jun 2010, Beijing, China. pp.218-235, ⟨10.1007/978-3-642-13708-14⟩. ⟨inria-00577167⟩
289 Consultations
261 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More