首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   26篇
  免费   4篇
  国内免费   1篇
化学工业   10篇
矿业工程   2篇
轻工业   2篇
无线电   3篇
一般工业技术   1篇
冶金工业   1篇
自动化技术   12篇
  2021年   2篇
  2018年   2篇
  2017年   1篇
  2016年   1篇
  2015年   2篇
  2013年   3篇
  2011年   1篇
  2010年   1篇
  2008年   3篇
  2006年   1篇
  2005年   7篇
  2004年   3篇
  2003年   1篇
  2002年   1篇
  1992年   1篇
  1991年   1篇
排序方式: 共有31条查询结果,搜索用时 0 毫秒
31.
The use of trust for onion routing has been proved effective in thwarting malicious onion routers. However, even state-of-the-art trust-based onion routing protocols still suffer from two key limitations in protecting anonymity. First, these protocols have no means to verify the correctness of the trust they rely on. Second, they run a high risk of being deanonymized by an inference attack due to biased trust distributions. In this paper, we propose SGor, a trust graph based onion routing that mitigates the key limitations of trust in protecting anonymity. SGor is novel with three unique properties. First, SGor aggregates group trust from mutual friends to verify the correctness of users’ trust assignments. Second, SGor employs an adaptive trust propagation algorithm to derive global trust from trust graph. The global trust removes the restriction of users’ local knowledge and defeats inference attacks by guiding users to discover and trust more honest routers (i.e., reducing the bias of trust distribution). Third, SGor is designed to operate in a fully decentralized manner. This decentralized design mitigates the leakage of a priori trust relationships. We evaluate SGor with simulation-based experiments using several real-world social trust datasets. The experimental results confirm that SGor can mitigate key limitations in the use of trust for protecting anonymity but introduces only a few overheads.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号