How to Prove Post-Quantum Security for Succinct Non-Interactive Reductions скачать в хорошем качестве

How to Prove Post-Quantum Security for Succinct Non-Interactive Reductions

Date: 2025-12-23 Speaker: Yuxi Zhang (EPFL) Abstract: Hash-based succinct non-interactive arguments (SNARGs) are widely used in practice. They are constructed via the BCS transformation, which combines an interactive oracle proof (IOP) and a hash-based vector commitment. This success has motivated the study of hash-based succinct non-interactive reductions (SNRDXs), by extending the BCS transformation to work with an interactive oracle reduction rather than an IOP. Prior post-quantum security analyses for SNARGs do not directly apply to SNRDXs. We establish the post-quantum security of SNRDXs, by showing that the extended BCS transformation is secure in the quantum random oracle model. Our modular proof introduces new definitions and techniques that may be of independent interest. This is a joint work with Alessandro Chiesa, Zijing Di, and Zihan Hu. The paper is available at: https://ia.cr/2025/2166