Towards uncheatable benchmarks
Jin‐Yi Cai, R.J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao · 2002
The problem of how to make benchmarks resistant to tampering and hence more trustworthy is studied. Some schemes that are based on modern cryptography and complexity theory are proposed to make benchmarks uncheatable. The philosophy is the same as that of encryption-decryption schemes, namely, that trust in individuals and organizations is replaced by trust in the impossibility of breaking certain computational problems.>