Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions

Olivier Blazy 1, * David Pointcheval 1 Damien Vergnaud 1
* Auteur correspondant
1 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : In 2008, Groth and Sahai proposed a powerful suite of techniques for constructing non-interactive zero-knowledge proofs in bilinear groups. Their proof systems have found numerous applications, including group signature schemes, anonymous voting, and anonymous credentials. In this paper, we demonstrate that the notion of smooth projective hash functions can be useful to design round-optimal privacy-preserving interactive protocols. We show that this approach is suitable for designing schemes that rely on standard security assumptions in the standard model with a common-reference string and are more efficient than those obtained using the Groth-Sahai methodology. As an illustration of our design principle, we construct an efficient oblivious signature-based envelope scheme and a blind signature scheme, both round-optimal.
Type de document :
Communication dans un congrès
Ronald Cramer. TCC 2012 - Ninth IACR Theory of Cryptography Conference, Mar 2012, Taormina, Italy. Springer, 7194, pp.94-112, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-28914-9_6〉
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00672939
Contributeur : Olivier Blazy <>
Soumis le : mercredi 22 février 2012 - 12:29:43
Dernière modification le : jeudi 11 janvier 2018 - 06:22:10
Document(s) archivé(s) le : jeudi 14 juin 2012 - 16:45:40

Fichier

MainTCC.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Olivier Blazy, David Pointcheval, Damien Vergnaud. Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions. Ronald Cramer. TCC 2012 - Ninth IACR Theory of Cryptography Conference, Mar 2012, Taormina, Italy. Springer, 7194, pp.94-112, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-28914-9_6〉. 〈hal-00672939〉

Partager

Métriques

Consultations de la notice

391

Téléchargements de fichiers

276