Fine-Tuning Groth-Sahai Proofs

DOI10.1007/978-3-642-54631-0_36zbMath1335.94047OpenAlexW66196827MaRDI QIDQ5402997

Jens Groth, Alex Escala

Publication date: 25 March 2014

Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_36

zbMATH Keywords

Groth-Sahai proofsnon-interactive zero-knowledge proofscommit-and-prove schemestype-based commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (22)

QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Signatures of knowledge for Boolean circuits under standard assumptions ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ A PCP theorem for interactive proofs and applications ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Extendable threshold ring signatures with enhanced anonymity ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Policy-compliant signatures ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Compact structure-preserving signatures with almost tight security ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Aggregatable distributed key generation ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: Fine-Tuning Groth-Sahai Proofs