Efficient NIZKs for algebraic sets

DOI10.1007/978-3-030-92078-4_5MaRDI QIDQ6157547zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algebraic branching programspairing-based cryptographyzero knowledgealgebraic setsalgebraic languagesNIZKSPHF

Mathematics Subject Classification ID

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

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

Cites work

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

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)