恒定预期时间的拜占庭协议

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI:10.1109/SFCS.1985.14

Paul Feldman, S. Micali

{"title":"恒定预期时间的拜占庭协议","authors":"Paul Feldman, S. Micali","doi":"10.1109/SFCS.1985.14","DOIUrl":null,"url":null,"abstract":"We present a novel cryptographic algorithm for Byzantine agreement in a network with l=O(n) faulty processors and in the most adversarial setting. Our algorithm requires, once and for all, O(t) rounds of preprocessing. Afterwards it allows us to reach each individual Byzantine agreement in constant expected time. Our solution does not make use of any trusted party.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Byzantine agreement in constant expected time\",\"authors\":\"Paul Feldman, S. Micali\",\"doi\":\"10.1109/SFCS.1985.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel cryptographic algorithm for Byzantine agreement in a network with l=O(n) faulty processors and in the most adversarial setting. Our algorithm requires, once and for all, O(t) rounds of preprocessing. Afterwards it allows us to reach each individual Byzantine agreement in constant expected time. Our solution does not make use of any trusted party.\",\"PeriodicalId\":296739,\"journal\":{\"name\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1985.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1985.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 28

摘要

提出了一种新的拜占庭协议加密算法，该算法适用于具有l=O(n)个故障处理器的网络和最对抗性设置。我们的算法需要一次性地进行O(t)轮预处理。之后，它允许我们在恒定的预期时间内达成每个单独的拜占庭协议。我们的解决方案不使用任何可信方。

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

查看原文本刊更多论文

Byzantine agreement in constant expected time

We present a novel cryptographic algorithm for Byzantine agreement in a network with l=O(n) faulty processors and in the most adversarial setting. Our algorithm requires, once and for all, O(t) rounds of preprocessing. Afterwards it allows us to reach each individual Byzantine agreement in constant expected time. Our solution does not make use of any trusted party.

求助全文

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

来源期刊

26th Annual Symposium on Foundations of Computer Science (sfcs 1985)

自引率

0.00%

发文量