Fine-Tuning Groth-Sahai Proofs

DOI10.1007/978-3-642-54631-0_36zbMATH Open1335.94047OpenAlexW66196827MaRDI QIDQ5402997FDOQ5402997

Authors: Alex Escala, Jens Groth 

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

Recommendations

• Groth–Sahai Proofs Revisited
• Theorem proving for and with Gröbner bases theory
• The Grothendieck inequality revisited
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• scientific article; zbMATH DE number 125312
• Proof of a conjecture of Gross concerning fix-points
• Resolving Grosswald's conjecture on GRH
• A corrected proof of a result of Grinold
• A proof of the Grünbaum conjecture
• An elementary and unified proof of Grothendieck's inequality

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (29)

• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Anonymous counting tokens
• Shorter quadratic QA-NIZK proofs
• Extendable threshold ring signatures with enhanced anonymity
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Compact E-Cash and Simulatable VRFs Revisited
• Unbounded inner product functional encryption from bilinear maps
• QA-NIZK arguments of same opening for bilateral commitments
• Almost optimal oblivious transfer from QA-NIZK
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• Signatures of knowledge for Boolean circuits under standard assumptions
• Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
• Toward practical lattice-based proof of knowledge from Hint-MLWE
• Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
• Compact structure-preserving signatures with almost tight security
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Aggregatable distributed key generation
• A PCP theorem for interactive proofs and applications
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• Batch Groth-Sahai
• Efficient fully structure-preserving signatures and shrinking commitments
• On the impossibility of structure-preserving deterministic primitives
• Policy-compliant signatures
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Groth–Sahai Proofs Revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402997)