{"title":"评估匿名提供技术使用排队论","authors":"Dogan Kesdogan","doi":"10.1109/LCN.2001.990801","DOIUrl":null,"url":null,"abstract":"In our work we use queuing theory both for security (ie, anonymity) and performance analysis. A well-known anonymity technique, the MIX method, which is the basis of most of today's deployments, is the object of our investigation. We show shortcomings and problems in the MIX method and suggest possible workarounds. Our investigation reveals the level of security of MIX based systems and their performance characteristics on the Internet.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Evaluation of anonymity providing techniques using queuing theory\",\"authors\":\"Dogan Kesdogan\",\"doi\":\"10.1109/LCN.2001.990801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In our work we use queuing theory both for security (ie, anonymity) and performance analysis. A well-known anonymity technique, the MIX method, which is the basis of most of today's deployments, is the object of our investigation. We show shortcomings and problems in the MIX method and suggest possible workarounds. Our investigation reveals the level of security of MIX based systems and their performance characteristics on the Internet.\",\"PeriodicalId\":213526,\"journal\":{\"name\":\"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2001.990801\",\"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 LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2001.990801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evaluation of anonymity providing techniques using queuing theory
In our work we use queuing theory both for security (ie, anonymity) and performance analysis. A well-known anonymity technique, the MIX method, which is the basis of most of today's deployments, is the object of our investigation. We show shortcomings and problems in the MIX method and suggest possible workarounds. Our investigation reveals the level of security of MIX based systems and their performance characteristics on the Internet.