Skip to Main content Skip to Navigation
Conference papers

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

Olivier Blazy 1, * David Pointcheval 1 Damien Vergnaud 1
* Corresponding author
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download
Contributor : Olivier Blazy <>
Submitted on : Wednesday, February 22, 2012 - 12:29:43 PM
Last modification on : Monday, December 14, 2020 - 5:01:24 PM
Long-term archiving on: : Thursday, June 14, 2012 - 4:45:40 PM


Files produced by the author(s)




Olivier Blazy, David Pointcheval, Damien Vergnaud. Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions. TCC 2012 - Ninth IACR Theory of Cryptography Conference, Mar 2012, Taormina, Italy. pp.94-112, ⟨10.1007/978-3-642-28914-9_6⟩. ⟨hal-00672939⟩



Record views


Files downloads