767 articles – 1379 references  [version française]
HAL: inria-00577167, version 1

See short view  BibTeX,EndNote,...
Batch Groth-Sahai
Blazy O., Fuchsbauer G., Izabachène M., Jambert A., Sibert H., Vergnaud D.
Applied Cryptography and Network Security, 8th International Conference, ACNS 2010, Beijing : China (2010) - http://hal.inria.fr/inria-00577167
Peer-reviewed conferences/proceedings
Computer Science/Cryptography and Security
Batch Groth-Sahai
Olivier Blazy 1, 2, Georg Fuchsbauer 1, 2, Malika Izabachène 3, Amandine Jambert 4, 5, Hervé Sibert 6, Damien Vergnaud () 1, 2
1:  CASCADE (INRIA Rocquencourt)
http://www-c.inria.fr/Internet/recherche/les-equipes-de-recherche/CASCADE_page
INRIA – CNRS : UMR 8548 – Ecole normale supérieure de Paris - ENS Paris
France
2:  Laboratoire d'informatique de l'école normale supérieure (LIENS)
http://www.di.ens.fr
CNRS : UMR8548 – Ecole normale supérieure de Paris - ENS Paris
45 Rue d'Ulm 75230 PARIS CEDEX 05
France
3:  Université Versailles Saint-Quentin en Yvelines (UVSQ)
http://www.uvsq.fr/
Université de Versailles Saint-Quentin-en-Yvelines
France
4:  Orange Labs [Caen]
Orange Labs
Orange Labs 42 rue des Coutures 14066 Caen, France,
France
5:  Institut de Mathématiques de Bordeaux (IMB)
http://www.math.u-bordeaux.fr/IMB/
CNRS : UMR5251 – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II
351 cours de la Libération 33405 TALENCE CEDEX
France
6:  ST-Ericsson [Le Mans]
ST-Ericsson
ST-Ericsson, 9-11 rue Pierre-Felix Delarue, 72100 Le Mans Cedex 9
France
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).
English

2010-03-16
international
Applied Cryptography and Network Security, 8th International Conference, ACNS 2010
Beijing
China
2010-06-22
2010-06-25
Jianying Zhou and Moti Yung
Springer
Applied Cryptography and Network Security, 8th International Conference, ACNS 2010
6123
Lecture Notes in Computer Science
218-235
http://www.springerlink.com/content/hv34521472vp7m43/

Pairing-based cryptography – Batch veri cation – Groth-Sahai proof system
Project Id ANR-07-TCOM-013
Year 2007
Project acronyme TCOM
Project title Pairings and Advances in Cryptology for E-cash
Intitule Télécommunications
Acronyme PACE
Cordis number 216676
Acronyme ECRYPT II
Title European Network of Excellence in Cryptology - Phase II
Funded by ICT
Start date 2008-07-31
End date 2012-07-31
Call identifier FP7-ICT-2007-1
Attached file list to this document: 
PDF
BatchGS.pdf(306.4 KB)