Pool-Based APROB Channel to Provide Resistance against Global Active Adversary under Probabilistic Real-Time Condition

Minh Tran, Trung-Thanh Nguyen, I. Echizen
{"title":"Pool-Based APROB Channel to Provide Resistance against Global Active Adversary under Probabilistic Real-Time Condition","authors":"Minh Tran, Trung-Thanh Nguyen, I. Echizen","doi":"10.1109/EUC.2008.110","DOIUrl":null,"url":null,"abstract":"We present Pool-Based APROB Channel, based on pool mix model, to provide anonymity against global active adversary. The adversary has capability to monitor all external activities of system, to delay and to create messages in the system. Our proposal is to solve the limitation of APROB Channel which concerns only global delaying adversary. Pool-Based APROB Channel provides flexibility for users to justify their level of anonymity (and speed) and satisfies probabilistic real-time condition which ensures to deliver any message within a predefined duration with high probability. Experimental evaluation shows that our system provides lower source-hiding property than APROB Channel with the same environment and users' behaviors (rate and number of sent messages).","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUC.2008.110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We present Pool-Based APROB Channel, based on pool mix model, to provide anonymity against global active adversary. The adversary has capability to monitor all external activities of system, to delay and to create messages in the system. Our proposal is to solve the limitation of APROB Channel which concerns only global delaying adversary. Pool-Based APROB Channel provides flexibility for users to justify their level of anonymity (and speed) and satisfies probabilistic real-time condition which ensures to deliver any message within a predefined duration with high probability. Experimental evaluation shows that our system provides lower source-hiding property than APROB Channel with the same environment and users' behaviors (rate and number of sent messages).
基于池的APROB信道在概率实时条件下抵抗全局活跃对手
我们提出了基于池混合模型的基于池的APROB通道,以提供对全局活跃对手的匿名性。攻击者有能力监视系统的所有外部活动,在系统中延迟和创建消息。我们的建议是解决APROB信道只关注全局延迟对手的局限性。基于池的APROB通道为用户提供了灵活性,以证明他们的匿名级别(和速度),并满足概率实时条件,确保在预定义的持续时间内以高概率传递任何消息。实验评估表明,在相同的环境和用户行为(发送消息的速率和数量)下,我们的系统提供了比APROB信道更低的信源隐藏性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信