Uncheatable Benchmarks

不可欺骗的基准

• 批准号: 9304718
• 负责人: Richard Lipton
• 金额: $ 27.83万
• 依托单位: Princeton University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1993
• 资助国家: 美国
• 起止时间: 1993-08-15 至 1997-01-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9304718&HistoricalAwards=false
• 关键词: Uncheatable; Benchmarks

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 to assess how fast a given hardware or software system operates. They are of importance in everyday computing. However, 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.'' The project studies the problem of how to make benchmarks resistant to tampering and hence more trustworthy. The plan is to use modern cryptography and complexity theory to make this possible. Basically the trust in individuals and organizations will be replaced by trust in the impossibility of breaking certain computational problems. The advantage of this approach is clear: the schemes will be scientifically trustworthy. There is an array of problems that need to be formulated and solved, which are important in making uncheatable benchmarks; some are practical issues, some are theoretical.

基准测试已经被用来测试从处理器的速度到存储器系统的访问时间的一切。 计算社区依靠它们来评估给定硬件或软件系统的运行速度。 它们在日常计算中非常重要。 然而，到目前为止，对设计一个好的基准的艺术的研究一直集中在使基准在预测它将为预期的应用程序执行得多好方面“现实”;使基准结果值得信赖的问题已经降级到“可信”或第三方代理，很少注意使基准本身“不可欺骗”的问题。该项目研究如何使基准抗篡改，从而更值得信赖的问题。 该计划是使用现代密码学和复杂性理论来实现这一点。 基本上，对个人和组织的信任将被不可能打破某些计算问题的信任所取代。 这种方法的优势是显而易见的：这些方案在科学上是可信的。 有一系列问题需要制定和解决，这些问题对于制定可靠的基准很重要;有些是实际问题，有些是理论问题。