A post-quantum uc-commitment scheme in the global random oracle model from code-based assumptions

Abstract

In this work, we propose a post-quantum UC-commitment scheme in the Global Random Oracle Model, where only one non-programmable random oracle is available. The security of our proposal is based on two well-established post-quantum hardness assumptions from coding theory: The Syn-drome Decoding and the Goppa Distinguisher. We prove that our proposal is perfectly hiding and computationally binding.