Efficient NIZKs for algebraic sets

DOI10.1007/978-3-030-92078-4_5zbMATH Open1514.94070OpenAlexW3204585232MaRDI QIDQ6157547FDOQ6157547

Authors: Geoffroy Couteau, Helger Lipmaa, Roberto Parisella 

Publication date: 12 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_5

Recommendations

• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Quasi-adaptive NIZK for linear subspaces revisited
• Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
• Quadratic span programs and succinct NIZKs without PCPs
• Non-interactive Zaps and New Techniques for NIZK

zbMATH Keywords

algebraic branching programspairing-based cryptographyzero knowledgealgebraic setsalgebraic languagesNIZKSPHF

Mathematics Subject Classification ID

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

Cites Work

• Ideals, Varieties, and Algorithms
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Non-interactive Zaps and New Techniques for NIZK
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing linear matrix representations of Helton-Vinnikov curves
• Title not available (Why is that?)
• Quadratic span programs and succinct NIZKs without PCPs
• An algebraic framework for Diffie-Hellman assumptions
• Unifying Zero-Knowledge Proofs of Knowledge
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• New techniques for SPHFs and efficient one-round PAKE protocols
• The kernel matrix Diffie-Hellman assumption
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
• Scalable zero knowledge via cycles of elliptic curves
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• QA-NIZK arguments in asymmetric groups: new tools and new constructions
• On QA-NIZK in the BPK model
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Practical zero-knowledge proofs for circuit evaluation

Cited In (2)

• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Set (non-)membership NIZKs from determinantal accumulators

This page was built for publication: Efficient NIZKs for algebraic sets

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