FMitF: Track I: Privacy-Preserving Policy Verification of Interdomain Routing

FMITF：第一轨：域间路由的隐私保护策略验证

• 批准号: 1918187
• 负责人: Lixin Gao
• 金额: $ 75万
• 依托单位: University of Massachusetts Amherst
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2019
• 资助国家: 美国
• 起止时间: 2019-10-01 至 2024-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1918187&HistoricalAwards=false
• 关键词: FMitF; Track; Privacy; Preserving; Policy

Nearly all digital communication between entities is now carried by the Internet. Communications through the Internet include collaborations that enable scientific progress, transaction of business, and transfer of medical information that promotes human welfare. Having a secure and predictable Internet is of great importance. In tension with its importance, the decentralized nature of the Internet makes it hard to analyze. No single entity has perfect information about the internet, and there is lack of formal models for reasoning about the Internet with incomplete information. As a result, through accident or malice, it is possible for small localized policy changes in the Internet to have large net effects of traffic being inappropriately routed. This project seeks to develop tools and techniques to address this limitation, and will use outreach to publicize these approaches to the academic community and standardization bodies that govern Internet policy. The Internet connects thousands of Autonomous Systems (ASs) operated by Internet Service Providers, companies, and universities. The ASs interconnect to each other to route traffic and exchange reachability information using the Border Gateway Protocol (BGP). BGP allows each AS to use its own local policy for making routing decisions, without revealing what policy it is using. The use of diverse and unknown policies makes it extremely difficult to analyze whether a network may be susceptible to traffic hijacking, or whether a policy change in one AS might lead to unintended emergent behaviors in a network. This project will seek to develop a formal framework for reasoning about routing policies and their impact. Network operators can pose queries in this framework to find out whether routing-policy settings may lead to vulnerabilities or other undesirable behaviors. The queries from network operators will be posed as SMT formulas, with additional domain-specific abstractions and invariants to help support scalability. Critically, in recognition that routing policies are private within BGP, the formal framework will be privacy-preserving, so that each AS can participate without revealing their policy.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

现在，实体之间几乎所有的数字通信都通过互联网进行。通过互联网进行的交流包括促进科学进步、商业交易和促进人类福祉的医疗信息传输的合作。拥有一个安全和可预测的互联网非常重要。与其重要性相矛盾的是，互联网的去中心化性质使其很难分析。没有一个单一的实体拥有关于互联网的完美信息，也没有正式的模型来推理信息不完全的互联网。因此，由于意外或恶意，互联网中的小的局部政策变化可能会产生流量被不适当路由的巨大净影响。该项目寻求开发工具和技术来解决这一限制，并将利用外联向管理互联网政策的学术界和标准化机构宣传这些方法。互联网连接了由互联网服务提供商、公司和大学运营的数千个自治系统(ASS)。AS彼此互连，以使用边界网关协议(BGP)来路由业务并交换可达性信息。BGP允许每个AS使用自己的本地策略来做出路由决策，而不会透露它使用的是什么策略。由于使用了不同的未知策略，因此很难分析网络是否容易受到流量劫持的影响，或者一个AS中的策略更改是否会导致网络中意外的突发行为。该项目将寻求开发一个正式的框架，用于推理路由策略及其影响。网络运营商可以在此框架中提出查询，以确定路由策略设置是否会导致漏洞或其他不良行为。来自网络运营商的查询将被设置为SMT公式，并带有附加的特定于域的抽象和不变量，以帮助支持可伸缩性。关键是，考虑到路由策略在BGP中是私有的，正式的框架将是隐私保护的，这样每个AS都可以参与，而不会透露他们的策略。这一奖项反映了NSF的法定使命，并通过使用基金会的智力优势和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Policy-rich interdomain routing with local coordination

• DOI: 10.1016/j.comnet.2021.108292
• 发表时间: 2021-10
• 期刊: Comput. Networks
• 作者: Xiaozhe Shao;Lixin Gao

Verifying Policy-based Routing at Internet Scale

在互联网规模验证基于策略的路由

• DOI: 10.1109/infocom41043.2020.9155235
• 发表时间: 2020
• 期刊: Infocom
• 作者: Shao, X;Gao, L
• 通讯作者: Gao, L

Path-preserving Anonymization for Inter-domain Routing Policies

域间路由策略的路径保留匿名化

• 发表时间: 2021
• 期刊: Nov. 2021
• 作者: Xiaozhe Shao, Hossein Pishro-Nik

Improving Privacy in Graphs Through Node Addition

通过添加节点提高图中的隐私性

• DOI: 10.1109/allerton.2019.8919967
• 发表时间: 2019
• 作者: Takbiri, N;Shao, X;Gao, L;Pishro-Nik, H
• 通讯作者: Pishro-Nik, H