Lightweight transparent zero-knowledge proofs for cross-domain statements

DOI10.1007/978-981-95-3540-8_3MaRDI QIDQ6846330zbMATH OpenFDO

Authors Zhengzhou Tu, Min Xie, Junbin Fang, Yong Yu, Zoe L. Jiang

Publication date 11 March 2026

Full work available at URL https://doi.org/10.1007/978-981-95-3540-8_3

zbMATH Keywords

commit-and-provecross-domainideal linear commitmentlightweightzero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
• Cryptography with constant computational overhead
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• scientific article; zbMATH DE number 1263215 (Why is no real title available?)
• scientific article; zbMATH DE number 1088250 (Why is no real title available?)
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Low-complexity cryptographic hash functions
• Non-interactive zero-knowledge proofs for composite statements
• On black-box knowledge-sound commit-and-prove SNARKs
• On the size of pairing-based non-interactive arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Sigma protocols from verifiable secret sharing and their applications
• The knowledge complexity of interactive proof-systems
• Updatable and universal common reference strings with applications to zk-SNARKs
• Updateable Inner Product Argument with Logarithmic Verifier and Applications

This page was built for publication: Lightweight transparent zero-knowledge proofs for cross-domain statements

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