Towards uncheatable benchmarks

Jin yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi Chih Yao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Scopus citations

Abstract

Benchmarks have been used to test everything from the speed of a processor to the access time of a memory system. The computing community relies on them heavily to assess how fast a given hardware or software system operates. They are of fundamental importance in everyday computing. However, up until now, the study of the art of designing a good benchmark has focused on making the benchmark 'realistic' in predicting how well it will perform for the intended applications; the issue of making benchmark results trustworthy has been relegated to 'trusted' or third party agents, and little attention has been paid to the question of making benchmarks themselves 'uncheatable'. This paper studies the problem of how one can make benchmarks resistant to tampering and hence more trustworthy. We propose some schemes that are based on modern cryptography and complexity theory to make benchmarks uncheatable. The philosophy is the same as encryption-decryption schemes, namely, we want that trust in individuals and organizations be replaced by trust in the impossibility of breaking certain computational problems.

Original languageEnglish (US)
Title of host publicationProceedings of the Eighth Annual Structure in Complexity Theory Conference
Editors Anon
PublisherPubl by IEEE
Pages2-11
Number of pages10
ISBN (Print)0818640715
StatePublished - Jan 1 1993
EventProceedings of the Eighth Annual Structure in Complexity Theory Conference - San Diego, California
Duration: May 18 1993May 21 1993

Publication series

NameProceedings of the Eighth Annual Structure in Complexity Theory Conference

Other

OtherProceedings of the Eighth Annual Structure in Complexity Theory Conference
CitySan Diego, California
Period5/18/935/21/93

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Towards uncheatable benchmarks'. Together they form a unique fingerprint.

  • Cite this

    Cai, J. Y., Lipton, R. J., Sedgewick, R., & Yao, A. C. C. (1993). Towards uncheatable benchmarks. In Anon (Ed.), Proceedings of the Eighth Annual Structure in Complexity Theory Conference (pp. 2-11). (Proceedings of the Eighth Annual Structure in Complexity Theory Conference). Publ by IEEE.