Skip to Main content Skip to Navigation
Conference papers

Batch Groth-Sahai

Abstract : 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).
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00577167
Contributor : Damien Vergnaud <>
Submitted on : Wednesday, March 16, 2011 - 3:37:38 PM
Last modification on : Tuesday, February 2, 2021 - 2:26:02 PM
Long-term archiving on: : Friday, June 17, 2011 - 2:44:05 AM

File

BatchGS.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

482

Files downloads

326