• DocumentCode
    2200894
  • Title

    Towards uncheatable benchmarks

  • Author

    Cai, Jin-Yi ; Lipton, Richard J. ; Sedgewick, Robert ; Yao, Andrew Chi-Chih

  • Author_Institution
    Dept. of Comput. Sci., Princeton Univ., NJ, USA
  • fYear
    1993
  • fDate
    18-21 May 1993
  • Firstpage
    2
  • Lastpage
    11
  • Abstract
    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
  • Keywords
    computational complexity; cryptography; benchmarks; complexity theory; cryptography; encryption-decryption schemes; Art; Bandwidth; Benchmark testing; Complexity theory; Computer science; Contracts; Cryptography; Hardware; Software systems; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    0-8186-4070-7
  • Type

    conf

  • DOI
    10.1109/SCT.1993.336546
  • Filename
    336546
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2200894