Since the Set Cover Problem is an NP problem, Zero Knowledge System for Set Cover will definitely exist, but I cannot find such a proof system.

  • $\begingroup$ I'm guessing that for some reason the generic answer of "reduce to, say, Hamiltonian cycle and use a ZK proof for that" is not satisfactory? $\endgroup$
    – Maeher
    Jun 28 at 6:59


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.