Increasing Trust in Tor Node List Using Blockchain

Lukás Hellebrandt, I. Homoliak, K. Malinka, P. Hanáček
{"title":"Increasing Trust in Tor Node List Using Blockchain","authors":"Lukás Hellebrandt, I. Homoliak, K. Malinka, P. Hanáček","doi":"10.1109/BLOC.2019.8751340","DOIUrl":null,"url":null,"abstract":"Tor is a low-latency free anonymization network based on onion routing. In Tor, directory servers maintain a list of all nodes. It is, however, possible for a powerful adversary (e.g., law enforcement agencies) to seize or compromise enough directory servers and thus forge that list. Therefore, clients that obtained such a forged list of nodes can be effectively deanonymized. As a countermeasure, we propose to utilize a permissioned blockchain with a single voting committee that is privately “elected” by a verifiable random function (VRF). Since the blockchain provides us with integrity guarantees by design, we increase trust in the directory servers by decentralizing management of Tor nodes present in the shared list. We apply skiplist as an optimization reducing a validation overhead of newly joined nodes and clients. The proposed approach has only a small performance impact on the existing Tor infrastructure.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BLOC.2019.8751340","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Tor is a low-latency free anonymization network based on onion routing. In Tor, directory servers maintain a list of all nodes. It is, however, possible for a powerful adversary (e.g., law enforcement agencies) to seize or compromise enough directory servers and thus forge that list. Therefore, clients that obtained such a forged list of nodes can be effectively deanonymized. As a countermeasure, we propose to utilize a permissioned blockchain with a single voting committee that is privately “elected” by a verifiable random function (VRF). Since the blockchain provides us with integrity guarantees by design, we increase trust in the directory servers by decentralizing management of Tor nodes present in the shared list. We apply skiplist as an optimization reducing a validation overhead of newly joined nodes and clients. The proposed approach has only a small performance impact on the existing Tor infrastructure.
使用区块链增加对Tor节点列表的信任
Tor是一个基于洋葱路由的低延迟免费匿名网络。在Tor中,目录服务器维护所有节点的列表。然而,强大的对手(例如,执法机构)有可能抓住或破坏足够的目录服务器,从而伪造该列表。因此,获得这种伪造的节点列表的客户端可以有效地去匿名化。作为对策,我们建议使用一个由可验证随机函数(VRF)私下“选举”的具有单一投票委员会的许可区块链。由于区块链通过设计为我们提供了完整性保证,我们通过分散共享列表中Tor节点的管理来增加对目录服务器的信任。我们应用skiplist作为优化,减少了新加入节点和客户端的验证开销。所提出的方法对现有Tor基础设施的性能影响很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信