Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems

ePrint Report: Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems

Jules Maire, Damien Vergnaud

We present a cryptographic string commitment scheme that is computationally hiding and binding based on (modular) subset sum problems. It is believed that these NP-complete problems provide post-quantum security contrary to the number theory assumptions currently used in cryptography. Using techniques recently introduced by Feneuil, Maire, Rivain and Vergnaud, this simple commitment scheme enables an efficient zero-knowledge proof of knowledge for committed values as well …

cryptographic eprint report knowledge modular post-quantum post-quantum security problems quantum quantum security report security theory