Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Central Control Over Distributed Routing
author:Stefano Vissicchio and
Olivier Tilmans and
Laurent Vanbever and
Jennifer Rexford
Central Control Over Distributed Routing
http://fibbing.net
Stefano Vissicchio∗∗, Olivier Tilmans∗, Laurent Vanbever†, Jennifer Rexford‡
∗ Université catholique de Louvain, † ETH Zurich, ‡ Princeton University
∗ name.surname@uclouvain.be, †lvanbever@ethz.ch, ‡jrex@cs.princeton.edu
ABSTRACT
Centralizing routing decisions oﬀers tremendous ﬂexi-
bility, but sacriﬁces the robustness of distributed proto-
cols. In this paper, we present Fibbing, an architecture
that achieves both ﬂexibility and robustness through
central control over distributed routing. Fibbing in-
troduces fake nodes and links into an underlying link-
state routing protocol, so that routers compute their
own forwarding tables based on the augmented topol-
ogy. Fibbing is expressive, and readily supports ﬂexible
load balancing, traﬃc engineering, and backup routes.
Based on high-level forwarding requirements, the Fib-
bing controller computes a compact augmented topol-
ogy and injects the fake components through standard
routing-protocol messages. Fibbing works with any un-
modiﬁed routers speaking OSPF. Our experiments also
show that it can scale to large networks with many
forwarding requirements, introduces minimal overhead,
and quickly reacts to network and controller failures.
CCS Concepts
•Networks → Routing protocols; Network architec-
tures; Programmable networks; Network management;
Keywords
Fibbing; SDN; link-state routing
1.
INTRODUCTION
Consider a large IP network with hundreds of devices,
including the components shown in Fig. 1a. A set of
IP addresses (D1) see a sudden surge of traﬃc, from
multiple entry points (A, D, and E), that congests a
∗S. Vissicchio is a postdoctoral researcher of F.R.S.-FNRS.
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Central Control Over Distributed Routing
author:Stefano Vissicchio and
Olivier Tilmans and
Laurent Vanbever and
Jennifer Rexford
Central Control Over Distributed Routing
http://fibbing.net
Stefano Vissicchio∗∗, Olivier Tilmans∗, Laurent Vanbever†, Jennifer Rexford‡
∗ Université catholique de Louvain, † ETH Zurich, ‡ Princeton University
∗ name.surname@uclouvain.be, †lvanbever@ethz.ch, ‡jrex@cs.princeton.edu
ABSTRACT
Centralizing routing decisions oﬀers tremendous ﬂexi-
bility, but sacriﬁces the robustness of distributed proto-
cols. In this paper, we present Fibbing, an architecture
that achieves both ﬂexibility and robustness through
central control over distributed routing. Fibbing in-
troduces fake nodes and links into an underlying link-
state routing protocol, so that routers compute their
own forwarding tables based on the augmented topol-
ogy. Fibbing is expressive, and readily supports ﬂexible
load balancing, traﬃc engineering, and backup routes.
Based on high-level forwarding requirements, the Fib-
bing controller computes a compact augmented topol-
ogy and injects the fake components through standard
routing-protocol messages. Fibbing works with any un-
modiﬁed routers speaking OSPF. Our experiments also
show that it can scale to large networks with many
forwarding requirements, introduces minimal overhead,
and quickly reacts to network and controller failures.
CCS Concepts
•Networks → Routing protocols; Network architec-
tures; Programmable networks; Network management;
Keywords
Fibbing; SDN; link-state routing
1.
INTRODUCTION
Consider a large IP network with hundreds of devices,
including the components shown in Fig. 1a. A set of
IP addresses (D1) see a sudden surge of traﬃc, from
multiple entry points (A, D, and E), that congests a
∗S. Vissicchio is a postdoctoral researcher of F.R.S.-FNRS.
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Secure and Efficient Key Derivation in Portfolio Authentication Schemes
Using Blakley Secret Sharing
author:Peter Mayer and
Melanie Volkamer
Secure and Efficient Key Derivation in
Portfolio Authentication Schemes
Using Blakley Secret Sharing
Peter Mayer, Melanie Volkamer
Usable Security  Lab
Crypto Lab
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
Peter Mayer, Melanie Volkamer
e1
e2
e3
e5
e1
P
a
s
s
w
o
r
d
e1
e2
e3
e4
e5
e6
e7
c1
c2
c3
c4
…
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
e2
e4
e5
e1
e2
e5
e6
e1
e3
e4
e5
.
.
.
.
.
.
.
.
.
.
.
.
e4
e5
e6
e7
e2
e4
e5
e6
e2
e5
e6
e7
e3
e4
e6
e7
Common  Secret
Stored  Information
(Hash)
Password
Verification
...
1 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
2 | Peter Mayer | ACSAC 2015 | 11.12.2015
Why portfolio authentication?
<shoulder surfing image>
3 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
✓
4 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
5 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
§Naïve approach
§ Generate & store the hashes for all authorized subsets
§ Check if user input matches one of the hashes
§ Easy to implement
§ Factorial growth of number of hashes
➔ inefficient
6 | Peter Mayer | ACSAC 2015 | 11.12.2015
(t,n)-threshold verification
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
S
e
t
C
h
a
l
l
e
n
g
e
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
e1
e2
e3
e5
e1
e2
e4
e5
e1
e2
e5...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Secure and Efficient Key Derivation in Portfolio Authentication Schemes
Using Blakley Secret Sharing
author:Peter Mayer and
Melanie Volkamer
Secure and Efficient Key Derivation in
Portfolio Authentication Schemes
Using Blakley Secret Sharing
Peter Mayer, Melanie Volkamer
Usable Security  Lab
Crypto Lab
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
Peter Mayer, Melanie Volkamer
e1
e2
e3
e5
e1
P
a
s
s
w
o
r
d
e1
e2
e3
e4
e5
e6
e7
c1
c2
c3
c4
…
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
e2
e4
e5
e1
e2
e5
e6
e1
e3
e4
e5
.
.
.
.
.
.
.
.
.
.
.
.
e4
e5
e6
e7
e2
e4
e5
e6
e2
e5
e6
e7
e3
e4
e6
e7
Common  Secret
Stored  Information
(Hash)
Password
Verification
...
1 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
2 | Peter Mayer | ACSAC 2015 | 11.12.2015
Why portfolio authentication?
<shoulder surfing image>
3 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
✓
4 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
5 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
§Naïve approach
§ Generate & store the hashes for all authorized subsets
§ Check if user input matches one of the hashes
§ Easy to implement
§ Factorial growth of number of hashes
➔ inefficient
6 | Peter Mayer | ACSAC 2015 | 11.12.2015
(t,n)-threshold verification
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
S
e
t
C
h
a
l
l
e
n
g
e
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
e1
e2
e3
e5
e1
e2
e4
e5
e1
e2
e5...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:YouSlow: a performance analysis tool for adaptive bitrate video streaming
author:Hyunwoo Nam and
Kyung-Hwa Kim and
Doru Calin and
Henning Schulzrinne
YouSlow: A Performance Analysis Tool for Adaptive Bitrate
Video Streaming
Hyunwoo Nam, Kyung-Hwa Kim and
Henning Schulzrinne
Columbia University
New York, NY
{hn2203, kk2515, hgs10}@columbia.edu
Bell Laboratories, Alcatel-Lucent
Doru Calin
Murray Hill, NJ
doru.calin@alcatel-lucent.com
ABSTRACT
Adaptive bitrate (ABR) technologies are being widely used
in today’s popular HTTP-based video streaming such as
YouTube and Netﬂix. Such a rate-switching algorithm em-
bedded in a video player is designed to improve video quality-
of-experience (QoE) by selecting an appropriate resolution
based on the analysis of network conditions while the video is
playing. However, a bad viewing experience is often caused
by the video player having diﬃculty estimating transit or
client-side network conditions accurately. In order to ana-
lyze the ABR streaming performance, we developed YouS-
low, a web browser plug-in that can detect and report live
buﬀer stalling events to our analysis tool. Currently, YouS-
low has collected more than 20,000 of YouTube video stalling
events over 40 countries.
Categories and Subject Descriptors
D.2.8 [Software Engineering]: Metrics—performance mea-
sures
Keywords
HTTP Video Streaming; Adaptive Bitrate Streaming (ABR);
Video Quality of Experience
1.
INTRODUCTION AND CHALLENGE
Today’s over-the-top (OTT) video streaming services de-
liver video contents to clients over HTTP. In the early ver-
sion of HTTP-based video streaming, a progressive down-
load mechanism was used, where the server pushes the con-
tent as quickly as possible when a client requests a video.
However, the major drawback is that all clients must down-
load videos at the same bitrate [1], regardless of network
conditions and performance of their devices. Several ABR
technologies such as Apple HTTP Live Streaming (HLS),
Microsoft IIS Smoo...


Instruction: 总结这篇安全研究的主要观点

Input:
title:YouSlow: a performance analysis tool for adaptive bitrate video streaming
author:Hyunwoo Nam and
Kyung-Hwa Kim and
Doru Calin and
Henning Schulzrinne
YouSlow: A Performance Analysis Tool for Adaptive Bitrate
Video Streaming
Hyunwoo Nam, Kyung-Hwa Kim and
Henning Schulzrinne
Columbia University
New York, NY
{hn2203, kk2515, hgs10}@columbia.edu
Bell Laboratories, Alcatel-Lucent
Doru Calin
Murray Hill, NJ
doru.calin@alcatel-lucent.com
ABSTRACT
Adaptive bitrate (ABR) technologies are being widely used
in today’s popular HTTP-based video streaming such as
YouTube and Netﬂix. Such a rate-switching algorithm em-
bedded in a video player is designed to improve video quality-
of-experience (QoE) by selecting an appropriate resolution
based on the analysis of network conditions while the video is
playing. However, a bad viewing experience is often caused
by the video player having diﬃculty estimating transit or
client-side network conditions accurately. In order to ana-
lyze the ABR streaming performance, we developed YouS-
low, a web browser plug-in that can detect and report live
buﬀer stalling events to our analysis tool. Currently, YouS-
low has collected more than 20,000 of YouTube video stalling
events over 40 countries.
Categories and Subject Descriptors
D.2.8 [Software Engineering]: Metrics—performance mea-
sures
Keywords
HTTP Video Streaming; Adaptive Bitrate Streaming (ABR);
Video Quality of Experience
1.
INTRODUCTION AND CHALLENGE
Today’s over-the-top (OTT) video streaming services de-
liver video contents to clients over HTTP. In the early ver-
sion of HTTP-based video streaming, a progressive down-
load mechanism was used, where the server pushes the con-
tent as quickly as possible when a client requests a video.
However, the major drawback is that all clients must down-
load videos at the same bitrate [1], regardless of network
conditions and performance of their devices. Several ABR
technologies such as Apple HTTP Live Streaming (HLS),
Microsoft IIS Smoo...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Enabling Network Security Through Active DNS Datasets
author:Athanasios Kountouras and
Panagiotis Kintis and
Chaz Lever and
Yizheng Chen and
Yacin Nadji and
David Dagon and
Manos Antonakakis and
Rodney Joffe
Enabling Network Security Through
Active DNS Datasets
Athanasios Kountouras1(B), Panagiotis Kintis2, Chaz Lever2, Yizheng Chen2,
Yacin Nadji2, David Dagon1, Manos Antonakakis1, and Rodney Joﬀe3
Georgia Institute of Technology, Atlanta, USA
1 School of Electrical and Computer Engineering,
{kountouras,manos}@gatech.edu, dagon@sudo.sh
{kintis,chazlever,yzchen,yacin}@gatech.edu
2 School of Computer Science, Georgia Institute of Technology, Atlanta, USA
3 Neustar, Sterling, USA
rjoffe@centergate.com
Abstract. Most modern cyber crime leverages the Domain Name Sys-
tem (DNS) to attain high levels of network agility and make detection
of Internet abuse challenging. The majority of malware, which represent
a key component of illicit Internet operations, are programmed to locate
the IP address of their command-and-control (C&C) server through DNS
lookups. To make the malicious infrastructure both agile and resilient,
malware authors often use sophisticated communication methods that
utilize DNS (i.e., domain generation algorithms) for their campaigns. In
general, Internet miscreants make extensive use of short-lived disposable
domains to promote a large variety of threats and support their criminal
network operations.
To eﬀectively combat Internet abuse, the security community needs
access to freely available and open datasets. Such datasets will enable
the development of new algorithms that can enable the early detection,
tracking, and overall lifetime of modern Internet threats. To that end, we
have created a system, Thales, that actively queries and collects records
for massive amounts of domain names from various seeds. These seeds
are collected from multiple public sources and, therefore, free of privacy
concerns. The results of this eﬀort will be opened and ma...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Enabling Network Security Through Active DNS Datasets
author:Athanasios Kountouras and
Panagiotis Kintis and
Chaz Lever and
Yizheng Chen and
Yacin Nadji and
David Dagon and
Manos Antonakakis and
Rodney Joffe
Enabling Network Security Through
Active DNS Datasets
Athanasios Kountouras1(B), Panagiotis Kintis2, Chaz Lever2, Yizheng Chen2,
Yacin Nadji2, David Dagon1, Manos Antonakakis1, and Rodney Joﬀe3
Georgia Institute of Technology, Atlanta, USA
1 School of Electrical and Computer Engineering,
{kountouras,manos}@gatech.edu, dagon@sudo.sh
{kintis,chazlever,yzchen,yacin}@gatech.edu
2 School of Computer Science, Georgia Institute of Technology, Atlanta, USA
3 Neustar, Sterling, USA
rjoffe@centergate.com
Abstract. Most modern cyber crime leverages the Domain Name Sys-
tem (DNS) to attain high levels of network agility and make detection
of Internet abuse challenging. The majority of malware, which represent
a key component of illicit Internet operations, are programmed to locate
the IP address of their command-and-control (C&C) server through DNS
lookups. To make the malicious infrastructure both agile and resilient,
malware authors often use sophisticated communication methods that
utilize DNS (i.e., domain generation algorithms) for their campaigns. In
general, Internet miscreants make extensive use of short-lived disposable
domains to promote a large variety of threats and support their criminal
network operations.
To eﬀectively combat Internet abuse, the security community needs
access to freely available and open datasets. Such datasets will enable
the development of new algorithms that can enable the early detection,
tracking, and overall lifetime of modern Internet threats. To that end, we
have created a system, Thales, that actively queries and collects records
for massive amounts of domain names from various seeds. These seeds
are collected from multiple public sources and, therefore, free of privacy
concerns. The results of this eﬀort will be opened and ma...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Private search in the real world
author:Vasilis Pappas and
Mariana Raykova and
Binh Vo and
Steven M. Bellovin and
Tal Malkin
Private Search in the Real World
Vasilis Pappas, Mariana Raykova, Binh Vo, Steven M. Bellovin, Tal Malkin
{vpappas, mariana, binh, smb, tal}@cs.columbia.edu
Department of Computer Science
Columbia University, New York, NY, USA
ABSTRACT
Encrypted search — performing queries on protected data — has
been explored in the past; however, its inherent inefﬁciency has
raised questions of practicality. Here, we focus on improving
the performance and extending its functionality enough to make
it practical. We do this by optimizing the system, and by stepping
back from the goal of achieving maximal privacy guarantees in an
encrypted search scenario and consider efﬁciency and functionality
as priorities.
We design and analyze the privacy implications of two prac-
tical extensions applicable to any keyword-based private search
system. We evaluate their efﬁciency by building them on top
of a private search system, called SADS. Additionally, we im-
prove SADS’ performance, privacy guaranties and functionality.
The extended SADS system offers improved efﬁciency parameters
that meet practical usability requirements in a relaxed adversarial
model. We present the experimental results and evaluate the per-
formance of the system. We also demonstrate analytically that our
scheme can meet the basic needs of a major hospital complex’s ad-
missions records. Overall, we achieve performance comparable to
a simply conﬁgured MySQL database system.
1.
INTRODUCTION
Encrypted search — querying of protected data — has come into
the foreground with growing concerns about security and privacy.
There are many variants of the problem that protect different things:
the searchable data, queries, participant identities, etc. Existing
schemes also differ in their expected operational environment. The
majority of encrypted search mechanisms concern data outsourc-
ing [4–6,8,13,...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Private search in the real world
author:Vasilis Pappas and
Mariana Raykova and
Binh Vo and
Steven M. Bellovin and
Tal Malkin
Private Search in the Real World
Vasilis Pappas, Mariana Raykova, Binh Vo, Steven M. Bellovin, Tal Malkin
{vpappas, mariana, binh, smb, tal}@cs.columbia.edu
Department of Computer Science
Columbia University, New York, NY, USA
ABSTRACT
Encrypted search — performing queries on protected data — has
been explored in the past; however, its inherent inefﬁciency has
raised questions of practicality. Here, we focus on improving
the performance and extending its functionality enough to make
it practical. We do this by optimizing the system, and by stepping
back from the goal of achieving maximal privacy guarantees in an
encrypted search scenario and consider efﬁciency and functionality
as priorities.
We design and analyze the privacy implications of two prac-
tical extensions applicable to any keyword-based private search
system. We evaluate their efﬁciency by building them on top
of a private search system, called SADS. Additionally, we im-
prove SADS’ performance, privacy guaranties and functionality.
The extended SADS system offers improved efﬁciency parameters
that meet practical usability requirements in a relaxed adversarial
model. We present the experimental results and evaluate the per-
formance of the system. We also demonstrate analytically that our
scheme can meet the basic needs of a major hospital complex’s ad-
missions records. Overall, we achieve performance comparable to
a simply conﬁgured MySQL database system.
1.
INTRODUCTION
Encrypted search — querying of protected data — has come into
the foreground with growing concerns about security and privacy.
There are many variants of the problem that protect different things:
the searchable data, queries, participant identities, etc. Existing
schemes also differ in their expected operational environment. The
majority of encrypted search mechanisms concern data outsourc-
ing [4–6,8,13,...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Validating web content with senser
author:Jordan Wilberding and
Andrew Yates and
Micah Sherr and
Wenchao Zhou
Validating Web Content with Senser
Jordan Wilberding
Georgetown University
Andrew Yates
Georgetown University
Wenchao Zhou
Georgetown University
Micah Sherr
Georgetown University
ABSTRACT
This paper introduces Senser, a system for validating retrieved
web content. Senser does not rely on a PKI and operates even
when SSL/TLS is not supported by the web server. Senser oper-
ates as a network of proxies located at different vantage points on
the Internet. Clients query a random subset of Senser proxies for
compact descriptions of a desired web page, and apply consensus
and matching algorithms to the returned results to locally render a
“majority” web page. To ensure diverse selections of proxies (and
consequently decrease an adversary’s ability to manipulate a ma-
jority of the proxies’ requests), Senser leverages Internet mapping
systems that accurately predict AS-level paths between available
proxies and the desired web page. We demonstrate using a de-
ployment of Senser on Amazon EC2 that Senser detects and mit-
igates attempts by adversaries to manipulate web content — even
when controlling large collections of autonomous systems — while
maintaining reasonable performance overheads.
1.
INTRODUCTION
SSL/TLS is the predominant protocol used to protect web con-
tent. When used correctly, it provides strong conﬁdentiality and
authenticity guarantees. Unfortunately, while SSL/TLS is critically
important in securing many web transactions, it is often unavail-
able and too often is susceptible to implementation weaknesses.
To illustrate, Sunshine et al. [24] demonstrate that users often do
not heed browsers’ certiﬁcate warning messages. Additionally, the
2011 DigiNotar incident [26] and academic studies of SSL/TLS de-
ployment [12] bring into focus longheld concerns about the lack of
safeguards in the web’s public key infrastructure or “PKI” (cf. [8]).
Final...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Validating web content with senser
author:Jordan Wilberding and
Andrew Yates and
Micah Sherr and
Wenchao Zhou
Validating Web Content with Senser
Jordan Wilberding
Georgetown University
Andrew Yates
Georgetown University
Wenchao Zhou
Georgetown University
Micah Sherr
Georgetown University
ABSTRACT
This paper introduces Senser, a system for validating retrieved
web content. Senser does not rely on a PKI and operates even
when SSL/TLS is not supported by the web server. Senser oper-
ates as a network of proxies located at different vantage points on
the Internet. Clients query a random subset of Senser proxies for
compact descriptions of a desired web page, and apply consensus
and matching algorithms to the returned results to locally render a
“majority” web page. To ensure diverse selections of proxies (and
consequently decrease an adversary’s ability to manipulate a ma-
jority of the proxies’ requests), Senser leverages Internet mapping
systems that accurately predict AS-level paths between available
proxies and the desired web page. We demonstrate using a de-
ployment of Senser on Amazon EC2 that Senser detects and mit-
igates attempts by adversaries to manipulate web content — even
when controlling large collections of autonomous systems — while
maintaining reasonable performance overheads.
1.
INTRODUCTION
SSL/TLS is the predominant protocol used to protect web con-
tent. When used correctly, it provides strong conﬁdentiality and
authenticity guarantees. Unfortunately, while SSL/TLS is critically
important in securing many web transactions, it is often unavail-
able and too often is susceptible to implementation weaknesses.
To illustrate, Sunshine et al. [24] demonstrate that users often do
not heed browsers’ certiﬁcate warning messages. Additionally, the
2011 DigiNotar incident [26] and academic studies of SSL/TLS de-
ployment [12] bring into focus longheld concerns about the lack of
safeguards in the web’s public key infrastructure or “PKI” (cf. [8]).
Final...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:A Merged Inline Measurement Method for Capacity and Available Bandwidth
author:Cao Le Thanh Man and
Go Hasegawa and
Masayuki Murata
A Merged Inline Measurement Method for Capacity
and Available Bandwidth
Cao Le Thanh Man, Go Hasegawa, and Masayuki Murata
Graduate School of Information Science and Technology, Osaka University
{mlt-cao, hasegawa, murata}@ist.osaka-u.ac.jp
Abstract. We have proposed a new TCP version, called ImTCP (Inline measure-
ment TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data
packets, and then utilizes the arrival intervals of ACK packets for the available
bandwidth estimation. This type of active measurement in a TCP connection (in-
line measurement) is preferred because it delivers measurement results that are as
accurate as active measurement, even though no extra probe trafﬁc is injected into
the network. In the present research, we combine a new capacity measurement
function with the currently used measurement method to enable simultaneous
measurement of both capacity and available bandwidth in ImTCP. The capacity
measurement algorithm is essentially based on the packet pair technique, but also
consider the estimated available bandwidth values for data ﬁltering or data cal-
culation, so that this algorithm promises better measurement results than current
packet-pair-based measurement algorithms.
Extended Abstract
The capacity of an end-to-end network path is the maximum possible throughput that
the network path can provide. Trafﬁc may reach this maximum throughput when there
is no other trafﬁc along the path. The available bandwidth indicates the unused band-
width of a network path, which is the maximum throughput that newly injected trafﬁc
may reach without affecting the existing trafﬁc. The two bandwidth-related values are
obviously important with respect to adaptive control of the network. In addition, these
two values are often both required at the same time. Although network transport proto-
cols optimi...


Instruction: 总结这篇安全研究的主要观点

Input:
title:A Merged Inline Measurement Method for Capacity and Available Bandwidth
author:Cao Le Thanh Man and
Go Hasegawa and
Masayuki Murata
A Merged Inline Measurement Method for Capacity
and Available Bandwidth
Cao Le Thanh Man, Go Hasegawa, and Masayuki Murata
Graduate School of Information Science and Technology, Osaka University
{mlt-cao, hasegawa, murata}@ist.osaka-u.ac.jp
Abstract. We have proposed a new TCP version, called ImTCP (Inline measure-
ment TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data
packets, and then utilizes the arrival intervals of ACK packets for the available
bandwidth estimation. This type of active measurement in a TCP connection (in-
line measurement) is preferred because it delivers measurement results that are as
accurate as active measurement, even though no extra probe trafﬁc is injected into
the network. In the present research, we combine a new capacity measurement
function with the currently used measurement method to enable simultaneous
measurement of both capacity and available bandwidth in ImTCP. The capacity
measurement algorithm is essentially based on the packet pair technique, but also
consider the estimated available bandwidth values for data ﬁltering or data cal-
culation, so that this algorithm promises better measurement results than current
packet-pair-based measurement algorithms.
Extended Abstract
The capacity of an end-to-end network path is the maximum possible throughput that
the network path can provide. Trafﬁc may reach this maximum throughput when there
is no other trafﬁc along the path. The available bandwidth indicates the unused band-
width of a network path, which is the maximum throughput that newly injected trafﬁc
may reach without affecting the existing trafﬁc. The two bandwidth-related values are
obviously important with respect to adaptive control of the network. In addition, these
two values are often both required at the same time. Although network transport proto-
cols optimi...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:The Security of ChaCha20-Poly1305 in the Multi-User Setting
author:Jean Paul Degabriele and
J'erôme Govinden and
Felix G"unther and
Kenneth G. Paterson
The Security of ChaCha20-Poly1305 in the Multi-User Setting
Jean Paul Degabriele
jean_paul.degabriele@tu-darmstadt.de
CNS, Technische Universität Darmstadt
Jérôme Govinden
jerome.govinden@tu-darmstadt.de
CNS, Technische Universität Darmstadt
Felix Günther
felix.guenther@inf.ethz.ch
Applied Cryptography Group, ETH Zurich
ABSTRACT
The ChaCha20-Poly1305 AEAD scheme is being increasingly wid-
ely deployed in practice. Practitioners need proven security bounds
in order to set data limits and rekeying intervals for the scheme.
But the formal security analysis of ChaCha20-Poly1305 currently
lags behind that of AES-GCM. The only extant analysis (Procter,
2014) contains a flaw and is only for the single-user setting. We
rectify this situation. We prove a multi-user security bound on the
AEAD security of ChaCha20-Poly1305 and establish the tightness
of each term in our bound through matching attacks. We show
how our bound differs both qualitatively and quantitatively from
the known bounds for AES-GCM, highlighting how subtle design
choices lead to distinctive security properties. We translate our
bound to the nonce-randomized setting employed in TLS 1.3 and
elsewhere, and we additionally improve the corresponding security
bounds for GCM. Finally, we provide a simple yet stronger variant
of ChaCha20-Poly1305 that addresses the deficiencies highlighted
by our analysis.
CCS CONCEPTS
• Security and privacy → Mathematical foundations of cryp-
tography; Block and stream ciphers; Hash functions and message
authentication codes.
KEYWORDS
ChaCha20-Poly1305; Multi-User Security; GCM; Nonce Random-
ization, AEAD; TLS 1.3; Tight Security
ACM Reference Format:
Jean Paul Degabriele, Jérôme Govinden, Felix Günther, and Kenneth G.
Paterson. 2021. The Security of ChaCha20-Poly1305 in the Multi-User Set-
ting. In Proceedings of ...


Instruction: 总结这篇安全研究的主要观点

Input:
title:The Security of ChaCha20-Poly1305 in the Multi-User Setting
author:Jean Paul Degabriele and
J'erôme Govinden and
Felix G"unther and
Kenneth G. Paterson
The Security of ChaCha20-Poly1305 in the Multi-User Setting
Jean Paul Degabriele
jean_paul.degabriele@tu-darmstadt.de
CNS, Technische Universität Darmstadt
Jérôme Govinden
jerome.govinden@tu-darmstadt.de
CNS, Technische Universität Darmstadt
Felix Günther
felix.guenther@inf.ethz.ch
Applied Cryptography Group, ETH Zurich
ABSTRACT
The ChaCha20-Poly1305 AEAD scheme is being increasingly wid-
ely deployed in practice. Practitioners need proven security bounds
in order to set data limits and rekeying intervals for the scheme.
But the formal security analysis of ChaCha20-Poly1305 currently
lags behind that of AES-GCM. The only extant analysis (Procter,
2014) contains a flaw and is only for the single-user setting. We
rectify this situation. We prove a multi-user security bound on the
AEAD security of ChaCha20-Poly1305 and establish the tightness
of each term in our bound through matching attacks. We show
how our bound differs both qualitatively and quantitatively from
the known bounds for AES-GCM, highlighting how subtle design
choices lead to distinctive security properties. We translate our
bound to the nonce-randomized setting employed in TLS 1.3 and
elsewhere, and we additionally improve the corresponding security
bounds for GCM. Finally, we provide a simple yet stronger variant
of ChaCha20-Poly1305 that addresses the deficiencies highlighted
by our analysis.
CCS CONCEPTS
• Security and privacy → Mathematical foundations of cryp-
tography; Block and stream ciphers; Hash functions and message
authentication codes.
KEYWORDS
ChaCha20-Poly1305; Multi-User Security; GCM; Nonce Random-
ization, AEAD; TLS 1.3; Tight Security
ACM Reference Format:
Jean Paul Degabriele, Jérôme Govinden, Felix Günther, and Kenneth G.
Paterson. 2021. The Security of ChaCha20-Poly1305 in the Multi-User Set-
ting. In Proceedings of ...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:An Intrusion Detection Tool for AODV-Based Ad hoc Wireless Networks
author:Giovanni Vigna and
Sumit Gwalani and
Kavitha Srinivasan and
Elizabeth M. Belding-Royer and
Richard A. Kemmerer
Available online at www.sciencedirect.com
Ad Hoc Networks 6 (2008) 578–599
www.elsevier.com/locate/adhoc
Threshold-based intrusion detection in ad hoc networks
and secure AODV q
A. Patwardhan a,*, J. Parker a, M. Iorga b, A. Joshi a, T. Karygiannis b, Y. Yesha a
a Computer Science and Electrical Engineering Department, UMBC, 1000 Hilltop Circle, Baltimore, MD 21250, United States
b Computer Security Division, National Institute of Standards and Technology, Gaithersburg, MD 20899, United States
Received 1 November 2006; received in revised form 28 February 2007; accepted 9 May 2007
Available online 18 May 2007
Abstract
Mobile ad hoc networks (MANETs) play an important role in connecting devices in pervasive environments. MANETs
provide inexpensive and versatile communication, yet several challenges remain in addressing their security. So far, numer-
ous schemes have been proposed for secure routing and intrusion detection, with only simulations to validate them; little
work exists, in implementing such schemes on small handheld devices. In this paper, we present our approach of securing a
MANET using a threshold-based intrusion detection system and a secure routing protocol. We present a proof-of-concept
implementation of our IDS deployed on handheld devices and in a MANET testbed connected by a secure version of
AODV over IPv6 – SecAODV. While the IDS helps detect attacks on data traﬃc, SecAODV incorporates security features
of non-repudiation and authentication, without relying on the availability of a Certiﬁcate Authority (CA) or a Key
Distribution Center (KDC). We present the design and implementation details of our system, the practical considerations
involved, and how these mechanisms can be used to detect and thwart malicious attacks.
Ó 2007 Elsevier B.V. All rights reser...


Instruction: 总结这篇安全研究的主要观点

Input:
title:An Intrusion Detection Tool for AODV-Based Ad hoc Wireless Networks
author:Giovanni Vigna and
Sumit Gwalani and
Kavitha Srinivasan and
Elizabeth M. Belding-Royer and
Richard A. Kemmerer
Available online at www.sciencedirect.com
Ad Hoc Networks 6 (2008) 578–599
www.elsevier.com/locate/adhoc
Threshold-based intrusion detection in ad hoc networks
and secure AODV q
A. Patwardhan a,*, J. Parker a, M. Iorga b, A. Joshi a, T. Karygiannis b, Y. Yesha a
a Computer Science and Electrical Engineering Department, UMBC, 1000 Hilltop Circle, Baltimore, MD 21250, United States
b Computer Security Division, National Institute of Standards and Technology, Gaithersburg, MD 20899, United States
Received 1 November 2006; received in revised form 28 February 2007; accepted 9 May 2007
Available online 18 May 2007
Abstract
Mobile ad hoc networks (MANETs) play an important role in connecting devices in pervasive environments. MANETs
provide inexpensive and versatile communication, yet several challenges remain in addressing their security. So far, numer-
ous schemes have been proposed for secure routing and intrusion detection, with only simulations to validate them; little
work exists, in implementing such schemes on small handheld devices. In this paper, we present our approach of securing a
MANET using a threshold-based intrusion detection system and a secure routing protocol. We present a proof-of-concept
implementation of our IDS deployed on handheld devices and in a MANET testbed connected by a secure version of
AODV over IPv6 – SecAODV. While the IDS helps detect attacks on data traﬃc, SecAODV incorporates security features
of non-repudiation and authentication, without relying on the availability of a Certiﬁcate Authority (CA) or a Key
Distribution Center (KDC). We present the design and implementation details of our system, the practical considerations
involved, and how these mechanisms can be used to detect and thwart malicious attacks.
Ó 2007 Elsevier B.V. All rights reser...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Result Pattern Hiding Searchable Encryption for Conjunctive Queries
author:Shangqi Lai and
Sikhar Patranabis and
Amin Sakzad and
Joseph K. Liu and
Debdeep Mukhopadhyay and
Ron Steinfeld and
Shifeng Sun and
Dongxi Liu and
Cong Zuo
Result Pattern Hiding Searchable Encryption for Conjunctive
Queries
(Full Version)
Shangqi Lai∗
Monash University
Melbourne, Australia
shangqi.lai@monash.edu
Joseph K. Liu†
Monash University
Melbourne, Australia
joseph.liu@monash.edu
Shi-Feng Sun∗†
Monash University
Melbourne, Australia
shifeng.sun@monash.edu
Sikhar Patranabis
Indian Institute of Technology
Kharagpur, India
sikhar.patranabis@iitkgp.ac.in
Debdeep Mukhopadhyay
Indian Institute of Technology
Kharagpur, India
debdeep@iitkgp.ac.in
Dongxi Liu
Data61, CSIRO
Syndey, Australia
dongxi.liu@data61.csiro.au
Amin Sakzad
Monash University
Melbourne, Australia
amin.sakzad@monash.edu
Ron Steinfeld
Monash University
Melbourne, Australia
ron.steinfeld@monash.edu
Cong Zuo∗
Monash University
Melbourne, Australia
cong.zuo1@monash.edu
ABSTRACT
The recently proposed Oblivious Cross-Tags (OXT) protocol (CRYP-
TO 2013) has broken new ground in designing efficient searchable
symmetric encryption (SSE) protocol with support for conjunctive
keyword search in a single-writer single-reader framework. While
the OXT protocol offers high performance by adopting a number
of specialised data-structures, it also trades-off security by leaking
‘partial’ database information to the server. Recent attacks have
exploited similar partial information leakage to breach database
confidentiality. Consequently, it is an open problem to design SSE
protocols that plug such leakages while retaining similar efficiency.
In this paper, we propose a new SSE protocol, called Hidden Cross-
Tags (HXT), that removes ‘Keyword Pair Result Pattern’ (KPRP)
leakage for conjunctive keyword search. We avoid this leakage by
adopting two additional cryptographic primitives - Hidden Vector
Encryption (HVE) and probabilistic (Bloom fil...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Result Pattern Hiding Searchable Encryption for Conjunctive Queries
author:Shangqi Lai and
Sikhar Patranabis and
Amin Sakzad and
Joseph K. Liu and
Debdeep Mukhopadhyay and
Ron Steinfeld and
Shifeng Sun and
Dongxi Liu and
Cong Zuo
Result Pattern Hiding Searchable Encryption for Conjunctive
Queries
(Full Version)
Shangqi Lai∗
Monash University
Melbourne, Australia
shangqi.lai@monash.edu
Joseph K. Liu†
Monash University
Melbourne, Australia
joseph.liu@monash.edu
Shi-Feng Sun∗†
Monash University
Melbourne, Australia
shifeng.sun@monash.edu
Sikhar Patranabis
Indian Institute of Technology
Kharagpur, India
sikhar.patranabis@iitkgp.ac.in
Debdeep Mukhopadhyay
Indian Institute of Technology
Kharagpur, India
debdeep@iitkgp.ac.in
Dongxi Liu
Data61, CSIRO
Syndey, Australia
dongxi.liu@data61.csiro.au
Amin Sakzad
Monash University
Melbourne, Australia
amin.sakzad@monash.edu
Ron Steinfeld
Monash University
Melbourne, Australia
ron.steinfeld@monash.edu
Cong Zuo∗
Monash University
Melbourne, Australia
cong.zuo1@monash.edu
ABSTRACT
The recently proposed Oblivious Cross-Tags (OXT) protocol (CRYP-
TO 2013) has broken new ground in designing efficient searchable
symmetric encryption (SSE) protocol with support for conjunctive
keyword search in a single-writer single-reader framework. While
the OXT protocol offers high performance by adopting a number
of specialised data-structures, it also trades-off security by leaking
‘partial’ database information to the server. Recent attacks have
exploited similar partial information leakage to breach database
confidentiality. Consequently, it is an open problem to design SSE
protocols that plug such leakages while retaining similar efficiency.
In this paper, we propose a new SSE protocol, called Hidden Cross-
Tags (HXT), that removes ‘Keyword Pair Result Pattern’ (KPRP)
leakage for conjunctive keyword search. We avoid this leakage by
adopting two additional cryptographic primitives - Hidden Vector
Encryption (HVE) and probabilistic (Bloom fil...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Scalable application layer multicast
author:Suman Banerjee and
Bobby Bhattacharjee and
Christopher Kommareddy
Scalable Application Layer Multicast
Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy
Department of Computer Science,University of Maryland, College Park, MD 20742, USA
fsuman,bobby,kcrg@cs.umd.edu
ABSTRACT
We describe a new scalable application-layer multicast protocol, specif-
ically designed for low-bandwidth, data streaming applications with
large receiver sets. Our scheme is based upon a hierarchical cluster-
ing of the application-layer multicast peers and can support a num-
ber of different data delivery trees with desirable properties.
We present extensive simulations of both our protocol and the
Narada application-layer multicast protocol over Internet-like topolo-
gies. Our results show that for groups of size 32 or more, our proto-
col has lower link stress (by about 25%), improved or similar end-
to-end latencies and similar failure recovery properties. More im-
portantly, it is able to achieve these results by using orders of mag-
nitude lower control trafﬁc.
Finally, we present results from our wide-area testbed in which
we experimented with 32-100 member groups distributed over 8 dif-
ferent sites. In our experiments, averagegroup members established
and maintained low-latency paths and incurred a maximum packet
loss rate of less than 1% as members randomly joined and left the
multicast group. The average control overhead during our experi-
ments was less than 1 Kbps for groups of size 100.
Categories and Subject Descriptors
C.2.2 [Computer-Communication Networks]: Network Protocols;
C.2.4 [Computer-Communication Networks]: Distributed Sys-
tems; C.4 [Computer Systems Organization]: Performance of Sys-
tems
General Terms
Algorithms, Design, Performance, Experimentation
Keywords
Application layer multicast, Overlay networks, Peer-to-peer systems,
Hierarchy, Scalability
Permission to make digital or hard copies of all or part of...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Scalable application layer multicast
author:Suman Banerjee and
Bobby Bhattacharjee and
Christopher Kommareddy
Scalable Application Layer Multicast
Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy
Department of Computer Science,University of Maryland, College Park, MD 20742, USA
fsuman,bobby,kcrg@cs.umd.edu
ABSTRACT
We describe a new scalable application-layer multicast protocol, specif-
ically designed for low-bandwidth, data streaming applications with
large receiver sets. Our scheme is based upon a hierarchical cluster-
ing of the application-layer multicast peers and can support a num-
ber of different data delivery trees with desirable properties.
We present extensive simulations of both our protocol and the
Narada application-layer multicast protocol over Internet-like topolo-
gies. Our results show that for groups of size 32 or more, our proto-
col has lower link stress (by about 25%), improved or similar end-
to-end latencies and similar failure recovery properties. More im-
portantly, it is able to achieve these results by using orders of mag-
nitude lower control trafﬁc.
Finally, we present results from our wide-area testbed in which
we experimented with 32-100 member groups distributed over 8 dif-
ferent sites. In our experiments, averagegroup members established
and maintained low-latency paths and incurred a maximum packet
loss rate of less than 1% as members randomly joined and left the
multicast group. The average control overhead during our experi-
ments was less than 1 Kbps for groups of size 100.
Categories and Subject Descriptors
C.2.2 [Computer-Communication Networks]: Network Protocols;
C.2.4 [Computer-Communication Networks]: Distributed Sys-
tems; C.4 [Computer Systems Organization]: Performance of Sys-
tems
General Terms
Algorithms, Design, Performance, Experimentation
Keywords
Application layer multicast, Overlay networks, Peer-to-peer systems,
Hierarchy, Scalability
Permission to make digital or hard copies of all or part of...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Passive IP traceback: capturing the origin of anonymous traffic
through network telescopes
author:Guang Yao and
Jun Bi and
Zijian Zhou
Passive IP Traceback: Capturing the Origin of Anonymous
Traffic through Network Telescopes
Guang Yao, Jun Bi, Zijian Zhou
Network Research Center, Tsinghua University, Beijing 100084, China
{yaog, junbi, zhouzj}@netarchlab.tsinghua.edu.cn
ABSTRACT
IP  traceback  can  be  used  to  find  the  origin  of  anonymous  traffic;
however,  Internet-scale  IP  traceback  systems  have  not  been
deployed  due  to  a  need  for  cooperation  between  Internet  Service
Providers (ISPs).  This article presents an Internet-scale Passive IP
Trackback (PIT) mechanism that does not require ISP deployment.
PIT analyzes the ICMP messages that may scattered to a network
telescope  as  spoofed  packets  travel  from  attacker  to  victim.    An
Internet route model is then used to help re-construct the attack path.
Applying  this  mechanism  to  data  collected  by  Cooperative
Association for Internet Data Analysis (CAIDA), we found  PIT can
construct a trace tree from at least one intermediate router in 55.4%
the fiercest packet spoofing attacks, and can construct a tree from at
least 10 routers in 23.4% of attacks. This initial result shows PIT is a
promising mechanism.
Categories and Subject Descriptors: C.2.0 [Computer-
Communication Networks]: General– Security and protection.
General Terms: Design
Keywords: IP traceback, network telescope
1.  INTRODUCTION
Distributed Denial of Service (DDoS) [1] attacks are one of the most
pressing  security  threats  on  the  Internet.  Attackers  can  launch
attacks from corners of the Internet, and the aggregated traffic can
exhaust  the  bandwidth  (or  other  resources)  at  the  victim.  DDoS
attack flows can be shut off by configuring IP source based filters if
one can identify the malicious clients.   However, attack flows can
use forged source addresses and thus source...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Passive IP traceback: capturing the origin of anonymous traffic
through network telescopes
author:Guang Yao and
Jun Bi and
Zijian Zhou
Passive IP Traceback: Capturing the Origin of Anonymous
Traffic through Network Telescopes
Guang Yao, Jun Bi, Zijian Zhou
Network Research Center, Tsinghua University, Beijing 100084, China
{yaog, junbi, zhouzj}@netarchlab.tsinghua.edu.cn
ABSTRACT
IP  traceback  can  be  used  to  find  the  origin  of  anonymous  traffic;
however,  Internet-scale  IP  traceback  systems  have  not  been
deployed  due  to  a  need  for  cooperation  between  Internet  Service
Providers (ISPs).  This article presents an Internet-scale Passive IP
Trackback (PIT) mechanism that does not require ISP deployment.
PIT analyzes the ICMP messages that may scattered to a network
telescope  as  spoofed  packets  travel  from  attacker  to  victim.    An
Internet route model is then used to help re-construct the attack path.
Applying  this  mechanism  to  data  collected  by  Cooperative
Association for Internet Data Analysis (CAIDA), we found  PIT can
construct a trace tree from at least one intermediate router in 55.4%
the fiercest packet spoofing attacks, and can construct a tree from at
least 10 routers in 23.4% of attacks. This initial result shows PIT is a
promising mechanism.
Categories and Subject Descriptors: C.2.0 [Computer-
Communication Networks]: General– Security and protection.
General Terms: Design
Keywords: IP traceback, network telescope
1.  INTRODUCTION
Distributed Denial of Service (DDoS) [1] attacks are one of the most
pressing  security  threats  on  the  Internet.  Attackers  can  launch
attacks from corners of the Internet, and the aggregated traffic can
exhaust  the  bandwidth  (or  other  resources)  at  the  victim.  DDoS
attack flows can be shut off by configuring IP source based filters if
one can identify the malicious clients.   However, attack flows can
use forged source addresses and thus source...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Errors, Misunderstandings, and Attacks: Analyzing the Crowdsourcing
Process of Ad-blocking Systems
author:Mshabab Alrizah and
Sencun Zhu and
Xinyu Xing and
Gang Wang
Errors, Misunderstandings, and Attacks: Analyzing the
Crowdsourcing Process of Ad-blocking Systems
Mshabab Alrizah
The Pennsylvania State University
maa25@psu.edu
Xinyu Xing
The Pennsylvania State University
xxing@ist.psu.edu
The Pennsylvania State University
Sencun Zhu
sxz16@psu.edu
Gang Wang
University of Illinois at Urbana-Champaign
gangw@illinois.edu
ABSTRACT
Ad-blocking systems such as Adblock Plus rely on crowdsourcing
to build and maintain filter lists, which are the basis for determin-
ing which ads to block on web pages. In this work, we seek to
advance our understanding of the ad-blocking community as well
as the errors and pitfalls of the crowdsourcing process. To do so,
we collected and analyzed a longitudinal dataset that covered the
dynamic changes of popular filter-list EasyList for nine years and
the error reports submitted by the crowd in the same period.
Our study yielded a number of significant findings regarding the
characteristics of FP and FN errors and their causes. For instances,
we found that false positive errors (i.e., incorrectly blocking legiti-
mate content) still took a long time before they could be discovered
(50% of them took more than a month) despite the community ef-
fort. Both EasyList editors and website owners were to blame for
the false positives. In addition, we found that a great number of
false negative errors (i.e., failing to block real advertisements) were
either incorrectly reported or simply ignored by the editors. Fur-
thermore, we analyzed evasion attacks from ad publishers against
ad-blockers. In total, our analysis covers 15 types of attack methods
including 8 methods that have not been studied by the research
community. We show how ad publishers have utilized them to
circumvent ad-blockers and empirically measure the reactions of
ad blockers. T...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Errors, Misunderstandings, and Attacks: Analyzing the Crowdsourcing
Process of Ad-blocking Systems
author:Mshabab Alrizah and
Sencun Zhu and
Xinyu Xing and
Gang Wang
Errors, Misunderstandings, and Attacks: Analyzing the
Crowdsourcing Process of Ad-blocking Systems
Mshabab Alrizah
The Pennsylvania State University
maa25@psu.edu
Xinyu Xing
The Pennsylvania State University
xxing@ist.psu.edu
The Pennsylvania State University
Sencun Zhu
sxz16@psu.edu
Gang Wang
University of Illinois at Urbana-Champaign
gangw@illinois.edu
ABSTRACT
Ad-blocking systems such as Adblock Plus rely on crowdsourcing
to build and maintain filter lists, which are the basis for determin-
ing which ads to block on web pages. In this work, we seek to
advance our understanding of the ad-blocking community as well
as the errors and pitfalls of the crowdsourcing process. To do so,
we collected and analyzed a longitudinal dataset that covered the
dynamic changes of popular filter-list EasyList for nine years and
the error reports submitted by the crowd in the same period.
Our study yielded a number of significant findings regarding the
characteristics of FP and FN errors and their causes. For instances,
we found that false positive errors (i.e., incorrectly blocking legiti-
mate content) still took a long time before they could be discovered
(50% of them took more than a month) despite the community ef-
fort. Both EasyList editors and website owners were to blame for
the false positives. In addition, we found that a great number of
false negative errors (i.e., failing to block real advertisements) were
either incorrectly reported or simply ignored by the editors. Fur-
thermore, we analyzed evasion attacks from ad publishers against
ad-blockers. In total, our analysis covers 15 types of attack methods
including 8 methods that have not been studied by the research
community. We show how ad publishers have utilized them to
circumvent ad-blockers and empirically measure the reactions of
ad blockers. T...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:The Art and Craft of Fraudulent App Promotion in Google Play
author:Mizanur Rahman and
Nestor Hernandez and
Ruben Recabarren and
Syed Ishtiaque Ahmed and
Bogdan Carbunar
The Art and Cra(cid:28) of Fraudulent App Promotion in Google Play
Mizanur Rahman∗
Amazon, USA
mrahm031@(cid:27)u.edu
Nestor Hernandez∗
FIU, Miami, USA
nestorghh@gmail.com
Ruben Recabarren
FIU, Miami, USA
recabarren@gmail.com
Syed Ishtiaque Ahmed
University of Toronto, Toronto, CA
ishtiaque@cs.toronto.edu
Bogdan Carbunar
FIU, Miami, USA
carbunar@gmail.com
ABSTRACT
Black Hat App Search Optimization (ASO) in the form of fake re-
views and sockpuppet accounts, is prevalent in peer-opinion sites,
e.g., app stores, with negative implications on the digital and real
lives of their users. To detect and (cid:27)lter fraud, a growing body of
research has provided insights into various aspects of fraud posting
activities, and made assumptions about the working procedures
of the fraudsters from online data. However, such assumptions of-
ten lack empirical evidence from the actual fraud perpetrators. To
address this problem, in this paper, we present results of both a
qualitative study with 18 ASO workers we recruited from 5 free-
lancing sites, concerning activities they performed on Google Play,
and a quantitative investigation with fraud-related data collected
from other 39 ASO workers.
We reveal (cid:27)ndings concerning various aspects of ASO worker ca-
pabilities and behaviors, including novel insights into their working
patterns, and supporting evidence for several existing assumptions.
Further, we found and report participant-revealed techniques to
bypass Google-imposed veri(cid:27)cations, concrete strategies to avoid
detection, and even strategies that leverage fraud detection to en-
hance fraud e(cid:28)cacy. We report a Google site vulnerability that
enabled us to infer the mobile device models used to post more
than 198 million reviews in Google Play, including 9,942 fake re-
views. We discus...


Instruction: 总结这篇安全研究的主要观点

Input:
title:The Art and Craft of Fraudulent App Promotion in Google Play
author:Mizanur Rahman and
Nestor Hernandez and
Ruben Recabarren and
Syed Ishtiaque Ahmed and
Bogdan Carbunar
The Art and Cra(cid:28) of Fraudulent App Promotion in Google Play
Mizanur Rahman∗
Amazon, USA
mrahm031@(cid:27)u.edu
Nestor Hernandez∗
FIU, Miami, USA
nestorghh@gmail.com
Ruben Recabarren
FIU, Miami, USA
recabarren@gmail.com
Syed Ishtiaque Ahmed
University of Toronto, Toronto, CA
ishtiaque@cs.toronto.edu
Bogdan Carbunar
FIU, Miami, USA
carbunar@gmail.com
ABSTRACT
Black Hat App Search Optimization (ASO) in the form of fake re-
views and sockpuppet accounts, is prevalent in peer-opinion sites,
e.g., app stores, with negative implications on the digital and real
lives of their users. To detect and (cid:27)lter fraud, a growing body of
research has provided insights into various aspects of fraud posting
activities, and made assumptions about the working procedures
of the fraudsters from online data. However, such assumptions of-
ten lack empirical evidence from the actual fraud perpetrators. To
address this problem, in this paper, we present results of both a
qualitative study with 18 ASO workers we recruited from 5 free-
lancing sites, concerning activities they performed on Google Play,
and a quantitative investigation with fraud-related data collected
from other 39 ASO workers.
We reveal (cid:27)ndings concerning various aspects of ASO worker ca-
pabilities and behaviors, including novel insights into their working
patterns, and supporting evidence for several existing assumptions.
Further, we found and report participant-revealed techniques to
bypass Google-imposed veri(cid:27)cations, concrete strategies to avoid
detection, and even strategies that leverage fraud detection to en-
hance fraud e(cid:28)cacy. We report a Google site vulnerability that
enabled us to infer the mobile device models used to post more
than 198 million reviews in Google Play, including 9,942 fake re-
views. We discus...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Ramblr: Making Reassembly Great Again
author:Ruoyu Wang and
Yan Shoshitaishvili and
Antonio Bianchi and
Aravind Machiry and
John Grosen and
Paul Grosen and
Christopher Kruegel and
Giovanni Vigna
Ramblr: Making Reassembly Great Again
Ruoyu Wang, Yan Shoshitaishvili, Antonio Bianchi, Aravind Machiry,
John Grosen, Paul Grosen, Christopher Kruegel, Giovanni Vigna
{ﬁsh, yans, antoniob, machiry, jmg, pcgrosen, chris, vigna}@cs.ucsb.edu
University of California, Santa Barbara
Abstract—Static binary rewriting has many important ap-
plications in reverse engineering, such as patching, code reuse,
and instrumentation. Binary reassembling is an efﬁcient solution
for static binary rewriting. While there has been a proposed
solution to the reassembly of binaries, an evaluation on a real-
world binary dataset shows that it suffers from some problems
that lead to breaking binaries. Those problems include incorrect
symbolization of immediates, failure in identifying symbolizable
constants, lack of pointer safety checks, and other issues. Failure
in addressing those problems makes the existing approach un-
suitable for real-world binaries, especially those compiled with
optimizations enabled.
In this paper, we present a new systematic approach for
binary reassembling. Our new approach is implemented in a tool
called Ramblr. We evaluate Ramblr on 106 real-world programs
on Linux x86 and x86-64, and 143 programs collected from the
Cyber Grand Challenge Qualiﬁcation Event. All programs are
compiled to binaries with a set of different compilation ﬂags
in order to cover as many real-world scenarios as possible.
Ramblr successfully reassembles most of the binaries, which
is an improvement over the state-of-the-art approach. It should
be noted that our reassembling procedure yields no execution
overhead and no size expansion.
I.
INTRODUCTION
Our world is extremely software-dependent. Because of
this, disruption caused by ﬂaws in this software has signif-
icant impact in the “real wor...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Ramblr: Making Reassembly Great Again
author:Ruoyu Wang and
Yan Shoshitaishvili and
Antonio Bianchi and
Aravind Machiry and
John Grosen and
Paul Grosen and
Christopher Kruegel and
Giovanni Vigna
Ramblr: Making Reassembly Great Again
Ruoyu Wang, Yan Shoshitaishvili, Antonio Bianchi, Aravind Machiry,
John Grosen, Paul Grosen, Christopher Kruegel, Giovanni Vigna
{ﬁsh, yans, antoniob, machiry, jmg, pcgrosen, chris, vigna}@cs.ucsb.edu
University of California, Santa Barbara
Abstract—Static binary rewriting has many important ap-
plications in reverse engineering, such as patching, code reuse,
and instrumentation. Binary reassembling is an efﬁcient solution
for static binary rewriting. While there has been a proposed
solution to the reassembly of binaries, an evaluation on a real-
world binary dataset shows that it suffers from some problems
that lead to breaking binaries. Those problems include incorrect
symbolization of immediates, failure in identifying symbolizable
constants, lack of pointer safety checks, and other issues. Failure
in addressing those problems makes the existing approach un-
suitable for real-world binaries, especially those compiled with
optimizations enabled.
In this paper, we present a new systematic approach for
binary reassembling. Our new approach is implemented in a tool
called Ramblr. We evaluate Ramblr on 106 real-world programs
on Linux x86 and x86-64, and 143 programs collected from the
Cyber Grand Challenge Qualiﬁcation Event. All programs are
compiled to binaries with a set of different compilation ﬂags
in order to cover as many real-world scenarios as possible.
Ramblr successfully reassembles most of the binaries, which
is an improvement over the state-of-the-art approach. It should
be noted that our reassembling procedure yields no execution
overhead and no size expansion.
I.
INTRODUCTION
Our world is extremely software-dependent. Because of
this, disruption caused by ﬂaws in this software has signif-
icant impact in the “real wor...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Error Propagation Profiling of Operating Systems
author:Andr'eas Johansson and
Neeraj Suri
Error Propagation Proﬁling of Operating Systems
Department of Computer Science, Technische Universit¨at Darmstadt
Andr´eas Johansson and Neeraj Suri
{aja,suri}@informatik.tu-darmstadt.de
Abstract
An Operating System (OS) constitutes a fundamental
software (SW) component of a computing system. The ro-
bustness of its operations, or lack thereof, strongly inﬂu-
ences the robustness of the entire system. Targeting en-
hancement of robustness at the OS level via use of add-on
SW wrappers, this paper presents an error propagation pro-
ﬁling framework that assists in a) systematic identiﬁcation
and location of design and operational vulnerabilities, and
b) quantiﬁcation of their potential impact. Focusing on data
(value) errors occurring in OS drivers, a set of measures is
presented that aids a designer to locate such vulnerabilities,
either on an OS service (system call) basis or a per driver
basis. A case study and associated experimental process,
using Windows CE .Net, is presented outlining the utility of
our proposed approach.
1. Introduction
The robustness of the OS, i.e., the ability to withstand
perturbations with continued service provision, directly af-
fects the robustness of the whole system. As applications
depend on the OS delivering correct and timely services, a
failure to do so will likely impact the system’s ability to de-
liver its services. In spite of the signiﬁcant ongoing efforts
to enhance OS robustness, and advances in the underlying
SW development processes, OS’s still occasionally fail to
deliver stipulated services. One reason is the complexity
of OS level interactions with varied SW components in the
system that are often unknown at OS design time, e.g., ap-
plications, drivers, libraries. This “dynamic” nature of OS’s
makes it hard to design an OS to be comprehensively robust
against errors that can occur in its operational environment.
This ...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Error Propagation Profiling of Operating Systems
author:Andr'eas Johansson and
Neeraj Suri
Error Propagation Proﬁling of Operating Systems
Department of Computer Science, Technische Universit¨at Darmstadt
Andr´eas Johansson and Neeraj Suri
{aja,suri}@informatik.tu-darmstadt.de
Abstract
An Operating System (OS) constitutes a fundamental
software (SW) component of a computing system. The ro-
bustness of its operations, or lack thereof, strongly inﬂu-
ences the robustness of the entire system. Targeting en-
hancement of robustness at the OS level via use of add-on
SW wrappers, this paper presents an error propagation pro-
ﬁling framework that assists in a) systematic identiﬁcation
and location of design and operational vulnerabilities, and
b) quantiﬁcation of their potential impact. Focusing on data
(value) errors occurring in OS drivers, a set of measures is
presented that aids a designer to locate such vulnerabilities,
either on an OS service (system call) basis or a per driver
basis. A case study and associated experimental process,
using Windows CE .Net, is presented outlining the utility of
our proposed approach.
1. Introduction
The robustness of the OS, i.e., the ability to withstand
perturbations with continued service provision, directly af-
fects the robustness of the whole system. As applications
depend on the OS delivering correct and timely services, a
failure to do so will likely impact the system’s ability to de-
liver its services. In spite of the signiﬁcant ongoing efforts
to enhance OS robustness, and advances in the underlying
SW development processes, OS’s still occasionally fail to
deliver stipulated services. One reason is the complexity
of OS level interactions with varied SW components in the
system that are often unknown at OS design time, e.g., ap-
plications, drivers, libraries. This “dynamic” nature of OS’s
makes it hard to design an OS to be comprehensively robust
against errors that can occur in its operational environment.
This ...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Robust full duplex radio link
author:Dinesh Bharadia and
Kiran Raj Joshi and
Sachin Katti
Robust Full Duplex Radio Link
Dinesh Bharadia
Stanford University
dineshb@stanford.edu
Kiran Raj Joshi
Stanford University
krjoshi@stanford.edu
Sachin Katti
Stanford University
skatti@stanford.edu
ABSTRACT
This paper presents demonstration of a real-time full duplex point-
to-point link, where transmission and reception occurs in the same
spectrum band simultaneously between a pair of full-duplex radios.
This demo ﬁrst builds a full duplex radio by implementing self-
interference cancellation technique on top of a traditional half duplex
radio architecture. We then establish a point-to-point link using a
pair of these radios that can transmit and receive OFDM packets. By
changing the environmental conditions around the full-duplex radios
we then demonstrate the robustness of the self-interference cancella-
tion to adapt to the changing environment.
Categories and Subject Descriptors
C.2.1 [Computer Communication Networks]: Network Architec-
ture and Design—Wireless communication
Keywords: Full Duplex; Interference Cancellation; Non-linear Can-
cellation
1.
INTRODUCTION
Full duplex radios have huge advantage over their half duplex
counterparts. Several work on full duplex radios [5, 3, 7, 6, 4, 8] have
proposed various hardware and algorithmic techniques to achieve
different level of self-interference cancellation required for realiza-
tion of full duplex radios. Yet, these works have failed to reduce the
ingrained skepticism of both academia and industry alike regarding
the feasibility of implementing these techniques and their adaptabil-
ity to dynamic environmental conditions. This demo has two fold
objectives; ﬁrst, we implement a working full duplex radio using the
architecture proposed in [5]. We then build full duplex radio link by
using a pair of these full duplex radios and demonstrate that they can
adapt to the changing environmental conditions around them [5].
I...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Robust full duplex radio link
author:Dinesh Bharadia and
Kiran Raj Joshi and
Sachin Katti
Robust Full Duplex Radio Link
Dinesh Bharadia
Stanford University
dineshb@stanford.edu
Kiran Raj Joshi
Stanford University
krjoshi@stanford.edu
Sachin Katti
Stanford University
skatti@stanford.edu
ABSTRACT
This paper presents demonstration of a real-time full duplex point-
to-point link, where transmission and reception occurs in the same
spectrum band simultaneously between a pair of full-duplex radios.
This demo ﬁrst builds a full duplex radio by implementing self-
interference cancellation technique on top of a traditional half duplex
radio architecture. We then establish a point-to-point link using a
pair of these radios that can transmit and receive OFDM packets. By
changing the environmental conditions around the full-duplex radios
we then demonstrate the robustness of the self-interference cancella-
tion to adapt to the changing environment.
Categories and Subject Descriptors
C.2.1 [Computer Communication Networks]: Network Architec-
ture and Design—Wireless communication
Keywords: Full Duplex; Interference Cancellation; Non-linear Can-
cellation
1.
INTRODUCTION
Full duplex radios have huge advantage over their half duplex
counterparts. Several work on full duplex radios [5, 3, 7, 6, 4, 8] have
proposed various hardware and algorithmic techniques to achieve
different level of self-interference cancellation required for realiza-
tion of full duplex radios. Yet, these works have failed to reduce the
ingrained skepticism of both academia and industry alike regarding
the feasibility of implementing these techniques and their adaptabil-
ity to dynamic environmental conditions. This demo has two fold
objectives; ﬁrst, we implement a working full duplex radio using the
architecture proposed in [5]. We then build full duplex radio link by
using a pair of these full duplex radios and demonstrate that they can
adapt to the changing environmental conditions around them [5].
I...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Optimal Average-Complexity Ideal-Security Order-Preserving Encryption
author:Florian Kerschbaum and
Axel Schr"opfer
Optimal Average-Complexity Ideal-Security
Order-Preserving Encryption
Florian Kerschbaum
SAP
Karlsruhe, Germany
ﬂorian.kerschbaum@sap.com
Axel Schröpfer
SAP
Karlsruhe, Germany
axel.schroepfer@sap.com
ABSTRACT
Order-preserving encryption enables performing many classes
of queries – including range queries – on encrypted databases.
Popa et al. recently presented an ideal-secure order-preserving
encryption (or encoding) scheme, but their cost of inser-
tions (encryption) is very high.
In this paper we present
an also ideal-secure, but signiﬁcantly more eﬃcient order-
preserving encryption scheme. Our scheme is inspired by
Reed’s referenced work on the average height of random bi-
nary search trees. We show that our scheme improves the
average communication complexity from O(n log n) to O(n)
under uniform distribution. Our scheme also integrates ef-
ﬁciently with adjustable encryption as used in CryptDB. In
our experiments for database inserts we achieve a perfor-
mance increase of up to 81% in LANs and 95% in WANs.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—
Cryptographic controls; C.2.4 [Computer-Communication
Networks]: Distributed Systems—Distributed databases
Keywords
Order-Preserving Encryption; Indistinguishability; Ideal Se-
curity; Eﬃciency; Adjustable Encryption; In-Memory Col-
umn Database
1.
INTRODUCTION
Order-preserving encryption [6, 8, 9, 32] enables perform-
ing many classes of queries – including range queries – on
encrypted data without modiﬁcation of the database en-
gine. Recent results in database implementation suggest
that these queries are quite practical in terms of perfor-
mance [17, 33]. Hence, researchers have suggested a number
of order-preserving encryption schemes. Nevertheless, the
security of these schemes is still under discussion.
Boldyreva et al. provide the ﬁrst form...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Optimal Average-Complexity Ideal-Security Order-Preserving Encryption
author:Florian Kerschbaum and
Axel Schr"opfer
Optimal Average-Complexity Ideal-Security
Order-Preserving Encryption
Florian Kerschbaum
SAP
Karlsruhe, Germany
ﬂorian.kerschbaum@sap.com
Axel Schröpfer
SAP
Karlsruhe, Germany
axel.schroepfer@sap.com
ABSTRACT
Order-preserving encryption enables performing many classes
of queries – including range queries – on encrypted databases.
Popa et al. recently presented an ideal-secure order-preserving
encryption (or encoding) scheme, but their cost of inser-
tions (encryption) is very high.
In this paper we present
an also ideal-secure, but signiﬁcantly more eﬃcient order-
preserving encryption scheme. Our scheme is inspired by
Reed’s referenced work on the average height of random bi-
nary search trees. We show that our scheme improves the
average communication complexity from O(n log n) to O(n)
under uniform distribution. Our scheme also integrates ef-
ﬁciently with adjustable encryption as used in CryptDB. In
our experiments for database inserts we achieve a perfor-
mance increase of up to 81% in LANs and 95% in WANs.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—
Cryptographic controls; C.2.4 [Computer-Communication
Networks]: Distributed Systems—Distributed databases
Keywords
Order-Preserving Encryption; Indistinguishability; Ideal Se-
curity; Eﬃciency; Adjustable Encryption; In-Memory Col-
umn Database
1.
INTRODUCTION
Order-preserving encryption [6, 8, 9, 32] enables perform-
ing many classes of queries – including range queries – on
encrypted data without modiﬁcation of the database en-
gine. Recent results in database implementation suggest
that these queries are quite practical in terms of perfor-
mance [17, 33]. Hence, researchers have suggested a number
of order-preserving encryption schemes. Nevertheless, the
security of these schemes is still under discussion.
Boldyreva et al. provide the ﬁrst form...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:PASTA: PASsword-based Threshold Authentication
author:Shashank Agrawal and
Peihan Miao and
Payman Mohassel and
Pratyay Mukherjee
Advanced Materials Research Vols. 143-144 (2011) pp 915-919
Online available since 2010/Oct/28 at www.scientific.net
© (2011) Trans Tech Publications, Switzerland
doi:10.4028/www.scientific.net/AMR.143-144.915
All rights reserved. No part of contents of this paper may be reproduced or transmitted in any form or by any means without the written permission of TTP,
www.ttp.net. (ID: 129.93.24.73, University of Nebraska-Lincoln, Lincoln, USA-18/03/15,03:15:53)
   A New Threshold Password Authentication Scheme  Yung-Cheng Lee  Department of Security Technology and Management, WuFeng University, Chiayi, Taiwan. yclee@wfu.edu.tw Keywords: Password authentication; Threshold scheme; Secret sharing. Abstract. The well-known password authentication mechanisms are widely used in networks to protect resources from unauthorized access. The ad hoc networks, due to their dynamic and lack of network infrastructure features, require authentication schemes to ensure security. In this paper, we propose a new threshold password authentication scheme for ad hoc networks. Our scheme can be efficiently implemented in mobile devices, and can achieve mutual authentication with registered users. Introduction The ad hoc network [15], constructed by a group of mobile devices without using any network infrastructure, is suitable for military or emergency uses. Ad hoc network causes a lot of security challenges such as unauthorized access due to its flexibility and lack of secure network infrastructure. Password authentication schemes are the simplest and most convenient authentication mechanisms in network environment to protect unauthorized access. Until now, there are many schemes proposed [2–6, 8-12, 14, 17, 18]. However, due to their security shortcomings, most schemes could not be applied in ad hoc networks. In 1981, Lamport proposed the first well-known pas...


Instruction: 总结这篇安全研究的主要观点

Input:
title:PASTA: PASsword-based Threshold Authentication
author:Shashank Agrawal and
Peihan Miao and
Payman Mohassel and
Pratyay Mukherjee
Advanced Materials Research Vols. 143-144 (2011) pp 915-919
Online available since 2010/Oct/28 at www.scientific.net
© (2011) Trans Tech Publications, Switzerland
doi:10.4028/www.scientific.net/AMR.143-144.915
All rights reserved. No part of contents of this paper may be reproduced or transmitted in any form or by any means without the written permission of TTP,
www.ttp.net. (ID: 129.93.24.73, University of Nebraska-Lincoln, Lincoln, USA-18/03/15,03:15:53)
   A New Threshold Password Authentication Scheme  Yung-Cheng Lee  Department of Security Technology and Management, WuFeng University, Chiayi, Taiwan. yclee@wfu.edu.tw Keywords: Password authentication; Threshold scheme; Secret sharing. Abstract. The well-known password authentication mechanisms are widely used in networks to protect resources from unauthorized access. The ad hoc networks, due to their dynamic and lack of network infrastructure features, require authentication schemes to ensure security. In this paper, we propose a new threshold password authentication scheme for ad hoc networks. Our scheme can be efficiently implemented in mobile devices, and can achieve mutual authentication with registered users. Introduction The ad hoc network [15], constructed by a group of mobile devices without using any network infrastructure, is suitable for military or emergency uses. Ad hoc network causes a lot of security challenges such as unauthorized access due to its flexibility and lack of secure network infrastructure. Password authentication schemes are the simplest and most convenient authentication mechanisms in network environment to protect unauthorized access. Until now, there are many schemes proposed [2–6, 8-12, 14, 17, 18]. However, due to their security shortcomings, most schemes could not be applied in ad hoc networks. In 1981, Lamport proposed the first well-known pas...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Defending Against Injection Attacks Through Context-Sensitive String
Evaluation
author:Tadeusz Pietraszek and
Chris Vanden Berghe
Defending Against Injection Attacks Through
Context-Sensitive String Evaluation
Tadeusz Pietraszek1 and Chris Vanden Berghe1,2
S¨aumerstrasse 4, CH-8803 R¨uschlikon, Switzerland
2 Katholieke Universiteit Leuven,
1 IBM Zurich Research Laboratory,
Celestijnenlaan 200A, B-3001 Leuven, Belgium
{pie, vbc}@zurich.ibm.com
Abstract. Injection vulnerabilities pose a major threat to application-
level security. Some of the more common types are SQL injection, cross-
site scripting and shell injection vulnerabilities. Existing methods for
defending against injection attacks, that is, attacks exploiting these vul-
nerabilities, rely heavily on the application developers and are therefore
error-prone.
In this paper we introduce CSSE, a method to detect and prevent
injection attacks. CSSE works by addressing the root cause why such at-
tacks can succeed, namely the ad-hoc serialization of user-provided input.
It provides a platform-enforced separation of channels, using a com-
bination of assignment of metadata to user-provided input, metadata-
preserving string operations and context-sensitive string evaluation.
CSSE requires neither application developer interaction nor appli-
cation source code modiﬁcations. Since only changes to the underlying
platform are needed, it eﬀectively shifts the burden of implementing
countermeasures against injection attacks from the many application
developers to the small team of security-savvy platform developers. Our
method is eﬀective against most types of injection attacks, and we show
that it is also less error-prone than other solutions proposed so far.
We have developed a prototype CSSE implementation for PHP, a
platform that is particularly prone to these vulnerabilities. We used
our prototype with phpBB, a well-known bulletin-board application,
to validate our method. CSSE detected and prevented all the ...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Defending Against Injection Attacks Through Context-Sensitive String
Evaluation
author:Tadeusz Pietraszek and
Chris Vanden Berghe
Defending Against Injection Attacks Through
Context-Sensitive String Evaluation
Tadeusz Pietraszek1 and Chris Vanden Berghe1,2
S¨aumerstrasse 4, CH-8803 R¨uschlikon, Switzerland
2 Katholieke Universiteit Leuven,
1 IBM Zurich Research Laboratory,
Celestijnenlaan 200A, B-3001 Leuven, Belgium
{pie, vbc}@zurich.ibm.com
Abstract. Injection vulnerabilities pose a major threat to application-
level security. Some of the more common types are SQL injection, cross-
site scripting and shell injection vulnerabilities. Existing methods for
defending against injection attacks, that is, attacks exploiting these vul-
nerabilities, rely heavily on the application developers and are therefore
error-prone.
In this paper we introduce CSSE, a method to detect and prevent
injection attacks. CSSE works by addressing the root cause why such at-
tacks can succeed, namely the ad-hoc serialization of user-provided input.
It provides a platform-enforced separation of channels, using a com-
bination of assignment of metadata to user-provided input, metadata-
preserving string operations and context-sensitive string evaluation.
CSSE requires neither application developer interaction nor appli-
cation source code modiﬁcations. Since only changes to the underlying
platform are needed, it eﬀectively shifts the burden of implementing
countermeasures against injection attacks from the many application
developers to the small team of security-savvy platform developers. Our
method is eﬀective against most types of injection attacks, and we show
that it is also less error-prone than other solutions proposed so far.
We have developed a prototype CSSE implementation for PHP, a
platform that is particularly prone to these vulnerabilities. We used
our prototype with phpBB, a well-known bulletin-board application,
to validate our method. CSSE detected and prevented all the ...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Touching the Untouchables: Dynamic Security Analysis of the LTE
Control Plane
author:Hongil Kim and
Jiho Lee and
Eunkyu Lee and
Yongdae Kim
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
Touching the Untouchables: Dynamic Security
Analysis of the LTE Control Plane
Hongil Kim
KAIST
Jiho Lee
KAIST
Eunkyu Lee
KAIST
Yongdae Kim
KAIST
hongilk@kaist.ac.kr
jiholee@kaist.ac.kr
ekleez@kaist.ac.kr
yongdaek@kaist.ac.kr
Abstract—This paper presents our extensive investigation
of the security aspects of control plane procedures based on
dynamic testing of the control components in operational Long
Term Evolution (LTE) networks. For dynamic testing in LTE
networks, we implemented a semi-automated testing tool, named
LTEFuzz, by using open-source LTE software over which the
user has full control. We systematically generated test cases by
deﬁning three basic security properties by closely analyzing the
standards. Based on the security property, LTEFuzz generates
and sends the test cases to a target network, and classiﬁes the
problematic behavior by only monitoring the device-side logs.
Accordingly, we uncovered 36 vulnerabilities, which have not
been disclosed previously. These ﬁndings are categorized into ﬁve
types: Improper handling of (1) unprotected initial procedure,
(2) crafted plain requests, (3) messages with invalid integrity
protection, (4) replayed messages, and (5) security procedure
bypass. We conﬁrmed those vulnerabilities by demonstrating
proof-of-concept attacks against operational LTE networks. The
impact of the attacks is to either deny LTE services to legitimate
users, spoof SMS messages, or eavesdrop/manipulate user data
trafﬁc. Precise root cause analysis and potential...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Touching the Untouchables: Dynamic Security Analysis of the LTE
Control Plane
author:Hongil Kim and
Jiho Lee and
Eunkyu Lee and
Yongdae Kim
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
Touching the Untouchables: Dynamic Security
Analysis of the LTE Control Plane
Hongil Kim
KAIST
Jiho Lee
KAIST
Eunkyu Lee
KAIST
Yongdae Kim
KAIST
hongilk@kaist.ac.kr
jiholee@kaist.ac.kr
ekleez@kaist.ac.kr
yongdaek@kaist.ac.kr
Abstract—This paper presents our extensive investigation
of the security aspects of control plane procedures based on
dynamic testing of the control components in operational Long
Term Evolution (LTE) networks. For dynamic testing in LTE
networks, we implemented a semi-automated testing tool, named
LTEFuzz, by using open-source LTE software over which the
user has full control. We systematically generated test cases by
deﬁning three basic security properties by closely analyzing the
standards. Based on the security property, LTEFuzz generates
and sends the test cases to a target network, and classiﬁes the
problematic behavior by only monitoring the device-side logs.
Accordingly, we uncovered 36 vulnerabilities, which have not
been disclosed previously. These ﬁndings are categorized into ﬁve
types: Improper handling of (1) unprotected initial procedure,
(2) crafted plain requests, (3) messages with invalid integrity
protection, (4) replayed messages, and (5) security procedure
bypass. We conﬁrmed those vulnerabilities by demonstrating
proof-of-concept attacks against operational LTE networks. The
impact of the attacks is to either deny LTE services to legitimate
users, spoof SMS messages, or eavesdrop/manipulate user data
trafﬁc. Precise root cause analysis and potential...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:State of the Art: Automated Black-Box Web Application Vulnerability
Testing
author:Jason Bau and
Elie Bursztein and
Divij Gupta and
John C. Mitchell
2010 IEEE Symposium on Security and Privacy
State of the Art: Automated Black-Box Web Application Vulnerability Testing
Jason Bau, Elie Bursztein, Divij Gupta, John Mitchell
Stanford University
{jbau, divijg}@stanford.edu, {elie, mitchell}@cs.stanford.edu
Stanford, CA
Abstract—Black-box web application vulnerability scanners
are automated tools that probe web applications for security
vulnerabilities. In order to assess the current state of the art, we
obtained access to eight leading tools and carried out a study
of: (i) the class of vulnerabilities tested by these scanners, (ii)
their effectiveness against target vulnerabilities, and (iii) the
relevance of the target vulnerabilities to vulnerabilities found
in the wild. To conduct our study we used a custom web
application vulnerable to known and projected vulnerabilities,
and previous versions of widely used web applications con-
taining known vulnerabilities. Our results show the promise
and effectiveness of automated tools, as a group, and also
some limitations. In particular, “stored” forms of Cross Site
Scripting (XSS) and SQL Injection (SQLI) vulnerabilities are
not currently found by many tools. Because our goal is to
assess the potential of future research, not to evaluate speciﬁc
vendors, we do not report comparative data or make any
recommendations about purchase of speciﬁc tools.
Keywords-Web Application Security; Black Box Testing;
Vulnerability Detection; Security Standards Compliance;
I. INTRODUCTION
Black-box web application vulnerability scanners are au-
tomated tools that probe web applications for security vul-
nerabilities, without access to source code used to build the
applications. While there are intrinsic limitations of black-
box tools, in comparison with code walkthrough, automated
source code analysis tools, and procedures carried out ...


Instruction: 总结这篇安全研究的主要观点

Input:
title:State of the Art: Automated Black-Box Web Application Vulnerability
Testing
author:Jason Bau and
Elie Bursztein and
Divij Gupta and
John C. Mitchell
2010 IEEE Symposium on Security and Privacy
State of the Art: Automated Black-Box Web Application Vulnerability Testing
Jason Bau, Elie Bursztein, Divij Gupta, John Mitchell
Stanford University
{jbau, divijg}@stanford.edu, {elie, mitchell}@cs.stanford.edu
Stanford, CA
Abstract—Black-box web application vulnerability scanners
are automated tools that probe web applications for security
vulnerabilities. In order to assess the current state of the art, we
obtained access to eight leading tools and carried out a study
of: (i) the class of vulnerabilities tested by these scanners, (ii)
their effectiveness against target vulnerabilities, and (iii) the
relevance of the target vulnerabilities to vulnerabilities found
in the wild. To conduct our study we used a custom web
application vulnerable to known and projected vulnerabilities,
and previous versions of widely used web applications con-
taining known vulnerabilities. Our results show the promise
and effectiveness of automated tools, as a group, and also
some limitations. In particular, “stored” forms of Cross Site
Scripting (XSS) and SQL Injection (SQLI) vulnerabilities are
not currently found by many tools. Because our goal is to
assess the potential of future research, not to evaluate speciﬁc
vendors, we do not report comparative data or make any
recommendations about purchase of speciﬁc tools.
Keywords-Web Application Security; Black Box Testing;
Vulnerability Detection; Security Standards Compliance;
I. INTRODUCTION
Black-box web application vulnerability scanners are au-
tomated tools that probe web applications for security vul-
nerabilities, without access to source code used to build the
applications. While there are intrinsic limitations of black-
box tools, in comparison with code walkthrough, automated
source code analysis tools, and procedures carried out ...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Difficulties in Modeling SCADA Traffic: A Comparative Analysis
author:Rafael Ramos Regis Barbosa and
Ramin Sadre and
Aiko Pras
Diﬃculties in Modeling SCADA Traﬃc:
A Comparative Analysis
Rafael R.R. Barbosa, Ramin Sadre, and Aiko Pras
University of Twente Design and Analysis of Communication Systems (DACS)
Enschede, The Netherlands
{r.barbosa,r.sadre,a.pras}@utwente.nl
Abstract. Modern critical infrastructures, such as water distribution
and power generation, are large facilities that are distributed over large
geographical areas. Supervisory Control and Data Acquisition (SCADA)
networks are deployed to guarantee the correct operation and safety of
these infrastructures. In this paper, we describe key characteristics of
SCADA traﬃc, verifying if models developed for traﬃc in traditional
IT networks are applicable. Our results show that SCADA traﬃc largely
diﬀers from traditional IT traﬃc, more noticeably not presenting diurnal
patters or self-similar correlations in the time series.
1 Introduction
Modern critical infrastructures, such as water distribution and power generation,
are large facilities that are distributed over large geographical areas. Supervisory
Control And Data Acquisition (SCADA) networks are deployed to continuously
monitor these infrastructures in order to guarantee correct operation and safety.
Originally, SCADA networks were isolated networks running proprietary proto-
cols, but there is an increasing trend toward the usage of IP protocols and the
interconnection with other networks and even the Internet.
Intuitively, we expect SCADA to present traﬃc patterns much diﬀerent to
those of “traditional” Information Technology (IT) networks. This is due to a
number of reasons. First, SCADA networks are expected to be more stable over
time, in the sense that new nodes are not expected to join or leave frequently.
Second, traditional networks usually support a multitude of protocols, such as
HTTP, instant messaging and Voice over IP, while the num...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Difficulties in Modeling SCADA Traffic: A Comparative Analysis
author:Rafael Ramos Regis Barbosa and
Ramin Sadre and
Aiko Pras
Diﬃculties in Modeling SCADA Traﬃc:
A Comparative Analysis
Rafael R.R. Barbosa, Ramin Sadre, and Aiko Pras
University of Twente Design and Analysis of Communication Systems (DACS)
Enschede, The Netherlands
{r.barbosa,r.sadre,a.pras}@utwente.nl
Abstract. Modern critical infrastructures, such as water distribution
and power generation, are large facilities that are distributed over large
geographical areas. Supervisory Control and Data Acquisition (SCADA)
networks are deployed to guarantee the correct operation and safety of
these infrastructures. In this paper, we describe key characteristics of
SCADA traﬃc, verifying if models developed for traﬃc in traditional
IT networks are applicable. Our results show that SCADA traﬃc largely
diﬀers from traditional IT traﬃc, more noticeably not presenting diurnal
patters or self-similar correlations in the time series.
1 Introduction
Modern critical infrastructures, such as water distribution and power generation,
are large facilities that are distributed over large geographical areas. Supervisory
Control And Data Acquisition (SCADA) networks are deployed to continuously
monitor these infrastructures in order to guarantee correct operation and safety.
Originally, SCADA networks were isolated networks running proprietary proto-
cols, but there is an increasing trend toward the usage of IP protocols and the
interconnection with other networks and even the Internet.
Intuitively, we expect SCADA to present traﬃc patterns much diﬀerent to
those of “traditional” Information Technology (IT) networks. This is due to a
number of reasons. First, SCADA networks are expected to be more stable over
time, in the sense that new nodes are not expected to join or leave frequently.
Second, traditional networks usually support a multitude of protocols, such as
HTTP, instant messaging and Voice over IP, while the num...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。


Instruction: 请分析这篇安全论文的内容

Output:
安全论文分析：

title:Toward the Accurate Identification of Network Applications
author:Andrew W. Moore and
Konstantina Papagiannaki
Toward the Accurate Identiﬁcation of
Network Applications
Andrew W. Moore1,(cid:1) and Konstantina Papagiannaki2
1 University of Cambridge
andrew.moore@cl.cam.ac.uk
2 Intel Research, Cambridge
dina.papagiannaki@intel.com
Abstract. Well-known port numbers can no longer be used to reliably
identify network applications. There is a variety of new Internet appli-
cations that either do not use well-known port numbers or use other
protocols, such as HTTP, as wrappers in order to go through ﬁrewalls
without being blocked. One consequence of this is that a simple inspec-
tion of the port numbers used by ﬂows may lead to the inaccurate clas-
siﬁcation of network traﬃc. In this work, we look at these inaccuracies
in detail. Using a full payload packet trace collected from an Internet
site we attempt to identify the types of errors that may result from port-
based classiﬁcation and quantify them for the speciﬁc trace under study.
To address this question we devise a classiﬁcation methodology that re-
lies on the full packet payload. We describe the building blocks of this
methodology and elaborate on the complications that arise in that con-
text. A classiﬁcation technique approaching 100% accuracy proves to be
a labor-intensive process that needs to test ﬂow-characteristics against
multiple classiﬁcation criteria in order to gain suﬃcient conﬁdence in
the nature of the causal application. Nevertheless, the beneﬁts gained
from a content-based classiﬁcation approach are evident. We are capable
of accurately classifying what would be otherwise classiﬁed as unknown
as well as identifying traﬃc ﬂows that could otherwise be classiﬁed in-
correctly. Our work opens up multiple research issues that we intend to
address in future work.
1
Introduction
Network traﬃc monitoring has attracted a lot of interest in the recent past.
One of the main operations performed within ...


Instruction: 总结这篇安全研究的主要观点

Input:
title:Toward the Accurate Identification of Network Applications
author:Andrew W. Moore and
Konstantina Papagiannaki
Toward the Accurate Identiﬁcation of
Network Applications
Andrew W. Moore1,(cid:1) and Konstantina Papagiannaki2
1 University of Cambridge
andrew.moore@cl.cam.ac.uk
2 Intel Research, Cambridge
dina.papagiannaki@intel.com
Abstract. Well-known port numbers can no longer be used to reliably
identify network applications. There is a variety of new Internet appli-
cations that either do not use well-known port numbers or use other
protocols, such as HTTP, as wrappers in order to go through ﬁrewalls
without being blocked. One consequence of this is that a simple inspec-
tion of the port numbers used by ﬂows may lead to the inaccurate clas-
siﬁcation of network traﬃc. In this work, we look at these inaccuracies
in detail. Using a full payload packet trace collected from an Internet
site we attempt to identify the types of errors that may result from port-
based classiﬁcation and quantify them for the speciﬁc trace under study.
To address this question we devise a classiﬁcation methodology that re-
lies on the full packet payload. We describe the building blocks of this
methodology and elaborate on the complications that arise in that con-
text. A classiﬁcation technique approaching 100% accuracy proves to be
a labor-intensive process that needs to test ﬂow-characteristics against
multiple classiﬁcation criteria in order to gain suﬃcient conﬁdence in
the nature of the causal application. Nevertheless, the beneﬁts gained
from a content-based classiﬁcation approach are evident. We are capable
of accurately classifying what would be otherwise classiﬁed as unknown
as well as identifying traﬃc ﬂows that could otherwise be classiﬁed in-
correctly. Our work opens up multiple research issues that we intend to
address in future work.
1
Introduction
Network traﬃc monitoring has attracted a lot of interest in the recent past.
One of the main operations performed within ...

Output: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。