Efficient NIZKs for algebraic sets

DOI10.1007/978-3-030-92078-4_5zbMath1514.94070OpenAlexW3204585232MaRDI QIDQ6157547

Geoffroy Couteau, Unnamed Author, Roberto Parisella, Helger Lipmaa

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 languagesalgebraic branching programspairing-based cryptographyzero knowledgealgebraic setsNIZKSPHF

Mathematics Subject Classification ID

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

Related Items (1)

Zero-knowledge proofs for set membership: efficient, succinct, modular

Cites Work

• Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols
• An Algebraic Framework for Diffie-Hellman Assumptions
• Computing Linear Matrix Representations of Helton-Vinnikov Curves
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• The Kernel Matrix Diffie-Hellman Assumption
• Unifying Zero-Knowledge Proofs of Knowledge
• Practical Zero-Knowledge Proofs for Circuit Evaluation
• Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
• Quadratic Span Programs and Succinct NIZKs without PCPs
• On QA-NIZK in the BPK Model
• Ideals, Varieties, and Algorithms
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Non-interactive Zaps and New Techniques for NIZK
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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