On QA-NIZK in the BPK Model

Explore a presentation from PKC 2020 on Quasi-Adaptive Non-Interactive Zero-Knowledge (QA-NIZK) proofs in the Bare Public Key (BPK) model. Delve into the motivations behind NIZK in the Common Reference String (CRS) model, examine the soundness of Kiltz-Wee QA-NIZK, and investigate subversion security and impossibility results. Learn about the equivalence of CRS and BPK models, the implementation of QA-NIZK in the BPK model, and the relationship between Persistent Zero-Knowledge and standard Zero-Knowledge. Discover a new approach for adapting Kiltz-Wee QA-NIZK to the BPK model and explore additional findings in this 24-minute talk by researchers Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, and Michał Zając.

Intro
Motivation
NIZK in CRS model
On the Soundness of KW QA-NIZK
Subversion security and Impossibility Results
Reminder: Different Models
Our result 1: CRS = BPK
Our result 2: QA-NIZK in BPK model
Does Persistent ZK provide ZK?
Our recipe for Kiltz-Wee QA-NIZK in BPK model
Additional Results