CAREER: Decentralizing Trust in Open Distributed Systems

职业：开放分布式系统中的去中心化信任

• 批准号: 0747052
• 负责人: Jinyang Li
• 金额: $ 36万
• 依托单位: New York University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-02-01 至 2014-01-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0747052&HistoricalAwards=false
• 关键词: CAREER; Decentralizing; Trust; Open; Distributed

Distributed systems that allow any user to enroll his node as a participantmust resolve two main challenges to achieve reliability: selecting trustworthyparticipants, and detecting and containing the damage of deviant nodes. Thisresearch addresses these challenges by (a) presenting a new systemarchitecture, F2F, that incorporates decentralized trust relationships amongusers in determining trustworthy nodes and (b) devising new techniques todetect and contain faults of misbehaving nodes in the context of concreteapplications using this new architecture. This research demonstrates the usefulness of F2F through the design andimplementation of two case-study systems: cooperative backup and censorshipcircumvention. Friendstore provides inexpensive and reliable backup by storingeach user's data on a subset of trusted neighbors. Such an architecture allowsFriendstore to use less expensive technical means to detect and recover fromfaults but makes it harder to fully utilize storage resources. This project addresses this challenge using coding techniques that allow a node toefficiently provide data redundancy for multiple neighbors simultaneously. Thesecond case study system, Kaleidoscope, helps users inside censored domainsaccess blocked websites by relaying traffic via a network of proxies.Kaleidoscope uses a novel protocol to disseminate proxy identities over the F2Ftrust graph so that each node can only collect limited information aboutothers' identities. A few malicious nodes, then, cannot discover a significantfraction of proxies. This project will produce systems that, if successfully deployed, provideinexpensive online storage to home users and help circumvent censorship formillions of affected users.

分布式系统，允许任何用户注册他的节点作为participantmust解决两个主要的挑战，以实现可靠性：选择值得信赖的参与者，检测和包含异常节点的损害。 本研究解决了这些挑战，（a）提出了一个新的系统架构，F2F，它结合了分散的信任关系，使用户在确定值得信赖的节点和（B）设计新的技术来检测和包含错误的行为节点的上下文中使用这种新的体系结构。 本研究通过两个案例研究系统的设计和实现来证明F2F的有用性：合作备份和审查规避。 通过将每个用户的数据存储在受信任的邻居的子集上，数据存储库提供了廉价而可靠的备份。这样的架构允许存储使用更便宜的技术手段来检测和恢复故障，但更难充分利用存储资源。该项目使用编码技术解决了这一挑战，该技术允许节点同时有效地为多个邻居提供数据冗余。 第二个案例研究系统Kaleidoscope通过代理网络中继流量来帮助受审查域中的用户访问被屏蔽的网站。Kaleidoscope使用一种新颖的协议在F2F信任图上传播代理身份，以便每个节点只能收集关于其他节点身份的有限信息。 一些恶意节点，然后，不能发现一个显着fraction的代理。 该项目将生产的系统，如果成功部署，提供廉价的在线存储家庭用户和帮助规避审查数百万受影响的用户。