CT: Making Network Layer Proofs-of-Work Work
CT: Making Network Layer Proofs-of-Work Work
批准号:
0627752
负责人:
Thomas Shrimpton
金额:
$39.97万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2006
资助国家:
美国
项目状态:
已结题
起止时间:
2006-09-01 至 2010-08-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Making Network Layer Proofs-of-Work WorkDenial-of-service (DoS) attacks continue to disrupt the flow of traffic on the Internet. Proofs-of-work or "client puzzles" are a mechanism for protecting a number of protocols against DoS attacks. A puzzle is a cryptographically or combinatorially difficult problem that is generated by a server and must be solved by a client before it receives service. The difficulty of the puzzle is determined by the server as a function of previous client behavior, server load, etc. While puzzles have been used mostly at the application layer (and even there with only limited success), we argue that to prevent DoS attacks protection must exist in a layer common to all applications: the IP layer. Before this can be realized, there are a number of significant challenges that puzzle mechanisms must overcome, including efficiency, fairness, tamper-resistance, and control. More fundamentally, we believe that puzzles will not realize their full potential until there is a solid theoretical foundation for them. To date, one does not exist. In this project we will address each of these challenges. First, we will give the puzzle problem a full provable-security treatment. Specifically, we will give a formal definition of what is a puzzle scheme, formal definitions of security for puzzles, and build puzzle mechanisms that provably meet these definitions. As part of this, we will formally analyze existing puzzle mechanisms based on previous work by us and others. In addition, we will explore new designs, with special attention given to puzzles constructed from T-functions, which show promise for being a basis for fast and effective puzzles. Our work will also address control-plane issues for intelligently setting puzzle difficulties. Finally, we will demonstrate the utility of our approaches by building a smart "Internet Tar Pit", a device that employs IP puzzles to selectively slow down DoS attacks, spam, port scans, and other undesirable network communication.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
NSF Student Travel Grant for Real World Cryptography 2019 (RWC '19)
-
批准号:1839355
-
项目类别:Standard Grant
-
资助金额:$1.8万
-
财政年份:2019
-
负责人:Thomas Shrimpton
-
依托单位:
SaTC: CORE: Small: API-centric Cryptography
-
批准号:1816375
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2018
-
负责人:Thomas Shrimpton
-
依托单位:
NSF Student Travel Grant for Real World Cryptography 2017 (RWC'17)
-
批准号:1703879
-
项目类别:Standard Grant
-
资助金额:$1.8万
-
财政年份:2017
-
负责人:Thomas Shrimpton
-
依托单位:
TWC: Medium: Collaborative: Distribution-Sensitive Cryptography
-
批准号:1514237
-
项目类别:Standard Grant
-
资助金额:$39.98万
-
财政年份:2015
-
负责人:Thomas Shrimpton
-
依托单位:
TWC: Small: Theory and Practice of Tweakable-Blockcipher-Based Cryptography
-
批准号:1564446
-
项目类别:Standard Grant
-
资助金额:$21.26万
-
财政年份:2015
-
负责人:Thomas Shrimpton
-
依托单位:
TWC: Medium: Collaborative: Distribution-Sensitive Cryptography
-
批准号:1564444
-
项目类别:Standard Grant
-
资助金额:$39.98万
-
财政年份:2015
-
负责人:Thomas Shrimpton
-
依托单位:
TWC: Small: Theory and Practice of Tweakable-Blockcipher-Based Cryptography
-
批准号:1319061
-
项目类别:Standard Grant
-
资助金额:$43.38万
-
财政年份:2013
-
负责人:Thomas Shrimpton
-
依托单位:
CAREER: Design Principles for Cryptographic Hash Functions: Foundations, Primitives, and Transforms
-
批准号:0845610
-
项目类别:Continuing Grant
-
资助金额:$40.0万
-
财政年份:2009
-
负责人:Thomas Shrimpton
-
依托单位:
国内基金
海外基金
Scalable Learning and Optimization: High-dimensional Models and Online Decision-Making Strategies for Big Data Analysis
-
批准号:--
-
项目类别:合作创新研究团队
-
资助金额:--
-
批准年份:2024
-
负责人:姚韬
-
依托单位: