We demonstrate how to build computationally secure commitment schemes with the aid of quantum auxiliary inputs without unproven complexity assumptions. Furthermore, the quantum auxiliary input can be prepared either (1) efficiently through a trusted setup similar to the classical common random string model, or (2) strictly between the two involved parties in uniform exponential time. Classically this remains impossible without first proving $\mathsf{P} \neq \mathsf{NP}$.

翻译：我们展示了如何借助量子辅助输入构建计算安全的承诺方案，而无需依赖未经证实的复杂性假设。此外，量子辅助输入可通过以下两种方式之一制备：（1）通过类似经典公共随机字符串模型的可信设置高效完成，或（2）严格在涉及双方之间以均匀指数时间完成。经典情况下，若未首先证明 $\mathsf{P} \neq \mathsf{NP}$，此目标仍无法实现。