Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability

DOI10.1007/978-3-662-46497-7_10zbMath1334.94094OpenAlexW64287730MaRDI QIDQ5261679

Carla Ràfols

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_10

zbMATH Keywords

non-interactive zero knowledge proofspartial satisfiabilitytwo-message and one-message witness-indistinguishable proofs (ZAPs and NIWIs)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (17)

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Signatures of Knowledge for Boolean Circuits Under Standard Assumptions ⋮ Signatures of knowledge for Boolean circuits under standard assumptions ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Non-interactive zero-knowledge proofs with fine-grained security ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Fine-grained verifier NIZK and its applications ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Unconditionally secure NIZK in the fine-grained setting ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Efficient NIZKs for algebraic sets ⋮ Updatable NIZKs from non-interactive zaps ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability