On QA-NIZK in the BPK Model

DOI10.1007/978-3-030-45374-9_20zbMath1501.94022OpenAlexW3021879125MaRDI QIDQ5041171

Janno Siim, Helger Lipmaa, Behzad Abdolmaleki, Michał Zając

Publication date: 13 October 2022

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-45374-9_20

zbMATH Keywords

QA-NIZKsubversion-securitybare public key modelno-auxiliary-string zero knowledgenon-black-box zero knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ A Unified Framework for Non-universal SNARKs ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Efficient NIZKs for algebraic sets ⋮ Smooth zero-knowledge hash functions ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ On subversion-resistant SNARKs

Uses Software

• Pinocchio
• LegoSNARK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definitions and properties of zero-knowledge proof systems
• Non-interactive zaps of knowledge
• A subversion-resistant SNARK
• An efficient pairing-based shuffle argument
• Subversion-zero-knowledge SNARKs
• The algebraic group model and its applications
• Shorter quadratic QA-NIZK proofs
• QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
• Compactly Hiding Linear Spans
• New Techniques for Non-interactive Shuffle and Range Arguments
• An Algebraic Framework for Diffie-Hellman Assumptions
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
• Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Square Span Programs with Applications to Succinct NIZK Arguments
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
• The Kernel Matrix Diffie-Hellman Assumption
• On the CCA1-Security of Elgamal and Damgård’s Elgamal
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Resettable zero-knowledge (extended abstract)
• Get Shorty via Group Signatures without Encryption
• Lower Bounds for Non-interactive Zero-Knowledge
• The knowledge complexity of interactive proof-systems
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
• Separating succinct non-interactive arguments from all falsifiable assumptions
• On the Size of Pairing-Based Non-interactive Arguments
• Topics in Cryptology – CT-RSA 2006

This page was built for publication: On QA-NIZK in the BPK Model