Daniel Rouhana, Peyton Lundquist, Tim Andersen, Gaby G. Dagher
{"title":"MnemoSys:用于区块链审计信誉管理的条件概率估计协议","authors":"Daniel Rouhana, Peyton Lundquist, Tim Andersen, Gaby G. Dagher","doi":"10.1109/TPS-ISA56441.2022.00019","DOIUrl":null,"url":null,"abstract":"Reputation systems have been one method of solving the unique challenges that face distributed networks of independent operators. Fundamentally, historical performance must be considered in a way that attempts to predict future behav-ior, optimize present functionality, and provide some measure of immutable recording. In this paper, a three-part system, MnemoSys, is proposed to solve this diverse set of problems. First, historical performance is dynamically weighted and scored using geometrically expanding time windows. Second, a quorum is abstracted as a restricted Boltzmann machine to produce a conditional probability estimate of log-normal likelihood of good-faith behavior. Third, all rewards and punishments are recorded on an immutable, decentralized ledger. Our experimentation shows that when applied iteratively to an entire network, consistently under-performing nodes are removed, network stability is maintained even with high percentages of simulated error, and global network parameters are optimized in the long-term.","PeriodicalId":427887,"journal":{"name":"2022 IEEE 4th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MnemoSys: A Conditional Probability Estimation Protocol for Blockchain Audited Reputation Management\",\"authors\":\"Daniel Rouhana, Peyton Lundquist, Tim Andersen, Gaby G. Dagher\",\"doi\":\"10.1109/TPS-ISA56441.2022.00019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reputation systems have been one method of solving the unique challenges that face distributed networks of independent operators. Fundamentally, historical performance must be considered in a way that attempts to predict future behav-ior, optimize present functionality, and provide some measure of immutable recording. In this paper, a three-part system, MnemoSys, is proposed to solve this diverse set of problems. First, historical performance is dynamically weighted and scored using geometrically expanding time windows. Second, a quorum is abstracted as a restricted Boltzmann machine to produce a conditional probability estimate of log-normal likelihood of good-faith behavior. Third, all rewards and punishments are recorded on an immutable, decentralized ledger. Our experimentation shows that when applied iteratively to an entire network, consistently under-performing nodes are removed, network stability is maintained even with high percentages of simulated error, and global network parameters are optimized in the long-term.\",\"PeriodicalId\":427887,\"journal\":{\"name\":\"2022 IEEE 4th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA)\",\"volume\":\"150 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 4th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TPS-ISA56441.2022.00019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 4th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TPS-ISA56441.2022.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
MnemoSys: A Conditional Probability Estimation Protocol for Blockchain Audited Reputation Management
Reputation systems have been one method of solving the unique challenges that face distributed networks of independent operators. Fundamentally, historical performance must be considered in a way that attempts to predict future behav-ior, optimize present functionality, and provide some measure of immutable recording. In this paper, a three-part system, MnemoSys, is proposed to solve this diverse set of problems. First, historical performance is dynamically weighted and scored using geometrically expanding time windows. Second, a quorum is abstracted as a restricted Boltzmann machine to produce a conditional probability estimate of log-normal likelihood of good-faith behavior. Third, all rewards and punishments are recorded on an immutable, decentralized ledger. Our experimentation shows that when applied iteratively to an entire network, consistently under-performing nodes are removed, network stability is maintained even with high percentages of simulated error, and global network parameters are optimized in the long-term.