交互式证明系统的代数方法

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science Pub Date : 1990-10-22 DOI:10.1145/146585.146605

C. Lund, L. Fortnow, H. Karloff, N. Nisan

{"title":"交互式证明系统的代数方法","authors":"C. Lund, L. Fortnow, H. Karloff, N. Nisan","doi":"10.1145/146585.146605","DOIUrl":null,"url":null,"abstract":"An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. For the proof, a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications for program checking, verification, and self-correction.<<ETX>>","PeriodicalId":271949,"journal":{"name":"Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"882","resultStr":"{\"title\":\"Algebraic methods for interactive proof systems\",\"authors\":\"C. Lund, L. Fortnow, H. Karloff, N. Nisan\",\"doi\":\"10.1145/146585.146605\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. For the proof, a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications for program checking, verification, and self-correction.<<ETX>>\",\"PeriodicalId\":271949,\"journal\":{\"name\":\"Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"882\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/146585.146605\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/146585.146605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 882

摘要

提出了一种构造交互式证明系统的代数方法。该技术用于证明多项式时间层次中的每一种语言都有一个交互证明系统。为了证明这一点，提出了一种将在两点上验证低次多项式值的问题简化为在一个新的点上验证低次多项式值的方法。这些结果对程序检查、验证和自我纠正具有启示意义

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Algebraic methods for interactive proof systems

An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. For the proof, a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications for program checking, verification, and self-correction.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science

自引率

0.00%

发文量