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

Output:
安全论文分析：

title:Geometric Exploration of the Landmark Selection Problem
author:Liying Tang and
Mark Crovella
Geometric Exploration of the Landmark Selection
Problem
Liying Tang and Mark Crovella
Department of Computer Science, Boston University, Boston, MA 02215
{litang,crovella}@cs.bu.edu
Abstract. Internet coordinate systems appear promising as a method for esti-
mating network distance without direct measurement, allowing scalable conﬁgu-
ration of emerging applications such as content delivery networks, peer to peer
systems, and overlay networks. However all such systems rely on landmarks, and
the choice of landmarks has a dramatic impact on their accuracy. Landmark sel-
ection is challenging because of the size of the Internet (leading to an immense
space of candidate sets) and because insight into the properties of good landmark
sets is lacking. In this paper we explore fast algorithms for landmark selection.
Whereas the traditional approach to analyzing similar network-based conﬁgurka-
tion problems employs the graph structure of the Internet, we leverage work in
coordinate systems to treat the problem geometrically, providing an opening for
applying new algorithms. Our results suggest that when employing small numbers
of landmarks (5-10), such geometric algorithms provide good landmarks, while
for larger numbers of landmarks (20-30) even faster methods based on random
selection are equally effective.
1 Introduction
Internet coordinate schemes assign coordinate vectors to hosts in the Internet, and at-
tempt to do so in a manner such that the Euclidean distance between hosts approximates
their network distance, usually taken to be minimum RTT [7]. The power of such co-
ordinate systems is that they allow network distance to be estimated in the absence of
measurement. As a result, applications for which network distance matters (such as con-
tent delivery networks, peer to peer applications, end-system multicast, and others) can
be rapidly conﬁgured in a network-sensiti...


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

Input:
title:Geometric Exploration of the Landmark Selection Problem
author:Liying Tang and
Mark Crovella
Geometric Exploration of the Landmark Selection
Problem
Liying Tang and Mark Crovella
Department of Computer Science, Boston University, Boston, MA 02215
{litang,crovella}@cs.bu.edu
Abstract. Internet coordinate systems appear promising as a method for esti-
mating network distance without direct measurement, allowing scalable conﬁgu-
ration of emerging applications such as content delivery networks, peer to peer
systems, and overlay networks. However all such systems rely on landmarks, and
the choice of landmarks has a dramatic impact on their accuracy. Landmark sel-
ection is challenging because of the size of the Internet (leading to an immense
space of candidate sets) and because insight into the properties of good landmark
sets is lacking. In this paper we explore fast algorithms for landmark selection.
Whereas the traditional approach to analyzing similar network-based conﬁgurka-
tion problems employs the graph structure of the Internet, we leverage work in
coordinate systems to treat the problem geometrically, providing an opening for
applying new algorithms. Our results suggest that when employing small numbers
of landmarks (5-10), such geometric algorithms provide good landmarks, while
for larger numbers of landmarks (20-30) even faster methods based on random
selection are equally effective.
1 Introduction
Internet coordinate schemes assign coordinate vectors to hosts in the Internet, and at-
tempt to do so in a manner such that the Euclidean distance between hosts approximates
their network distance, usually taken to be minimum RTT [7]. The power of such co-
ordinate systems is that they allow network distance to be estimated in the absence of
measurement. As a result, applications for which network distance matters (such as con-
tent delivery networks, peer to peer applications, end-system multicast, and others) can
be rapidly conﬁgured in a network-sensiti...

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


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

Output:
安全论文分析：

title:Unexpected Data Dependency Creation and Chaining: A New Attack to
SDN
author:Feng Xiao and
Jinquan Zhang and
Jianwei Huang and
Guofei Gu and
Dinghao Wu and
Peng Liu
2020 IEEE Symposium on Security and Privacy
Unexpected Data Dependency Creation and
Chaining: A New Attack to SDN
Feng Xiao, Jinquan Zhang, Jianwei Huang†, Guofei Gu†, Dinghao Wu, Peng Liu
The Pennsylvania State University
† SUCCESS Lab, Texas A&M University
Abstract—Software-Deﬁned Networking (SDN) is an emerging
network architecture that provides programmable networking
through a logically centralized controller. As SDN becomes more
prominent, its security vulnerabilities become more evident than
ever. Serving as the “brain” of a software-deﬁned network, how
the control plane (of the network) is exposed to external inputs
(i.e., data plane messages) is directly correlated with how secure
the network is. Fortunately, due to some unique SDN design
choices (e.g., control plane and data plane separation), attackers
often struggle to ﬁnd a reachable path to those vulnerable logic
hidden deeply within the control plane.
it
In this paper, we demonstrate that
is possible for a
weak adversary who only controls a commodity network device
(host or switch) to attack previously unreachable control plane
components by maliciously increasing reachability in the con-
trol plane. We introduce D2C2 (data dependency creation and
chaining) attack, which leverages some widely-used SDN protocol
features (e.g., custom ﬁelds) to create and chain unexpected data
dependencies in order to achieve greater reachability. We have
developed a novel tool, SVHunter, which can effectively identify
D2C2 vulnerabilities. Till now we have evaluated SVHunter
on three mainstream open-source SDN controllers (i.e., ONOS,
Floodlight, and Opendaylight) as well as one security-enhanced
controller (i.e., SE-Floodlight). SVHunter detects 18 previously
unknown vulnerabilities, all of which can be exploited remotely
to launch serious attacks su...


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

Input:
title:Unexpected Data Dependency Creation and Chaining: A New Attack to
SDN
author:Feng Xiao and
Jinquan Zhang and
Jianwei Huang and
Guofei Gu and
Dinghao Wu and
Peng Liu
2020 IEEE Symposium on Security and Privacy
Unexpected Data Dependency Creation and
Chaining: A New Attack to SDN
Feng Xiao, Jinquan Zhang, Jianwei Huang†, Guofei Gu†, Dinghao Wu, Peng Liu
The Pennsylvania State University
† SUCCESS Lab, Texas A&M University
Abstract—Software-Deﬁned Networking (SDN) is an emerging
network architecture that provides programmable networking
through a logically centralized controller. As SDN becomes more
prominent, its security vulnerabilities become more evident than
ever. Serving as the “brain” of a software-deﬁned network, how
the control plane (of the network) is exposed to external inputs
(i.e., data plane messages) is directly correlated with how secure
the network is. Fortunately, due to some unique SDN design
choices (e.g., control plane and data plane separation), attackers
often struggle to ﬁnd a reachable path to those vulnerable logic
hidden deeply within the control plane.
it
In this paper, we demonstrate that
is possible for a
weak adversary who only controls a commodity network device
(host or switch) to attack previously unreachable control plane
components by maliciously increasing reachability in the con-
trol plane. We introduce D2C2 (data dependency creation and
chaining) attack, which leverages some widely-used SDN protocol
features (e.g., custom ﬁelds) to create and chain unexpected data
dependencies in order to achieve greater reachability. We have
developed a novel tool, SVHunter, which can effectively identify
D2C2 vulnerabilities. Till now we have evaluated SVHunter
on three mainstream open-source SDN controllers (i.e., ONOS,
Floodlight, and Opendaylight) as well as one security-enhanced
controller (i.e., SE-Floodlight). SVHunter detects 18 previously
unknown vulnerabilities, all of which can be exploited remotely
to launch serious attacks su...

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


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

Output:
安全论文分析：

title:eXpert-BSM: A Host-Based Intrusion Detection Solution for Sun Solaris
author:Ulf Lindqvist and
Phillip A. Porras
eXpert-BSM: A Host-based Intrusion Detection Solution
for Sun Solaris
Ulf Lindqvist and Phillip A. Porras
System Design Laboratory
SRI International
333 Ravenswood Avenue
Menlo Park, CA 94025-3493
(cid:1)ulf, porras(cid:2)@sdl.sri.com
Abstract
eXpert-BSM is a real time forward-reasoning expert sys-
tem that analyzes Sun Solaris audit trails. Based on many
years of intrusion detection research, eXpert-BSM’s knowl-
edge base detects a wide range of speciﬁc and general forms
of misuse, provides detailed reports and recommendations
to the system operator, and has a low false-alarm rate.
Host-based intrusion detection offers the ability to detect
misuse and subversion through the direct monitoring of pro-
cesses inside the host, providing an important complement
to network-based surveillance. Suites of eXpert-BSMs may
be deployed throughout a network, and their alarms man-
aged, correlated, and acted on by remote or local subscrib-
ing security services, thus helping to address issues of de-
centralized management. Inside the host, eXpert-BSM is
intended to operate as a true security daemon for host sys-
tems, consuming few CPU cycles and very little memory
and secondary storage. eXpert-BSM has been available
for download on the Internet since April 2000, and has been
successfully deployed in several production environments.
1. Introduction
When research on intrusion detection was initiated in the
early 1980s, the problem was often referred to as automated
audit-trail analysis. In theory, auditing is an important se-
The work presented in this paper was funded by the Defense Advanced
Research Projects Agency (DARPA), under contract number F30602-98-
C-0059. SRI International, EMERALD, and eXpert-BSM are trademarks
of SRI International. Sun, Sun Microsystems, Solaris, SunOS, Sun En-
terprise and SunSHIELD are trademarks or registered trademarks of Sun
M...


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

Input:
title:eXpert-BSM: A Host-Based Intrusion Detection Solution for Sun Solaris
author:Ulf Lindqvist and
Phillip A. Porras
eXpert-BSM: A Host-based Intrusion Detection Solution
for Sun Solaris
Ulf Lindqvist and Phillip A. Porras
System Design Laboratory
SRI International
333 Ravenswood Avenue
Menlo Park, CA 94025-3493
(cid:1)ulf, porras(cid:2)@sdl.sri.com
Abstract
eXpert-BSM is a real time forward-reasoning expert sys-
tem that analyzes Sun Solaris audit trails. Based on many
years of intrusion detection research, eXpert-BSM’s knowl-
edge base detects a wide range of speciﬁc and general forms
of misuse, provides detailed reports and recommendations
to the system operator, and has a low false-alarm rate.
Host-based intrusion detection offers the ability to detect
misuse and subversion through the direct monitoring of pro-
cesses inside the host, providing an important complement
to network-based surveillance. Suites of eXpert-BSMs may
be deployed throughout a network, and their alarms man-
aged, correlated, and acted on by remote or local subscrib-
ing security services, thus helping to address issues of de-
centralized management. Inside the host, eXpert-BSM is
intended to operate as a true security daemon for host sys-
tems, consuming few CPU cycles and very little memory
and secondary storage. eXpert-BSM has been available
for download on the Internet since April 2000, and has been
successfully deployed in several production environments.
1. Introduction
When research on intrusion detection was initiated in the
early 1980s, the problem was often referred to as automated
audit-trail analysis. In theory, auditing is an important se-
The work presented in this paper was funded by the Defense Advanced
Research Projects Agency (DARPA), under contract number F30602-98-
C-0059. SRI International, EMERALD, and eXpert-BSM are trademarks
of SRI International. Sun, Sun Microsystems, Solaris, SunOS, Sun En-
terprise and SunSHIELD are trademarks or registered trademarks of Sun
M...

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


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

Output:
安全论文分析：

title:Poster: Understanding User's Decision to Interact with Potential Phishing
Posts on Facebook using a Vignette Study
author:Sovantharith Seng and
Huzeyfe Kocabas and
Mahdi Nasrullah Al-Ameen and
Matthew Wright
Poster: Understanding User’s Decision to Interact with Potential
Phishing Posts on Facebook using a Vignette Study
Sovantharith Seng
sovantharith.seng@mail.rit.edu
Rochester Institute of Technology
Rochester, New York
Huzeyfe Kocabas
huzeyfe.kocabas@aggiemail.usu.edu
Utah State University
Logan, Utah
Mahdi Nasrullah Al-Ameen
mahdi.al-ameen@usu.edu
Utah State University
Logan, Utah
Matthew Wright
matthew.wright@rit.edu
Rochester Institute of Technology
Rochester, New York
Abstract
Facebook remains the largest social media platform on the Internet
with over one billion active monthly users. A variety of personal
and sensitive data is shared on the platform, which makes it a prime
target for attackers. Increasingly, we see phishing attacks that take
advantage of users’ lack of security knowledge, deceiving victims
by using fake or compromised accounts to share malicious posts.
These attacks may slip undetected by the Facebook defense sys-
tem, exposing users to potentially be phished or have their devices
infected with drive-by downloads and malware. Only a few stud-
ies have been conducted to date to understand how users interact
with attacks like this in Facebook. In our prior work, we conducted
a study to address this challenge using a simulated interface and
think-aloud protocol. In this study, we aim to make further progress
in understanding the impact of different factors on users’ clicking
decision in social media through a vignette study that encourages
participants to think about realistic scenarios that they might face.
CCS Concepts
• Security and privacy → Social network security and pri-
vacy; Social aspects of security and privacy.
Keywords
social media; facebook; phishing; vignette study
ACM Reference Format:
Sovantharith Seng, Huzeyfe Kocabas, ...


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

Input:
title:Poster: Understanding User's Decision to Interact with Potential Phishing
Posts on Facebook using a Vignette Study
author:Sovantharith Seng and
Huzeyfe Kocabas and
Mahdi Nasrullah Al-Ameen and
Matthew Wright
Poster: Understanding User’s Decision to Interact with Potential
Phishing Posts on Facebook using a Vignette Study
Sovantharith Seng
sovantharith.seng@mail.rit.edu
Rochester Institute of Technology
Rochester, New York
Huzeyfe Kocabas
huzeyfe.kocabas@aggiemail.usu.edu
Utah State University
Logan, Utah
Mahdi Nasrullah Al-Ameen
mahdi.al-ameen@usu.edu
Utah State University
Logan, Utah
Matthew Wright
matthew.wright@rit.edu
Rochester Institute of Technology
Rochester, New York
Abstract
Facebook remains the largest social media platform on the Internet
with over one billion active monthly users. A variety of personal
and sensitive data is shared on the platform, which makes it a prime
target for attackers. Increasingly, we see phishing attacks that take
advantage of users’ lack of security knowledge, deceiving victims
by using fake or compromised accounts to share malicious posts.
These attacks may slip undetected by the Facebook defense sys-
tem, exposing users to potentially be phished or have their devices
infected with drive-by downloads and malware. Only a few stud-
ies have been conducted to date to understand how users interact
with attacks like this in Facebook. In our prior work, we conducted
a study to address this challenge using a simulated interface and
think-aloud protocol. In this study, we aim to make further progress
in understanding the impact of different factors on users’ clicking
decision in social media through a vignette study that encourages
participants to think about realistic scenarios that they might face.
CCS Concepts
• Security and privacy → Social network security and pri-
vacy; Social aspects of security and privacy.
Keywords
social media; facebook; phishing; vignette study
ACM Reference Format:
Sovantharith Seng, Huzeyfe Kocabas, ...

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


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

Output:
安全论文分析：

title:Dissecting Round Trip Time on the Slow Path with a Single Packet
author:Pietro Marchetta and
Alessio Botta and
Ethan Katz-Bassett and
Antonio Pescapè
Dissecting Round Trip Time on the Slow Path
with a Single Packet
Pietro Marchetta1, Alessio Botta1, Ethan Katz-Bassett2, and Antonio Pescap´e1
1 University of Napoli Federico II, Napoli, Italy
2 University of Southern California, Los Angeles, USA
Abstract. Researchers and operators often measure Round Trip Time
when monitoring, troubleshooting, or otherwise assessing network paths.
However, because it combines all hops traversed along both the forward
and reverse path, it can be diﬃcult to interpret or to attribute delay to
particular path segments.
In this work, we present an approach using a single packet to dissect
the RTT in chunks mapped to speciﬁc portions of the path. Using the IP
Prespeciﬁed Timestamp option directed at intermediate routers, it pro-
vides RTT estimations along portions of the slow path. Using multiple
vantage points (116 PlanetLab nodes), we show that the proposed ap-
proach can be applied on more than 77% of the considered paths. Finally,
we present preliminary results for two use cases (home network contri-
bution to the RTT and per-Autonomous System RTT contribution) to
demonstrate its potential in practical scenarios.
1
Introduction and Motivation
A common metric used to estimate the delay over a network path is the Round
Trip Time (RTT) [1], deﬁned as the length of time it takes to send a data packet
toward a destination and receive its response. Monitoring RTT provides useful
information about the network status when managing testbeds and operational
networks [28]. However, an RTT sample comprises all the delays experienced
by the data packet and its response along the forward and reverse path respec-
tively, and it also includes the time the destination takes to inspect the incoming
packet and generate the proper response. As a consequence, it can be diﬃcult
to interpret RTT values...


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

Input:
title:Dissecting Round Trip Time on the Slow Path with a Single Packet
author:Pietro Marchetta and
Alessio Botta and
Ethan Katz-Bassett and
Antonio Pescapè
Dissecting Round Trip Time on the Slow Path
with a Single Packet
Pietro Marchetta1, Alessio Botta1, Ethan Katz-Bassett2, and Antonio Pescap´e1
1 University of Napoli Federico II, Napoli, Italy
2 University of Southern California, Los Angeles, USA
Abstract. Researchers and operators often measure Round Trip Time
when monitoring, troubleshooting, or otherwise assessing network paths.
However, because it combines all hops traversed along both the forward
and reverse path, it can be diﬃcult to interpret or to attribute delay to
particular path segments.
In this work, we present an approach using a single packet to dissect
the RTT in chunks mapped to speciﬁc portions of the path. Using the IP
Prespeciﬁed Timestamp option directed at intermediate routers, it pro-
vides RTT estimations along portions of the slow path. Using multiple
vantage points (116 PlanetLab nodes), we show that the proposed ap-
proach can be applied on more than 77% of the considered paths. Finally,
we present preliminary results for two use cases (home network contri-
bution to the RTT and per-Autonomous System RTT contribution) to
demonstrate its potential in practical scenarios.
1
Introduction and Motivation
A common metric used to estimate the delay over a network path is the Round
Trip Time (RTT) [1], deﬁned as the length of time it takes to send a data packet
toward a destination and receive its response. Monitoring RTT provides useful
information about the network status when managing testbeds and operational
networks [28]. However, an RTT sample comprises all the delays experienced
by the data packet and its response along the forward and reverse path respec-
tively, and it also includes the time the destination takes to inspect the incoming
packet and generate the proper response. As a consequence, it can be diﬃcult
to interpret RTT values...

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


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

Output:
安全论文分析：

title:On the responsiveness of DNS-based network control
author:Jeffrey Pang and
Aditya Akella and
Anees Shaikh and
Balachander Krishnamurthy and
Srinivasan Seshan
On the Responsiveness of DNS-based Network Control
Jeffrey Pang(cid:3), Aditya Akella(cid:3), Anees Shaikhy, Balachander Krishnamurthyz, Srinivasan Seshan(cid:3)
(cid:3)Computer Science Department
Carnegie Mellon University
Pittsburgh, PA 15213-3891
fjeffpang,aditya,srini+g@cs.cmu.edu
yNetwork Software and Services
IBM T.J. Watson Research Center Florham Park, NJ 07932-0971
zAT&T Labs – Research
bala@research.att.com
Hawthorne, NY 10532-2134
aashaikh@watson.ibm.com
ABSTRACT
For the last few years, large Web content providers interested in im-
proving their scalability and availability have increasingly turned
to three techniques: mirroring, content distribution, and ISP multi-
homing. The Domain Name System (DNS) has gained a prominent
role in the way each of these techniques directs client requests to
achieve the goals of scalability and availability. The DNS is thought
to offer the transparent and agile control necessary to react quickly
to ISP link failures or phenomenon such as ﬂash crowds.
In this paper, we investigate this assumption with the objective
of quantifying the degree of responsiveness that can be expected
from DNS. We use a combination of Web and DNS access mea-
surements from several busy Web sites, as well as a large content
distribution network, to characterize the behavior of end-systems
and local DNS servers in terms of their adherence to DNS-based
controls. Our results suggest that DNS is at best a coarse-grained
mechanism, and poorly suited for applications, such as route con-
trol, which require quick response to link failures or performance
degradations. We then propose several proactive techniques that,
when deployed in cooperation between large content providers and
important clients, have the potential to improve the responsiveness
of DNS-based control.
Categories and Subject ...


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

Input:
title:On the responsiveness of DNS-based network control
author:Jeffrey Pang and
Aditya Akella and
Anees Shaikh and
Balachander Krishnamurthy and
Srinivasan Seshan
On the Responsiveness of DNS-based Network Control
Jeffrey Pang(cid:3), Aditya Akella(cid:3), Anees Shaikhy, Balachander Krishnamurthyz, Srinivasan Seshan(cid:3)
(cid:3)Computer Science Department
Carnegie Mellon University
Pittsburgh, PA 15213-3891
fjeffpang,aditya,srini+g@cs.cmu.edu
yNetwork Software and Services
IBM T.J. Watson Research Center Florham Park, NJ 07932-0971
zAT&T Labs – Research
bala@research.att.com
Hawthorne, NY 10532-2134
aashaikh@watson.ibm.com
ABSTRACT
For the last few years, large Web content providers interested in im-
proving their scalability and availability have increasingly turned
to three techniques: mirroring, content distribution, and ISP multi-
homing. The Domain Name System (DNS) has gained a prominent
role in the way each of these techniques directs client requests to
achieve the goals of scalability and availability. The DNS is thought
to offer the transparent and agile control necessary to react quickly
to ISP link failures or phenomenon such as ﬂash crowds.
In this paper, we investigate this assumption with the objective
of quantifying the degree of responsiveness that can be expected
from DNS. We use a combination of Web and DNS access mea-
surements from several busy Web sites, as well as a large content
distribution network, to characterize the behavior of end-systems
and local DNS servers in terms of their adherence to DNS-based
controls. Our results suggest that DNS is at best a coarse-grained
mechanism, and poorly suited for applications, such as route con-
trol, which require quick response to link failures or performance
degradations. We then propose several proactive techniques that,
when deployed in cooperation between large content providers and
important clients, have the potential to improve the responsiveness
of DNS-based control.
Categories and Subject ...

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


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

Output:
安全论文分析：

title:Efficient and extensible security enforcement using dynamic data flow
analysis
author:Walter Chang and
Brandon Streiff and
Calvin Lin
Efﬁcient and Extensible Security Enforcement Using
Dynamic Data Flow Analysis
Walter Chang
walter@cs.utexas.edu
Brandon Streiff
bstreiff@mail.utexas.edu
Calvin Lin
lin@cs.utexas.edu
Department of Computer Sciences
The University of Texas at Austin
Austin, TX 78712
ABSTRACT
Current taint tracking systems suffer from high overhead and a lack
of generality. In this paper, we solve both of these issues with an
extensible system that is an order of magnitude more efﬁcient than
previous software taint tracking systems and is fully general to dy-
namic data ﬂow tracking problems. Our system uses a compiler
to transform untrusted programs into policy-enforcing programs,
and our system can be easily reconﬁgured to support new analyses
and policies without modifying the compiler or runtime system.
Our system uses a sound and sophisticated static analysis that can
dramatically reduce the amount of data that must be dynamically
tracked.
For server programs, our system’s average overhead is 0.65%
for taint tracking, which is comparable to the best hardware-based
solutions. For a set of compute-bound benchmarks, our system pro-
duces no runtime overhead because our compiler can prove the ab-
sence of vulnerabilities, eliminating the need to dynamically track
taint. After modifying these benchmarks to contain format string
vulnerabilities, our system’s overhead is less than 13%, which is
over 6× lower than the previous best solutions. We demonstrate
the ﬂexibility and power of our system by applying it to ﬁle dis-
closure vulnerabilities, a problem that taint tracking cannot handle.
To prevent such vulnerabilities, our system introduces an average
runtime overhead of 0.25% for three open source server programs.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—Informa-
tion Flow Controls
General Terms
Reliab...


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

Input:
title:Efficient and extensible security enforcement using dynamic data flow
analysis
author:Walter Chang and
Brandon Streiff and
Calvin Lin
Efﬁcient and Extensible Security Enforcement Using
Dynamic Data Flow Analysis
Walter Chang
walter@cs.utexas.edu
Brandon Streiff
bstreiff@mail.utexas.edu
Calvin Lin
lin@cs.utexas.edu
Department of Computer Sciences
The University of Texas at Austin
Austin, TX 78712
ABSTRACT
Current taint tracking systems suffer from high overhead and a lack
of generality. In this paper, we solve both of these issues with an
extensible system that is an order of magnitude more efﬁcient than
previous software taint tracking systems and is fully general to dy-
namic data ﬂow tracking problems. Our system uses a compiler
to transform untrusted programs into policy-enforcing programs,
and our system can be easily reconﬁgured to support new analyses
and policies without modifying the compiler or runtime system.
Our system uses a sound and sophisticated static analysis that can
dramatically reduce the amount of data that must be dynamically
tracked.
For server programs, our system’s average overhead is 0.65%
for taint tracking, which is comparable to the best hardware-based
solutions. For a set of compute-bound benchmarks, our system pro-
duces no runtime overhead because our compiler can prove the ab-
sence of vulnerabilities, eliminating the need to dynamically track
taint. After modifying these benchmarks to contain format string
vulnerabilities, our system’s overhead is less than 13%, which is
over 6× lower than the previous best solutions. We demonstrate
the ﬂexibility and power of our system by applying it to ﬁle dis-
closure vulnerabilities, a problem that taint tracking cannot handle.
To prevent such vulnerabilities, our system introduces an average
runtime overhead of 0.25% for three open source server programs.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—Informa-
tion Flow Controls
General Terms
Reliab...

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


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

Output:
安全论文分析：

title:A Better Method to Analyze Blockchain Consistency
author:Lucianna Kiffer and
Rajmohan Rajaraman and
Abhi Shelat
A Better Method to Analyze Blockchain Consistency
Lucianna Kiffer, Rajmohan Rajaraman and abhi shelat
Northeastern University
{lkiffer,rraj}@ccs.neu.edu,a.shelat@northeastern.edu
ABSTRACT
The celebrated Nakamoto consensus protocol [16] ushered in sev-
eral new consensus applications including cryptocurrencies. A
few recent works [7, 17] have analyzed important properties of
blockchains, including most significantly, consistency, which is a
guarantee that all honest parties output the same sequence of blocks
throughout the execution of the protocol.
To establish consistency, the prior analysis of Pass, Seeman and
Shelat [17] required a careful counting of certain combinatorial
events that was difficult to apply to variations of Nakamoto. The
work of Garay, Kiayas, and Leonardas [7] provides another method
of analyzing the blockchain under the simplifying assumption that
the network was synchronous.
The contribution of this paper is the development of a simple
Markov-chain based method for analyzing consistency properties of
blockchain protocols. The method includes a formal way of stating
strong concentration bounds as well as easy ways to concretely
compute the bounds. We use our new method to answer a number
of basic questions about consistency of blockchains:
and extend them to other protocols;
• Our new analysis provides a tighter guarantee on the con-
sistency property of Nakamoto’s protocol, including for pa-
rameter regimes which [17] could not consider;
• We analyze a family of delaying attacks first presented in [17],
• We analyze how long a participant should wait before con-
• We analyze the consistency of CliqueChain, a variation of
• We provide the first rigorous consistency analysis of GHOST
sidering a high-value transaction “confirmed”;
the Chainweb [14] system;
[20] and also analyze a folklore “balancing"-attack.
In each case, we use o...


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

Input:
title:A Better Method to Analyze Blockchain Consistency
author:Lucianna Kiffer and
Rajmohan Rajaraman and
Abhi Shelat
A Better Method to Analyze Blockchain Consistency
Lucianna Kiffer, Rajmohan Rajaraman and abhi shelat
Northeastern University
{lkiffer,rraj}@ccs.neu.edu,a.shelat@northeastern.edu
ABSTRACT
The celebrated Nakamoto consensus protocol [16] ushered in sev-
eral new consensus applications including cryptocurrencies. A
few recent works [7, 17] have analyzed important properties of
blockchains, including most significantly, consistency, which is a
guarantee that all honest parties output the same sequence of blocks
throughout the execution of the protocol.
To establish consistency, the prior analysis of Pass, Seeman and
Shelat [17] required a careful counting of certain combinatorial
events that was difficult to apply to variations of Nakamoto. The
work of Garay, Kiayas, and Leonardas [7] provides another method
of analyzing the blockchain under the simplifying assumption that
the network was synchronous.
The contribution of this paper is the development of a simple
Markov-chain based method for analyzing consistency properties of
blockchain protocols. The method includes a formal way of stating
strong concentration bounds as well as easy ways to concretely
compute the bounds. We use our new method to answer a number
of basic questions about consistency of blockchains:
and extend them to other protocols;
• Our new analysis provides a tighter guarantee on the con-
sistency property of Nakamoto’s protocol, including for pa-
rameter regimes which [17] could not consider;
• We analyze a family of delaying attacks first presented in [17],
• We analyze how long a participant should wait before con-
• We analyze the consistency of CliqueChain, a variation of
• We provide the first rigorous consistency analysis of GHOST
sidering a high-value transaction “confirmed”;
the Chainweb [14] system;
[20] and also analyze a folklore “balancing"-attack.
In each case, we use o...

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


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

Output:
安全论文分析：

title:Automatic metadata generation for active measurement
author:Joel Sommers and
Ramakrishnan Durairajan and
Paul Barford
Automatic Metadata Generation for Active Measurement
Joel Sommers
Colgate University
jsommers@colgate.edu
Ramakrishnan Durairajan
University of Oregon
ram@cs.uoregon.edu
University of Wisconsin-Madison
Paul Barford
comScore, Inc.
pb@cs.wisc.edu
ABSTRACT
Empirical research in the Internet is fraught with challenges. Among
these is the possibility that local environmental conditions (e.g.,
CPU load or network load) introduce unexpected bias or artifacts
in measurements that lead to erroneous conclusions. In this paper,
we describe a framework for local environment monitoring that is
designed to be used during Internet measurement experiments. The
goals of our work are to provide a critical, expanded perspective
on measurement results and to improve the opportunity for repro-
ducibility of results. We instantiate our framework in a tool we
call SoMeta, which monitors the local environment during active
probe-based measurement experiments. We evaluate the runtime
costs of SoMeta and conduct a series of experiments in which we
intentionally perturb different aspects of the local environment
during active probe-based measurements. Our experiments show
how simple local monitoring can readily expose conditions that
bias active probe-based measurement results. We conclude with
a discussion of how our framework can be expanded to provide
metadata for a broad range of Internet measurement experiments.
CCS CONCEPTS
• Networks → Network experimentation; Network measure-
ment;
KEYWORDS
network measurement, metadata
ACM Reference Format:
Joel Sommers, Ramakrishnan Durairajan, and Paul Barford. 2017. Automatic
Metadata Generation for Active Measurement. In Proceedings of IMC ’17,
London, United Kingdom, November 1–3, 2017, 7 pages.
https://doi.org/10.1145/3131365.3131400
1 INTRODUCTION
Active probe-based measurements have been widely used to eluci-
date Intern...


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

Input:
title:Automatic metadata generation for active measurement
author:Joel Sommers and
Ramakrishnan Durairajan and
Paul Barford
Automatic Metadata Generation for Active Measurement
Joel Sommers
Colgate University
jsommers@colgate.edu
Ramakrishnan Durairajan
University of Oregon
ram@cs.uoregon.edu
University of Wisconsin-Madison
Paul Barford
comScore, Inc.
pb@cs.wisc.edu
ABSTRACT
Empirical research in the Internet is fraught with challenges. Among
these is the possibility that local environmental conditions (e.g.,
CPU load or network load) introduce unexpected bias or artifacts
in measurements that lead to erroneous conclusions. In this paper,
we describe a framework for local environment monitoring that is
designed to be used during Internet measurement experiments. The
goals of our work are to provide a critical, expanded perspective
on measurement results and to improve the opportunity for repro-
ducibility of results. We instantiate our framework in a tool we
call SoMeta, which monitors the local environment during active
probe-based measurement experiments. We evaluate the runtime
costs of SoMeta and conduct a series of experiments in which we
intentionally perturb different aspects of the local environment
during active probe-based measurements. Our experiments show
how simple local monitoring can readily expose conditions that
bias active probe-based measurement results. We conclude with
a discussion of how our framework can be expanded to provide
metadata for a broad range of Internet measurement experiments.
CCS CONCEPTS
• Networks → Network experimentation; Network measure-
ment;
KEYWORDS
network measurement, metadata
ACM Reference Format:
Joel Sommers, Ramakrishnan Durairajan, and Paul Barford. 2017. Automatic
Metadata Generation for Active Measurement. In Proceedings of IMC ’17,
London, United Kingdom, November 1–3, 2017, 7 pages.
https://doi.org/10.1145/3131365.3131400
1 INTRODUCTION
Active probe-based measurements have been widely used to eluci-
date Intern...

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


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

Output:
安全论文分析：

title:A resource-minimalist flow size histogram estimator
author:Bruno F. Ribeiro and
Tao Ye and
Donald F. Towsley
A Resource-minimalist Flow Size Histogram Estimator
Bruno Ribeiro
Computer Science
Department
University of Massachusetts
Amherst, MA, 01003
ribeiro@cs.umass.edu
Tao Ye
Sprint
Burlingame, CA, 94010
Tao.Ye@sprint.com
Don Towsley
Computer Science
Department
University of Massachusetts
Amherst, MA, 01003
towsley@cs.umass.edu
ABSTRACT
The histogram of network ﬂow sizes is an important yet
diﬃcult metric to estimate in network monitoring. It is im-
portant because it characterizes traﬃc compositions and is
a crucial component of anomaly detection methods.
It is
diﬃcult to estimate because of its high memory and com-
putational requirements. Existing algorithms compute ﬁne
grained estimates for each ﬂow size, i.e. 1, 2,. . . up to the
maximum number observed over a ﬁnite time interval. Our
approach instead relies on the insight that, while many ap-
plications require ﬁne grained estimates of small ﬂow sizes,
i.e. {1, 2, . . . , k} with a small k, network operators are of-
ten only interested in coarse grained estimates of larger ﬂow
sizes. Thus, we propose an estimator that outputs a binned
histogram of size distributions. Our estimator computes
this histogram in O(k3 + log W ) operations, where W is the
largest ﬂow size of interest to the network operator, while
requiring only a few bits of memory per measured ﬂow. This
translates into more than 4 fold memory savings and an ex-
ponential speedup in the estimator as compared to previous
works, greatly increasing the possibility of performing on-
line estimation inside a router.
Categories and Subject Descriptors
C.2.3 [Network Operations]: Network monitoring; G.3
[Probability and Statistics]: Nonparametric statistics
General Terms
Design, Measurement
Keywords
Monitoring Systems, Sampling Methods, Data Stream Al-
gorithms, Flow Size Histogram
1.
INTRODUCTION
Measuring the histogram of network ﬂow sizes has bee...


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

Input:
title:A resource-minimalist flow size histogram estimator
author:Bruno F. Ribeiro and
Tao Ye and
Donald F. Towsley
A Resource-minimalist Flow Size Histogram Estimator
Bruno Ribeiro
Computer Science
Department
University of Massachusetts
Amherst, MA, 01003
ribeiro@cs.umass.edu
Tao Ye
Sprint
Burlingame, CA, 94010
Tao.Ye@sprint.com
Don Towsley
Computer Science
Department
University of Massachusetts
Amherst, MA, 01003
towsley@cs.umass.edu
ABSTRACT
The histogram of network ﬂow sizes is an important yet
diﬃcult metric to estimate in network monitoring. It is im-
portant because it characterizes traﬃc compositions and is
a crucial component of anomaly detection methods.
It is
diﬃcult to estimate because of its high memory and com-
putational requirements. Existing algorithms compute ﬁne
grained estimates for each ﬂow size, i.e. 1, 2,. . . up to the
maximum number observed over a ﬁnite time interval. Our
approach instead relies on the insight that, while many ap-
plications require ﬁne grained estimates of small ﬂow sizes,
i.e. {1, 2, . . . , k} with a small k, network operators are of-
ten only interested in coarse grained estimates of larger ﬂow
sizes. Thus, we propose an estimator that outputs a binned
histogram of size distributions. Our estimator computes
this histogram in O(k3 + log W ) operations, where W is the
largest ﬂow size of interest to the network operator, while
requiring only a few bits of memory per measured ﬂow. This
translates into more than 4 fold memory savings and an ex-
ponential speedup in the estimator as compared to previous
works, greatly increasing the possibility of performing on-
line estimation inside a router.
Categories and Subject Descriptors
C.2.3 [Network Operations]: Network monitoring; G.3
[Probability and Statistics]: Nonparametric statistics
General Terms
Design, Measurement
Keywords
Monitoring Systems, Sampling Methods, Data Stream Al-
gorithms, Flow Size Histogram
1.
INTRODUCTION
Measuring the histogram of network ﬂow sizes has bee...

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


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

Output:
安全论文分析：

title:ATTAIN: An Attack Injection Framework for Software-Defined Networking
author:Benjamin E. Ujcich and
Uttam Thakore and
William H. Sanders
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
ATTAIN: An Attack Injection Framework for
Software-Deﬁned Networking
Benjamin E. Ujcich∗†, Uttam Thakore∗‡, and William H. Sanders∗†
∗Information Trust Institute, †Department of Electrical and Computer Engineering, ‡Department of Computer Science
University of Illinois at Urbana–Champaign
Email: {ujcich2, thakore1, whs}@illinois.edu
Urbana, Illinois USA
Abstract—Software-deﬁned networking (SDN) has recently
attracted interest as a way to provide cyber resiliency because
of its programmable and logically centralized nature. However,
the security of the SDN architecture itself against malicious
attacks is not well understood and must be ensured in order
to provide cyber resiliency to systems that use SDNs. In this
paper, we present ATTAIN, an attack injection framework for
OpenFlow-based SDN architectures. First, we deﬁne an attack
model that relates system components to an attacker’s capability
to inﬂuence control plane behavior. Second, we deﬁne an attack
language for writing control plane attacks that can be used to
evaluate SDN implementations. Third, we describe an attack
injector architecture that actuates attacks in networks. Finally,
we evaluate our framework with an enterprise network case study
by writing and running attacks with popular SDN controllers.
I. INTRODUCTION
Software-deﬁned networking (SDN) has seen widespread
use in settings such as research networks, enterprise networks
and data center and cloud networks, among others [1]. SDN
decouples control protocol messages that represent how the
end host trafﬁc should be forwarded (i.e., the control plane)
from the end host trafﬁc itself (i.e., the data plane), and it
centralizes forwarding decisions through programmable con-
trollers for network service and application integrati...


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

Input:
title:ATTAIN: An Attack Injection Framework for Software-Defined Networking
author:Benjamin E. Ujcich and
Uttam Thakore and
William H. Sanders
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
ATTAIN: An Attack Injection Framework for
Software-Deﬁned Networking
Benjamin E. Ujcich∗†, Uttam Thakore∗‡, and William H. Sanders∗†
∗Information Trust Institute, †Department of Electrical and Computer Engineering, ‡Department of Computer Science
University of Illinois at Urbana–Champaign
Email: {ujcich2, thakore1, whs}@illinois.edu
Urbana, Illinois USA
Abstract—Software-deﬁned networking (SDN) has recently
attracted interest as a way to provide cyber resiliency because
of its programmable and logically centralized nature. However,
the security of the SDN architecture itself against malicious
attacks is not well understood and must be ensured in order
to provide cyber resiliency to systems that use SDNs. In this
paper, we present ATTAIN, an attack injection framework for
OpenFlow-based SDN architectures. First, we deﬁne an attack
model that relates system components to an attacker’s capability
to inﬂuence control plane behavior. Second, we deﬁne an attack
language for writing control plane attacks that can be used to
evaluate SDN implementations. Third, we describe an attack
injector architecture that actuates attacks in networks. Finally,
we evaluate our framework with an enterprise network case study
by writing and running attacks with popular SDN controllers.
I. INTRODUCTION
Software-deﬁned networking (SDN) has seen widespread
use in settings such as research networks, enterprise networks
and data center and cloud networks, among others [1]. SDN
decouples control protocol messages that represent how the
end host trafﬁc should be forwarded (i.e., the control plane)
from the end host trafﬁc itself (i.e., the data plane), and it
centralizes forwarding decisions through programmable con-
trollers for network service and application integrati...

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


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

Output:
安全论文分析：

title:Towards Understanding and Detecting Cyberbullying in Real-world Images
author:Nishant Vishwamitra and
Hongxin Hu and
Feng Luo and
Long Cheng
Towards Understanding and Detecting Cyberbullying
in Real-world Images
Nishant Vishwamitra∗, Hongxin Hu∗, Feng Luo† and Long Cheng†
∗Computer Science and Engineering, University at Buffalo
Email: ∗{nvishwam, hongxinh}@buffalo.edu, †{luofeng, lcheng2}@clemson.edu
†School of Computing, Clemson University
Abstract—Cyberbullying has become widely recognized as
a critical social problem plaguing today’s Internet users. This
problem involves perpetrators using Internet-based technologies
to bully their victims by sharing cyberbullying-related content.
To combat this problem, researchers have studied the factors
associated with such content and proposed automatic detection
techniques based on those factors. However, most of these studies
have mainly focused on understanding the factors of textual
content, such as comments and text messages, while largely over-
looking the misuse of visual content in perpetrating cyberbullying.
Recent technological advancements in the way users access the
Internet have led to a new cyberbullying paradigm. Perpetrators
can use visual media to bully their victims through sending and
distributing images with cyberbullying content. As a ﬁrst step to
understand the threat of cyberbullying in images, we report in
this paper a comprehensive study on the nature of images used in
cyberbullying. We ﬁrst collect a real-world cyberbullying images
dataset with 19,300 valid images. We then analyze the images
in our dataset and identify the factors related to cyberbullying
images that can be used to build systems to detect cyberbullying
in images. Our analysis of factors in cyberbullying images reveals
that unlike traditional offensive image content (e.g., violence and
nudity), the factors in cyberbullying images tend to be highly
contextual. We further demonstrate the effectiveness of the factors
by measuring ...


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

Input:
title:Towards Understanding and Detecting Cyberbullying in Real-world Images
author:Nishant Vishwamitra and
Hongxin Hu and
Feng Luo and
Long Cheng
Towards Understanding and Detecting Cyberbullying
in Real-world Images
Nishant Vishwamitra∗, Hongxin Hu∗, Feng Luo† and Long Cheng†
∗Computer Science and Engineering, University at Buffalo
Email: ∗{nvishwam, hongxinh}@buffalo.edu, †{luofeng, lcheng2}@clemson.edu
†School of Computing, Clemson University
Abstract—Cyberbullying has become widely recognized as
a critical social problem plaguing today’s Internet users. This
problem involves perpetrators using Internet-based technologies
to bully their victims by sharing cyberbullying-related content.
To combat this problem, researchers have studied the factors
associated with such content and proposed automatic detection
techniques based on those factors. However, most of these studies
have mainly focused on understanding the factors of textual
content, such as comments and text messages, while largely over-
looking the misuse of visual content in perpetrating cyberbullying.
Recent technological advancements in the way users access the
Internet have led to a new cyberbullying paradigm. Perpetrators
can use visual media to bully their victims through sending and
distributing images with cyberbullying content. As a ﬁrst step to
understand the threat of cyberbullying in images, we report in
this paper a comprehensive study on the nature of images used in
cyberbullying. We ﬁrst collect a real-world cyberbullying images
dataset with 19,300 valid images. We then analyze the images
in our dataset and identify the factors related to cyberbullying
images that can be used to build systems to detect cyberbullying
in images. Our analysis of factors in cyberbullying images reveals
that unlike traditional offensive image content (e.g., violence and
nudity), the factors in cyberbullying images tend to be highly
contextual. We further demonstrate the effectiveness of the factors
by measuring ...

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


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

Output:
安全论文分析：

title:Improving Tor using a TCP-over-DTLS Tunnel
author:Joel Reardon and
Ian Goldberg
Improving Tor using a TCP-over-DTLS Tunnel
Joel Reardon∗
Google Switzerland GmbH
Brandschenkestrasse 110
Z¨urich, Switzerland
Ian Goldberg
University of Waterloo
200 University Ave W.
Waterloo, ON, Canada
reardon@google.com
iang@cs.uwaterloo.ca
Abstract
The Tor network gives anonymity to Internet users by re-
laying their trafﬁc through the world over a variety of
routers. All trafﬁc between any pair of routers, even
if they represent circuits for different clients, are mul-
tiplexed over a single TCP connection. This results in
interference across circuits during congestion control,
packet dropping and packet reordering. This interference
greatly contributes to Tor’s notorious latency problems.
Our solution is to use a TCP-over-DTLS (Datagram
Transport Layer Security) transport between routers. We
give each stream of data its own TCP connection, and
protect the TCP headers—which would otherwise give
stream identiﬁcation information to an attacker—with
DTLS. We perform experiments on our implemented
version to illustrate that our proposal has indeed resolved
the cross-circuit interference.
1 Introduction
Tor [2] is a tool to enable Internet privacy that has seen
widespread use and popularity throughout the world.
Tor consists of a network of thousands of nodes—
known as Onion Routers (ORs)—whose operators have
volunteered to relay Internet trafﬁc around the world.
Clients—known as Onion Proxies (OPs)—build circuits
through ORs in the network to dispatch their trafﬁc. Tor’s
goal is to frustrate an attacker who aims to match up
the identities of the clients with the actions they are per-
forming. Despite its popularity, Tor has a problem that
dissuades its ubiquitous application—it imposes greater
latency on its users than they would experience without
Tor.
While some increased latency is inevitable due to the
increased network path length, our experiments show
that this effect is no...


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

Input:
title:Improving Tor using a TCP-over-DTLS Tunnel
author:Joel Reardon and
Ian Goldberg
Improving Tor using a TCP-over-DTLS Tunnel
Joel Reardon∗
Google Switzerland GmbH
Brandschenkestrasse 110
Z¨urich, Switzerland
Ian Goldberg
University of Waterloo
200 University Ave W.
Waterloo, ON, Canada
reardon@google.com
iang@cs.uwaterloo.ca
Abstract
The Tor network gives anonymity to Internet users by re-
laying their trafﬁc through the world over a variety of
routers. All trafﬁc between any pair of routers, even
if they represent circuits for different clients, are mul-
tiplexed over a single TCP connection. This results in
interference across circuits during congestion control,
packet dropping and packet reordering. This interference
greatly contributes to Tor’s notorious latency problems.
Our solution is to use a TCP-over-DTLS (Datagram
Transport Layer Security) transport between routers. We
give each stream of data its own TCP connection, and
protect the TCP headers—which would otherwise give
stream identiﬁcation information to an attacker—with
DTLS. We perform experiments on our implemented
version to illustrate that our proposal has indeed resolved
the cross-circuit interference.
1 Introduction
Tor [2] is a tool to enable Internet privacy that has seen
widespread use and popularity throughout the world.
Tor consists of a network of thousands of nodes—
known as Onion Routers (ORs)—whose operators have
volunteered to relay Internet trafﬁc around the world.
Clients—known as Onion Proxies (OPs)—build circuits
through ORs in the network to dispatch their trafﬁc. Tor’s
goal is to frustrate an attacker who aims to match up
the identities of the clients with the actions they are per-
forming. Despite its popularity, Tor has a problem that
dissuades its ubiquitous application—it imposes greater
latency on its users than they would experience without
Tor.
While some increased latency is inevitable due to the
increased network path length, our experiments show
that this effect is no...

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


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

Output:
安全论文分析：

title:An Adaptive Decomposition Approach for the Analysis of Stochastic
Petri Nets
author:Peter Buchholz
An Adaptive Decomposition Approach for the Analysis of Stochastic Petri Nets
Institute for Applied Computer Science, Dresden University of Technology, D-01062 Dresden, Germany
p.buchholz@inf.tu-dresden.de
Peter Buchholz
Abstract
We present a new approximate solution technique for the
numerical analysis of superposed generalized stochastic
Petri nets (SGSPNs) and related models. The approach
combines numerical iterative solution techniques and ﬁxed
point computations using the complete knowledge of state
space and generator matrix. In contrast to other approxi-
mation methods, the proposed method is adaptive by con-
sidering states with a high probability in detail and aggre-
gating states with small probabilities. Probabilities are ap-
proximated by the results derived during the iterative solu-
tion. Thus, a maximum number of states can be predeﬁned
and the presented method automatically aggregates states
such that the solution is computed using a vector of a size
smaller or equal to the maximum. By means of a non-trivial
example it is shown that the approach computes good ap-
proximations with a low effort for many models.
1. Introduction
Stochastic Petri nets (SPNs) and their variants like GSPNs
[1] are important model types to describe discrete event sys-
tems and to analyze them according to their performance,
dependability or performability. Often the long run behav-
ior of a system is analyzed which results in the computa-
tion of the stationary distribution of the continuous time
Markov chain (CTMC) underlying a (G)SPN. Three differ-
ent classes of solution approaches exist to analyze (G)SPNs
or the underlying CTMCs. First, the (G)SPN can be used as
a speciﬁcation of a simulation model and discrete event sim-
ulation can be applied to obtain estimates for the required
results [18]. The advantage of this approach is the general
applicability and ﬂexibility...


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

Input:
title:An Adaptive Decomposition Approach for the Analysis of Stochastic
Petri Nets
author:Peter Buchholz
An Adaptive Decomposition Approach for the Analysis of Stochastic Petri Nets
Institute for Applied Computer Science, Dresden University of Technology, D-01062 Dresden, Germany
p.buchholz@inf.tu-dresden.de
Peter Buchholz
Abstract
We present a new approximate solution technique for the
numerical analysis of superposed generalized stochastic
Petri nets (SGSPNs) and related models. The approach
combines numerical iterative solution techniques and ﬁxed
point computations using the complete knowledge of state
space and generator matrix. In contrast to other approxi-
mation methods, the proposed method is adaptive by con-
sidering states with a high probability in detail and aggre-
gating states with small probabilities. Probabilities are ap-
proximated by the results derived during the iterative solu-
tion. Thus, a maximum number of states can be predeﬁned
and the presented method automatically aggregates states
such that the solution is computed using a vector of a size
smaller or equal to the maximum. By means of a non-trivial
example it is shown that the approach computes good ap-
proximations with a low effort for many models.
1. Introduction
Stochastic Petri nets (SPNs) and their variants like GSPNs
[1] are important model types to describe discrete event sys-
tems and to analyze them according to their performance,
dependability or performability. Often the long run behav-
ior of a system is analyzed which results in the computa-
tion of the stationary distribution of the continuous time
Markov chain (CTMC) underlying a (G)SPN. Three differ-
ent classes of solution approaches exist to analyze (G)SPNs
or the underlying CTMCs. First, the (G)SPN can be used as
a speciﬁcation of a simulation model and discrete event sim-
ulation can be applied to obtain estimates for the required
results [18]. The advantage of this approach is the general
applicability and ﬂexibility...

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


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

Output:
安全论文分析：

title:PriMa: an effective privacy protection mechanism for social networks
author:Anna Cinzia Squicciarini and
Federica Paci and
Smitha Sundareswaran
PriMa: An Effective Privacy Protection Mechanism for
Social Networks
Anna Squicciarini
College of Information
Sciences and Technology
The Pennsylvania State
University, USA
acs20@psu.edu
Federica Paci
Department of Information
Engineering and Computer
Science
University of Trento,
Trento,Italy
paci@disi.unitn.it
Smitha Sundareswaran
College of Information
Sciences and Technology
The Pennsylvania State
University, USA
sus263@psu.edu
ABSTRACT
In this paper, we propose PriMa (Privacy Manager), a privacy pro-
tection mechanism which supports semi-automated generation of
access rules for users’ proﬁle information. PriMa access rules are
tailored by the users’ privacy preferences for their proﬁle data, the
sensitivity of the data itself, and the objective risk of disclosing this
data to other users. The resulting rules are simple, yet powerful
speciﬁcations indicating the adequate level of protection for each
user, and are dynamically adapted to the ever changing setting of
the users’ preferences and SN conﬁguration.
1.
INTRODUCTION
Web 2.0 revolutionizes how people store and share personal data,
allowing for pervasive sharing of personal information on the web.
This change has multi-faceted implications, especially on privacy.
End users, are often unaware of the size or nature of the audience
that could potentially access their data. These issues are partic-
ularly pronounced in Social Network sites (SNs from now on),
where the false sense of intimacy amongst digital friends often
leads to potentially risky disclosures of private data.
Privacy in SNs can be compromised in several ways, by steal-
ing proﬁles’ data, observing the SN graph and by cross-correlating
distributed proﬁles that belongs to multiple sites [19, 7]. One of
the main threats to the users’ privacy stems from accidental disclo-
sures of data. For example, d...


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

Input:
title:PriMa: an effective privacy protection mechanism for social networks
author:Anna Cinzia Squicciarini and
Federica Paci and
Smitha Sundareswaran
PriMa: An Effective Privacy Protection Mechanism for
Social Networks
Anna Squicciarini
College of Information
Sciences and Technology
The Pennsylvania State
University, USA
acs20@psu.edu
Federica Paci
Department of Information
Engineering and Computer
Science
University of Trento,
Trento,Italy
paci@disi.unitn.it
Smitha Sundareswaran
College of Information
Sciences and Technology
The Pennsylvania State
University, USA
sus263@psu.edu
ABSTRACT
In this paper, we propose PriMa (Privacy Manager), a privacy pro-
tection mechanism which supports semi-automated generation of
access rules for users’ proﬁle information. PriMa access rules are
tailored by the users’ privacy preferences for their proﬁle data, the
sensitivity of the data itself, and the objective risk of disclosing this
data to other users. The resulting rules are simple, yet powerful
speciﬁcations indicating the adequate level of protection for each
user, and are dynamically adapted to the ever changing setting of
the users’ preferences and SN conﬁguration.
1.
INTRODUCTION
Web 2.0 revolutionizes how people store and share personal data,
allowing for pervasive sharing of personal information on the web.
This change has multi-faceted implications, especially on privacy.
End users, are often unaware of the size or nature of the audience
that could potentially access their data. These issues are partic-
ularly pronounced in Social Network sites (SNs from now on),
where the false sense of intimacy amongst digital friends often
leads to potentially risky disclosures of private data.
Privacy in SNs can be compromised in several ways, by steal-
ing proﬁles’ data, observing the SN graph and by cross-correlating
distributed proﬁles that belongs to multiple sites [19, 7]. One of
the main threats to the users’ privacy stems from accidental disclo-
sures of data. For example, d...

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


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

Output:
安全论文分析：

title:OpenBox: A Software-Defined Framework for Developing, Deploying,
and Managing Network Functions
author:Anat Bremler-Barr and
Yotam Harchol and
David Hay
OpenBox: A Software-Deﬁned Framework for
Developing, Deploying, and Managing
Network Functions
Anat Bremler-Barr ∗
bremler@idc.ac.il
dhay@cs.huji.ac.il
∗ School of Computer Science, The Interdisciplinary Center, Herzliya, Israel
yotamhc@cs.huji.ac.il
† School of Computer Science and Engineering, The Hebrew University, Jerusalem, Israel
Yotam Harchol †
David Hay†
ABSTRACT
We present OpenBox — a software-deﬁned framework
for network-wide development, deployment, and man-
agement of network functions (NFs). OpenBox eﬀec-
tively decouples the control plane of NFs from their data
plane, similarly to SDN solutions that only address the
network’s forwarding plane.
OpenBox consists of three logic components. First,
user-deﬁned OpenBox applications provide NF speciﬁ-
cations through the OpenBox north-bound API. Sec-
ond, a logically-centralized OpenBox controller is able
to merge logic of multiple NFs, possibly from multiple
tenants, and to use a network-wide view to eﬃciently
deploy and scale NFs across the network data plane.
Finally, OpenBox instances constitute OpenBox’s data
plane and are implemented either purely in software or
contain speciﬁc hardware accelerators (e.g., a TCAM).
In practice, diﬀerent NFs carry out similar process-
ing steps on the same packet, and our experiments in-
deed show a signiﬁcant improvement of the network per-
formance when using OpenBox. Moreover, OpenBox
readily supports smart NF placement, NF scaling, and
multi-tenancy through its controller.
CCS Concepts
•Networks → Middle boxes / network appliances;
Programming interfaces; Network control algorithms;
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or
distributed for proﬁt or commercial advantage and that copies bear this ...


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

Input:
title:OpenBox: A Software-Defined Framework for Developing, Deploying,
and Managing Network Functions
author:Anat Bremler-Barr and
Yotam Harchol and
David Hay
OpenBox: A Software-Deﬁned Framework for
Developing, Deploying, and Managing
Network Functions
Anat Bremler-Barr ∗
bremler@idc.ac.il
dhay@cs.huji.ac.il
∗ School of Computer Science, The Interdisciplinary Center, Herzliya, Israel
yotamhc@cs.huji.ac.il
† School of Computer Science and Engineering, The Hebrew University, Jerusalem, Israel
Yotam Harchol †
David Hay†
ABSTRACT
We present OpenBox — a software-deﬁned framework
for network-wide development, deployment, and man-
agement of network functions (NFs). OpenBox eﬀec-
tively decouples the control plane of NFs from their data
plane, similarly to SDN solutions that only address the
network’s forwarding plane.
OpenBox consists of three logic components. First,
user-deﬁned OpenBox applications provide NF speciﬁ-
cations through the OpenBox north-bound API. Sec-
ond, a logically-centralized OpenBox controller is able
to merge logic of multiple NFs, possibly from multiple
tenants, and to use a network-wide view to eﬃciently
deploy and scale NFs across the network data plane.
Finally, OpenBox instances constitute OpenBox’s data
plane and are implemented either purely in software or
contain speciﬁc hardware accelerators (e.g., a TCAM).
In practice, diﬀerent NFs carry out similar process-
ing steps on the same packet, and our experiments in-
deed show a signiﬁcant improvement of the network per-
formance when using OpenBox. Moreover, OpenBox
readily supports smart NF placement, NF scaling, and
multi-tenancy through its controller.
CCS Concepts
•Networks → Middle boxes / network appliances;
Programming interfaces; Network control algorithms;
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or
distributed for proﬁt or commercial advantage and that copies bear this ...

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


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

Output:
安全论文分析：

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...


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: 这篇论文提供了重要的安全研究见解，对网络安全防护具有指导意义。