Introduction to Zero Knowledge Proofs for Mathematicians?

Question

I'd like to learn more about Zero Knowledge Proofs (ZKPs), specifically Non-Interactive ZKPs. However, given that it's a relatively new field seemingly propelled by blockchains, all the introductions I can find are heavily geared towards, use examples in, or assume a background in cryptocurrencies and cryptography.

Are there accessible introductions to ZKPs that are more oriented to those with pure-maths backgrounds?

---

Essentially, I'd like to actually convert some proofs in a simple propositional calculus such as a Hilbert system to a ZKP (preferably non-interactive). Since formal proofs (especially proofs in a propositional calculus, like this one for $A\implies A$) are relatively simple objects, I imagine (or hope) that I don't need a huge introduction to theoretical cryptography or blockchain-technologies, like so many introductions seem to suggest, but all the pure-maths examples of ZKPs are either way too simplified (like the Ali-Baba cave), or extremely high level (like universal ZKP protocols such as zk-SNARKs).

So, any and all insight would be greatly appreciated.

Answer 1

Maybe you can search up some lecture notes? For example, maybe you can try this: https://crypto.stanford.edu/cs355/18sp/lec3.pdf

Answer 2

In my opinion, the canonical reference for zero knowledge is this manuscript. You may find what you are looking for here.