计算和应用正确性的高效保密证明

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI:10.1109/LICS.2007.24

M. Rabin, R. Servedio, C. Thorpe

{"title":"计算和应用正确性的高效保密证明","authors":"M. Rabin, R. Servedio, C. Thorpe","doi":"10.1109/LICS.2007.24","DOIUrl":null,"url":null,"abstract":"We present a highly efficient method for proving correctness of computations while preserving secrecy of the input values. This is done in an Evaluator-Prover model which can also be realized by a secure processor. We describe an application to secure auctions.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications\",\"authors\":\"M. Rabin, R. Servedio, C. Thorpe\",\"doi\":\"10.1109/LICS.2007.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a highly efficient method for proving correctness of computations while preserving secrecy of the input values. This is done in an Evaluator-Prover model which can also be realized by a secure processor. We describe an application to secure auctions.\",\"PeriodicalId\":137827,\"journal\":{\"name\":\"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2007.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2007.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 24

摘要

我们提出了一种高效的方法来证明计算的正确性，同时保持输入值的保密性。这是在评估者-证明者模型中完成的，该模型也可以由安全处理器实现。我们描述一个确保拍卖安全的应用程序。

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

查看原文本刊更多论文

Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications

We present a highly efficient method for proving correctness of computations while preserving secrecy of the input values. This is done in an Evaluator-Prover model which can also be realized by a secure processor. We describe an application to secure auctions.

求助全文

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

来源期刊

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

自引率

0.00%

发文量