{"title":"简短公告:关于在拜占庭设置中使用空消息","authors":"G. Goren, Y. Moses","doi":"10.1145/3382734.3405717","DOIUrl":null,"url":null,"abstract":"In reliable settings, null messages allow the transfer of information without explicit communication in cases of interest. We investigate the use of null messages in the much more challenging Byzantine model (without signatures). Different ways of using null messages are discussed. One of them, called a silent validation round, can provide processes with global information about all correct sites of the system, without any message exchange. As a case study, we consider optimizing the behavior in failure-free runs of protocols for the classic Byzantine Consensus problem.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Brief Announcement: On Using Null Messages in a Byzantine Setting\",\"authors\":\"G. Goren, Y. Moses\",\"doi\":\"10.1145/3382734.3405717\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In reliable settings, null messages allow the transfer of information without explicit communication in cases of interest. We investigate the use of null messages in the much more challenging Byzantine model (without signatures). Different ways of using null messages are discussed. One of them, called a silent validation round, can provide processes with global information about all correct sites of the system, without any message exchange. As a case study, we consider optimizing the behavior in failure-free runs of protocols for the classic Byzantine Consensus problem.\",\"PeriodicalId\":222366,\"journal\":{\"name\":\"Proceedings of the 39th Symposium on Principles of Distributed Computing\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 39th Symposium on Principles of Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3382734.3405717\",\"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 of the 39th Symposium on Principles of Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3382734.3405717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Brief Announcement: On Using Null Messages in a Byzantine Setting
In reliable settings, null messages allow the transfer of information without explicit communication in cases of interest. We investigate the use of null messages in the much more challenging Byzantine model (without signatures). Different ways of using null messages are discussed. One of them, called a silent validation round, can provide processes with global information about all correct sites of the system, without any message exchange. As a case study, we consider optimizing the behavior in failure-free runs of protocols for the classic Byzantine Consensus problem.