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

Input:
title:Analyzing the process of installing rogue software
author:Robin Berthier and
Jorge Arjona and
Michel Cukier
978-1-4244-4421-2/09/$25.00 c(cid:13)2009 IEEE
560
Authorized licensed use limited to: Tsinghua University. Downloaded on March 20,2021 at 05:37:13 UTC from IEEE Xplore.  Restrictions apply.
Analyzing the Process of Installing Rogue SoftwareRobin Berthier*, Jorge Arjona‡*, and Michel Cukier**Center for Risk and ReliabilityDepartment of Mechanical EngineeringUniversity of Maryland, College Park, MD, USA{robinb, jorarar, mcukier}@umd.edu‡Escuela Técnica Superior de Ingenieros deTelecomunicaciónUniversidad Politecnica of Valencia, Spainjorarar@teleco.upv.esAbstractThis practical experience report presents the resultsof an experiment aimed at understanding the sequenceof malicious actions following a remote compromise.The type of rogue software installed during attacks wasused to classify and understand sequences of maliciousactions. For this experiment, we used four Linux targetcomputers running SSH with simple passwords. Duringthe eight-month data collection period, we recorded atotal of 1,171 attack sessions. In these sessions,attackers typed a total of 20,335 commands that wecategorized into 24 specific actions. These actions wereanalyzed based on the type of rogue software installedby attackers.1. IntroductionMost security analysis experiments focus on methodsfor keeping attackers out of target systems, but do littleto address their behavior after a remote compromise. Inthis experiment, we focused exclusively on post-compromise attacker behavior. More specifically, wefocused on the attackers’ actions that led to theinstallation of rogue software. We used four Linux target computers running SSHwith simple passwords. During the eight-month datacollection period, we recorded 1,171 attack sessions. Inthese sessions, attackers typed 20,335 commands thatwe categorized in 24 specific actions. These actionswere analyzed to determine attackers’ patterns andunde...

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


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

Output:
安全论文分析：

title:Trust-based anonymous communication: adversary models and routing
algorithms
author:Aaron Johnson and
Paul F. Syverson and
Roger Dingledine and
Nick Mathewson
Trust-based Anonymous Communication: Adversary
Models and Routing Algorithms
Aaron Johnson
Paul Syverson
Roger Dingledine
Nick Mathewson
∗
U.S. Naval Research Laboratory
{aaron.m.johnson,paul.syverson}@nrl.navy.mil
The Tor Project
{arma, nickm}@torproject.org
ABSTRACT
We introduce a novel model of routing security that incor-
porates the ordinarily overlooked variations in trust that
users have for diﬀerent parts of the network. We focus on
anonymous communication, and in particular onion routing,
although we expect the approach to apply more broadly.
This paper provides two main contributions. First, we
present a novel model to consider the various security con-
cerns for route selection in anonymity networks when users
vary their trust over parts of the network. Second, to show
the usefulness of our model, we present as an example a new
algorithm to select paths in onion routing. We analyze its
eﬀectiveness against deanonymization and other information
leaks, and particularly how it fares in our model versus ex-
isting algorithms, which do not consider trust. In contrast
to those, we ﬁnd that our trust-based routing strategy can
protect anonymity against an adversary capable of attacking
a signiﬁcant fraction of the network.
Categories and Subject Descriptors
C.2.2 [Networks]: Network Protocols; C.2.0 [Networks]:
General—Security and protection; C.4 [Performance]: Mod-
eling techniques
General Terms
Security, Theory
Keywords
anonymous communication, onion routing, privacy, trust
1.
INTRODUCTION
Existing anonymous communication theory and system
design are generally based on the unrealistic assumption that
both adversaries and vulnerability to their attacks are uni-
formly distributed throughout the communications infras-
∗This work was primarily done while at the Department of
Computer Science at The U...


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

Input:
title:Trust-based anonymous communication: adversary models and routing
algorithms
author:Aaron Johnson and
Paul F. Syverson and
Roger Dingledine and
Nick Mathewson
Trust-based Anonymous Communication: Adversary
Models and Routing Algorithms
Aaron Johnson
Paul Syverson
Roger Dingledine
Nick Mathewson
∗
U.S. Naval Research Laboratory
{aaron.m.johnson,paul.syverson}@nrl.navy.mil
The Tor Project
{arma, nickm}@torproject.org
ABSTRACT
We introduce a novel model of routing security that incor-
porates the ordinarily overlooked variations in trust that
users have for diﬀerent parts of the network. We focus on
anonymous communication, and in particular onion routing,
although we expect the approach to apply more broadly.
This paper provides two main contributions. First, we
present a novel model to consider the various security con-
cerns for route selection in anonymity networks when users
vary their trust over parts of the network. Second, to show
the usefulness of our model, we present as an example a new
algorithm to select paths in onion routing. We analyze its
eﬀectiveness against deanonymization and other information
leaks, and particularly how it fares in our model versus ex-
isting algorithms, which do not consider trust. In contrast
to those, we ﬁnd that our trust-based routing strategy can
protect anonymity against an adversary capable of attacking
a signiﬁcant fraction of the network.
Categories and Subject Descriptors
C.2.2 [Networks]: Network Protocols; C.2.0 [Networks]:
General—Security and protection; C.4 [Performance]: Mod-
eling techniques
General Terms
Security, Theory
Keywords
anonymous communication, onion routing, privacy, trust
1.
INTRODUCTION
Existing anonymous communication theory and system
design are generally based on the unrealistic assumption that
both adversaries and vulnerability to their attacks are uni-
formly distributed throughout the communications infras-
∗This work was primarily done while at the Department of
Computer Science at The U...

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


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

Output:
安全论文分析：

title:Impact of Path Diversity on Multi-homed and Overlay Networks
author:Junghee Han and
Farnam Jahanian
Impact of Path Diversity on Multi-homed and Overlay Networks
Junghee Han and Farnam Jahanian
University of Michigan - Dept. EECS
1301 Beal Avenue, Ann Arbor, Michigan, 48109-2122, USA
Email: (cid:0)jungheeh, farnam(cid:1)@eecs.umich.edu
Abstract
Multi-homed and overlay networks are two widely stud-
ied approaches aimed at leveraging the inherent redun-
dancy of the Internet’s underlying routing infrastructure to
enhance end-to-end application performance and availabil-
ity. However, the effectiveness of these approaches depends
on the natural diversity of redundant paths between two
endhosts in terms of physical links, routing infrastructure,
administrative control and geographical distribution. This
paper quantitatively analyzes the impact of path diversity
on multi-homed and overlay networks and highlights sev-
eral inherent limitations of these architectures in exploit-
ing the full potential redundancy of the Internet. We based
our analysis on traceroutes and routing table data collected
from several vantage points in the Internet including: look-
ing glasses at ten major Internet Service Providers (ISPs),
RouteViews servers from twenty ISPs, and more than ﬁfty
PlanetLab nodes globally distributed across the Internet.
Our study motivates new research directions—constructing
topology-aware multi-homing and overlay networks for bet-
ter availability.
1 Introduction
The Internet is increasingly utilized as a business neces-
sity, making connectivity and network availability a criti-
cal resource. In recent years, a number of researchers have
studied Internet routing protocols in terms of end-to-end
behavior, convergence and stability [17, 13, 12, 8]. These
studies have found that although the Internet routing infras-
tructure is highly redundant, current underlying routing pro-
tocols do not fully utilize this redundancy to achieve higher
performance and avail...


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

Input:
title:Impact of Path Diversity on Multi-homed and Overlay Networks
author:Junghee Han and
Farnam Jahanian
Impact of Path Diversity on Multi-homed and Overlay Networks
Junghee Han and Farnam Jahanian
University of Michigan - Dept. EECS
1301 Beal Avenue, Ann Arbor, Michigan, 48109-2122, USA
Email: (cid:0)jungheeh, farnam(cid:1)@eecs.umich.edu
Abstract
Multi-homed and overlay networks are two widely stud-
ied approaches aimed at leveraging the inherent redun-
dancy of the Internet’s underlying routing infrastructure to
enhance end-to-end application performance and availabil-
ity. However, the effectiveness of these approaches depends
on the natural diversity of redundant paths between two
endhosts in terms of physical links, routing infrastructure,
administrative control and geographical distribution. This
paper quantitatively analyzes the impact of path diversity
on multi-homed and overlay networks and highlights sev-
eral inherent limitations of these architectures in exploit-
ing the full potential redundancy of the Internet. We based
our analysis on traceroutes and routing table data collected
from several vantage points in the Internet including: look-
ing glasses at ten major Internet Service Providers (ISPs),
RouteViews servers from twenty ISPs, and more than ﬁfty
PlanetLab nodes globally distributed across the Internet.
Our study motivates new research directions—constructing
topology-aware multi-homing and overlay networks for bet-
ter availability.
1 Introduction
The Internet is increasingly utilized as a business neces-
sity, making connectivity and network availability a criti-
cal resource. In recent years, a number of researchers have
studied Internet routing protocols in terms of end-to-end
behavior, convergence and stability [17, 13, 12, 8]. These
studies have found that although the Internet routing infras-
tructure is highly redundant, current underlying routing pro-
tocols do not fully utilize this redundancy to achieve higher
performance and avail...

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


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

Output:
安全论文分析：

title:Crying Wolf: An Empirical Study of SSL Warning Effectiveness
author:Joshua Sunshine and
Serge Egelman and
Hazim Almuhimedi and
Neha Atri and
Lorrie Faith Cranor
Crying Wolf: An Empirical Study of SSL Warning Eﬀectiveness
Joshua Sunshine, Serge Egelman, Hazim Almuhimedi, Neha Atri, and Lorrie Faith Cranor
{sunshine, egelman, hazim}@cs.cmu.edu, natri@andrew.cmu.edu, lorrie@cs.cmu.edu
Carnegie Mellon University
Abstract
Web users are shown an invalid certiﬁcate warning
when their browser cannot validate the identity of
the websites they are visiting. While these warn-
ings often appear in benign situations, they can also
signal a man-in-the-middle attack. We conducted a
survey of over 400 Internet users to examine their
reactions to and understanding of current SSL warn-
ings. We then designed two new warnings using warn-
ings science principles and lessons learned from the
survey. We evaluated warnings used in three pop-
ular web browsers and our two warnings in a 100-
participant, between-subjects laboratory study. Our
warnings performed signiﬁcantly better than exist-
ing warnings, but far too many participants exhibited
dangerous behavior in all warning conditions. Our re-
sults suggest that, while warnings can be improved,
a better approach may be to minimize the use of SSL
warnings altogether by blocking users from making
unsafe connections and eliminating warnings in be-
nign situations.
1
Introduction
Browsers display Secure Socket Layer (SSL)1 warn-
ings to warn users about a variety of certiﬁcate prob-
lems, for example when the server’s certiﬁcate has
expired, mismatches the address of the server, or is
1The Secure Socket Layer (SSL) and Transport Layer Secu-
rity (TLS) protocols secure web communication by encrypting
data sent between browser and server and by validating the
identity of the server. For the remainder of the paper we will
use the common convention of using the term “SSL” to refer
to both protocols.
signed by an unrecognized authority. T...


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

Input:
title:Crying Wolf: An Empirical Study of SSL Warning Effectiveness
author:Joshua Sunshine and
Serge Egelman and
Hazim Almuhimedi and
Neha Atri and
Lorrie Faith Cranor
Crying Wolf: An Empirical Study of SSL Warning Eﬀectiveness
Joshua Sunshine, Serge Egelman, Hazim Almuhimedi, Neha Atri, and Lorrie Faith Cranor
{sunshine, egelman, hazim}@cs.cmu.edu, natri@andrew.cmu.edu, lorrie@cs.cmu.edu
Carnegie Mellon University
Abstract
Web users are shown an invalid certiﬁcate warning
when their browser cannot validate the identity of
the websites they are visiting. While these warn-
ings often appear in benign situations, they can also
signal a man-in-the-middle attack. We conducted a
survey of over 400 Internet users to examine their
reactions to and understanding of current SSL warn-
ings. We then designed two new warnings using warn-
ings science principles and lessons learned from the
survey. We evaluated warnings used in three pop-
ular web browsers and our two warnings in a 100-
participant, between-subjects laboratory study. Our
warnings performed signiﬁcantly better than exist-
ing warnings, but far too many participants exhibited
dangerous behavior in all warning conditions. Our re-
sults suggest that, while warnings can be improved,
a better approach may be to minimize the use of SSL
warnings altogether by blocking users from making
unsafe connections and eliminating warnings in be-
nign situations.
1
Introduction
Browsers display Secure Socket Layer (SSL)1 warn-
ings to warn users about a variety of certiﬁcate prob-
lems, for example when the server’s certiﬁcate has
expired, mismatches the address of the server, or is
1The Secure Socket Layer (SSL) and Transport Layer Secu-
rity (TLS) protocols secure web communication by encrypting
data sent between browser and server and by validating the
identity of the server. For the remainder of the paper we will
use the common convention of using the term “SSL” to refer
to both protocols.
signed by an unrecognized authority. T...

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


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

Output:
安全论文分析：

title:SoK: All You Ever Wanted to Know About x86/x64 Binary Disassembly
But Were Afraid to Ask
author:Chengbin Pang and
Ruotong Yu and
Yaohui Chen and
Eric Koskinen and
Georgios Portokalidis and
Bing Mao and
Jun Xu
2
1
0
0
0
.
1
2
0
2
.
1
0
0
0
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
1
2
0
2
©
0
0
.
1
3
$
/
1
2
/
5
-
4
3
9
8
-
1
8
2
7
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
1
2
0
2
2021 IEEE Symposium on Security and Privacy (SP)
SoK: All You Ever Wanted to Know About x86/x64
Binary Disassembly But Were Afraid to Ask
Chengbin Pang∗‡§ Ruotong Yu∗ Yaohui Chen† Eric Koskinen∗ Georgios Portokalidis∗ Bing Mao‡
Jun Xu∗
∗Stevens Institute of Technology
†Facebook Inc.
‡Nanjing University
Abstract—Disassembly of binary code is hard, but necessary
for improving the security of binary software. Over the past
few decades, research in binary disassembly has produced many
tools and frameworks, which have been made available to
researchers and security professionals. These tools employ a
variety of strategies that grant them different characteristics.
The lack of systematization, however, impedes new research in
the area and makes selecting the right tool hard, as we do
not understand the strengths and weaknesses of existing tools.
In this paper, we systematize binary disassembly through the
study of nine popular, open-source tools. We couple the manual
examination of their code bases with the most comprehensive
experimental evaluation (thus far) using 3,788 binaries. Our
study yields a comprehensive description and organization of
strategies for disassembly, classifying them as either algorithm
or else heuristic. Meanwhile, we measure and report the impact
of individual algorithms on the results of each tool. We ﬁnd that
while principled algorithms are used by all tools, they still heavily
rely on heuristics to increase code coverage. Depending on the
heuristics used, different coverage-vs-correctness trade-offs come
in play, leadin...


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

Input:
title:SoK: All You Ever Wanted to Know About x86/x64 Binary Disassembly
But Were Afraid to Ask
author:Chengbin Pang and
Ruotong Yu and
Yaohui Chen and
Eric Koskinen and
Georgios Portokalidis and
Bing Mao and
Jun Xu
2
1
0
0
0
.
1
2
0
2
.
1
0
0
0
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
1
2
0
2
©
0
0
.
1
3
$
/
1
2
/
5
-
4
3
9
8
-
1
8
2
7
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
1
2
0
2
2021 IEEE Symposium on Security and Privacy (SP)
SoK: All You Ever Wanted to Know About x86/x64
Binary Disassembly But Were Afraid to Ask
Chengbin Pang∗‡§ Ruotong Yu∗ Yaohui Chen† Eric Koskinen∗ Georgios Portokalidis∗ Bing Mao‡
Jun Xu∗
∗Stevens Institute of Technology
†Facebook Inc.
‡Nanjing University
Abstract—Disassembly of binary code is hard, but necessary
for improving the security of binary software. Over the past
few decades, research in binary disassembly has produced many
tools and frameworks, which have been made available to
researchers and security professionals. These tools employ a
variety of strategies that grant them different characteristics.
The lack of systematization, however, impedes new research in
the area and makes selecting the right tool hard, as we do
not understand the strengths and weaknesses of existing tools.
In this paper, we systematize binary disassembly through the
study of nine popular, open-source tools. We couple the manual
examination of their code bases with the most comprehensive
experimental evaluation (thus far) using 3,788 binaries. Our
study yields a comprehensive description and organization of
strategies for disassembly, classifying them as either algorithm
or else heuristic. Meanwhile, we measure and report the impact
of individual algorithms on the results of each tool. We ﬁnd that
while principled algorithms are used by all tools, they still heavily
rely on heuristics to increase code coverage. Depending on the
heuristics used, different coverage-vs-correctness trade-offs come
in play, leadin...

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


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

Output:
安全论文分析：

title:SpecROP: Speculative Exploitation of ROP Chains
author:Atri Bhattacharyya and
Andr'es S'anchez and
Esmaeil Mohammadian Koruyeh and
Nael B. Abu-Ghazaleh and
Chengyu Song and
Mathias Payer
SpecROP: Speculative Exploitation of ROP Chains
Atri Bhattacharyya
EPFL
Andrés Sánchez
EPFL
Esmaeil M. Koruyeh
UC Riverside
Nael Abu-Ghazaleh
UC Riverside
Chengyu Song
UC Riverside
Mathias Payer
EPFL
Abstract
Speculative execution attacks, such as Spectre, reuse code
from the victim’s binary to access and leak secret information
during speculative execution. Every variant of the attack re-
quires very particular code sequences, necessitating elaborate
gadget-search campaigns. Often, victim programs contain
few, or even zero, usable gadgets. Consequently, speculative
attacks are sometimes demonstrated by injecting usable code
sequences into the victim. So far, attacks search for mono-
lithic gadgets, a single sequence of code which performs all
the attack steps.
We introduce SpecROP, a novel speculative execution at-
tack technique, inspired by classic code reuse attacks like
Return-Oriented Programming to tackle the rarity of code
gadgets. The SpecROP attacker uses multiple, small gadgets
chained by poisoning multiple control-ﬂow instructions to
perform the same computation as a monolithic gadget. A key
difference to classic code reuse attacks is that control-ﬂow
transfers between gadgets use speculative targets compared
to targets in memory or registers.
We categorize SpecROP gadgets into generic classes and
demonstrate the abundance of such gadgets in victim libraries.
Further, we explore the practicality of inﬂuencing multiple
control-ﬂow instructions on modern processors, and demon-
strate an attack which uses gadget chaining to increase the
leakage potential of a Spectre variant, SMoTherSpectre.
1 Introduction
Spectre [1] demonstrated the power of speculative execu-
tion attacks by leaking information across various protection
boundaries: sandboxes, processes, u...


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

Input:
title:SpecROP: Speculative Exploitation of ROP Chains
author:Atri Bhattacharyya and
Andr'es S'anchez and
Esmaeil Mohammadian Koruyeh and
Nael B. Abu-Ghazaleh and
Chengyu Song and
Mathias Payer
SpecROP: Speculative Exploitation of ROP Chains
Atri Bhattacharyya
EPFL
Andrés Sánchez
EPFL
Esmaeil M. Koruyeh
UC Riverside
Nael Abu-Ghazaleh
UC Riverside
Chengyu Song
UC Riverside
Mathias Payer
EPFL
Abstract
Speculative execution attacks, such as Spectre, reuse code
from the victim’s binary to access and leak secret information
during speculative execution. Every variant of the attack re-
quires very particular code sequences, necessitating elaborate
gadget-search campaigns. Often, victim programs contain
few, or even zero, usable gadgets. Consequently, speculative
attacks are sometimes demonstrated by injecting usable code
sequences into the victim. So far, attacks search for mono-
lithic gadgets, a single sequence of code which performs all
the attack steps.
We introduce SpecROP, a novel speculative execution at-
tack technique, inspired by classic code reuse attacks like
Return-Oriented Programming to tackle the rarity of code
gadgets. The SpecROP attacker uses multiple, small gadgets
chained by poisoning multiple control-ﬂow instructions to
perform the same computation as a monolithic gadget. A key
difference to classic code reuse attacks is that control-ﬂow
transfers between gadgets use speculative targets compared
to targets in memory or registers.
We categorize SpecROP gadgets into generic classes and
demonstrate the abundance of such gadgets in victim libraries.
Further, we explore the practicality of inﬂuencing multiple
control-ﬂow instructions on modern processors, and demon-
strate an attack which uses gadget chaining to increase the
leakage potential of a Spectre variant, SMoTherSpectre.
1 Introduction
Spectre [1] demonstrated the power of speculative execu-
tion attacks by leaking information across various protection
boundaries: sandboxes, processes, u...

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


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

Output:
安全论文分析：

title:Pathdiag: Automated TCP Diagnosis
author:Matthew Mathis and
John Heffner and
Peter O'Neil and
Pete Siemsen
Pathdiag: Automated TCP Diagnosis(cid:2)
Matt Mathis1, John Heﬀner1, Peter O’Neil2,3, and Pete Siemsen2
1 Pittsburgh Supercomputing Center
2 National Center for Atmospheric Research
3 Mid-Atlantic Crossroads
Abstract. This paper describes a tool to diagnose network performance
problems commonly aﬀecting TCP-based applications. The tool, path-
diag, runs under a web server framework to provide non-expert network
users with one-click diagnostic testing, tuning support and repair in-
structions. It diagnoses many causes of poor network performance using
Web100 statistics and TCP performance models to overcome the lack of
otherwise identiﬁable symptoms.
1 Introduction
By design, the TCP/IP hourglass [4] hides the details of the network and the
application from each other. This property is critical to the ongoing evolution of
the Internet because it permits applications and the underlying network infras-
tructure to evolve independently. However, it also obscures all network ﬂaws.
Since TCP silently compensates for ﬂaws, for example by retransmitting lost
data, the only symptom of most problems is reduced performance. This “symp-
tom hiding” property was the motivation behind the Web100 project [17], which
developed the TCP extended statistics MIB [16] to expose TCP protocol events
that are normally hidden from the application. A MIB is a formal speciﬁcation
of a set of management variables that can be accessed by SNMP or other lower
overhead mechanisms. Experimental prototypes of the MIB have been imple-
mented in a number of operating systems, including Linux [17] and Microsoft
Windows Vista [23].
Diagnostic eﬀorts are further complicated by another property of TCP: the
symptoms of most ﬂaws scale by the ﬂow’s round-trip time (RTT). Note that
for window-based protocols, performance models generally have an RTT term in
the denominator. For example, insuﬃcient...


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

Input:
title:Pathdiag: Automated TCP Diagnosis
author:Matthew Mathis and
John Heffner and
Peter O'Neil and
Pete Siemsen
Pathdiag: Automated TCP Diagnosis(cid:2)
Matt Mathis1, John Heﬀner1, Peter O’Neil2,3, and Pete Siemsen2
1 Pittsburgh Supercomputing Center
2 National Center for Atmospheric Research
3 Mid-Atlantic Crossroads
Abstract. This paper describes a tool to diagnose network performance
problems commonly aﬀecting TCP-based applications. The tool, path-
diag, runs under a web server framework to provide non-expert network
users with one-click diagnostic testing, tuning support and repair in-
structions. It diagnoses many causes of poor network performance using
Web100 statistics and TCP performance models to overcome the lack of
otherwise identiﬁable symptoms.
1 Introduction
By design, the TCP/IP hourglass [4] hides the details of the network and the
application from each other. This property is critical to the ongoing evolution of
the Internet because it permits applications and the underlying network infras-
tructure to evolve independently. However, it also obscures all network ﬂaws.
Since TCP silently compensates for ﬂaws, for example by retransmitting lost
data, the only symptom of most problems is reduced performance. This “symp-
tom hiding” property was the motivation behind the Web100 project [17], which
developed the TCP extended statistics MIB [16] to expose TCP protocol events
that are normally hidden from the application. A MIB is a formal speciﬁcation
of a set of management variables that can be accessed by SNMP or other lower
overhead mechanisms. Experimental prototypes of the MIB have been imple-
mented in a number of operating systems, including Linux [17] and Microsoft
Windows Vista [23].
Diagnostic eﬀorts are further complicated by another property of TCP: the
symptoms of most ﬂaws scale by the ﬂow’s round-trip time (RTT). Note that
for window-based protocols, performance models generally have an RTT term in
the denominator. For example, insuﬃcient...

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


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

Output:
安全论文分析：

title:Extracting Attack Manifestations to Determine Log Data Requirements
for Intrusion Detection
author:Emilie Lundin Barse and
Erland Jonsson
Extracting attack manifestations to determine log data requirements for
intrusion detection
Emilie Lundin Barse and Erland Jonsson
Department of Computer Engineering
Chalmers University of Technology
412 96 G¨oteborg, Sweden
{emilie, erland.jonsson}@ce.chalmers.se
Abstract
Log data adapted for intrusion detection is a little ex-
plored research issue despite its importance for successful
and efﬁcient detection of attacks and intrusions. This paper
presents a starting point in the search for suitable log data
by providing a framework for determining exactly which log
data that can reveal a speciﬁc attack, i.e. the attack manifes-
tations. An attack manifestation consists of the log entries
added, changed or removed by the attack compared to nor-
mal behaviour. We demonstrate the use of the framework
by studying attacks in different types of log data. This work
provides a foundation for a fully automated attack analysis.
It also provides some pointers for how to deﬁne a collection
of log elements that are both sufﬁcient and necessary for
detection of a speciﬁc group of attacks. We believe that this
will lead to a log data source that is especially adapted for
intrusion detection purposes.
Keywords:
Intrusion detection, attack manifestations,
log data, data collection
1
Introduction
Intrusion detection is an increasingly vital part of gen-
eral computer security, as computer systems today must
cope with a wide variety of threats. A key issue is thus the
presence of suitable log data that intrusion detection sys-
tems (IDS) can analyse for an accurate determination of the
current system state. Unfortunately, the common adage of
“garbage in, garbage out” also applies for intrusion detec-
tion. We need high-quality log data to provide high qual-
ity alerts, and to avoid false positives and false negatives.
For that reason, it may ...


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

Input:
title:Extracting Attack Manifestations to Determine Log Data Requirements
for Intrusion Detection
author:Emilie Lundin Barse and
Erland Jonsson
Extracting attack manifestations to determine log data requirements for
intrusion detection
Emilie Lundin Barse and Erland Jonsson
Department of Computer Engineering
Chalmers University of Technology
412 96 G¨oteborg, Sweden
{emilie, erland.jonsson}@ce.chalmers.se
Abstract
Log data adapted for intrusion detection is a little ex-
plored research issue despite its importance for successful
and efﬁcient detection of attacks and intrusions. This paper
presents a starting point in the search for suitable log data
by providing a framework for determining exactly which log
data that can reveal a speciﬁc attack, i.e. the attack manifes-
tations. An attack manifestation consists of the log entries
added, changed or removed by the attack compared to nor-
mal behaviour. We demonstrate the use of the framework
by studying attacks in different types of log data. This work
provides a foundation for a fully automated attack analysis.
It also provides some pointers for how to deﬁne a collection
of log elements that are both sufﬁcient and necessary for
detection of a speciﬁc group of attacks. We believe that this
will lead to a log data source that is especially adapted for
intrusion detection purposes.
Keywords:
Intrusion detection, attack manifestations,
log data, data collection
1
Introduction
Intrusion detection is an increasingly vital part of gen-
eral computer security, as computer systems today must
cope with a wide variety of threats. A key issue is thus the
presence of suitable log data that intrusion detection sys-
tems (IDS) can analyse for an accurate determination of the
current system state. Unfortunately, the common adage of
“garbage in, garbage out” also applies for intrusion detec-
tion. We need high-quality log data to provide high qual-
ity alerts, and to avoid false positives and false negatives.
For that reason, it may ...

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


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

Output:
安全论文分析：

title:Dynamic behavior of slowly-responsive congestion control algorithms
author:Deepak Bansal and
Hari Balakrishnan and
Sally Floyd and
Scott Shenker
Dynamic Behavior of Slowly-Responsive Congestion
Control Algorithms
Deepak Bansal and Hari Balakrishnan
MIT Laboratory for Computer Science
Sally Floyd and Scott Shenker
AT&T Center for Internet Research at ICSI
fbansal,harig@lcs.mit.edu
fﬂoyd,shenkerg@aciri.org
Abstract
The recently developed notion of TCP-compatibility has led to a
number of proposals for alternative congestion control algorithms
whose long-term throughput as a function of a steady-state loss rate
is similar to that of TCP. Motivated by the needs of some stream-
ing and multicast applications, these algorithms seem poised to take
the current TCP-dominated Internet to an Internet where many con-
gestion control algorithms co-exist. An important characteristic of
these alternative algorithms is that they are slowly-responsive, re-
fraining from reacting as drastically as TCP to a single packet loss.
However, the TCP-compatibility criteria explored so far in the
literature considers only the static condition of a ﬁxed loss rate.
This paper investigates the behavior of slowly-responsive, TCP-
compatible congestion control algorithms under more realistic dy-
namic network conditions, addressing the fundamental question of
whether these algorithms are safe to deploy in the public Internet.
We study persistent loss rates, long- and short-term fairness prop-
erties, bottleneck link utilization, and smoothness of transmission
rates.
1.
Introduction
In the Internet’s current congestion control paradigm, routers
play a relatively passive role:
they merely indicate congestion
through packet drops or explicit congestion notiﬁcation. It is the
end-systems that perform the crucial role of responding appropri-
ately to these congestion signals. This paradigm of passive routers
and active hosts has been spectacularly successful; the conges-
tion management mechanism...


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

Input:
title:Dynamic behavior of slowly-responsive congestion control algorithms
author:Deepak Bansal and
Hari Balakrishnan and
Sally Floyd and
Scott Shenker
Dynamic Behavior of Slowly-Responsive Congestion
Control Algorithms
Deepak Bansal and Hari Balakrishnan
MIT Laboratory for Computer Science
Sally Floyd and Scott Shenker
AT&T Center for Internet Research at ICSI
fbansal,harig@lcs.mit.edu
fﬂoyd,shenkerg@aciri.org
Abstract
The recently developed notion of TCP-compatibility has led to a
number of proposals for alternative congestion control algorithms
whose long-term throughput as a function of a steady-state loss rate
is similar to that of TCP. Motivated by the needs of some stream-
ing and multicast applications, these algorithms seem poised to take
the current TCP-dominated Internet to an Internet where many con-
gestion control algorithms co-exist. An important characteristic of
these alternative algorithms is that they are slowly-responsive, re-
fraining from reacting as drastically as TCP to a single packet loss.
However, the TCP-compatibility criteria explored so far in the
literature considers only the static condition of a ﬁxed loss rate.
This paper investigates the behavior of slowly-responsive, TCP-
compatible congestion control algorithms under more realistic dy-
namic network conditions, addressing the fundamental question of
whether these algorithms are safe to deploy in the public Internet.
We study persistent loss rates, long- and short-term fairness prop-
erties, bottleneck link utilization, and smoothness of transmission
rates.
1.
Introduction
In the Internet’s current congestion control paradigm, routers
play a relatively passive role:
they merely indicate congestion
through packet drops or explicit congestion notiﬁcation. It is the
end-systems that perform the crucial role of responding appropri-
ately to these congestion signals. This paradigm of passive routers
and active hosts has been spectacularly successful; the conges-
tion management mechanism...

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


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

Output:
安全论文分析：

title:Bloom Cookies: Web Search Personalization without User Tracking
author:Nitesh Mor and
Oriana Riva and
Suman Nath and
John Kubiatowicz
Bloom Cookies: Web Search Personalization
without User Tracking
Nitesh Mor∗
Oriana Riva†
∗University of California, Berkeley
{mor@eecs,kubitron@cs}.berkeley.edu
Abstract—We propose Bloom cookies that encode a user’s
proﬁle in a compact and privacy-preserving way, without prevent-
ing online services from using it for personalization purposes.
The Bloom cookies design is inspired by our analysis of a large
set of web search logs that shows drawbacks of two proﬁle
obfuscation techniques, namely proﬁle generalization and noise
injection, today used by many privacy-preserving personaliza-
tion systems. We ﬁnd that proﬁle generalization signiﬁcantly
hurts personalization and fails to protect users from a server
linking user sessions over time. Noise injection can address
these problems, but only at the cost of a high communication
overhead and a noise dictionary generated by a trusted third
party. In contrast, Bloom cookies leverage Bloom ﬁlters as a
privacy-preserving data structure to provide a more convenient
privacy, personalization, and network efﬁciency tradeoff: they
provide similar (or better) personalization and privacy than
noise injection (and proﬁle generalization), but with an order
of magnitude lower communication cost and no noise dictionary.
We discuss how Bloom cookies can be used for personalized web
search, present an algorithm to automatically conﬁgure the noise
in Bloom cookies given a user’s privacy and personalization goals,
and evaluate their performance compared to the state-of-the-art.
I.
INTRODUCTION
Online services such as web search and advertising are
becoming increasingly personalized. The more and the longer a
service knows about an individual, the better personalization it
can provide. Typically, these online services build user proﬁles
(containing e.g., web sites frequently visited, user interests,
d...


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

Input:
title:Bloom Cookies: Web Search Personalization without User Tracking
author:Nitesh Mor and
Oriana Riva and
Suman Nath and
John Kubiatowicz
Bloom Cookies: Web Search Personalization
without User Tracking
Nitesh Mor∗
Oriana Riva†
∗University of California, Berkeley
{mor@eecs,kubitron@cs}.berkeley.edu
Abstract—We propose Bloom cookies that encode a user’s
proﬁle in a compact and privacy-preserving way, without prevent-
ing online services from using it for personalization purposes.
The Bloom cookies design is inspired by our analysis of a large
set of web search logs that shows drawbacks of two proﬁle
obfuscation techniques, namely proﬁle generalization and noise
injection, today used by many privacy-preserving personaliza-
tion systems. We ﬁnd that proﬁle generalization signiﬁcantly
hurts personalization and fails to protect users from a server
linking user sessions over time. Noise injection can address
these problems, but only at the cost of a high communication
overhead and a noise dictionary generated by a trusted third
party. In contrast, Bloom cookies leverage Bloom ﬁlters as a
privacy-preserving data structure to provide a more convenient
privacy, personalization, and network efﬁciency tradeoff: they
provide similar (or better) personalization and privacy than
noise injection (and proﬁle generalization), but with an order
of magnitude lower communication cost and no noise dictionary.
We discuss how Bloom cookies can be used for personalized web
search, present an algorithm to automatically conﬁgure the noise
in Bloom cookies given a user’s privacy and personalization goals,
and evaluate their performance compared to the state-of-the-art.
I.
INTRODUCTION
Online services such as web search and advertising are
becoming increasingly personalized. The more and the longer a
service knows about an individual, the better personalization it
can provide. Typically, these online services build user proﬁles
(containing e.g., web sites frequently visited, user interests,
d...

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


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

Output:
安全论文分析：

title:How to Find Correlated Internet Failures
author:Ramakrishna Padmanabhan and
Aaron Schulman and
Alberto Dainotti and
Dave Levin and
Neil Spring
How to Find Correlated Internet Failures
Ramakrishna Padmanabhan1,2(B), Aaron Schulman3, Alberto Dainotti2,
Dave Levin1, and Neil Spring1
1 University of Maryland, College Park, USA
{dml,nspring}@cs.umd.edu
2 CAID/UCSD, La Jolla, USA
{ramapad,alberto}@caida.org
3 UCSD, San Diego, USA
schulman@cs.ucsd.edu
Abstract. Even as residential users increasingly rely upon the Internet,
connectivity sometimes fails. Characterizing small-scale failures of last
mile networks is essential to improving Internet reliability.
In this paper, we develop and evaluate an approach to detect Inter-
net failure events that aﬀect multiple users simultaneously using mea-
surements from the Thunderping project. Thunderping probes addresses
across the U.S. When the areas in which they are geo-located are aﬀected
by severe weather alerts. It detects a disruption event when an IP address
ceases to respond to pings. In this paper, we focus on simultaneous dis-
ruptions of multiple addresses that are related to each other by geog-
raphy and ISP, and thus are indicative of a shared cause. Using bino-
mial testing, we detect groups of per-IP disruptions that are unlikely to
have happened independently. We characterize these dependent disrup-
tion events and present results that challenge conventional wisdom on
how such outages aﬀect Internet address blocks.
1 Introduction
Even as residential users rely increasingly upon the Internet, last-mile infras-
tructure continues to be vulnerable to connectivity outages [1–3,5,18,20–24].
Measurement-driven approaches to study residential Internet failures will help
improve reliability by identifying vulnerable networks and their challenges.
Techniques that detect outages at the Internet’s edge often seek, using ter-
minology from Richter et al. [19], disruption events: the abrupt loss of Internet
connectivity of ...


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

Input:
title:How to Find Correlated Internet Failures
author:Ramakrishna Padmanabhan and
Aaron Schulman and
Alberto Dainotti and
Dave Levin and
Neil Spring
How to Find Correlated Internet Failures
Ramakrishna Padmanabhan1,2(B), Aaron Schulman3, Alberto Dainotti2,
Dave Levin1, and Neil Spring1
1 University of Maryland, College Park, USA
{dml,nspring}@cs.umd.edu
2 CAID/UCSD, La Jolla, USA
{ramapad,alberto}@caida.org
3 UCSD, San Diego, USA
schulman@cs.ucsd.edu
Abstract. Even as residential users increasingly rely upon the Internet,
connectivity sometimes fails. Characterizing small-scale failures of last
mile networks is essential to improving Internet reliability.
In this paper, we develop and evaluate an approach to detect Inter-
net failure events that aﬀect multiple users simultaneously using mea-
surements from the Thunderping project. Thunderping probes addresses
across the U.S. When the areas in which they are geo-located are aﬀected
by severe weather alerts. It detects a disruption event when an IP address
ceases to respond to pings. In this paper, we focus on simultaneous dis-
ruptions of multiple addresses that are related to each other by geog-
raphy and ISP, and thus are indicative of a shared cause. Using bino-
mial testing, we detect groups of per-IP disruptions that are unlikely to
have happened independently. We characterize these dependent disrup-
tion events and present results that challenge conventional wisdom on
how such outages aﬀect Internet address blocks.
1 Introduction
Even as residential users rely increasingly upon the Internet, last-mile infras-
tructure continues to be vulnerable to connectivity outages [1–3,5,18,20–24].
Measurement-driven approaches to study residential Internet failures will help
improve reliability by identifying vulnerable networks and their challenges.
Techniques that detect outages at the Internet’s edge often seek, using ter-
minology from Richter et al. [19], disruption events: the abrupt loss of Internet
connectivity of ...

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


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

Output:
安全论文分析：

title:Cryptology As a Network Service
author:Tom Berson and
Drew Dean and
Matthew K. Franklin and
Diana K. Smetters and
Mike Spreitzer
Cryptography as a Network Service
Tom Berson
Xerox PARC‡
Drew Dean
Xerox PARC
Matt Franklin
U.C. Davis
Diana Smetters
Xerox PARC
berson@parc.xerox.com ddean@parc.xerox.com franklin@cs.ucdavis.edu
smetters@parc.xerox.com
Michael Spreitzer†
IBM Research
mspreitz@us.ibm.com
Abstract
Cryptography is a powerful tool for building secure dis-
tributed systems, albeit at substantial computational cost.
This is especially true for public key cryptography. Con-
ventional wisdom dictates that cryptography must be done
locally in order to be secure. We argue for an approach in
which public key cryptographic operations are provided
as a network service. This service operates over long-
lived associations secured by symmetric cryptography.
This network architecture amortizes the cost of special-
purpose cryptographic hardware across many users. We
describe the implementation of such a system, and perfor-
mance results we obtained.
1. Introduction
The received wisdom about cryptography is that it is
difﬁcult and expensive. This has led to system designs
and engineering tradeoffs that aim to minimize the use of
cryptography, and especially of public-key operations, be-
cause they are computationally intensive.
But this received wisdom is no longer true. A great
many inﬂuences have already made cryptography easy
and cheap, and will continue to make it easier and cheaper.
These diverse inﬂuences include the professionalization of
cryptographers, the creation of textbooks and of courses,
the steady growth of computational power delivered by
the operation of Moore’s law, the algorithmic advances
made by cryptographic researchers and engineers, the rise
of e-commerce and wireless infrastructures which have a
seemingly endless appetite for cryptographic services, the
entry of many young people into the ﬁeld, and the easing
of government export controls. ...


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

Input:
title:Cryptology As a Network Service
author:Tom Berson and
Drew Dean and
Matthew K. Franklin and
Diana K. Smetters and
Mike Spreitzer
Cryptography as a Network Service
Tom Berson
Xerox PARC‡
Drew Dean
Xerox PARC
Matt Franklin
U.C. Davis
Diana Smetters
Xerox PARC
berson@parc.xerox.com ddean@parc.xerox.com franklin@cs.ucdavis.edu
smetters@parc.xerox.com
Michael Spreitzer†
IBM Research
mspreitz@us.ibm.com
Abstract
Cryptography is a powerful tool for building secure dis-
tributed systems, albeit at substantial computational cost.
This is especially true for public key cryptography. Con-
ventional wisdom dictates that cryptography must be done
locally in order to be secure. We argue for an approach in
which public key cryptographic operations are provided
as a network service. This service operates over long-
lived associations secured by symmetric cryptography.
This network architecture amortizes the cost of special-
purpose cryptographic hardware across many users. We
describe the implementation of such a system, and perfor-
mance results we obtained.
1. Introduction
The received wisdom about cryptography is that it is
difﬁcult and expensive. This has led to system designs
and engineering tradeoffs that aim to minimize the use of
cryptography, and especially of public-key operations, be-
cause they are computationally intensive.
But this received wisdom is no longer true. A great
many inﬂuences have already made cryptography easy
and cheap, and will continue to make it easier and cheaper.
These diverse inﬂuences include the professionalization of
cryptographers, the creation of textbooks and of courses,
the steady growth of computational power delivered by
the operation of Moore’s law, the algorithmic advances
made by cryptographic researchers and engineers, the rise
of e-commerce and wireless infrastructures which have a
seemingly endless appetite for cryptographic services, the
entry of many young people into the ﬁeld, and the easing
of government export controls. ...

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


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

Output:
安全论文分析：

title:Cache Me If You Can: Effects of DNS Time-to-Live
author:Giovane C. M. Moura and
John S. Heidemann and
Ricardo de Oliveira Schmidt and
Wes Hardaker
Cache Me If You Can:
Effects of DNS Time-to-Live
Giovane C. M. Moura (1)
1: SIDN Labs and TU Delft
John Heidemann (2)
Ricardo de O. Schmidt (3) Wes Hardaker (2)
2: USC/Information Sciences Institute
3: University of Passo Fundo
ABSTRACT
DNS depends on extensive caching for good performance, and ev-
ery DNS zone owner must set Time-to-Live (TTL) values to control
their DNS caching. Today there is relatively little guidance backed
by research about how to set TTLs, and operators must balance
conflicting demands of caching against agility of configuration. Ex-
actly how TTL value choices affect operational networks is quite
challenging to understand due to interactions across the distributed
DNS service, where resolvers receive TTLs in different ways (an-
swers and hints), TTLs are specified in multiple places (zones and
their parent’s glue), and while DNS resolution must be security-
aware. This paper provides the first careful evaluation of how these
multiple, interacting factors affect the effective cache lifetimes of
DNS records, and provides recommendations for how to configure
DNS TTLs based on our findings. We provide recommendations
in TTL choice for different situations, and for where they must be
configured. We show that longer TTLs have significant promise
in reducing latency, reducing it from 183 ms to 28.7 ms for one
country-code TLD.
CCS CONCEPTS
• Networks → Network measurement; Naming and address-
ing.
KEYWORDS
DNS, recursive DNS servers, caching
ACM Reference Format:
Giovane C. M. Moura, John Heidemann, Ricardo de O. Schmidt, Wes Hardaker.
2019. Cache Me If You Can: Effects of DNS Time-to-Live . In Internet Mea-
surement Conference (IMC ’19), October 21–23, 2019, Amsterdam, Netherlands.
ACM, New York, NY, USA, 15 pages. https://doi.org/10.1145/3355369.3355568
1 INTRODUCTION
The Domain Name System (DNS)...


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

Input:
title:Cache Me If You Can: Effects of DNS Time-to-Live
author:Giovane C. M. Moura and
John S. Heidemann and
Ricardo de Oliveira Schmidt and
Wes Hardaker
Cache Me If You Can:
Effects of DNS Time-to-Live
Giovane C. M. Moura (1)
1: SIDN Labs and TU Delft
John Heidemann (2)
Ricardo de O. Schmidt (3) Wes Hardaker (2)
2: USC/Information Sciences Institute
3: University of Passo Fundo
ABSTRACT
DNS depends on extensive caching for good performance, and ev-
ery DNS zone owner must set Time-to-Live (TTL) values to control
their DNS caching. Today there is relatively little guidance backed
by research about how to set TTLs, and operators must balance
conflicting demands of caching against agility of configuration. Ex-
actly how TTL value choices affect operational networks is quite
challenging to understand due to interactions across the distributed
DNS service, where resolvers receive TTLs in different ways (an-
swers and hints), TTLs are specified in multiple places (zones and
their parent’s glue), and while DNS resolution must be security-
aware. This paper provides the first careful evaluation of how these
multiple, interacting factors affect the effective cache lifetimes of
DNS records, and provides recommendations for how to configure
DNS TTLs based on our findings. We provide recommendations
in TTL choice for different situations, and for where they must be
configured. We show that longer TTLs have significant promise
in reducing latency, reducing it from 183 ms to 28.7 ms for one
country-code TLD.
CCS CONCEPTS
• Networks → Network measurement; Naming and address-
ing.
KEYWORDS
DNS, recursive DNS servers, caching
ACM Reference Format:
Giovane C. M. Moura, John Heidemann, Ricardo de O. Schmidt, Wes Hardaker.
2019. Cache Me If You Can: Effects of DNS Time-to-Live . In Internet Mea-
surement Conference (IMC ’19), October 21–23, 2019, Amsterdam, Netherlands.
ACM, New York, NY, USA, 15 pages. https://doi.org/10.1145/3355369.3355568
1 INTRODUCTION
The Domain Name System (DNS)...

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


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

Output:
安全论文分析：

title:Setuid Demystified
author:Hao Chen and
David A. Wagner and
Drew Dean
USENIX Association
Proceedings of the
11th USENIX Security
Symposium
San Francisco, California, USA
August 5-9, 2002
© 2002 by The USENIX Association
Phone: 1 510 528 8649
FAX: 1 510 548 5738
THE ADVANCED COMPUTING SYSTEMS ASSOCIATION
All Rights Reserved
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
Rights to individual papers remain with the author or the author's employer.
 Permission is granted for noncommercial reproduction of the work for educational or research purposes.
This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein.
Setuid Demystiﬁed∗
Hao Chen
David Wagner
University of California at Berkeley
{hchen,daw}@cs.berkeley.edu
Drew Dean
SRI International
ddean@csl.sri.com
Abstract
Access control in Unix systems is mainly based on user
IDs, yet the system calls that modify user IDs (uid-setting
system calls), such as setuid, are poorly designed, in-
sufﬁciently documented, and widely misunderstood and
misused. This has caused many security vulnerabilities
in application programs. We propose to make progress
on the setuid mystery through two approaches. First,
we study kernel sources and compare the semantics of
the uid-setting system calls in three major Unix systems:
Linux, Solaris, and FreeBSD. Second, we develop a for-
mal model of user IDs as a Finite State Automaton (FSA)
and develop new techniques for automatic construction
of such models. We use the resulting FSA to uncover
pitfalls in the Unix API of the uid-setting system calls, to
identify differences in the semantics of these calls among
various Unix systems, to detect inconsistency in the han-
dling of user IDs within an OS kernel, and to check the
proper usage of these calls in programs automatically.
Finally, we provide general guidelines on the proper us-
age of the uid-setting system calls, and we propose a
high...


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

Input:
title:Setuid Demystified
author:Hao Chen and
David A. Wagner and
Drew Dean
USENIX Association
Proceedings of the
11th USENIX Security
Symposium
San Francisco, California, USA
August 5-9, 2002
© 2002 by The USENIX Association
Phone: 1 510 528 8649
FAX: 1 510 548 5738
THE ADVANCED COMPUTING SYSTEMS ASSOCIATION
All Rights Reserved
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
Rights to individual papers remain with the author or the author's employer.
 Permission is granted for noncommercial reproduction of the work for educational or research purposes.
This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein.
Setuid Demystiﬁed∗
Hao Chen
David Wagner
University of California at Berkeley
{hchen,daw}@cs.berkeley.edu
Drew Dean
SRI International
ddean@csl.sri.com
Abstract
Access control in Unix systems is mainly based on user
IDs, yet the system calls that modify user IDs (uid-setting
system calls), such as setuid, are poorly designed, in-
sufﬁciently documented, and widely misunderstood and
misused. This has caused many security vulnerabilities
in application programs. We propose to make progress
on the setuid mystery through two approaches. First,
we study kernel sources and compare the semantics of
the uid-setting system calls in three major Unix systems:
Linux, Solaris, and FreeBSD. Second, we develop a for-
mal model of user IDs as a Finite State Automaton (FSA)
and develop new techniques for automatic construction
of such models. We use the resulting FSA to uncover
pitfalls in the Unix API of the uid-setting system calls, to
identify differences in the semantics of these calls among
various Unix systems, to detect inconsistency in the han-
dling of user IDs within an OS kernel, and to check the
proper usage of these calls in programs automatically.
Finally, we provide general guidelines on the proper us-
age of the uid-setting system calls, and we propose a
high...

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


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

Output:
安全论文分析：

title:Imperio: Robust Over-the-Air Adversarial Examples for Automatic Speech
Recognition Systems
author:Lea Sch"onherr and
Thorsten Eisenhofer and
Steffen Zeiler and
Thorsten Holz and
Dorothea Kolossa
Imperio: Robust Over-the-Air Adversarial Examples for
Automatic Speech Recognition Systems
Lea Schönherr, Thorsten Eisenhofer, Steffen Zeiler, Thorsten Holz, and Dorothea Kolossa
{lea.schoenherr,thorsten.eisenhofer,steffen.zeiler,thorsten.holz,dorothea.kolossa}@rub.de
Ruhr University Bochum
0
2
0
2
v
o
N
4
2
]
R
C
.
s
c
[
5
v
1
5
5
1
0
.
8
0
9
1
:
v
i
X
r
a
ABSTRACT
Automatic speech recognition (ASR) systems can be fooled via
targeted adversarial examples, which induce the ASR to produce
arbitrary transcriptions in response to altered audio signals. How-
ever, state-of-the-art adversarial examples typically have to be fed
into the ASR system directly, and are not successful when played in
a room. Previously published over-the-air adversarial examples fall
into one of three categories: they are either handcrafted examples,
they are so conspicuous that human listeners can easily recognize
the target transcription once they are alerted to its content, or they
require precise information about the room where the attack takes
place, and are hence not transferable to other rooms.
In this paper, we demonstrate the first algorithm that produces
generic adversarial examples against hybrid ASR systems, which
remain robust in an over-the-air attack that is not adapted to the
specific environment. Hence, no prior knowledge of the room char-
acteristics is required. Instead, we use room impulse responses (RIRs)
to compute robust adversarial examples for arbitrary room char-
acteristics and employ the ASR system Kaldi to demonstrate the
attack. Further, our algorithm can utilize psychoacoustic meth-
ods to hide changes of the original audio signal below the human
thresholds of hearing. In practical experiments, we show that the
adversarial examples work for varying room setups,...


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

Input:
title:Imperio: Robust Over-the-Air Adversarial Examples for Automatic Speech
Recognition Systems
author:Lea Sch"onherr and
Thorsten Eisenhofer and
Steffen Zeiler and
Thorsten Holz and
Dorothea Kolossa
Imperio: Robust Over-the-Air Adversarial Examples for
Automatic Speech Recognition Systems
Lea Schönherr, Thorsten Eisenhofer, Steffen Zeiler, Thorsten Holz, and Dorothea Kolossa
{lea.schoenherr,thorsten.eisenhofer,steffen.zeiler,thorsten.holz,dorothea.kolossa}@rub.de
Ruhr University Bochum
0
2
0
2
v
o
N
4
2
]
R
C
.
s
c
[
5
v
1
5
5
1
0
.
8
0
9
1
:
v
i
X
r
a
ABSTRACT
Automatic speech recognition (ASR) systems can be fooled via
targeted adversarial examples, which induce the ASR to produce
arbitrary transcriptions in response to altered audio signals. How-
ever, state-of-the-art adversarial examples typically have to be fed
into the ASR system directly, and are not successful when played in
a room. Previously published over-the-air adversarial examples fall
into one of three categories: they are either handcrafted examples,
they are so conspicuous that human listeners can easily recognize
the target transcription once they are alerted to its content, or they
require precise information about the room where the attack takes
place, and are hence not transferable to other rooms.
In this paper, we demonstrate the first algorithm that produces
generic adversarial examples against hybrid ASR systems, which
remain robust in an over-the-air attack that is not adapted to the
specific environment. Hence, no prior knowledge of the room char-
acteristics is required. Instead, we use room impulse responses (RIRs)
to compute robust adversarial examples for arbitrary room char-
acteristics and employ the ASR system Kaldi to demonstrate the
attack. Further, our algorithm can utilize psychoacoustic meth-
ods to hide changes of the original audio signal below the human
thresholds of hearing. In practical experiments, we show that the
adversarial examples work for varying room setups,...

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


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

Output:
安全论文分析：

title:ProcHarvester: Fully Automated Analysis of Procfs Side-Channel Leaks
on Android
author:Raphael Spreitzer and
Felix Kirchengast and
Daniel Gruss and
Stefan Mangard
ProcHarvester: Fully Automated Analysis of Procfs Side-Channel
Leaks on Android
Raphael Spreitzer, Felix Kirchengast, Daniel Gruss, and Stefan Mangard
Graz University of Technology
ABSTRACT
The procfs has been identified as a viable source of side-channel
information leaks on mobile devices. Starting with Android M (An-
droid 6), access to the procfs has been continuously restricted in
order to cope with these attacks. Yet, more recent papers demon-
strated that even if access to process-specific information is re-
stricted within the procfs, global statistics can still be exploited.
However, with state-of-the-art techniques, the search for procfs
information leaks requires a significant amount of manual work.
This makes an exhaustive analysis of existing and newly introduced
procfs resources in terms of information leaks impractical.
We introduce ProcHarvester, a systematic and fully automated
technique to assess procfs information leaks. ProcHarvester au-
tomatically triggers events of interest and later on applies machine
learning techniques to identify procfs information leaks. We demon-
strate the power of ProcHarvester by identifying information
leaks to infer app starts from a set of 100 apps with an accuracy of
96% on Android N (Android 7). Thereby, we outperform the most
accurate app inference attack by about 10 percentage points. We
also demonstrate the ease of applicability of ProcHarvester by
showing how to profile other events such as website launches as
well as keyboard gestures, and we identify the first procfs side
channels on Android O (Android 8). ProcHarvester advances
investigations of procfs information leaks to the next level and will
hopefully help to reduce the attack surface of side-channel attacks.
CCS CONCEPTS
• Security and privacy → Mobile platform security;
KEYWORDS
Andr...


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

Input:
title:ProcHarvester: Fully Automated Analysis of Procfs Side-Channel Leaks
on Android
author:Raphael Spreitzer and
Felix Kirchengast and
Daniel Gruss and
Stefan Mangard
ProcHarvester: Fully Automated Analysis of Procfs Side-Channel
Leaks on Android
Raphael Spreitzer, Felix Kirchengast, Daniel Gruss, and Stefan Mangard
Graz University of Technology
ABSTRACT
The procfs has been identified as a viable source of side-channel
information leaks on mobile devices. Starting with Android M (An-
droid 6), access to the procfs has been continuously restricted in
order to cope with these attacks. Yet, more recent papers demon-
strated that even if access to process-specific information is re-
stricted within the procfs, global statistics can still be exploited.
However, with state-of-the-art techniques, the search for procfs
information leaks requires a significant amount of manual work.
This makes an exhaustive analysis of existing and newly introduced
procfs resources in terms of information leaks impractical.
We introduce ProcHarvester, a systematic and fully automated
technique to assess procfs information leaks. ProcHarvester au-
tomatically triggers events of interest and later on applies machine
learning techniques to identify procfs information leaks. We demon-
strate the power of ProcHarvester by identifying information
leaks to infer app starts from a set of 100 apps with an accuracy of
96% on Android N (Android 7). Thereby, we outperform the most
accurate app inference attack by about 10 percentage points. We
also demonstrate the ease of applicability of ProcHarvester by
showing how to profile other events such as website launches as
well as keyboard gestures, and we identify the first procfs side
channels on Android O (Android 8). ProcHarvester advances
investigations of procfs information leaks to the next level and will
hopefully help to reduce the attack surface of side-channel attacks.
CCS CONCEPTS
• Security and privacy → Mobile platform security;
KEYWORDS
Andr...

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


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

Output:
安全论文分析：

title:Efficient Repair of Polluted Machine Learning Systems via Causal Unlearning
author:Yinzhi Cao and
Alexander Fangxiao Yu and
Andrew Aday and
Eric Stahl and
Jon Merwine and
Junfeng Yang
Efficient Repair of Polluted Machine Learning Systems via
Causal Unlearning
Yinzhi Cao
Alexander Fangxiao Yu
Andrew Aday
Lehigh University, Bethlehem PA
Columbia University, New York, NY
Columbia University, New York, NY
yinzhi.cao@lehigh.edu
afy2103@columbia.edu
aza2112@columbia.edu
Eric Stahl
Jon Merwine
Junfeng Yang
Lehigh University, Bethlehem PA
Lehigh University, Bethlehem PA
Columbia University, New York, NY
ems316@lehigh.edu
jmm214@lehigh.edu
junfeng@cs.columbia.edu
ABSTRACT
Machine learning systems, though being successful in many real-
world applications, are known to remain prone to errors and attacks.
A major attack, called data pollution, injects maliciously crafted
training data samples into the training set, causing the system to
learn an incorrect model and subsequently misclassify testing sam-
ples. A natural solution to a data pollution attack is to remove the
polluted data from the training set and relearn a clean model. Unfor-
tunately, the training set of a real-world machine learning system can
contain millions of samples; it is thus hopeless for an administrator
to manually inspect all of them to weed out the polluted ones.
This paper presents an approach called causal unlearning and a
corresponding system called KARMA to efficiently repair a polluted
learning system. KARMA dramatically reduces the manual effort of
administrators by automatically detecting the set of polluted training
data samples with high precision and recall. Evaluation on three
learning systems show that KARMA greatly reduces manual effort
for repair, and has high precision and recall.
CCS CONCEPTS
• Computing methodologies → Machine learning; • Security and
privacy → Systems security;
KEYWORDS
Causality; Data Pollution Attacks; Machine Unlearning
ACM Reference format:
Yinzhi Cao, Alexa...


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

Input:
title:Efficient Repair of Polluted Machine Learning Systems via Causal Unlearning
author:Yinzhi Cao and
Alexander Fangxiao Yu and
Andrew Aday and
Eric Stahl and
Jon Merwine and
Junfeng Yang
Efficient Repair of Polluted Machine Learning Systems via
Causal Unlearning
Yinzhi Cao
Alexander Fangxiao Yu
Andrew Aday
Lehigh University, Bethlehem PA
Columbia University, New York, NY
Columbia University, New York, NY
yinzhi.cao@lehigh.edu
afy2103@columbia.edu
aza2112@columbia.edu
Eric Stahl
Jon Merwine
Junfeng Yang
Lehigh University, Bethlehem PA
Lehigh University, Bethlehem PA
Columbia University, New York, NY
ems316@lehigh.edu
jmm214@lehigh.edu
junfeng@cs.columbia.edu
ABSTRACT
Machine learning systems, though being successful in many real-
world applications, are known to remain prone to errors and attacks.
A major attack, called data pollution, injects maliciously crafted
training data samples into the training set, causing the system to
learn an incorrect model and subsequently misclassify testing sam-
ples. A natural solution to a data pollution attack is to remove the
polluted data from the training set and relearn a clean model. Unfor-
tunately, the training set of a real-world machine learning system can
contain millions of samples; it is thus hopeless for an administrator
to manually inspect all of them to weed out the polluted ones.
This paper presents an approach called causal unlearning and a
corresponding system called KARMA to efficiently repair a polluted
learning system. KARMA dramatically reduces the manual effort of
administrators by automatically detecting the set of polluted training
data samples with high precision and recall. Evaluation on three
learning systems show that KARMA greatly reduces manual effort
for repair, and has high precision and recall.
CCS CONCEPTS
• Computing methodologies → Machine learning; • Security and
privacy → Systems security;
KEYWORDS
Causality; Data Pollution Attacks; Machine Unlearning
ACM Reference format:
Yinzhi Cao, Alexa...

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


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

Output:
安全论文分析：

title:Zen and the art of network architecture
author:Larry Peterson
Zen and the Art of Network Architecture
Larry Peterson
Princeton University
llp@cs.princeton.edu
ABSTRACT
Network architectures are a unique artifact of computer science.
They  are  shaped  by  both  technical  and  non-technical  forces.
When  well-crafted,  they  define  fixed  points
that  catalyze
innovation. And they ultimately suffer from entropy and need to
be reinvented. Drawing on my experiences building and operating
network research testbeds, designing and deploying experimental
network  services,
the
commercial  sector,  and  witnessing  fundamental  shifts  in  the
networking  industry,  this  talk  explores  the  nature  of  network
architectures. It also attempts to extract a set of general lessons,
and apply them to the emerging cloud.
research  prototypes
transferring
to
Categories and Subject Descriptors
C. 2.1 [Computer Systems Organization]: Network
Architecture and Design – Network communications.
General Terms
Design, Experimentation, Performance, Reliability.
Keywords
Network Architecture.
Permission to make digital or hard copies of part or all of this work for personal or
classroom  use  is  granted  without  fee  provided  that  copies  are  not  made  or
distributed for profit or commercial advantage, and that copies bear this notice and
the full citation on the first page. Copyrights for third-party components of this work
must be honored. For all other uses, contact the owner/author(s). Copyright is held
by the author/owner(s).
SIGCOMM’13, August 12–16, 2013, Hong Kong, China.
ACM 978-1-4503-2056-6/13/08.
1


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

Input:
title:Zen and the art of network architecture
author:Larry Peterson
Zen and the Art of Network Architecture
Larry Peterson
Princeton University
llp@cs.princeton.edu
ABSTRACT
Network architectures are a unique artifact of computer science.
They  are  shaped  by  both  technical  and  non-technical  forces.
When  well-crafted,  they  define  fixed  points
that  catalyze
innovation. And they ultimately suffer from entropy and need to
be reinvented. Drawing on my experiences building and operating
network research testbeds, designing and deploying experimental
network  services,
the
commercial  sector,  and  witnessing  fundamental  shifts  in  the
networking  industry,  this  talk  explores  the  nature  of  network
architectures. It also attempts to extract a set of general lessons,
and apply them to the emerging cloud.
research  prototypes
transferring
to
Categories and Subject Descriptors
C. 2.1 [Computer Systems Organization]: Network
Architecture and Design – Network communications.
General Terms
Design, Experimentation, Performance, Reliability.
Keywords
Network Architecture.
Permission to make digital or hard copies of part or all of this work for personal or
classroom  use  is  granted  without  fee  provided  that  copies  are  not  made  or
distributed for profit or commercial advantage, and that copies bear this notice and
the full citation on the first page. Copyrights for third-party components of this work
must be honored. For all other uses, contact the owner/author(s). Copyright is held
by the author/owner(s).
SIGCOMM’13, August 12–16, 2013, Hong Kong, China.
ACM 978-1-4503-2056-6/13/08.
1

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


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

Output:
安全论文分析：

title:Next Generation P2P Botnets: Monitoring Under Adverse Conditions
author:Leon B"ock and
Emmanouil Vasilomanolakis and
Max M"uhlh"auser and
Shankar Karuppayah
Next Generation P2P Botnets:
Monitoring Under Adverse Conditions
Leon B¨ock1(B), Emmanouil Vasilomanolakis1, Max M¨uhlh¨auser1,
and Shankar Karuppayah2
1 Telecooperation Lab, Technische Universit¨at Darmstadt, Darmstadt, Germany
{boeck,vasilomano,max}@tk.tu-darmstadt.de
2 National Advanced IPv6 Centre, Universiti Sains Malaysia (USM), Gelugor,
Malaysia
kshankar@usm.my
Abstract. The eﬀects of botnet attacks, over the years, have been dev-
astating. From high volume Distributed Denial of Service (DDoS) attacks
to ransomware attacks, it is evident that defensive measures need to be
taken. Indeed, there has been a number of successful takedowns of bot-
nets that exhibit a centralized architecture. However, this is not the case
with distributed botnets that are more resilient and armed with coun-
termeasures against monitoring. In this paper, we argue that monitoring
countermeasures, applied by botmasters, will only become more sophisti-
cated; to such an extent that monitoring, under these adverse conditions,
may become infeasible. That said, we present the most detailed analy-
sis, to date, of parameters that inﬂuence a P2P botnet’s resilience and
monitoring resistance. Integral to our analysis, we introduce BotChurn
(BC) a realistic and botnet-focused churn generator that can assist in
the analysis of botnets. Our experimental results suggest that certain
parameter combinations greatly limit intelligence gathering operations.
Furthermore, our analysis highlights the need for extensive collaboration
between defenders. For instance, we show that even the combined knowl-
edge of 500 monitoring instances is insuﬃcient to fully enumerate some
of the examined botnets. In this context, we also raise the question of
whether botnet monitoring will still be feasible in the near future.
1 Introduction
Bo...


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

Input:
title:Next Generation P2P Botnets: Monitoring Under Adverse Conditions
author:Leon B"ock and
Emmanouil Vasilomanolakis and
Max M"uhlh"auser and
Shankar Karuppayah
Next Generation P2P Botnets:
Monitoring Under Adverse Conditions
Leon B¨ock1(B), Emmanouil Vasilomanolakis1, Max M¨uhlh¨auser1,
and Shankar Karuppayah2
1 Telecooperation Lab, Technische Universit¨at Darmstadt, Darmstadt, Germany
{boeck,vasilomano,max}@tk.tu-darmstadt.de
2 National Advanced IPv6 Centre, Universiti Sains Malaysia (USM), Gelugor,
Malaysia
kshankar@usm.my
Abstract. The eﬀects of botnet attacks, over the years, have been dev-
astating. From high volume Distributed Denial of Service (DDoS) attacks
to ransomware attacks, it is evident that defensive measures need to be
taken. Indeed, there has been a number of successful takedowns of bot-
nets that exhibit a centralized architecture. However, this is not the case
with distributed botnets that are more resilient and armed with coun-
termeasures against monitoring. In this paper, we argue that monitoring
countermeasures, applied by botmasters, will only become more sophisti-
cated; to such an extent that monitoring, under these adverse conditions,
may become infeasible. That said, we present the most detailed analy-
sis, to date, of parameters that inﬂuence a P2P botnet’s resilience and
monitoring resistance. Integral to our analysis, we introduce BotChurn
(BC) a realistic and botnet-focused churn generator that can assist in
the analysis of botnets. Our experimental results suggest that certain
parameter combinations greatly limit intelligence gathering operations.
Furthermore, our analysis highlights the need for extensive collaboration
between defenders. For instance, we show that even the combined knowl-
edge of 500 monitoring instances is insuﬃcient to fully enumerate some
of the examined botnets. In this context, we also raise the question of
whether botnet monitoring will still be feasible in the near future.
1 Introduction
Bo...

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


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

Output:
安全论文分析：

title:DataGuard: Dynamic data attestation in wireless sensor networks
author:Dazhi Zhang and
Donggang Liu
DataGuard: Dynamic Data Attestation in Wireless Sensor Networks
Dazhi Zhang and Donggang Liu
dazhi.zhang@mavs.uta.edu,dliu@uta.edu
Department of Computer Science and Engineering
The University of Texas at Arlington
Abstract
Attestation has become a promising approach for ensur-
ing software integrity in wireless sensor networks. How-
ever, current attestation either focuses on static system
properties, e.g., code integrity, or requires hardware sup-
port such as Trusted Platform Module (TPM). However,
there are attacks exploiting vulnerabilities that do not vio-
late static system properties, and sensor platforms may not
have hardware-based security support. This paper presents
a software attestation scheme for dynamic data integrity
based on data boundary integrity. It automatically trans-
forms the source code and inserts data guards to track run-
time program data. A data guard is unrecoverable once it
is corrupted by an attacker, even if the attacker fully con-
trols the system later. The corruption of any data guard at
runtime can be remotely detected. A corruption either indi-
cates a software attack or a bug in the software that needs
immediate attention. The beneﬁts of the proposed attesta-
tion scheme are as follows. First, it does not rely on any
additional hardware support, making it suitable for low-
cost sensor nodes. Second, it introduces minimal communi-
cation cost and has adjustable runtime memory overhead.
Third, it works even if sensor nodes use different hardware
platforms, as long as they run the same software. The pro-
totype implementation and the experiments on TelosB motes
show that the proposed technique is both effective and efﬁ-
cient for sensor networks.
1 Introduction
Wireless sensor nodes often lack advanced hardware
support for system integrity and are vulnerable to attacks
exploiting software ﬂaws. Additionally, it is often costl...


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

Input:
title:DataGuard: Dynamic data attestation in wireless sensor networks
author:Dazhi Zhang and
Donggang Liu
DataGuard: Dynamic Data Attestation in Wireless Sensor Networks
Dazhi Zhang and Donggang Liu
dazhi.zhang@mavs.uta.edu,dliu@uta.edu
Department of Computer Science and Engineering
The University of Texas at Arlington
Abstract
Attestation has become a promising approach for ensur-
ing software integrity in wireless sensor networks. How-
ever, current attestation either focuses on static system
properties, e.g., code integrity, or requires hardware sup-
port such as Trusted Platform Module (TPM). However,
there are attacks exploiting vulnerabilities that do not vio-
late static system properties, and sensor platforms may not
have hardware-based security support. This paper presents
a software attestation scheme for dynamic data integrity
based on data boundary integrity. It automatically trans-
forms the source code and inserts data guards to track run-
time program data. A data guard is unrecoverable once it
is corrupted by an attacker, even if the attacker fully con-
trols the system later. The corruption of any data guard at
runtime can be remotely detected. A corruption either indi-
cates a software attack or a bug in the software that needs
immediate attention. The beneﬁts of the proposed attesta-
tion scheme are as follows. First, it does not rely on any
additional hardware support, making it suitable for low-
cost sensor nodes. Second, it introduces minimal communi-
cation cost and has adjustable runtime memory overhead.
Third, it works even if sensor nodes use different hardware
platforms, as long as they run the same software. The pro-
totype implementation and the experiments on TelosB motes
show that the proposed technique is both effective and efﬁ-
cient for sensor networks.
1 Introduction
Wireless sensor nodes often lack advanced hardware
support for system integrity and are vulnerable to attacks
exploiting software ﬂaws. Additionally, it is often costl...

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


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

Output:
安全论文分析：

title:K-anonymous association rule hiding
author:Zutao Zhu and
Wenliang Du
Privacy Preserving Data Mining Using
Association Rule With Condensation Approach
 Supriya S. Borhade1 , Bipin B.Shinde2
Researcher, Department of Computer Engineering,
Pune University, Pune. 1
Researcher ,Department of Computer Engineering,
RGPV,Bhopal. 2
Abstract—With  the  rapid  development  data  mining  within
various  fields  and  security  and  privacy  concerns  come  into
view.  In  data  mining  while  releasing  micro-data  or  patterns
from large databases individual or organizational private data
may  get  compromise  the  information.  The  main  aim  behind
privacy  preserving  data  mining  is  to  maximizing  analysis
outcome  and  minimizing  disclosure  of
individuals  or
organizational private data. Association rule mining explores
interesting relationship between data. This paper is based on
concepts:  condensation  method  and  association  rule.  SMC
(secure  multiparty  computation)  securely  transferring  data
over  the  network  with  hiding  process  which  hide  sensitive
association rule which create threat to privacy. Now privacy
preserving  data  mining  has  become  increasingly  popular
because  it  provides  sharing  of  private  or  sensitive  data  for
analysis purposes. Most of people and organizations are afraid
or hesitate to share their data or refusing to share their data
or  sometimes  might  provide  wrong  data.  Due  to  rapid
proliferation  of  private  information  on  the  internet,  lot  of
research has been done in recent years for privacy preserving
data  mining.  Users  are  unwilling  to  provide  private  or
personal data unless and until privacy is assured. Sometimes
automated  transaction  system  holds  or  track  information
about individuals in day today’s life. For example credit card
transactions.
Keywords—Association  Rule,  Condensation,  PPDM,
SMC, Perturbation.
I.  INTRODUCTION
Now it has ...


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

Input:
title:K-anonymous association rule hiding
author:Zutao Zhu and
Wenliang Du
Privacy Preserving Data Mining Using
Association Rule With Condensation Approach
 Supriya S. Borhade1 , Bipin B.Shinde2
Researcher, Department of Computer Engineering,
Pune University, Pune. 1
Researcher ,Department of Computer Engineering,
RGPV,Bhopal. 2
Abstract—With  the  rapid  development  data  mining  within
various  fields  and  security  and  privacy  concerns  come  into
view.  In  data  mining  while  releasing  micro-data  or  patterns
from large databases individual or organizational private data
may  get  compromise  the  information.  The  main  aim  behind
privacy  preserving  data  mining  is  to  maximizing  analysis
outcome  and  minimizing  disclosure  of
individuals  or
organizational private data. Association rule mining explores
interesting relationship between data. This paper is based on
concepts:  condensation  method  and  association  rule.  SMC
(secure  multiparty  computation)  securely  transferring  data
over  the  network  with  hiding  process  which  hide  sensitive
association rule which create threat to privacy. Now privacy
preserving  data  mining  has  become  increasingly  popular
because  it  provides  sharing  of  private  or  sensitive  data  for
analysis purposes. Most of people and organizations are afraid
or hesitate to share their data or refusing to share their data
or  sometimes  might  provide  wrong  data.  Due  to  rapid
proliferation  of  private  information  on  the  internet,  lot  of
research has been done in recent years for privacy preserving
data  mining.  Users  are  unwilling  to  provide  private  or
personal data unless and until privacy is assured. Sometimes
automated  transaction  system  holds  or  track  information
about individuals in day today’s life. For example credit card
transactions.
Keywords—Association  Rule,  Condensation,  PPDM,
SMC, Perturbation.
I.  INTRODUCTION
Now it has ...

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


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

Output:
安全论文分析：

title:TextExerciser: Feedback-driven Text Input Exercising for Android Applications
author:Yuyu He and
Lei Zhang and
Zhemin Yang and
Yinzhi Cao and
Keke Lian and
Shuai Li and
Wei Yang and
Zhibo Zhang and
Min Yang and
Yuan Zhang and
Haixin Duan
2020 IEEE Symposium on Security and Privacy
TextExerciser: Feedback-driven Text Input
Yuyu He,1, Lei Zhang,1, Zhemin Yang1, Yinzhi Cao2, Keke Lian1, Shuai Li1, Wei Yang3, Zhibo Zhang1
Exercising for Android Applications
Min Yang1, Yuan Zhang1, Haixin Duan4
1: Fudan University, 2: Johns Hopkins University, 3: University of Texas at Dalla, 4: Tsinghua University
1: {heyy16, lei zhang14, yangzhemin, kklian18, lis19, zbzhang15, m yang, yuanxzhang}@fudan.edu.cn
2: yinzhi.cao@jhu.edu, 3: wei.yang@utdallas.edu, 4: duanhx@tsinghua.edu.cn
: The ﬁrst two authors have contributed equally to this work.
Abstract—Dynamic analysis of Android apps is often used
together with an exerciser to increase its code coverage. One big
obstacle in designing such Android app exercisers comes from
the existence of text-based inputs, which are often constrained
by the nature of the input ﬁeld, such as the length and character
restrictions.
In this paper, we propose TextExerciser, an iterative,
feedback-driven text input exerciser, which generates text inputs
for Android apps. Our key insight is that Android apps often
provide feedback, called hints, for malformed inputs so that our
system can utilize such hints to improve the input generation.
We implemented a prototype of TextExerciser and eval-
uated it by comparing TextExerciser with state-of-the-art
exercisers, such as The Monkey and DroidBot. Our evaluation
shows that TextExerciser can achieve signiﬁcantly higher
code coverage and trigger more sensitive behaviors than these
tools. We also combine TextExerciser with dynamic analysis
tools and show they are able to detect more privacy leaks and vul-
nerabilities with TextExerciser than with existing exercisers.
Particularly, existing tools, under th...


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

Input:
title:TextExerciser: Feedback-driven Text Input Exercising for Android Applications
author:Yuyu He and
Lei Zhang and
Zhemin Yang and
Yinzhi Cao and
Keke Lian and
Shuai Li and
Wei Yang and
Zhibo Zhang and
Min Yang and
Yuan Zhang and
Haixin Duan
2020 IEEE Symposium on Security and Privacy
TextExerciser: Feedback-driven Text Input
Yuyu He,1, Lei Zhang,1, Zhemin Yang1, Yinzhi Cao2, Keke Lian1, Shuai Li1, Wei Yang3, Zhibo Zhang1
Exercising for Android Applications
Min Yang1, Yuan Zhang1, Haixin Duan4
1: Fudan University, 2: Johns Hopkins University, 3: University of Texas at Dalla, 4: Tsinghua University
1: {heyy16, lei zhang14, yangzhemin, kklian18, lis19, zbzhang15, m yang, yuanxzhang}@fudan.edu.cn
2: yinzhi.cao@jhu.edu, 3: wei.yang@utdallas.edu, 4: duanhx@tsinghua.edu.cn
: The ﬁrst two authors have contributed equally to this work.
Abstract—Dynamic analysis of Android apps is often used
together with an exerciser to increase its code coverage. One big
obstacle in designing such Android app exercisers comes from
the existence of text-based inputs, which are often constrained
by the nature of the input ﬁeld, such as the length and character
restrictions.
In this paper, we propose TextExerciser, an iterative,
feedback-driven text input exerciser, which generates text inputs
for Android apps. Our key insight is that Android apps often
provide feedback, called hints, for malformed inputs so that our
system can utilize such hints to improve the input generation.
We implemented a prototype of TextExerciser and eval-
uated it by comparing TextExerciser with state-of-the-art
exercisers, such as The Monkey and DroidBot. Our evaluation
shows that TextExerciser can achieve signiﬁcantly higher
code coverage and trigger more sensitive behaviors than these
tools. We also combine TextExerciser with dynamic analysis
tools and show they are able to detect more privacy leaks and vul-
nerabilities with TextExerciser than with existing exercisers.
Particularly, existing tools, under th...

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


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

Output:
安全论文分析：

title:UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
author:Mridula Singh and
Patrick Leu and
AbdelRahman Abdou and
Srdjan Capkun
UWB-ED: Distance Enlargement Attack Detection
in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, and Srdjan Capkun, ETH Zurich
https://www.usenix.org/conference/usenixsecurity19/presentation/singh
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, Srdjan Capkun
{ﬁrstname.lastname}@inf.ethz.ch
Dept. of Computer Science
ETH Zurich
Abstract
Mobile autonomous systems, robots, and cyber-physical sys-
tems rely on accurate positioning information. To conduct
distance-measurement, two devices exchange signals and,
knowing these signals propagate at the speed of light, the time
of arrival is used for distance estimations. Existing distance-
measurement techniques are incapable of protecting against
adversarial distance enlargement—a highly devastating tac-
tic in which the adversary reissues a delayed version of the
signals transmitted between devices, after distorting the au-
thentic signal to prevent the receiver from identifying it. The
adversary need not break crypto, nor compromise any upper-
layer security protocols for mounting this attack. No known
solution currently exists to protect against distance enlarge-
ment. We present Ultra-Wideband Enlargement Detection
(UWB-ED), a new modulation technique to detect distance
enlargement attacks, and securely verify distances between
two mutually trusted devices. We analyze UWB-ED under
an adversary that injects signals to block/modify authentic
signals. We show how UWB-ED is a good candidate for
802.15.4z Low Rate Pulse and the 5G standard.
1 Introduction
Ranging and positioning...


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

Input:
title:UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
author:Mridula Singh and
Patrick Leu and
AbdelRahman Abdou and
Srdjan Capkun
UWB-ED: Distance Enlargement Attack Detection
in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, and Srdjan Capkun, ETH Zurich
https://www.usenix.org/conference/usenixsecurity19/presentation/singh
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, Srdjan Capkun
{ﬁrstname.lastname}@inf.ethz.ch
Dept. of Computer Science
ETH Zurich
Abstract
Mobile autonomous systems, robots, and cyber-physical sys-
tems rely on accurate positioning information. To conduct
distance-measurement, two devices exchange signals and,
knowing these signals propagate at the speed of light, the time
of arrival is used for distance estimations. Existing distance-
measurement techniques are incapable of protecting against
adversarial distance enlargement—a highly devastating tac-
tic in which the adversary reissues a delayed version of the
signals transmitted between devices, after distorting the au-
thentic signal to prevent the receiver from identifying it. The
adversary need not break crypto, nor compromise any upper-
layer security protocols for mounting this attack. No known
solution currently exists to protect against distance enlarge-
ment. We present Ultra-Wideband Enlargement Detection
(UWB-ED), a new modulation technique to detect distance
enlargement attacks, and securely verify distances between
two mutually trusted devices. We analyze UWB-ED under
an adversary that injects signals to block/modify authentic
signals. We show how UWB-ED is a good candidate for
802.15.4z Low Rate Pulse and the 5G standard.
1 Introduction
Ranging and positioning...

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


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

Output:
安全论文分析：

title:Intrusion Detection in RBAC-administered Databases
author:Elisa Bertino and
Ashish Kamra and
Evimaria Terzi and
Athena Vakali
Intrusion Detection in RBAC-administered Databases ∗
Elisa Bertino
Purdue University
Ashish Kamra
Purdue University
bertino@cs.purdue.edu
akamra@ecn.purdue.edu
Evimaria Terzi
University of Helsinki
Athena Vakali
Aristotle University
terzi@cs.helsinki.fi
avakali@csd.auth.gr
Abstract
A considerable effort has been recently devoted to the
development of Database Management Systems (DBMS)
which guarantee high assurance security and privacy. An
important component of any strong security solution is rep-
resented by intrusion detection (ID) systems, able to detect
anomalous behavior by applications and users. To date,
however, there have been very few ID mechanisms specif-
ically tailored to database systems. In this paper, we pro-
pose such a mechanism. The approach we propose to ID
is based on mining database traces stored in log ﬁles. The
result of the mining process is used to form user proﬁles
that can model normal behavior and identify intruders. An
additional feature of our approach is that we couple our
mechanism with Role Based Access Control (RBAC). Under
a RBAC system permissions are associated with roles, usu-
ally grouping several users, rather than with single users.
Our ID system is able to determine role intruders, that is,
individuals that while holding a speciﬁc role, have a be-
havior different from the normal behavior of the role. An
important advantage of providing an ID mechanism speciﬁ-
cally tailored to databases is that it can also be used to pro-
tect against insider threats. Furthermore, the use of roles
makes our approach usable even for databases with large
user population. Our preliminary experimental evaluation
on both real and synthetic database traces show that our
methods work well in practical situations.
1. Introduction
Data represent today an important asset. We see an in-
creasing number of organizations ...


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

Input:
title:Intrusion Detection in RBAC-administered Databases
author:Elisa Bertino and
Ashish Kamra and
Evimaria Terzi and
Athena Vakali
Intrusion Detection in RBAC-administered Databases ∗
Elisa Bertino
Purdue University
Ashish Kamra
Purdue University
bertino@cs.purdue.edu
akamra@ecn.purdue.edu
Evimaria Terzi
University of Helsinki
Athena Vakali
Aristotle University
terzi@cs.helsinki.fi
avakali@csd.auth.gr
Abstract
A considerable effort has been recently devoted to the
development of Database Management Systems (DBMS)
which guarantee high assurance security and privacy. An
important component of any strong security solution is rep-
resented by intrusion detection (ID) systems, able to detect
anomalous behavior by applications and users. To date,
however, there have been very few ID mechanisms specif-
ically tailored to database systems. In this paper, we pro-
pose such a mechanism. The approach we propose to ID
is based on mining database traces stored in log ﬁles. The
result of the mining process is used to form user proﬁles
that can model normal behavior and identify intruders. An
additional feature of our approach is that we couple our
mechanism with Role Based Access Control (RBAC). Under
a RBAC system permissions are associated with roles, usu-
ally grouping several users, rather than with single users.
Our ID system is able to determine role intruders, that is,
individuals that while holding a speciﬁc role, have a be-
havior different from the normal behavior of the role. An
important advantage of providing an ID mechanism speciﬁ-
cally tailored to databases is that it can also be used to pro-
tect against insider threats. Furthermore, the use of roles
makes our approach usable even for databases with large
user population. Our preliminary experimental evaluation
on both real and synthetic database traces show that our
methods work well in practical situations.
1. Introduction
Data represent today an important asset. We see an in-
creasing number of organizations ...

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


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

Output:
安全论文分析：

title:Towards Generating High Coverage Vulnerability-Based Signatures with
Protocol-Level Constraint-Guided Exploration
author:Juan Caballero and
Zhenkai Liang and
Pongsin Poosankam and
Dawn Song
Towards Generating High Coverage
Vulnerability-Based Signatures with Protocol-Level
Constraint-Guided Exploration
Juan Caballero2,1, Zhenkai Liang3, Pongsin Poosankam2,1, and Dawn Song1
1 UC Berkeley
2 Carnegie Mellon University
3 National University of Singapore
Abstract. Signature-based input ﬁltering is an important and widely deployed de-
fense. But current signature generation methods have limited coverage and the gen-
erated signatures often can be easily evaded by an attacker with small variations of
the exploit message. In this paper, we propose protocol-level constraint-guided ex-
ploration, a new approach towards generating high coverage vulnerability-based
signatures. In particular, our approach generates high coverage, yet compact, vul-
nerability point reachability predicates, which capture many paths to the vulnera-
bility point. In our experimental results, our tool, Elcano, generates compact, high
coverage signatures for real-world vulnerabilities.
1 Introduction
Automatic signature generation remains an important open problem. According to
Symantec’s latest Internet Security Threat Report hundreds of new security-critical vul-
nerabilities were discovered in the second half of 2007 [1]. For many of these vulner-
abilities, the exploit development time is less than a day, while the patch development
time is often days or months [1]. In addition, the patch deployment time can be long
due to extensive testing cycles.
To address these issues, signature-based input ﬁltering has been widely deployed in
Intrusion Prevention (IPS) and Intrusion Detection (IDS) systems. Signature-based in-
put ﬁltering matches program inputs against a set of signatures and ﬂags matched inputs
as attacks. It provides an important means to protect vulnerable hosts when patches are
not...