I have a primitive $A$ which is impossible to prove under some hardness assumption in a black-box way. Now, if another primitive $B$ is stronger than $A$ - in other words $B$ implies $A$ - will it imply that $B$ is also impossible to prove under the same hardness assumption in a black-box way?

  • 1
    If B implies A in a black box way, then yes, this just follows immediately from what you stated and the transitivity of black box reductions. – Mikero Aug 10 at 1:38

This seems like a logic question: $B$ implies $A$, therefore not $A$ implies not $B$

Proving $B$ would prove $A$, so if it is impossible to prove $A$ it must be impossible to prove $B$ in the same setup.

Alternatively lets assume $B$ is proven, since $B$ implies $A$, $A$ is proven. Yet $A$ is unproveable: a contradiction.

Your Answer

 
discard

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.