A primitive or protocol with provable security is accompanied by a mathematical proof that shows how to reduce the security claims about the protocol to a set of assumptions.
A primitive or protocol with provable security is accompanied by a mathematical proof that shows how to reduce the security claims about the protocol to a set of assumptions.
Provable security does not imply the assumptions are correct. Generally one might face choosing between less efficient protocols based on "standard" or "plain-model" assumptions and more efficient protocols based on "non-standard" (but not known to be incorrect) assumptions.
