Stretching Groth-Sahai: NIZK proofs of partial satisfiability

DOI10.1007/978-3-662-46497-7_10MaRDI QIDQ5261679zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Groth–Sahai Proofs Revisited
• Fine-Tuning Groth-Sahai Proofs
• Batch Groth-Sahai
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Non-interactive Zaps and New Techniques for NIZK

Cited in

(22)

• Unconditionally secure NIZK in the fine-grained setting
• Unbounded inner product functional encryption from bilinear maps
• Fine-Tuning Groth-Sahai Proofs
• Fine-grained verifier NIZK and its applications
• Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
• Determining the <I>SHOIN(D)</I>-Satisfiability with a Complete Disjunctive Normal Form Group
• QA-NIZK arguments of same opening for bilateral commitments
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
• Batch Groth-Sahai
• Logarithmic-size (linkable) threshold ring signatures in the plain model
• Signatures of knowledge for Boolean circuits under standard assumptions
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Non-interactive zero-knowledge proofs with fine-grained security
• NIWI and new notions of extraction for algebraic languages
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
• A simple and efficient framework of proof systems for NP
• Practical traceable receipt-free encryption
• Efficient NIZKs for algebraic sets
• On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
• Updatable NIZKs from non-interactive zaps

This page was built for publication: Stretching Groth-Sahai: NIZK proofs of partial satisfiability

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