P2P计算下的拜占庭将军问题

2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services Pub Date : 2006-07-17 DOI:10.1109/MOBIQW.2006.361758

N. Fedotova, L. Veltri

{"title":"P2P计算下的拜占庭将军问题","authors":"N. Fedotova, L. Veltri","doi":"10.1109/MOBIQW.2006.361758","DOIUrl":null,"url":null,"abstract":"Security problems in P2P environment become more complicated with the growing number of P2P networks and applications. Hence, it is very important to find reliable mechanisms of detection and elimination of various threats, attack sources, and malicious nodes. In this paper we consider how it is possible to apply some classical solutions for Byzantine generals problem (BGP), originally described by Lamport and Shostak, in a P2P environment to solve such problems","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Byzantine Generals Problem in the Light of P2P Computing\",\"authors\":\"N. Fedotova, L. Veltri\",\"doi\":\"10.1109/MOBIQW.2006.361758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Security problems in P2P environment become more complicated with the growing number of P2P networks and applications. Hence, it is very important to find reliable mechanisms of detection and elimination of various threats, attack sources, and malicious nodes. In this paper we consider how it is possible to apply some classical solutions for Byzantine generals problem (BGP), originally described by Lamport and Shostak, in a P2P environment to solve such problems\",\"PeriodicalId\":440604,\"journal\":{\"name\":\"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MOBIQW.2006.361758\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOBIQW.2006.361758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

随着P2P网络和应用的不断增多，P2P环境中的安全问题变得越来越复杂。因此，找到检测和消除各种威胁、攻击源和恶意节点的可靠机制是非常重要的。在本文中，我们考虑了如何在P2P环境中应用最初由Lamport和Shostak描述的拜占庭将军问题(BGP)的一些经典解决方案来解决此类问题

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

查看原文本刊更多论文

Byzantine Generals Problem in the Light of P2P Computing

Security problems in P2P environment become more complicated with the growing number of P2P networks and applications. Hence, it is very important to find reliable mechanisms of detection and elimination of various threats, attack sources, and malicious nodes. In this paper we consider how it is possible to apply some classical solutions for Byzantine generals problem (BGP), originally described by Lamport and Shostak, in a P2P environment to solve such problems

求助全文

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

来源期刊

2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services

自引率

0.00%

发文量