{"title":"简短公告:多重身份的(有限)力量:通过共谋提高弹性的异步拜占庭可靠广播","authors":"Thorsten Götte, C. Scheideler","doi":"10.1145/3490148.3538556","DOIUrl":null,"url":null,"abstract":"We present a new model for (asynchronous) byzantine reliable broadcast to investigate the potential of secret collusion between honest players. To model the collusion, we assume that each honest player has k > 1 distinct communication identities over which they can send and receive messages. A player can obtain these identities - for example - by joining a distributed system under several aliases.","PeriodicalId":112865,"journal":{"name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","volume":"255 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion\",\"authors\":\"Thorsten Götte, C. Scheideler\",\"doi\":\"10.1145/3490148.3538556\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new model for (asynchronous) byzantine reliable broadcast to investigate the potential of secret collusion between honest players. To model the collusion, we assume that each honest player has k > 1 distinct communication identities over which they can send and receive messages. A player can obtain these identities - for example - by joining a distributed system under several aliases.\",\"PeriodicalId\":112865,\"journal\":{\"name\":\"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures\",\"volume\":\"255 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3490148.3538556\",\"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 34th ACM Symposium on Parallelism in Algorithms and Architectures","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3490148.3538556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion
We present a new model for (asynchronous) byzantine reliable broadcast to investigate the potential of secret collusion between honest players. To model the collusion, we assume that each honest player has k > 1 distinct communication identities over which they can send and receive messages. A player can obtain these identities - for example - by joining a distributed system under several aliases.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
