Motivated by the effectiveness of correlation attacks against Tor, the censorship arms race, and observations of malicious relays in Tor, we propose that Tor users capture their trust in network elements using probability distributions over the sets of elements observed by network adversaries. We present a modular system that allows users to efficiently and conveniently create such distributions and use them to improve their security. The major components of this system are (i) an ontology of network-element types that represents the main threats to and vulnerabilities of anonymous communication over Tor, (ii) a formal language that allows users to naturally express trust beliefs about network elements, and (iii) a conversion procedure that takes the ontology, public information about the network, and user beliefs written in the trust language and produce a Bayesian Belief Network that represents the probability distribution in a way that is concise and easily sampleable. We also present preliminary experimental results that show the distribution produced by our system can improve security when employed by users; further improvement is seen when the system is employed by both users and services.
Optimizing Smart Grid Aggregators and Measuring Degree of Privacy in a Distributed Trust Based Anonymous Aggregation System
智能电网是一种先进的向消费者供电的方法，可以缓解现有系统的局限性。它导致从最终用户到供应商的频繁的仪表读数传输。这种频繁的数据传输会带来隐私风险。已经提出了一些工作来解决这个问题，但不能确保隐私的最佳水平。这项工作是基于一个分布式的基于信任的数据聚合系统，利用秘密共享机制。在这项工作中，我们表明，{ \em三个聚合器}是足够的，以确保消费者的隐私在一个分布式的信任为基础的系统。我们在研究中利用匿名的思想，表明无论是主动攻击者还是被动攻击者都无法侵犯消费者的隐私。我们证明了我们的概念数学和基于加密游戏的机制。我们命名我们的新系统\emph{"Distributed Trust Based Anonymous System (DTBAS)"}。
Spam Prevention Using zk-SNARKs for Anonymous Peer-to-Peer Content Sharing Systems
去中心化的未经许可的对等网络在允许任意参与者将内容提交到公共索引或注册表时，本质上容易受到垃圾邮件的攻击;由于缺乏可以充当看门人的中央仲裁者，因此很难防止这种情况。出于这个原因，即使在分散的网络中（例如Bittorrent与DHT，IPFS），新内容的索引通常也留给集中式服务，如torrent网站。去中心化的垃圾邮件预防方法（例如Web of Trust）已经存在[1][2]，但它们要求提交者采用假名身份并随着时间的推移建立信任。在本文中，我们提出了一种方法的垃圾邮件预防工作的假设下，参与者是完全匿名的，不希望他们的不同的意见书被链接到彼此。我们所说的垃圾邮件并不是指未经请求的广告;而是指在短时间内添加大量内容，使网络容量饱和，并对对等方造成拒绝服务的做法。我们的解决方案的目的是防止用户饱和系统，可以被描述为速率限制。该系统应能抵制审查：提交的内容不应因内容本身而被排除，用户也不应因其提交的内容而被排除。我们首先讨论了一个基于单一的、集中的、抗审查和匿名的限速器的解决方案，然后我们将其扩展到一个完全分散的、基于区块链的系统，并提出了使其经济和可扩展的方法。
Lacan: Making Accountability in Anonymous Networks Real
Graduate School of Information Science and Technology, The University of Osaka（大阪大学信息科学技术研究生院）；Faculty of Materials for Energy, Shimane University（岛根大学能源材料学院）
ZK-AMS: Credibly Anonymous Admission for Web 3.0 Platforms via Recursive Proof Aggregation
Shenzhen University（深圳大学）；Nanjing University of Science and Technology（南京理工大学）；University of Copenhagen（哥本哈根大学）；University of Technology Sydney（悉尼科技大学）
