Towards uncheatable benchmarks

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.<<ETX>>

[1]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[2]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[3]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  Lance Fortnow,et al.  On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..

[5]  Silvio Micali,et al.  Cryptographically Strong Sequences Of Pseudo Random Bits , 1982 .

[6]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[7]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[9]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[10]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[11]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[12]  D. Shanks.  Class number, a theory of factorization, and genera , 1971 .

[13]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[14]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[15]  H. E. Rose.  A course in number theory , 1988 .

[16]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[18]  John Gill,et al.  Terse, Superterse, and Verbose Sets , 1993, Inf. Comput..

[19]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[20]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..