This fall, I’ve continued reading MPC-in-the-head papers:
- Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures
- Limbo: Efficient Zero-knowledge MPCitH-based Arguments
- Building MPCitH-based Signatures from MQ, MinRank, Rank SD and PKP
I also started reading Proofs, Arguments, and Zero-Knowledge, which deals with SNARKs and other proof systems.
More recently, I’ve been learning about black-box separation techniques. Is it possible to obtain public-key encryption from one-way functions? These papers formally establish impossibility results for these kinds of questions: