Afficher la notice abrégée

Batch Groth-Sahai

hal.structure.identifierConstruction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities [CASCADE]
hal.structure.identifierLaboratoire d'informatique de l'école normale supérieure [LIENS]
dc.contributor.authorBLAZY, Olivier
hal.structure.identifierConstruction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities [CASCADE]
hal.structure.identifierLaboratoire d'informatique de l'école normale supérieure [LIENS]
dc.contributor.authorFUCHSBAUER, Georg
hal.structure.identifierUniversité de Versailles Saint-Quentin-en-Yvelines [UVSQ]
dc.contributor.authorIZABACHÈNE, Malika
hal.structure.identifierOrange Labs [Caen]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorJAMBERT, Amandine
hal.structure.identifierST-Ericsson [Le Mans]
dc.contributor.authorSIBERT, Hervé
hal.structure.identifierConstruction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities [CASCADE]
hal.structure.identifierLaboratoire d'informatique de l'école normale supérieure [LIENS]
dc.contributor.authorVERGNAUD, Damien
dc.contributor.editorJianying Zhou and Moti Yung
dc.date.accessioned2024-04-04T02:27:06Z
dc.date.available2024-04-04T02:27:06Z
dc.date.issued2010-03-16
dc.date.conference2010-06-22
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190002
dc.description.abstractEnIn 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).
dc.description.sponsorshipPairings and Advances in Cryptology for E-cash - ANR-07-TCOM-0013
dc.language.isoen
dc.publisherSpringer
dc.subject.enPairing-based cryptography
dc.subject.enBatch veri cation
dc.subject.enGroth-Sahai proof system
dc.title.enBatch Groth-Sahai
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-642-13708-14
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
dc.description.sponsorshipEuropeEuropean Network of Excellence in Cryptology - Phase II
bordeaux.page218-235
bordeaux.volume6123
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleApplied Cryptography and Network Security, 8th International Conference, ACNS 2010
bordeaux.countryCN
bordeaux.conference.cityBeijing
bordeaux.peerReviewedoui
hal.identifierinria-00577167
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2010-06-25
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00577167v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2010-03-16&rft.volume=6123&rft.spage=218-235&rft.epage=218-235&rft.au=BLAZY,%20Olivier&FUCHSBAUER,%20Georg&IZABACH%C3%88NE,%20Malika&JAMBERT,%20Amandine&SIBERT,%20Herv%C3%A9&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée