Editing Copy Protection
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 9: | Line 9: | ||
== Use-cases == | == Use-cases == | ||
* Any kind of software | * Any kind of software license protection | ||
== Protocols == | == Protocols == | ||
Line 27: | Line 27: | ||
A Copy Protection scheme for a family of circuits has <math display="inline">\varepsilon</math>-<math display="inline">correctness</math> if for any circuit <math display="inline">C</math> of this family and for any input <math display="inline">x</math> for this circuit, <math display="block">Pr[\mathbf{Eval}(\rho_C, x) = f(x);\ \rho_C \gets \mathbf{Protect}(C)] \geq 1 - \varepsilon</math> | A Copy Protection scheme for a family of circuits has <math display="inline">\varepsilon</math>-<math display="inline">correctness</math> if for any circuit <math display="inline">C</math> of this family and for any input <math display="inline">x</math> for this circuit, <math display="block">Pr[\mathbf{Eval}(\rho_C, x) = f(x);\ \rho_C \gets \mathbf{Protect}(C)] \geq 1 - \varepsilon</math> | ||
A Copy Protection scheme for a family of circuits has <math display="inline">\delta</math>-<math display="inline">security</math> if no polynomially bounded quantum adversary can efficiently copy a protected program, more formally if | A Copy Protection scheme for a family of circuits has <math display="inline">\delta</math>-<math display="inline">security</math> if no polynomially bounded quantum adversary can efficiently copy a protected program, more formally if no such adversary can win the following game: | ||
* A Challenger samples a circuit C in the family and sends Protect(C) to the Adversary | * A Challenger samples a circuit C in the family and sends Protect(C) to the Adversary |