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

Input:
title:Coming of Age: A Longitudinal Study of TLS Deployment
author:Platon Kotzias and
Abbas Razaghpanah and
Johanna Amann and
Kenneth G. Paterson and
Narseo Vallina-Rodriguez and
Juan Caballero
Coming of Age: A Longitudinal Study of TLS Deployment
Platon Kotzias
IMDEA Software Institute
Universidad Politécnica de Madrid
Abbas Razaghpanah
Stony Brook University
Johanna Amann
ICSI/Corelight/LBNL
Kenneth G. Paterson
Royal Holloway, University of London
Narseo Vallina-Rodriguez
IMDEA Networks Institute
ICSI
Juan Caballero
IMDEA Software Institue
ABSTRACT
The Transport Layer Security (TLS) protocol is the de-facto standard
for encrypted communication on the Internet. However, it has been
plagued by a number of different attacks and security issues over
the last years. Addressing these attacks requires changes to the
protocol, to server- or client-software, or to all of them. In this
paper we conduct the first large-scale longitudinal study examining
the evolution of the TLS ecosystem over the last six years. We
place a special focus on the ecosystem’s evolution in response to
high-profile attacks.
For our analysis, we use a passive measurement dataset with
more than 319.3B connections since February 2012, and an active
dataset that contains TLS and SSL scans of the entire IPv4 address
space since August 2015. To identify the evolution of specific clients
we also create the—to our knowledge—largest TLS client fingerprint
database to date, consisting of 1,684 fingerprints.
We observe that the ecosystem has shifted significantly since
2012, with major changes in which cipher suites and TLS extensions
are offered by clients and accepted by servers having taken place.
Where possible, we correlate these with the timing of specific at-
tacks on TLS. At the same time, our results show that while clients,
especially browsers, are quick to adopt new algorithms, they are
also slow to drop support for older ones. We also encounter signif-
icant amounts of client software that probab...

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


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

Output:
安全论文分析：

title:Attribute-Based Encryption in the Generic Group Model: Automated Proofs
and New Constructions
author:Miguel Ambrona and
Gilles Barthe and
Romain Gay and
Hoeteck Wee
A(cid:130)ribute-Based Encryption in the Generic Group Model:
Automated Proofs and New Constructions
Miguel Ambrona
Gilles Barthe
IMDEA So(cid:137)ware Institute, Madrid, Spain
Universidad Polit´ecnica de Madrid, Spain
IMDEA So(cid:137)ware Institute, Madrid, Spain
Romain Gay
ENS, Paris, France
Hoeteck Wee
CNRS, France
ENS, Paris, France
ABSTRACT
A(cid:139)ribute-based encryption (ABE) is a cryptographic primitive which
supports (cid:128)ne-grained access control on encrypted data, making
it an appealing building block for many applications. In this pa-
per, we propose, implement, and evaluate fully automated methods
for proving security of ABE in the Generic Bilinear Group Model
(Boneh, Boyen, and Goh, 2005, Boyen, 2008), an idealized model
which admits simpler and more e(cid:129)cient constructions, and can
also be used to (cid:128)nd a(cid:139)acks. Our method is applicable to Rational-
Fraction Induced ABE, a large class of ABE that contains most of the
schemes from the literature, and relies on a Master (cid:145)eorem, which
reduces security in the GGM to a (new) notion of symbolic security,
which is amenable to automated veri(cid:128)cation using constraint-based
techniques. We relate our notion of symbolic security for Rational-
Fraction Induced ABE to prior notions for Pair Encodings. Finally,
we present several applications, including automated proofs for
new schemes.
CCS CONCEPTS
•Security and privacy → Mathematical foundations of cryp-
tography; Formal security models; Logic and veri(cid:128)cation;
KEYWORDS
automated proofs, symbolic security, a(cid:139)ribute-based encryption,
generic group model
1 INTRODUCTION
Computer-aided cryptography [18] is an emerging approach that
advocates using automated tools based on formal methods for ana-
lyzing the security of cryptographic schemes and t...


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

Input:
title:Attribute-Based Encryption in the Generic Group Model: Automated Proofs
and New Constructions
author:Miguel Ambrona and
Gilles Barthe and
Romain Gay and
Hoeteck Wee
A(cid:130)ribute-Based Encryption in the Generic Group Model:
Automated Proofs and New Constructions
Miguel Ambrona
Gilles Barthe
IMDEA So(cid:137)ware Institute, Madrid, Spain
Universidad Polit´ecnica de Madrid, Spain
IMDEA So(cid:137)ware Institute, Madrid, Spain
Romain Gay
ENS, Paris, France
Hoeteck Wee
CNRS, France
ENS, Paris, France
ABSTRACT
A(cid:139)ribute-based encryption (ABE) is a cryptographic primitive which
supports (cid:128)ne-grained access control on encrypted data, making
it an appealing building block for many applications. In this pa-
per, we propose, implement, and evaluate fully automated methods
for proving security of ABE in the Generic Bilinear Group Model
(Boneh, Boyen, and Goh, 2005, Boyen, 2008), an idealized model
which admits simpler and more e(cid:129)cient constructions, and can
also be used to (cid:128)nd a(cid:139)acks. Our method is applicable to Rational-
Fraction Induced ABE, a large class of ABE that contains most of the
schemes from the literature, and relies on a Master (cid:145)eorem, which
reduces security in the GGM to a (new) notion of symbolic security,
which is amenable to automated veri(cid:128)cation using constraint-based
techniques. We relate our notion of symbolic security for Rational-
Fraction Induced ABE to prior notions for Pair Encodings. Finally,
we present several applications, including automated proofs for
new schemes.
CCS CONCEPTS
•Security and privacy → Mathematical foundations of cryp-
tography; Formal security models; Logic and veri(cid:128)cation;
KEYWORDS
automated proofs, symbolic security, a(cid:139)ribute-based encryption,
generic group model
1 INTRODUCTION
Computer-aided cryptography [18] is an emerging approach that
advocates using automated tools based on formal methods for ana-
lyzing the security of cryptographic schemes and t...

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


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

Output:
安全论文分析：

title:SymPLFIED: Symbolic program-level fault injection and error detection
framework
author:Karthik Pattabiraman and
Nithin Nakka and
Zbigniew Kalbarczyk and
Ravishankar K. Iyer
International Conference on Dependable Systems & Networks: Anchorage, Alaska, June 24-27 2008
SymPLFIED: Symbolic Program-Level Fault Injection
and Error Detection Framework
Karthik Pattabiraman, Nithin Nakka, Zbigniew Kalbarczyk, and Ravishanka~ Iyer
Coordinated Science Laboratory, University of Illinois at Urbana-ChampaIgn
{pattabir, nakka, kalbarcz, rkiyer}@uiuc.edu
Abstract
This paper introduces SymPLFIED, a program(cid:173)
level framework that allows specification of arbitrary
error detectors and the verification of their efficacy
SymPLFIED comprehen(cid:173)
against hardware errors.
sively enumerates all
transient hardware errors in
registers, memory, and computation (expressed as
value errors)
that potentially evade detection and
cause program failure. The framework uses symbolic
execution to abstract the state of erroneous values in
the program and model checking to comprehensively
find all errors that evade detection. We demonstrate
the use of SymPLFIED on a widely deployed aircraft
collision avoidance application, tcas. Our results show
that the SymPLFIED framework can be used to un(cid:173)
cover hard-to-detect corner cases caused by transient
errors in programs that may not be exposed by ran(cid:173)
dom fault-injection based validation.
Keywords: Dependability validation, Fault injection,
Symbolic execution, Error detectors, Model checking.
1
Introduction
Error detection mechanisms are vital for building
highly reliable systems. There has been significant
work on efficiently placing and deriving error detec(cid:173)
tors for programs [1]. An important challenge is to
enumerate the set of errors the mechanism fails to
detect, from either a known set or an unknown set.
Typically, verification techniques target the defin~d
set of errors the detector is supposed to detect. WhIle
t...


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

Input:
title:SymPLFIED: Symbolic program-level fault injection and error detection
framework
author:Karthik Pattabiraman and
Nithin Nakka and
Zbigniew Kalbarczyk and
Ravishankar K. Iyer
International Conference on Dependable Systems & Networks: Anchorage, Alaska, June 24-27 2008
SymPLFIED: Symbolic Program-Level Fault Injection
and Error Detection Framework
Karthik Pattabiraman, Nithin Nakka, Zbigniew Kalbarczyk, and Ravishanka~ Iyer
Coordinated Science Laboratory, University of Illinois at Urbana-ChampaIgn
{pattabir, nakka, kalbarcz, rkiyer}@uiuc.edu
Abstract
This paper introduces SymPLFIED, a program(cid:173)
level framework that allows specification of arbitrary
error detectors and the verification of their efficacy
SymPLFIED comprehen(cid:173)
against hardware errors.
sively enumerates all
transient hardware errors in
registers, memory, and computation (expressed as
value errors)
that potentially evade detection and
cause program failure. The framework uses symbolic
execution to abstract the state of erroneous values in
the program and model checking to comprehensively
find all errors that evade detection. We demonstrate
the use of SymPLFIED on a widely deployed aircraft
collision avoidance application, tcas. Our results show
that the SymPLFIED framework can be used to un(cid:173)
cover hard-to-detect corner cases caused by transient
errors in programs that may not be exposed by ran(cid:173)
dom fault-injection based validation.
Keywords: Dependability validation, Fault injection,
Symbolic execution, Error detectors, Model checking.
1
Introduction
Error detection mechanisms are vital for building
highly reliable systems. There has been significant
work on efficiently placing and deriving error detec(cid:173)
tors for programs [1]. An important challenge is to
enumerate the set of errors the mechanism fails to
detect, from either a known set or an unknown set.
Typically, verification techniques target the defin~d
set of errors the detector is supposed to detect. WhIle
t...

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


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

Output:
安全论文分析：

title:Neutral Net Neutrality
author:Yiannis Yiakoumis and
Sachin Katti and
Nick McKeown
Neutral Net Neutrality
Yiannis Yiakoumis, Sachin Katti, and Nick McKeown
Stanford University
ABSTRACT
Should applications receive special treatment from the
network? And if so, who decides which applications
are preferred? This discussion, known as net neutral-
ity, goes beyond technology and is a hot political topic.
In this paper we approach net neutrality from a user’s
perspective. Through user studies, we demonstrate that
users do indeed want some services to receive preferen-
tial treatment; and their preferences have a heavy-tail:
a one-size-ﬁts-all approach is unlikely to work. This
suggests that users should be able to decide how their
trac is treated. A crucial part to enable user prefer-
ences, is the mechanism to express them. To this end,
we present network cookies, a general mechanism to ex-
press user preferences to the network. Using cookies,
we prototype Boost, a user-deﬁned fast-lane and deploy
it in 161 homes.
CCS Concepts
•Social and professional topics ! Net neutrality;
•Networks ! Network architectures; Network proto-
cols; Cross-layer protocols; Middle boxes / network ap-
pliances; Network economics; Network manageability;
Home networks;
1.
INTRODUCTION
Net neutrality is currently a charged debate. The core
of the argument is about which applications should re-
ceive special treatment from the network, and whether
special treatment is in the best interest of users. Several
examples of special treatment already exist, for exam-
ple Facebook Zero [3] and T-Mobile’s Music Freedom [8]
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 notice
and the full citation on the ﬁrst page. Copyrights for components of this work
owned by others than the author(s) must be honored. Abstracting w...


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

Input:
title:Neutral Net Neutrality
author:Yiannis Yiakoumis and
Sachin Katti and
Nick McKeown
Neutral Net Neutrality
Yiannis Yiakoumis, Sachin Katti, and Nick McKeown
Stanford University
ABSTRACT
Should applications receive special treatment from the
network? And if so, who decides which applications
are preferred? This discussion, known as net neutral-
ity, goes beyond technology and is a hot political topic.
In this paper we approach net neutrality from a user’s
perspective. Through user studies, we demonstrate that
users do indeed want some services to receive preferen-
tial treatment; and their preferences have a heavy-tail:
a one-size-ﬁts-all approach is unlikely to work. This
suggests that users should be able to decide how their
trac is treated. A crucial part to enable user prefer-
ences, is the mechanism to express them. To this end,
we present network cookies, a general mechanism to ex-
press user preferences to the network. Using cookies,
we prototype Boost, a user-deﬁned fast-lane and deploy
it in 161 homes.
CCS Concepts
•Social and professional topics ! Net neutrality;
•Networks ! Network architectures; Network proto-
cols; Cross-layer protocols; Middle boxes / network ap-
pliances; Network economics; Network manageability;
Home networks;
1.
INTRODUCTION
Net neutrality is currently a charged debate. The core
of the argument is about which applications should re-
ceive special treatment from the network, and whether
special treatment is in the best interest of users. Several
examples of special treatment already exist, for exam-
ple Facebook Zero [3] and T-Mobile’s Music Freedom [8]
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 notice
and the full citation on the ﬁrst page. Copyrights for components of this work
owned by others than the author(s) must be honored. Abstracting w...

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


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

Output:
安全论文分析：

title:RedPlane: enabling fault-tolerant stateful in-switch applications
author:Daehyeok Kim and
Jacob Nelson and
Dan R. K. Ports and
Vyas Sekar and
Srinivasan Seshan
RedPlane: Enabling Fault-Tolerant Stateful In-Switch
Applications
Daehyeok Kim★†, Jacob Nelson†, Dan R. K. Ports†, Vyas Sekar★, Srinivasan Seshan★
★Carnegie Mellon University, †Microsoft
Abstract
Many recent efforts have demonstrated the performance benefits
of running datacenter functions (e.g., NATs, load balancers, moni-
toring) on programmable switches. However, a key missing piece
remains: fault tolerance. This is especially critical as the network is
no longer stateless and pure endpoint recovery does not suffice. In
this paper, we design and implement RedPlane, a fault-tolerant state
store for stateful in-switch applications. This provides in-switch
applications consistent access to their state, even if the switch they
run on fails or traffic is rerouted to an alternative switch. We address
key challenges in devising a practical, provably correct replication
protocol and implementing it in the switch data plane. Our evalua-
tions show that RedPlane incurs negligible overhead and enables
end-to-end applications to rapidly recover from switch failures.
CCS Concepts
• Networks → Programmable networks; In-network process-
ing; • Hardware → Emerging technologies; • Computer sys-
tems organization → Availability.
Keywords
Programmable switches, Programmable networks, Fault tolerance,
State replication
ACM Reference Format:
Daehyeok Kim, Jacob Nelson, Dan R. K. Ports, Vyas Sekar, Srinivasan Seshan
. 2021. RedPlane: Enabling Fault-Tolerant Stateful In-Switch Applications.
In ACM SIGCOMM 2021 Conference (SIGCOMM ’21), August 23–27, 2021,
Virtual Event, USA. ACM, New York, NY, USA, 22 pages. https://doi.org/10.
1145/3452296.3472905
1
Today’s data center switches are no longer simple stateless packet
forwarders. They implement sophisticated network functions, such
as NATs, firewalls, and load balancers...


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

Input:
title:RedPlane: enabling fault-tolerant stateful in-switch applications
author:Daehyeok Kim and
Jacob Nelson and
Dan R. K. Ports and
Vyas Sekar and
Srinivasan Seshan
RedPlane: Enabling Fault-Tolerant Stateful In-Switch
Applications
Daehyeok Kim★†, Jacob Nelson†, Dan R. K. Ports†, Vyas Sekar★, Srinivasan Seshan★
★Carnegie Mellon University, †Microsoft
Abstract
Many recent efforts have demonstrated the performance benefits
of running datacenter functions (e.g., NATs, load balancers, moni-
toring) on programmable switches. However, a key missing piece
remains: fault tolerance. This is especially critical as the network is
no longer stateless and pure endpoint recovery does not suffice. In
this paper, we design and implement RedPlane, a fault-tolerant state
store for stateful in-switch applications. This provides in-switch
applications consistent access to their state, even if the switch they
run on fails or traffic is rerouted to an alternative switch. We address
key challenges in devising a practical, provably correct replication
protocol and implementing it in the switch data plane. Our evalua-
tions show that RedPlane incurs negligible overhead and enables
end-to-end applications to rapidly recover from switch failures.
CCS Concepts
• Networks → Programmable networks; In-network process-
ing; • Hardware → Emerging technologies; • Computer sys-
tems organization → Availability.
Keywords
Programmable switches, Programmable networks, Fault tolerance,
State replication
ACM Reference Format:
Daehyeok Kim, Jacob Nelson, Dan R. K. Ports, Vyas Sekar, Srinivasan Seshan
. 2021. RedPlane: Enabling Fault-Tolerant Stateful In-Switch Applications.
In ACM SIGCOMM 2021 Conference (SIGCOMM ’21), August 23–27, 2021,
Virtual Event, USA. ACM, New York, NY, USA, 22 pages. https://doi.org/10.
1145/3452296.3472905
1
Today’s data center switches are no longer simple stateless packet
forwarders. They implement sophisticated network functions, such
as NATs, firewalls, and load balancers...

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


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

Output:
安全论文分析：

title:BLOCK: a black-box approach for detection of state violation attacks
towards web applications
author:Xiaowei Li and
Yuan Xue
BLOCK: A Black-box Approach for Detection of State
Violation Attacks Towards Web Applications
Department of Electrical Engineering and
Department of Electrical Engineering and
Xiaowei Li
Computer Science
Vanderbilt University
xiaowei.li@vanderbilt.edu
Yuan Xue
Computer Science
Vanderbilt University
yuan.xue@vanderbilt.edu
ABSTRACT
State violation attacks towards web applications exploit logic
ﬂaws and allow restrictive functions and sensitive informa-
tion to be accessed at inappropriate states. Since application
logic ﬂaws are speciﬁc to the intended functionality of a par-
ticular web application, it is diﬃcult to develop a general
approach that addresses state violation attacks. To date,
existing approaches all require web application source code
for analysis or instrumentation in order to detect state vio-
lations.
In this paper, we present BLOCK, a BLack-bOx approach
for detecting state violation attaCKs. We regard the web
application as a stateless system and infer the intended web
application behavior model by observing the interactions be-
tween the clients and the web application. We extract a set
of invariants from the web request/response sequences and
their associated session variable values during its attack-free
execution. The set of invariants is then used for evaluating
web requests and responses at runtime. Any web request or
response that violates the associated invariants is identiﬁed
as a potential state violation attack. We develop a system
prototype based on the WebScarab proxy and evaluate our
detection system using a set of real-world web applications.
The experiment results demonstrate that our approach is
eﬀective at detecting state violation attacks and incurs ac-
ceptable performance overhead. Our approach is valuable
in that it is independent of the web application source code
and can easily scale up.
Keyword...


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

Input:
title:BLOCK: a black-box approach for detection of state violation attacks
towards web applications
author:Xiaowei Li and
Yuan Xue
BLOCK: A Black-box Approach for Detection of State
Violation Attacks Towards Web Applications
Department of Electrical Engineering and
Department of Electrical Engineering and
Xiaowei Li
Computer Science
Vanderbilt University
xiaowei.li@vanderbilt.edu
Yuan Xue
Computer Science
Vanderbilt University
yuan.xue@vanderbilt.edu
ABSTRACT
State violation attacks towards web applications exploit logic
ﬂaws and allow restrictive functions and sensitive informa-
tion to be accessed at inappropriate states. Since application
logic ﬂaws are speciﬁc to the intended functionality of a par-
ticular web application, it is diﬃcult to develop a general
approach that addresses state violation attacks. To date,
existing approaches all require web application source code
for analysis or instrumentation in order to detect state vio-
lations.
In this paper, we present BLOCK, a BLack-bOx approach
for detecting state violation attaCKs. We regard the web
application as a stateless system and infer the intended web
application behavior model by observing the interactions be-
tween the clients and the web application. We extract a set
of invariants from the web request/response sequences and
their associated session variable values during its attack-free
execution. The set of invariants is then used for evaluating
web requests and responses at runtime. Any web request or
response that violates the associated invariants is identiﬁed
as a potential state violation attack. We develop a system
prototype based on the WebScarab proxy and evaluate our
detection system using a set of real-world web applications.
The experiment results demonstrate that our approach is
eﬀective at detecting state violation attacks and incurs ac-
ceptable performance overhead. Our approach is valuable
in that it is independent of the web application source code
and can easily scale up.
Keyword...

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


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

Output:
安全论文分析：

title:The Join Problem in Dynamic Network Algorithms
author:Kishori M. Konwar and
Dariusz R. Kowalski and
Alexander A. Shvartsman
The Join Problem in Dynamic Network Algorithms∗
Kishori M. Konwar 1
kishori@cse.uconn.edu
Dariusz R. Kowalski 2,3
darek@duch.mimuw.edu.pl
Alexander A. Shvartsman 1,4
alex@theory.csail.mit.edu
1 Department of Computer Science and Engineering, University of Connecticut, Unit 2155, Storrs, CT 06269, USA
2 Max-Planck-Institut f¨ur Informatik, Stuhlsatzenhausweg 85, Saarbr¨ucken, 66123, Germany
3 Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, Poland
4 MIT Computer Science and Artiﬁcial Intelligence Laboratory, The Stata Center, Cambridge, MA 02139, USA
Abstract
1. Introduction
Distributed algorithms in dynamic networks often em-
ploy communication patterns whose purpose is to dissemi-
nate information among the participants. Gossiping is one
form of such communication pattern. In dynamic settings
the set of participants can change substantially as new par-
ticipants join, and as failures and voluntary departures re-
move those who have joined previously. A natural question
for such settings is: how soon can newly joined nodes dis-
cover each other by means of gossiping? This paper ab-
stracts and studies the Join Problem for dynamic systems
that use all-to-all gossip. The problem is studied in terms of
join-connectivity graphs where vertices represent the par-
ticipants and where each edge represents one participant’s
knowledge about another. Ideally, such a graph has diam-
eter one, i.e., all participants know each other. The diam-
eter can grow as new participants join, and as failures re-
move edges from the graph. Gossip helps participants dis-
cover one another, decreasing the diameter. The results de-
scribe the lower and upper bounds on the number of com-
munication rounds such that the participants who have pre-
viously joined discover one another, under a variety of as-
sumptions about the joining and failur...


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

Input:
title:The Join Problem in Dynamic Network Algorithms
author:Kishori M. Konwar and
Dariusz R. Kowalski and
Alexander A. Shvartsman
The Join Problem in Dynamic Network Algorithms∗
Kishori M. Konwar 1
kishori@cse.uconn.edu
Dariusz R. Kowalski 2,3
darek@duch.mimuw.edu.pl
Alexander A. Shvartsman 1,4
alex@theory.csail.mit.edu
1 Department of Computer Science and Engineering, University of Connecticut, Unit 2155, Storrs, CT 06269, USA
2 Max-Planck-Institut f¨ur Informatik, Stuhlsatzenhausweg 85, Saarbr¨ucken, 66123, Germany
3 Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, Poland
4 MIT Computer Science and Artiﬁcial Intelligence Laboratory, The Stata Center, Cambridge, MA 02139, USA
Abstract
1. Introduction
Distributed algorithms in dynamic networks often em-
ploy communication patterns whose purpose is to dissemi-
nate information among the participants. Gossiping is one
form of such communication pattern. In dynamic settings
the set of participants can change substantially as new par-
ticipants join, and as failures and voluntary departures re-
move those who have joined previously. A natural question
for such settings is: how soon can newly joined nodes dis-
cover each other by means of gossiping? This paper ab-
stracts and studies the Join Problem for dynamic systems
that use all-to-all gossip. The problem is studied in terms of
join-connectivity graphs where vertices represent the par-
ticipants and where each edge represents one participant’s
knowledge about another. Ideally, such a graph has diam-
eter one, i.e., all participants know each other. The diam-
eter can grow as new participants join, and as failures re-
move edges from the graph. Gossip helps participants dis-
cover one another, decreasing the diameter. The results de-
scribe the lower and upper bounds on the number of com-
munication rounds such that the participants who have pre-
viously joined discover one another, under a variety of as-
sumptions about the joining and failur...

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


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

Output:
安全论文分析：

title:PTrix: Efficient Hardware-Assisted Fuzzing for COTS Binary
author:Yaohui Chen and
Dongliang Mu and
Jun Xu and
Zhichuang Sun and
Wenbo Shen and
Xinyu Xing and
Long Lu and
Bing Mao
PTrix: Efficient Hardware-Assisted Fuzzing for COTS Binary
Yaohui Chen*
Northeastern University
Zhichuang Sun
Northeastern University
Dongliang Mu*
Penn State University
Wenbo Shen
Zhejiang University
Jun Xu
Stevens Institute of Technology
Xinyu Xing
Penn State University
Long Lu
Northeastern University
Bing Mao
Nanjing University
ABSTRACT
Despite its effectiveness in uncovering software defects, American
Fuzzy Lop (AFL), one of the best grey-box fuzzers, is inefficient
when fuzz-testing source-unavailable programs. AFL’s binary-only
fuzzing mode, QEMU-AFL, is typically 2-5× slower than its source-
available fuzzing mode. The slowdown is largely caused by the
heavy dynamic instrumentation.
Recent fuzzing techniques use Intel Processor Tracing (PT), a
light-weight tracing feature supported by recent Intel CPUs, to re-
move the need of dynamic instrumentation. However, we found that
these PT-based fuzzing techniques are even slower than QEMU-AFL
when fuzzing real-world programs, making them less effective than
QEMU-AFL. This poor performance is caused by the slow extraction
of code coverage information from highly compressed PT traces.
In this work, we present the design and implementation of PTrix,
which fully unleashes the benefits of PT for fuzzing via three novel
techniques. First, PTrix introduces a scheme to highly parallel the
processing of PT trace and target program execution. Second, it
directly takes decoded PT trace as feedback for fuzzing, avoiding
the expensive reconstruction of code coverage information. Third,
PTrix maintains the new feedback with stronger feedback than
edge-based code coverage, which helps reach new code space and
defects that AFL may not.
We evaluated PTrix by comparing its performance with the state-
of-the-art fuzzers. Our results show that, given th...


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

Input:
title:PTrix: Efficient Hardware-Assisted Fuzzing for COTS Binary
author:Yaohui Chen and
Dongliang Mu and
Jun Xu and
Zhichuang Sun and
Wenbo Shen and
Xinyu Xing and
Long Lu and
Bing Mao
PTrix: Efficient Hardware-Assisted Fuzzing for COTS Binary
Yaohui Chen*
Northeastern University
Zhichuang Sun
Northeastern University
Dongliang Mu*
Penn State University
Wenbo Shen
Zhejiang University
Jun Xu
Stevens Institute of Technology
Xinyu Xing
Penn State University
Long Lu
Northeastern University
Bing Mao
Nanjing University
ABSTRACT
Despite its effectiveness in uncovering software defects, American
Fuzzy Lop (AFL), one of the best grey-box fuzzers, is inefficient
when fuzz-testing source-unavailable programs. AFL’s binary-only
fuzzing mode, QEMU-AFL, is typically 2-5× slower than its source-
available fuzzing mode. The slowdown is largely caused by the
heavy dynamic instrumentation.
Recent fuzzing techniques use Intel Processor Tracing (PT), a
light-weight tracing feature supported by recent Intel CPUs, to re-
move the need of dynamic instrumentation. However, we found that
these PT-based fuzzing techniques are even slower than QEMU-AFL
when fuzzing real-world programs, making them less effective than
QEMU-AFL. This poor performance is caused by the slow extraction
of code coverage information from highly compressed PT traces.
In this work, we present the design and implementation of PTrix,
which fully unleashes the benefits of PT for fuzzing via three novel
techniques. First, PTrix introduces a scheme to highly parallel the
processing of PT trace and target program execution. Second, it
directly takes decoded PT trace as feedback for fuzzing, avoiding
the expensive reconstruction of code coverage information. Third,
PTrix maintains the new feedback with stronger feedback than
edge-based code coverage, which helps reach new code space and
defects that AFL may not.
We evaluated PTrix by comparing its performance with the state-
of-the-art fuzzers. Our results show that, given th...

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


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

Output:
安全论文分析：

title:My script engines know what you did in the dark: converting engines
into script API tracers
author:Toshinori Usui and
Yuto Otsuki and
Yuhei Kawakoya and
Makoto Iwamura and
Jun Miyoshi and
Kanta Matsuura
My Script Engines Know What You Did In the Dark:
Converting Engines into Script API Tracers
Toshinori Usui
NTT Secure Platform Laboratories
Institute of Industrial Science,
The University of Tokyo
toshinori.usui.rt@hco.ntt.co.jp
Yuto Otsuki
NTT Secure Platform Laboratories
yuuto.ootsuki.uh@hco.ntt.co.jp
Yuhei Kawakoya
NTT Secure Platform Laboratories
yuuhei.kawakoya.sy@hco.ntt.co.jp
Makoto Iwamura
NTT Secure Platform Laboratories
makoto.iwamura.sw@hco.ntt.co.jp
Jun Miyoshi
NTT Secure Platform Laboratories
jun.miyoshi.fu@hco.ntt.co.jp
Kanta Matsuura
Institute of Industrial Science,
The University of Tokyo
kanta@iis.u-tokyo.ac.jp
ABSTRACT
Malicious scripts have been crucial attack vectors in recent attacks
such as malware spam (malspam) and fileless malware. Since mali-
cious scripts are generally obfuscated, statically analyzing them is
difficult due to reflections. Therefore, dynamic analysis, which is not
affected by obfuscation, is used for malicious script analysis. How-
ever, despite its wide adoption, some problems remain unsolved.
Current designs of script analysis tools do not fulfill the follow-
ing three requirements important for malicious script analysis. (1)
Universally applicable to various script languages, (2) capable of
outputting analysis logs that can precisely recover the behavior of
malicious scripts, and (3) applicable to proprietary script engines.
In this paper, we propose a method for automatically generating
script API tracer by analyzing the target script engine binaries. The
method mine the knowledge of script engine internals that are
required to append behavior analysis capability. This enables the
addition of analysis functionalities to arbitrary script engines and
generation of script API tracers that can fulfill the above require...


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

Input:
title:My script engines know what you did in the dark: converting engines
into script API tracers
author:Toshinori Usui and
Yuto Otsuki and
Yuhei Kawakoya and
Makoto Iwamura and
Jun Miyoshi and
Kanta Matsuura
My Script Engines Know What You Did In the Dark:
Converting Engines into Script API Tracers
Toshinori Usui
NTT Secure Platform Laboratories
Institute of Industrial Science,
The University of Tokyo
toshinori.usui.rt@hco.ntt.co.jp
Yuto Otsuki
NTT Secure Platform Laboratories
yuuto.ootsuki.uh@hco.ntt.co.jp
Yuhei Kawakoya
NTT Secure Platform Laboratories
yuuhei.kawakoya.sy@hco.ntt.co.jp
Makoto Iwamura
NTT Secure Platform Laboratories
makoto.iwamura.sw@hco.ntt.co.jp
Jun Miyoshi
NTT Secure Platform Laboratories
jun.miyoshi.fu@hco.ntt.co.jp
Kanta Matsuura
Institute of Industrial Science,
The University of Tokyo
kanta@iis.u-tokyo.ac.jp
ABSTRACT
Malicious scripts have been crucial attack vectors in recent attacks
such as malware spam (malspam) and fileless malware. Since mali-
cious scripts are generally obfuscated, statically analyzing them is
difficult due to reflections. Therefore, dynamic analysis, which is not
affected by obfuscation, is used for malicious script analysis. How-
ever, despite its wide adoption, some problems remain unsolved.
Current designs of script analysis tools do not fulfill the follow-
ing three requirements important for malicious script analysis. (1)
Universally applicable to various script languages, (2) capable of
outputting analysis logs that can precisely recover the behavior of
malicious scripts, and (3) applicable to proprietary script engines.
In this paper, we propose a method for automatically generating
script API tracer by analyzing the target script engine binaries. The
method mine the knowledge of script engine internals that are
required to append behavior analysis capability. This enables the
addition of analysis functionalities to arbitrary script engines and
generation of script API tracers that can fulfill the above require...

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


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

Output:
安全论文分析：

title:Winding Path: Characterizing the Malicious Redirection in Squatting
Domain Names
author:Yuwei Zeng and
Xunxun Chen and
Tianning Zang and
Haiwei Tsang
Winding Path: Characterizing
the Malicious Redirection in Squatting
Domain Names
Yuwei Zeng1,2, Xunxun Chen1,3, Tianning Zang1,2(B), and Haiwei Tsang4
1 Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
{zengyuwei,zangtianning}@iie.ac.cn
2 School of Cyber Security, University of Chinese Academy of Sciences,
3 National Computer Network Emergency Response Technical Team/Coordination
Beijing, China
Center of China, Beijing, China
4 Jilin University, Changchun, China
Abstract. An increasing number of adversaries tend to cover up their
malicious sites by leveraging the elaborate redirection chains. Prior works
mostly focused on the speciﬁc attacks that users suﬀered, and seldom
considered how users were exposed to such attacks. In this paper, we con-
duct a comprehensive measurement study on the malicious redirections
that leverage squatting domain names as the start point. To this end, we
collected 101,186 resolved squatting domain names that targeted 2,302
top brands from the ISP-level DNS traﬃc. After dynamically crawling
these squatting domain names, we pioneered the application of perfor-
mance log to mine the redirection chains they involved. Afterward, we
analyzed the nodes that acted as intermediaries in malicious redirec-
tions and found that adversaries preferred to conduct URL redirection
via imported JavaScript codes and iframes. Our further investigation
indicates that such intermediaries have obvious aggregation, both in the
domain name and the Internet infrastructure supporting them.
Keywords: Domain squatting · URL redirection
1 Introduction
URL redirection has been widely used since its inception. With this technique,
website administrators are able to provide more customized navigation services
for visitors by specifying certain parameters in the URL (e.g., language). ...


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

Input:
title:Winding Path: Characterizing the Malicious Redirection in Squatting
Domain Names
author:Yuwei Zeng and
Xunxun Chen and
Tianning Zang and
Haiwei Tsang
Winding Path: Characterizing
the Malicious Redirection in Squatting
Domain Names
Yuwei Zeng1,2, Xunxun Chen1,3, Tianning Zang1,2(B), and Haiwei Tsang4
1 Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
{zengyuwei,zangtianning}@iie.ac.cn
2 School of Cyber Security, University of Chinese Academy of Sciences,
3 National Computer Network Emergency Response Technical Team/Coordination
Beijing, China
Center of China, Beijing, China
4 Jilin University, Changchun, China
Abstract. An increasing number of adversaries tend to cover up their
malicious sites by leveraging the elaborate redirection chains. Prior works
mostly focused on the speciﬁc attacks that users suﬀered, and seldom
considered how users were exposed to such attacks. In this paper, we con-
duct a comprehensive measurement study on the malicious redirections
that leverage squatting domain names as the start point. To this end, we
collected 101,186 resolved squatting domain names that targeted 2,302
top brands from the ISP-level DNS traﬃc. After dynamically crawling
these squatting domain names, we pioneered the application of perfor-
mance log to mine the redirection chains they involved. Afterward, we
analyzed the nodes that acted as intermediaries in malicious redirec-
tions and found that adversaries preferred to conduct URL redirection
via imported JavaScript codes and iframes. Our further investigation
indicates that such intermediaries have obvious aggregation, both in the
domain name and the Internet infrastructure supporting them.
Keywords: Domain squatting · URL redirection
1 Introduction
URL redirection has been widely used since its inception. With this technique,
website administrators are able to provide more customized navigation services
for visitors by specifying certain parameters in the URL (e.g., language). ...

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


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

Output:
安全论文分析：

title:Blacklistable anonymous credentials: blocking misbehaving users without
ttps
author:Patrick P. Tsang and
Man Ho Au and
Apu Kapadia and
Sean W. Smith
Blacklistable Anonymous Credentials:
Blocking Misbehaving Users without TTPs
Patrick P. Tsang†, Man Ho Au§, Apu Kapadia†‡, Sean W. Smith†
†Department of Computer Science
Dartmouth College
Hanover, NH, USA
‡Institute for Security Technology Studies
Dartmouth College
Hanover, NH, USA
§Centre for Computer and Information Security Research
School of Computer Science and Software Engineering
University of Wollongong, Australia
{patrick, akapadia, sws}@cs.dartmouth.edu, mhaa456@uow.edu.au
ABSTRACT
Several credential systems have been proposed in which
users can authenticate to services anonymously.
Since
anonymity can give users the license to misbehave, some
variants allow the selective deanonymization (or linking)
of misbehaving users upon a complaint to a trusted third
party (TTP). The ability of the TTP to revoke a user’s pri-
vacy at any time, however, is too strong a punishment for
misbehavior. To limit the scope of deanonymization, sys-
tems such as “e-cash” have been proposed in which users are
deanonymized under only certain types of well-deﬁned mis-
behavior such as “double spending.” While useful in some
applications, it is not possible to generalize such techniques
to more subjective deﬁnitions of misbehavior.
We present the ﬁrst anonymous credential system in which
services can “blacklist” misbehaving users without contact-
ing a TTP. Since blacklisted users remain anonymous, mis-
behaviors can be judged subjectively without users fearing
arbitrary deanonymization by a TTP.
Categories and Subject Descriptors
K.6.5 [Operating Systems]: Security and Protection—
Authentication; E.3 [Data Encryption]: Public key cryp-
tosystems
General Terms
Algorithms, Security
Keywords
privacy,
anonymous blacklisting, revocation
anonymous authentication, user misbehavior,
Permission to make digital or hard copies of all or pa...


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

Input:
title:Blacklistable anonymous credentials: blocking misbehaving users without
ttps
author:Patrick P. Tsang and
Man Ho Au and
Apu Kapadia and
Sean W. Smith
Blacklistable Anonymous Credentials:
Blocking Misbehaving Users without TTPs
Patrick P. Tsang†, Man Ho Au§, Apu Kapadia†‡, Sean W. Smith†
†Department of Computer Science
Dartmouth College
Hanover, NH, USA
‡Institute for Security Technology Studies
Dartmouth College
Hanover, NH, USA
§Centre for Computer and Information Security Research
School of Computer Science and Software Engineering
University of Wollongong, Australia
{patrick, akapadia, sws}@cs.dartmouth.edu, mhaa456@uow.edu.au
ABSTRACT
Several credential systems have been proposed in which
users can authenticate to services anonymously.
Since
anonymity can give users the license to misbehave, some
variants allow the selective deanonymization (or linking)
of misbehaving users upon a complaint to a trusted third
party (TTP). The ability of the TTP to revoke a user’s pri-
vacy at any time, however, is too strong a punishment for
misbehavior. To limit the scope of deanonymization, sys-
tems such as “e-cash” have been proposed in which users are
deanonymized under only certain types of well-deﬁned mis-
behavior such as “double spending.” While useful in some
applications, it is not possible to generalize such techniques
to more subjective deﬁnitions of misbehavior.
We present the ﬁrst anonymous credential system in which
services can “blacklist” misbehaving users without contact-
ing a TTP. Since blacklisted users remain anonymous, mis-
behaviors can be judged subjectively without users fearing
arbitrary deanonymization by a TTP.
Categories and Subject Descriptors
K.6.5 [Operating Systems]: Security and Protection—
Authentication; E.3 [Data Encryption]: Public key cryp-
tosystems
General Terms
Algorithms, Security
Keywords
privacy,
anonymous blacklisting, revocation
anonymous authentication, user misbehavior,
Permission to make digital or hard copies of all or pa...

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


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

Output:
安全论文分析：

title:Automated Classification and Analysis of Internet Malware
author:Michael Bailey and
Jon Oberheide and
Jon Andersen and
Zhuoqing Morley Mao and
Farnam Jahanian and
Jose Nazario
Automated Classiﬁcation and Analysis of
Internet Malware
Michael Bailey1, Jon Oberheide1, Jon Andersen1, Z. Morley Mao1,
Farnam Jahanian1,2, and Jose Nazario2
1 Electrical Engineering and Computer Science Department
{mibailey,jonojono,janderse,zmao,farnam}@umich.edu
University of Michigan
2 Arbor Networks
{farnam,jose}@arbor.net
Abstract. Numerous attacks, such as worms, phishing, and botnets,
threaten the availability of the Internet, the integrity of its hosts, and
the privacy of its users. A core element of defense against these attacks
is anti-virus (AV) software—a service that detects, removes, and charac-
terizes these threats. The ability of these products to successfully char-
acterize these threats has far-reaching eﬀects—from facilitating sharing
across organizations, to detecting the emergence of new threats, and as-
sessing risk in quarantine and cleanup. In this paper, we examine the
ability of existing host-based anti-virus products to provide semantically
meaningful information about the malicious software and tools (or mal-
ware) used by attackers. Using a large, recent collection of malware that
spans a variety of attack vectors (e.g., spyware, worms, spam), we show
that diﬀerent AV products characterize malware in ways that are incon-
sistent across AV products, incomplete across malware, and that fail to
be concise in their semantics. To address these limitations, we propose a
new classiﬁcation technique that describes malware behavior in terms of
system state changes (e.g., ﬁles written, processes created) rather than
in sequences or patterns of system calls. To address the sheer volume
of malware and diversity of its behavior, we provide a method for auto-
matically categorizing these proﬁles of malware into groups that reﬂect
similar classes of behaviors and demonst...


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

Input:
title:Automated Classification and Analysis of Internet Malware
author:Michael Bailey and
Jon Oberheide and
Jon Andersen and
Zhuoqing Morley Mao and
Farnam Jahanian and
Jose Nazario
Automated Classiﬁcation and Analysis of
Internet Malware
Michael Bailey1, Jon Oberheide1, Jon Andersen1, Z. Morley Mao1,
Farnam Jahanian1,2, and Jose Nazario2
1 Electrical Engineering and Computer Science Department
{mibailey,jonojono,janderse,zmao,farnam}@umich.edu
University of Michigan
2 Arbor Networks
{farnam,jose}@arbor.net
Abstract. Numerous attacks, such as worms, phishing, and botnets,
threaten the availability of the Internet, the integrity of its hosts, and
the privacy of its users. A core element of defense against these attacks
is anti-virus (AV) software—a service that detects, removes, and charac-
terizes these threats. The ability of these products to successfully char-
acterize these threats has far-reaching eﬀects—from facilitating sharing
across organizations, to detecting the emergence of new threats, and as-
sessing risk in quarantine and cleanup. In this paper, we examine the
ability of existing host-based anti-virus products to provide semantically
meaningful information about the malicious software and tools (or mal-
ware) used by attackers. Using a large, recent collection of malware that
spans a variety of attack vectors (e.g., spyware, worms, spam), we show
that diﬀerent AV products characterize malware in ways that are incon-
sistent across AV products, incomplete across malware, and that fail to
be concise in their semantics. To address these limitations, we propose a
new classiﬁcation technique that describes malware behavior in terms of
system state changes (e.g., ﬁles written, processes created) rather than
in sequences or patterns of system calls. To address the sheer volume
of malware and diversity of its behavior, we provide a method for auto-
matically categorizing these proﬁles of malware into groups that reﬂect
similar classes of behaviors and demonst...

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


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

Output:
安全论文分析：

title:Using an assurance case to support independent assessment of the transition
to a new GPS ground control system
author:Elisabeth A. Nguyen and
William S. Greenwell and
Myron Hecht
Using an Assurance Case to Support Independent Assessment of
the Transition to a New GPS Ground Control System
Elisabeth A. Nguyen1, William S. Greenwell1, Myron J. Hecht2
The Aerospace Corporation
1Chantilly, Virginia, USA;  2El Segundo, CA, USA
{enguyen, william.s.greenwell, myron.j.hecht}@aero.org
Abstract
We  describe  a  specific  application  of  assurance  cases  to
the  problem  of  ensuring  that  a  transition  from  a  legacy
system  to  its  replacement  will  not  compromise  mission
assurance objectives. The application in question was the
transition  of  the  Global  Positioning  System  (GPS)  to  a
new  ground-control  system.  The  transition,  which  took
place over five days, required uninterrupted control of the
GPS  satellite  constellation  while  control  was  transferred
from a 1970s-era mainframe to a distributed architecture.
We  created  an  assurance  case  so  that  the  procedural
documentation we had  could  be  restructured  into  a  form
amenable  to  analysis.  The  analysis  concluded  that  there
were no major hazards; this conclusion was validated by
a successful transition.
1. Introduction
On  September  14,  2007,  the  U.S.  Air  Force  replaced
the  ground-control  system  for  the  Global  Positioning
System  (GPS)  [1].  The  new  system,  known  as  the
Architecture  Evolution  Plan  (AEP),  replaced  a  legacy
control system (referred to as Legacy)  built  on  1970s-era
mainframe computers. Since GPS is used worldwide as  a
navigation  aid,  it  was  essential  that  the  transition  was
executed without disrupting the GPS navigation signals.
The  Air  Force  asked  The  Aerospace  Corporation  to
analyze the AEP transition plan from a mission assurance
perspective and document any risks that were discovered...


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

Input:
title:Using an assurance case to support independent assessment of the transition
to a new GPS ground control system
author:Elisabeth A. Nguyen and
William S. Greenwell and
Myron Hecht
Using an Assurance Case to Support Independent Assessment of
the Transition to a New GPS Ground Control System
Elisabeth A. Nguyen1, William S. Greenwell1, Myron J. Hecht2
The Aerospace Corporation
1Chantilly, Virginia, USA;  2El Segundo, CA, USA
{enguyen, william.s.greenwell, myron.j.hecht}@aero.org
Abstract
We  describe  a  specific  application  of  assurance  cases  to
the  problem  of  ensuring  that  a  transition  from  a  legacy
system  to  its  replacement  will  not  compromise  mission
assurance objectives. The application in question was the
transition  of  the  Global  Positioning  System  (GPS)  to  a
new  ground-control  system.  The  transition,  which  took
place over five days, required uninterrupted control of the
GPS  satellite  constellation  while  control  was  transferred
from a 1970s-era mainframe to a distributed architecture.
We  created  an  assurance  case  so  that  the  procedural
documentation we had  could  be  restructured  into  a  form
amenable  to  analysis.  The  analysis  concluded  that  there
were no major hazards; this conclusion was validated by
a successful transition.
1. Introduction
On  September  14,  2007,  the  U.S.  Air  Force  replaced
the  ground-control  system  for  the  Global  Positioning
System  (GPS)  [1].  The  new  system,  known  as  the
Architecture  Evolution  Plan  (AEP),  replaced  a  legacy
control system (referred to as Legacy)  built  on  1970s-era
mainframe computers. Since GPS is used worldwide as  a
navigation  aid,  it  was  essential  that  the  transition  was
executed without disrupting the GPS navigation signals.
The  Air  Force  asked  The  Aerospace  Corporation  to
analyze the AEP transition plan from a mission assurance
perspective and document any risks that were discovered...

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


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

Output:
安全论文分析：

title:Zoom on the Keystrokes: Exploiting Video Calls for Keystroke Inference
Attacks
author:Mohd Sabra and
Anindya Maiti and
Murtuza Jadliwala
Zoom on the Keystrokes: Exploiting
Video Calls for Keystroke Inference Attacks
Mohd Sabra
Anindya Maiti
University of Texas at San Antonio
University of Oklahoma
mohd.sabra@utsa.edu
am@ou.edu
Murtuza Jadliwala
University of Texas at San Antonio
murtuza.jadliwala@utsa.edu
Abstract—Due to recent world events, video calls have be-
come the new norm for both personal and professional remote
communication. However, if a participant in a video call is not
careful, he/she can reveal his/her private information to others
in the call. In this paper, we design and evaluate an attack
framework to infer one type of such private information from
the video stream of a call – keystrokes, i.e., text typed during the
call. We evaluate our video-based keystroke inference framework
using different experimental settings and parameters, including
different webcams, video resolutions, keyboards, clothing, and
backgrounds. Our relatively high keystroke inference accuracies
under commonly occurring and realistic settings highlight the
need for awareness and countermeasures against such attacks.
Consequently, we also propose and evaluate effective mitigation
techniques that can automatically protect users when they type
during a video call.
I.
INTRODUCTION
Catalyzed by the ubiquity of the Internet, audio-video call-
ing has become a mainstream method of remote communica-
tion [13]. The trend has recently seen a further boost due to the
COVID-19 pandemic [4], whereby audio-video calls became
the default medium for professionals to confer remotely and
for students to attend lectures from home. Nonetheless, audio-
video calls (often referred to as just video calls) should be
considered privacy sensitive as participants may have spoken
or displayed private information during the call. To protect
video calls from eavesdropping threats, secure video callin...


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

Input:
title:Zoom on the Keystrokes: Exploiting Video Calls for Keystroke Inference
Attacks
author:Mohd Sabra and
Anindya Maiti and
Murtuza Jadliwala
Zoom on the Keystrokes: Exploiting
Video Calls for Keystroke Inference Attacks
Mohd Sabra
Anindya Maiti
University of Texas at San Antonio
University of Oklahoma
mohd.sabra@utsa.edu
am@ou.edu
Murtuza Jadliwala
University of Texas at San Antonio
murtuza.jadliwala@utsa.edu
Abstract—Due to recent world events, video calls have be-
come the new norm for both personal and professional remote
communication. However, if a participant in a video call is not
careful, he/she can reveal his/her private information to others
in the call. In this paper, we design and evaluate an attack
framework to infer one type of such private information from
the video stream of a call – keystrokes, i.e., text typed during the
call. We evaluate our video-based keystroke inference framework
using different experimental settings and parameters, including
different webcams, video resolutions, keyboards, clothing, and
backgrounds. Our relatively high keystroke inference accuracies
under commonly occurring and realistic settings highlight the
need for awareness and countermeasures against such attacks.
Consequently, we also propose and evaluate effective mitigation
techniques that can automatically protect users when they type
during a video call.
I.
INTRODUCTION
Catalyzed by the ubiquity of the Internet, audio-video call-
ing has become a mainstream method of remote communica-
tion [13]. The trend has recently seen a further boost due to the
COVID-19 pandemic [4], whereby audio-video calls became
the default medium for professionals to confer remotely and
for students to attend lectures from home. Nonetheless, audio-
video calls (often referred to as just video calls) should be
considered privacy sensitive as participants may have spoken
or displayed private information during the call. To protect
video calls from eavesdropping threats, secure video callin...

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


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

Output:
安全论文分析：

title:POSTER: TLS Proxies: Friend or Foe?
author:Mark O'Neill and
Scott Ruoti and
Kent E. Seamons and
Daniel Zappala
Poster – TLS Proxies: Friend or Foe?
Mark O’Neill, Scott Ruoti, Kent Seamons, Daniel Zappala
Brigham Young University
Computer Science Department
mto@byu.edu, ruoti@isrl.byu.edu, seamons@cs.byu.edu, zappala@cs.byu.edu
Provo, UT 84602
ABSTRACT
The use of TLS proxies to intercept encrypted traﬃc is
controversial since the same mechanism can be used for both
benevolent purposes, such as protecting against malware, and
for malicious purposes, such as identity theft or warrantless
government surveillance. To understand the prevalence and
uses of these proxies, we build a TLS proxy measurement
tool and deploy it via a Google AdWords campaign. We
generate 2.9 million certiﬁcate tests and ﬁnd that 1 in 250
TLS connections are proxied. The majority of these proxies
appear to be benevolent, however we identify over 1,000
cases where three malware products are using this technology
nefariously. We also ﬁnd numerous instances of negligent
and duplicitous behavior, some of which degrade security for
users without their knowledge.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General
- Security and protection
Keywords
TLS proxy; measurement; man-in-the-middle attack
1.
INTRODUCTION
Communicating securely over the Internet requires authen-
ticating the identity of a website to establish trust. Web
browsers authenticate a site by validating a chain of trust
from the site’s certiﬁcate back to one of a set of trusted root
certiﬁcates. These certiﬁcates comprise the root store and
are typically bundled with the operating system or browser.
This validation system is currently being compromised by
the use of TLS proxies, which can act as a man-in-the-middle
(MitM) for TLS connections. Companies typically employ
TLS proxies for benevolent reasons, particularly to protect
intellectual property and to protect their network from in-
truders. Pers...


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

Input:
title:POSTER: TLS Proxies: Friend or Foe?
author:Mark O'Neill and
Scott Ruoti and
Kent E. Seamons and
Daniel Zappala
Poster – TLS Proxies: Friend or Foe?
Mark O’Neill, Scott Ruoti, Kent Seamons, Daniel Zappala
Brigham Young University
Computer Science Department
mto@byu.edu, ruoti@isrl.byu.edu, seamons@cs.byu.edu, zappala@cs.byu.edu
Provo, UT 84602
ABSTRACT
The use of TLS proxies to intercept encrypted traﬃc is
controversial since the same mechanism can be used for both
benevolent purposes, such as protecting against malware, and
for malicious purposes, such as identity theft or warrantless
government surveillance. To understand the prevalence and
uses of these proxies, we build a TLS proxy measurement
tool and deploy it via a Google AdWords campaign. We
generate 2.9 million certiﬁcate tests and ﬁnd that 1 in 250
TLS connections are proxied. The majority of these proxies
appear to be benevolent, however we identify over 1,000
cases where three malware products are using this technology
nefariously. We also ﬁnd numerous instances of negligent
and duplicitous behavior, some of which degrade security for
users without their knowledge.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General
- Security and protection
Keywords
TLS proxy; measurement; man-in-the-middle attack
1.
INTRODUCTION
Communicating securely over the Internet requires authen-
ticating the identity of a website to establish trust. Web
browsers authenticate a site by validating a chain of trust
from the site’s certiﬁcate back to one of a set of trusted root
certiﬁcates. These certiﬁcates comprise the root store and
are typically bundled with the operating system or browser.
This validation system is currently being compromised by
the use of TLS proxies, which can act as a man-in-the-middle
(MitM) for TLS connections. Companies typically employ
TLS proxies for benevolent reasons, particularly to protect
intellectual property and to protect their network from in-
truders. Pers...

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


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

Output:
安全论文分析：

title:Genoa TIE, Advanced Boundary Controller Experiment
author:Eric Monteith
Genoa TIE, Advanced Boundary Controller Experiment
Eric Monteith
NAI Labs, Network Associates Inc.
eric_monteith@nai.com
Abstract
This
in
describes
document
two  phases,
(TIE).  Achieved
experimentation
performed as part of the Genoa Technology Integration
Experiment
the
overarching  assertion  of  the  Genoa  TIE  was  that
boundary  controllers,  in  the  form  of  an  automated
guard,  could play  an  important  role  in  the  operational
success  of  Project  Genoa  [1].  Genoa,  an  ongoing
DARPA [2] research program, is focused on developing
a  prototype  decision  support  environment  for  the
National  Command  Authority,  and  is  intended  to
mitigate  potential  international  crises  early  in  their
development. In addition to protection from Information
Warfare  attacks  across  the  Internet  and  other  sources,
boundary  controllers  could  assist  the  Genoa  system  in
managing important aspects of information sharing, by
implementing  access  control  and  content  filtering  for
inter-enclave  transactions.  The  focus  of  this  paper
includes  experimentation  with  syntactic  and  Natural
Language  Processing
the  Genoa
environment, and the measurement of their effectiveness
in filtering inter-enclave transactions.
filters  within
Introduction
in
for
support  environment
Genoa  is  focused  on  developing  a  prototype
decision
the  National
Command  Authority  (NCA)  to  identify  and  mitigate
crisis  situations  early
their  development.  The
organizations  comprising  the  NCA  span  those  of
intelligence,  operations,  execution,  and  decision/policy
control. Illustrated in Figure 1, each enclave comprising
the  NCA  represents  a  homogeneous  entity.  They  are
often organizationally oriented and can be hierarchically
organized.    However,  for  any  enclave  to  conduct  the
activities  that  it  is  responsible  for,  the  staff  in  that
...


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

Input:
title:Genoa TIE, Advanced Boundary Controller Experiment
author:Eric Monteith
Genoa TIE, Advanced Boundary Controller Experiment
Eric Monteith
NAI Labs, Network Associates Inc.
eric_monteith@nai.com
Abstract
This
in
describes
document
two  phases,
(TIE).  Achieved
experimentation
performed as part of the Genoa Technology Integration
Experiment
the
overarching  assertion  of  the  Genoa  TIE  was  that
boundary  controllers,  in  the  form  of  an  automated
guard,  could play  an  important  role  in  the  operational
success  of  Project  Genoa  [1].  Genoa,  an  ongoing
DARPA [2] research program, is focused on developing
a  prototype  decision  support  environment  for  the
National  Command  Authority,  and  is  intended  to
mitigate  potential  international  crises  early  in  their
development. In addition to protection from Information
Warfare  attacks  across  the  Internet  and  other  sources,
boundary  controllers  could  assist  the  Genoa  system  in
managing important aspects of information sharing, by
implementing  access  control  and  content  filtering  for
inter-enclave  transactions.  The  focus  of  this  paper
includes  experimentation  with  syntactic  and  Natural
Language  Processing
the  Genoa
environment, and the measurement of their effectiveness
in filtering inter-enclave transactions.
filters  within
Introduction
in
for
support  environment
Genoa  is  focused  on  developing  a  prototype
decision
the  National
Command  Authority  (NCA)  to  identify  and  mitigate
crisis  situations  early
their  development.  The
organizations  comprising  the  NCA  span  those  of
intelligence,  operations,  execution,  and  decision/policy
control. Illustrated in Figure 1, each enclave comprising
the  NCA  represents  a  homogeneous  entity.  They  are
often organizationally oriented and can be hierarchically
organized.    However,  for  any  enclave  to  conduct  the
activities  that  it  is  responsible  for,  the  staff  in  that
...

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


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

Output:
安全论文分析：

title:Automatic Generation of Buffer Overflow Attack Signatures: An Approach
Based on Program Behavior Models
author:Zhenkai Liang and
R. Sekar
Automatic Generation of Buffer Overﬂow Attack Signatures:
An Approach Based on Program Behavior Models(cid:3)
Zhenkai Liang and R. Sekar
Department of Computer Science,
Stony Brook University, Stony Brook, NY 11794
fzliang, sekarg@cs.sunysb.edu
Abstract
Buffer overﬂows have become the most common target
for network-based attacks. They are also the primary mech-
anism used by worms and other forms of automated attacks.
Although many techniques have been developed to prevent
server compromises due to buffer overﬂows, these defenses
still lead to server crashes. When attacks occur repeat-
edly, as is common with automated attacks, these protec-
tion mechanisms lead to repeated restarts of the victim ap-
plication, rendering its service unavailable. To overcome
this problem, we develop a new approach that can learn
the characteristics of a particular attack, and ﬁlter out fu-
ture instances of the same attack or its variants. By doing
so, our approach signiﬁcantly increases the availability of
servers subjected to repeated attacks. The approach is fully
automatic, does not require source code, and has low run-
time overheads. In our experiments, it was effective against
most attacks, and did not produce any false positives.
1 Introduction
In the past few years, there has been an alarming increase
in automated attacks that are launched by worms or zom-
bies. A key characteristic of such automated attacks is that
they are repetitive, i.e., multiple instances of the same at-
tack may be launched against the same victim machine in
a quick succession. A vast majority of these automated at-
tacks are due to buffer overﬂows, which account for more
than three-quarters of the US CERT advisories in the last
few years. Current technology for defending against buffer
overﬂows uses some form of guarding [5, 7, 8] or ran-
domization [1, 2, 3,...


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

Input:
title:Automatic Generation of Buffer Overflow Attack Signatures: An Approach
Based on Program Behavior Models
author:Zhenkai Liang and
R. Sekar
Automatic Generation of Buffer Overﬂow Attack Signatures:
An Approach Based on Program Behavior Models(cid:3)
Zhenkai Liang and R. Sekar
Department of Computer Science,
Stony Brook University, Stony Brook, NY 11794
fzliang, sekarg@cs.sunysb.edu
Abstract
Buffer overﬂows have become the most common target
for network-based attacks. They are also the primary mech-
anism used by worms and other forms of automated attacks.
Although many techniques have been developed to prevent
server compromises due to buffer overﬂows, these defenses
still lead to server crashes. When attacks occur repeat-
edly, as is common with automated attacks, these protec-
tion mechanisms lead to repeated restarts of the victim ap-
plication, rendering its service unavailable. To overcome
this problem, we develop a new approach that can learn
the characteristics of a particular attack, and ﬁlter out fu-
ture instances of the same attack or its variants. By doing
so, our approach signiﬁcantly increases the availability of
servers subjected to repeated attacks. The approach is fully
automatic, does not require source code, and has low run-
time overheads. In our experiments, it was effective against
most attacks, and did not produce any false positives.
1 Introduction
In the past few years, there has been an alarming increase
in automated attacks that are launched by worms or zom-
bies. A key characteristic of such automated attacks is that
they are repetitive, i.e., multiple instances of the same at-
tack may be launched against the same victim machine in
a quick succession. A vast majority of these automated at-
tacks are due to buffer overﬂows, which account for more
than three-quarters of the US CERT advisories in the last
few years. Current technology for defending against buffer
overﬂows uses some form of guarding [5, 7, 8] or ran-
domization [1, 2, 3,...

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


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

Output:
安全论文分析：

title:Mind Your Keys? A Security Evaluation of Java Keystores
author:Riccardo Focardi and
Francesco Palmarini and
Marco Squarcina and
Graham Steel and
Mauro Tempesta
Mind Your Keys?
A Security Evaluation of Java Keystores
Riccardo Focardi
Universit`a Ca’ Foscari
Francesco Palmarini
Universit`a Ca’ Foscari
Marco Squarcina
Universit`a Ca’ Foscari
Yarix
Cryptosense
Graham Steel
Mauro Tempesta
Cryptosense
Universit`a Ca’ Foscari
Cryptosense
focardi@unive.it
palmarini@unive.it
squarcina@unive.it
graham@cryptosense.com
tempesta@unive.it
Abstract—Cryptography is complex and variegate and re-
quires to combine different algorithms and mechanisms in non-
trivial ways. This complexity is often source of vulnerabilities.
Secure key management is one of the most critical aspects,
since leaking a cryptographic key vanishes any advantage of
using cryptography. In this paper we analyze Java keystores,
the standard way to manage and securely store keys in Java
applications. We consider seven keystore implementations from
Oracle JDK and Bouncy Castle, a widespread cryptographic
library. We describe, in detail, how the various keystores enforce
conﬁdentiality and integrity of the stored keys through password-
based cryptography and we show that many of the implementa-
tions do not adhere to state-of-the-art cryptographic standards.
We investigate the resistance to ofﬂine attacks and we show that,
for non-compliant keystores, brute-forcing can be up to three
orders of magnitude faster with respect to the most compliant
keystore. Additionally, when an attacker can tamper with the
keystore ﬁle, some implementations are vulnerable to denial of
service attacks or, in the worst case, arbitrary code execution.
Finally we discuss the ﬁxes implemented by Oracle and Bouncy
Castle developers following our responsible disclosure.
I.
INTRODUCTION
Cryptography is a fundamental technology for IT security.
Even if there are well established standards for cryptographic
operations, cryptography is com...


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

Input:
title:Mind Your Keys? A Security Evaluation of Java Keystores
author:Riccardo Focardi and
Francesco Palmarini and
Marco Squarcina and
Graham Steel and
Mauro Tempesta
Mind Your Keys?
A Security Evaluation of Java Keystores
Riccardo Focardi
Universit`a Ca’ Foscari
Francesco Palmarini
Universit`a Ca’ Foscari
Marco Squarcina
Universit`a Ca’ Foscari
Yarix
Cryptosense
Graham Steel
Mauro Tempesta
Cryptosense
Universit`a Ca’ Foscari
Cryptosense
focardi@unive.it
palmarini@unive.it
squarcina@unive.it
graham@cryptosense.com
tempesta@unive.it
Abstract—Cryptography is complex and variegate and re-
quires to combine different algorithms and mechanisms in non-
trivial ways. This complexity is often source of vulnerabilities.
Secure key management is one of the most critical aspects,
since leaking a cryptographic key vanishes any advantage of
using cryptography. In this paper we analyze Java keystores,
the standard way to manage and securely store keys in Java
applications. We consider seven keystore implementations from
Oracle JDK and Bouncy Castle, a widespread cryptographic
library. We describe, in detail, how the various keystores enforce
conﬁdentiality and integrity of the stored keys through password-
based cryptography and we show that many of the implementa-
tions do not adhere to state-of-the-art cryptographic standards.
We investigate the resistance to ofﬂine attacks and we show that,
for non-compliant keystores, brute-forcing can be up to three
orders of magnitude faster with respect to the most compliant
keystore. Additionally, when an attacker can tamper with the
keystore ﬁle, some implementations are vulnerable to denial of
service attacks or, in the worst case, arbitrary code execution.
Finally we discuss the ﬁxes implemented by Oracle and Bouncy
Castle developers following our responsible disclosure.
I.
INTRODUCTION
Cryptography is a fundamental technology for IT security.
Even if there are well established standards for cryptographic
operations, cryptography is com...

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


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

Output:
安全论文分析：

title:On the Safety and Efficiency of Virtual Firewall Elasticity Control
author:Juan Deng and
Hongda Li and
Hongxin Hu and
Kuang-Ching Wang and
Gail-Joon Ahn and
Ziming Zhao and
Wonkyu Han
On the Safety and Efﬁciency of
Virtual Firewall Elasticity Control
Juan Deng†∗, Hongda Li†∗, Hongxin Hu†, Kuang-Ching Wang†, Gail-Joon Ahn‡, Ziming Zhao‡, and Wonkyu Han‡
{jdeng, hongdal, hongxih, kwang}@clemson.edu
† Clemson University
‡Arizona State University
{gahn, zzhao30, iamhwk}@asu.edu
Abstract—Traditional hardware-based ﬁrewall appliances are
placed at ﬁxed locations with ﬁxed capacity. Such nature makes
them difﬁcult to protect today’s prevailing virtualized environ-
ments. Two emerging networking paradigms, Network Function
Virtualization (NFV) and Software-Deﬁned Networking (SDN),
offer the potential to address these limitations. NFV envisions
to implement ﬁrewall function as software instance (a.k.a virtual
ﬁrewall). Virtual ﬁrewalls provide great ﬂexibility and elasticity,
which are necessary to protect virtualized environments. In
this paper, we propose to build an innovative virtual ﬁrewall
controller, VFW Controller, to enable safe, efﬁcient and cost-
effective virtual ﬁrewall elasticity control. VFW Controller
addresses four key challenges with respect to semantic consistency,
correct ﬂow update, buffer overﬂow avoidance, and optimal scaling
in virtual ﬁrewall scaling. To demonstrate the feasibility of our ap-
proach, we implement the core components of VFW Controller
on top of NFV and SDN environments. Our experimental results
demonstrate that VFW Controller is efﬁcient to provide safe
elasticity control of virtual ﬁrewalls.
I.
INTRODUCTION
Firewall is the most critical and widely deployed network
security function that protects networks against suspicious
trafﬁc and unauthorized access. Traditional hardware-based
ﬁrewalls are often placed at ﬁxed network entry points and
have a constant capacity with respect to the maximum amount
of trafﬁc they can handle per ...


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

Input:
title:On the Safety and Efficiency of Virtual Firewall Elasticity Control
author:Juan Deng and
Hongda Li and
Hongxin Hu and
Kuang-Ching Wang and
Gail-Joon Ahn and
Ziming Zhao and
Wonkyu Han
On the Safety and Efﬁciency of
Virtual Firewall Elasticity Control
Juan Deng†∗, Hongda Li†∗, Hongxin Hu†, Kuang-Ching Wang†, Gail-Joon Ahn‡, Ziming Zhao‡, and Wonkyu Han‡
{jdeng, hongdal, hongxih, kwang}@clemson.edu
† Clemson University
‡Arizona State University
{gahn, zzhao30, iamhwk}@asu.edu
Abstract—Traditional hardware-based ﬁrewall appliances are
placed at ﬁxed locations with ﬁxed capacity. Such nature makes
them difﬁcult to protect today’s prevailing virtualized environ-
ments. Two emerging networking paradigms, Network Function
Virtualization (NFV) and Software-Deﬁned Networking (SDN),
offer the potential to address these limitations. NFV envisions
to implement ﬁrewall function as software instance (a.k.a virtual
ﬁrewall). Virtual ﬁrewalls provide great ﬂexibility and elasticity,
which are necessary to protect virtualized environments. In
this paper, we propose to build an innovative virtual ﬁrewall
controller, VFW Controller, to enable safe, efﬁcient and cost-
effective virtual ﬁrewall elasticity control. VFW Controller
addresses four key challenges with respect to semantic consistency,
correct ﬂow update, buffer overﬂow avoidance, and optimal scaling
in virtual ﬁrewall scaling. To demonstrate the feasibility of our ap-
proach, we implement the core components of VFW Controller
on top of NFV and SDN environments. Our experimental results
demonstrate that VFW Controller is efﬁcient to provide safe
elasticity control of virtual ﬁrewalls.
I.
INTRODUCTION
Firewall is the most critical and widely deployed network
security function that protects networks against suspicious
trafﬁc and unauthorized access. Traditional hardware-based
ﬁrewalls are often placed at ﬁxed network entry points and
have a constant capacity with respect to the maximum amount
of trafﬁc they can handle per ...

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


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

Output:
安全论文分析：

title:Detecting Third-Party Addresses in Traceroute Traces with IP Timestamp
Option
author:Pietro Marchetta and
Walter de Donato and
Antonio Pescapè
Detecting Third-Party Addresses
in Traceroute Traces with IP Timestamp Option
Pietro Marchetta, Walter de Donato, and Antonio Pescap´e
{pietro.marchetta,walter.dedonato,pescape}@unina.it
University of Napoli Federico II Italy
Abstract. Traceroute is one of the most famous and widely adopted di-
agnostic tool for computer networks. Although traceroute is often used
to infer links between Autonomous Systems (ASes), the presence of the
so-called third-party (TP) addresses may induce the inference of false
AS-level links. In this paper, we propose a novel active probing tech-
nique based on the IP timestamp option able to identify TP addresses.
For evaluating both the applicability and the utility of the proposed
technique, we perform a large-scale measurement campaign targeting –
from multiple vantage points – more than 327K destinations belonging
to about 14K ASes. The results show how TP addresses are very com-
mon and aﬀect about 17% of AS-level links extracted from traceroute
traces. Compared to a previously proposed heuristic method, our tech-
nique allows to identify many more TP addresses and to re-interpret part
of its results.
1
Introduction
An accurate knowledge of the Internet topology is essential for a deep under-
standing of such a complex and ever-evolving system [7, 11, 19, 20]. In the last
decade many attempts have been done to overcome the incompleteness of BGP-
derived AS-level topologies [12] using traceroute [4, 8, 13]. However, traceroute
is known to be inaccurate and to induce errors when its results are used to infer
the Internet topology [15, 17, 27].
One source of inaccuracy is represented by the so called third-party (TP)
addresses [14, 18], i.e. addresses associated to interfaces which are not actually
traversed by the IP packets sent toward the traceroute destination. While several
other causes...


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

Input:
title:Detecting Third-Party Addresses in Traceroute Traces with IP Timestamp
Option
author:Pietro Marchetta and
Walter de Donato and
Antonio Pescapè
Detecting Third-Party Addresses
in Traceroute Traces with IP Timestamp Option
Pietro Marchetta, Walter de Donato, and Antonio Pescap´e
{pietro.marchetta,walter.dedonato,pescape}@unina.it
University of Napoli Federico II Italy
Abstract. Traceroute is one of the most famous and widely adopted di-
agnostic tool for computer networks. Although traceroute is often used
to infer links between Autonomous Systems (ASes), the presence of the
so-called third-party (TP) addresses may induce the inference of false
AS-level links. In this paper, we propose a novel active probing tech-
nique based on the IP timestamp option able to identify TP addresses.
For evaluating both the applicability and the utility of the proposed
technique, we perform a large-scale measurement campaign targeting –
from multiple vantage points – more than 327K destinations belonging
to about 14K ASes. The results show how TP addresses are very com-
mon and aﬀect about 17% of AS-level links extracted from traceroute
traces. Compared to a previously proposed heuristic method, our tech-
nique allows to identify many more TP addresses and to re-interpret part
of its results.
1
Introduction
An accurate knowledge of the Internet topology is essential for a deep under-
standing of such a complex and ever-evolving system [7, 11, 19, 20]. In the last
decade many attempts have been done to overcome the incompleteness of BGP-
derived AS-level topologies [12] using traceroute [4, 8, 13]. However, traceroute
is known to be inaccurate and to induce errors when its results are used to infer
the Internet topology [15, 17, 27].
One source of inaccuracy is represented by the so called third-party (TP)
addresses [14, 18], i.e. addresses associated to interfaces which are not actually
traversed by the IP packets sent toward the traceroute destination. While several
other causes...

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


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

Output:
安全论文分析：

title:WIND: Workload-Aware INtrusion Detection
author:Sushant Sinha and
Farnam Jahanian and
Jignesh M. Patel
WIND: Workload-Aware INtrusion Detection
Sushant Sinha, Farnam Jahanian, and Jignesh M. Patel
Electrical Engineering and Computer Science,
University of Michigan,
Ann Arbor, MI-48109
{sushant, farnam, jignesh}@umich.edu
Abstract. Intrusion detection and prevention systems have become es-
sential to the protection of critical networks across the Internet. Widely
deployed IDS and IPS systems are based around a database of known ma-
licious signatures. This database is growing quickly while at the same time
the signatures are getting more complex. These trends place additional
performance requirements on the rule-matching engine inside IDSs and
IPSs, which check each signature against an incoming packet. Existing
approaches to signature evaluation apply statically-deﬁned optimizations
that do not take into account the network in which the IDS or IPS is de-
ployed or the characteristics of the signature database. We argue that for
higher performance, IDS and IPS systems should adapt according to the
workload, which includes the set of input signatures and the network traﬃc
characteristics. To demonstrate this idea, we have developed an adaptive
algorithm that systematically proﬁles attack signatures and network traf-
ﬁc to generate a high performance and memory-eﬃcient packet inspection
strategy. We have implemented our idea by building two distinct compo-
nents over Snort: a proﬁler that analyzes the input rules and the observed
network traﬃc to produce a packet inspection strategy, and an evaluation
engine that pre-processes rules according to the strategy and evaluates
incoming packets to determine the set of applicable signatures. We have
conducted an extensive evaluation of our workload-aware Snort implemen-
tation on a collection of publicly available datasets and on live traﬃc from
a border router at a large university network. Our evaluation shows that
th...


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

Input:
title:WIND: Workload-Aware INtrusion Detection
author:Sushant Sinha and
Farnam Jahanian and
Jignesh M. Patel
WIND: Workload-Aware INtrusion Detection
Sushant Sinha, Farnam Jahanian, and Jignesh M. Patel
Electrical Engineering and Computer Science,
University of Michigan,
Ann Arbor, MI-48109
{sushant, farnam, jignesh}@umich.edu
Abstract. Intrusion detection and prevention systems have become es-
sential to the protection of critical networks across the Internet. Widely
deployed IDS and IPS systems are based around a database of known ma-
licious signatures. This database is growing quickly while at the same time
the signatures are getting more complex. These trends place additional
performance requirements on the rule-matching engine inside IDSs and
IPSs, which check each signature against an incoming packet. Existing
approaches to signature evaluation apply statically-deﬁned optimizations
that do not take into account the network in which the IDS or IPS is de-
ployed or the characteristics of the signature database. We argue that for
higher performance, IDS and IPS systems should adapt according to the
workload, which includes the set of input signatures and the network traﬃc
characteristics. To demonstrate this idea, we have developed an adaptive
algorithm that systematically proﬁles attack signatures and network traf-
ﬁc to generate a high performance and memory-eﬃcient packet inspection
strategy. We have implemented our idea by building two distinct compo-
nents over Snort: a proﬁler that analyzes the input rules and the observed
network traﬃc to produce a packet inspection strategy, and an evaluation
engine that pre-processes rules according to the strategy and evaluates
incoming packets to determine the set of applicable signatures. We have
conducted an extensive evaluation of our workload-aware Snort implemen-
tation on a collection of publicly available datasets and on live traﬃc from
a border router at a large university network. Our evaluation shows that
th...

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


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

Input:
title:A statistical approach to botnet virulence estimation
author:Julian L. Rrushi and
Ehsan Mokhtari and
Ali A. Ghorbani
A Statistical Approach to Botnet Virulence Estimation
Julian Rrushi, Ehsan Mokhtari, Ali A. Ghorbani
University of New Brunswick, Fredericton, NB, E3B 5A3, Canada
{jrrushi, ehsan.mokhtari, ghorbani}@unb.ca
ABSTRACT
Network vulnerability and infection rates are key factors
in mathematical models of botnet propagation dynamics,
which in turn are increasingly deemed to have potential for
playing an important role in various botnet mitigation s-
trategies. In this paper we discuss research that draws on
epidemiological models in biology in order to solve the prob-
lem of how to estimate network vulnerability and infection
rates in relation to a botnet. This research provides bot-
net propagation models with concrete measures that make
those models practical, and hence employable in mitigation
of real world botnets in a timely fashion. The proposed es-
timation approach is based on random sampling and follows
a novel application of statistical learning and inference in a
botnet-versus-network setting. We have implemented this
research in the Matlab programming language, and thus in
the paper we also discuss an experimental validation of the
eﬀectiveness of this research with respect to realistically sim-
ulated botnet propagation dynamics in a GTNetS network
simulation platform.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Network]: Security
and Protection
General Terms
Security
Keywords
Computer network security, stochastic processes, statistical
learning and inference.
1.
INTRODUCTION
The tactical design of botnets, i.e. networks of compro-
mised nodes referred to as bots, which are controlled by
remote attackers known as botmasters, has been evolving
towards higher degrees of sophistication. Wang et al. [7]
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee...

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


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

Output:
安全论文分析：

title:A Bi-Criteria Scheduling Heuristic for Distributed Embedded Systems
under Reliability and Real-Time Constraints
author:Ismail Assayad and
Alain Girault and
Hamoudi Kalla
A Bi-Criteria Scheduling Heuristic for Distributed Embedded Systems under
Reliability and Real-Time Constraints
Ismail Assayad
VERIMAG, 2 av. de Vignate,
38610 Gières, France.
Ismail.Assayad@imag.fr
Alain Girault
INRIA, 655 av. de l’Europe
3833 Saint-Ismier, Cedex - France
Alain.Girault@inrialpes.fr
Hamoudi Kalla
INRIA, 655 av. de l’Europe
3833 Saint-Ismier, Cedex - France
Hamoudi.Kalla@inrialpes.fr
Abstract
Multi-criteria scheduling problems, involving optimiza-
tion of more than one criterion, are subject to a growing
interest. In this paper, we present a new bi-criteria schedul-
ing heuristic for scheduling data-ﬂow graphs of operations
onto parallel heterogeneous architectures according to two
criteria: ﬁrst the minimization of the schedule length, and
second the maximization of the system reliability. Reliabil-
ity is deﬁned as the probability that none of the system com-
ponents will fail while processing. The proposed algorithm
is a list scheduling heuristics, based on a bi-criteria com-
promise function that introduces priority between the op-
erations to be scheduled, and that chooses on what subset
of processors they should be scheduled. It uses the active
replication of operations to improve the reliability. If the
system reliability or the schedule length requirements are
not met, then a parameter of the compromise function can
be changed and the algorithm re-executed. This process is
iterated until both requirements are met.
Keywords: Distributed real-time systems, safety-critical
systems, reliability, multi-criteria scheduling, heteroge-
neous systems, active software replication.
1 Introduction
Distributed systems are being increasingly used in criti-
cal real-time applications, such as avionics, air trafﬁc con-
trol, autopilot systems, and nuclear plant control, in which
the co...


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

Input:
title:A Bi-Criteria Scheduling Heuristic for Distributed Embedded Systems
under Reliability and Real-Time Constraints
author:Ismail Assayad and
Alain Girault and
Hamoudi Kalla
A Bi-Criteria Scheduling Heuristic for Distributed Embedded Systems under
Reliability and Real-Time Constraints
Ismail Assayad
VERIMAG, 2 av. de Vignate,
38610 Gières, France.
Ismail.Assayad@imag.fr
Alain Girault
INRIA, 655 av. de l’Europe
3833 Saint-Ismier, Cedex - France
Alain.Girault@inrialpes.fr
Hamoudi Kalla
INRIA, 655 av. de l’Europe
3833 Saint-Ismier, Cedex - France
Hamoudi.Kalla@inrialpes.fr
Abstract
Multi-criteria scheduling problems, involving optimiza-
tion of more than one criterion, are subject to a growing
interest. In this paper, we present a new bi-criteria schedul-
ing heuristic for scheduling data-ﬂow graphs of operations
onto parallel heterogeneous architectures according to two
criteria: ﬁrst the minimization of the schedule length, and
second the maximization of the system reliability. Reliabil-
ity is deﬁned as the probability that none of the system com-
ponents will fail while processing. The proposed algorithm
is a list scheduling heuristics, based on a bi-criteria com-
promise function that introduces priority between the op-
erations to be scheduled, and that chooses on what subset
of processors they should be scheduled. It uses the active
replication of operations to improve the reliability. If the
system reliability or the schedule length requirements are
not met, then a parameter of the compromise function can
be changed and the algorithm re-executed. This process is
iterated until both requirements are met.
Keywords: Distributed real-time systems, safety-critical
systems, reliability, multi-criteria scheduling, heteroge-
neous systems, active software replication.
1 Introduction
Distributed systems are being increasingly used in criti-
cal real-time applications, such as avionics, air trafﬁc con-
trol, autopilot systems, and nuclear plant control, in which
the co...

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


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

Output:
安全论文分析：

title:16th Workshop on Privacy in the Electronic Society (WPES 2017)
author:Adam J. Lee
16th Workshop on Privacy in the Electronic Society (WPES 2017)
Adam J. Lee
University of Pittsburgh
Pittsburgh, Pennsylvania
adamlee@cs.pitt.edu
ABSTRACT
The 16th Workshop on Privacy in the Electronic Society was held
on October 30, 2017 in conjunction with the 24th ACM Conference
on Computer and Communications Security (CCS 2017) in Dallas,
Texas, USA. The goal of WPES is to bring together a diverse group
of privacy researchers and practitioners to discuss privacy problems
that arise in global, interconnected societies, and potential solutions
to them. The program for the workshop contains 14 full papers
and 5 short papers selected from a total of 56 submissions. Specific
topics covered in the program include but are not limited to: de-
anonymization, fingerprinting and profiling, location privacy, and
private memory systems.
CCS CONCEPTS
• Security and privacy;
KEYWORDS
Privacy protection
ACM Reference Format:
Adam J. Lee. 2017. 16th Workshop on Privacy in the Electronic Society
(WPES 2017). In Proceedings of CCS ’17. ACM, New York, NY, USA, Article 4,
2 pages. https://doi.org/10.1145/3133956.3137047
1 INTRODUCTION
The increased power and interconnectivity of computer systems
available today create the ability to store and process large amounts
of data, resulting in networked information accessible from any-
where at any time. It is becoming easier to collect, exchange, access,
process, and link information. This global scenario has inevitably
resulted in an increasing degree of awareness with respect to pri-
vacy. Privacy issues have been the subject of public debates, and
the need for privacy-aware policies, regulations, and techniques
has been widely recognized.
The goal of this workshop is to discuss the problems of privacy
in global interconnected societies, as well as possible solutions to
these types of problems. The workshop seeks submissions from
academia and industry ...


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

Input:
title:16th Workshop on Privacy in the Electronic Society (WPES 2017)
author:Adam J. Lee
16th Workshop on Privacy in the Electronic Society (WPES 2017)
Adam J. Lee
University of Pittsburgh
Pittsburgh, Pennsylvania
adamlee@cs.pitt.edu
ABSTRACT
The 16th Workshop on Privacy in the Electronic Society was held
on October 30, 2017 in conjunction with the 24th ACM Conference
on Computer and Communications Security (CCS 2017) in Dallas,
Texas, USA. The goal of WPES is to bring together a diverse group
of privacy researchers and practitioners to discuss privacy problems
that arise in global, interconnected societies, and potential solutions
to them. The program for the workshop contains 14 full papers
and 5 short papers selected from a total of 56 submissions. Specific
topics covered in the program include but are not limited to: de-
anonymization, fingerprinting and profiling, location privacy, and
private memory systems.
CCS CONCEPTS
• Security and privacy;
KEYWORDS
Privacy protection
ACM Reference Format:
Adam J. Lee. 2017. 16th Workshop on Privacy in the Electronic Society
(WPES 2017). In Proceedings of CCS ’17. ACM, New York, NY, USA, Article 4,
2 pages. https://doi.org/10.1145/3133956.3137047
1 INTRODUCTION
The increased power and interconnectivity of computer systems
available today create the ability to store and process large amounts
of data, resulting in networked information accessible from any-
where at any time. It is becoming easier to collect, exchange, access,
process, and link information. This global scenario has inevitably
resulted in an increasing degree of awareness with respect to pri-
vacy. Privacy issues have been the subject of public debates, and
the need for privacy-aware policies, regulations, and techniques
has been widely recognized.
The goal of this workshop is to discuss the problems of privacy
in global interconnected societies, as well as possible solutions to
these types of problems. The workshop seeks submissions from
academia and industry ...

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


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

Output:
安全论文分析：

title:EpicRec: Towards Practical Differentially Private Framework for Personalized
Recommendation
author:Yilin Shen and
Hongxia Jin
EpicRec: Towards Practical Differentially Private
Framework for Personalized Recommendation
Yilin Shen
Samsung Research America
665 Clyde Ave, Mountain View, CA 94043
yilin.shen@samsung.com
Hongxia Jin
Samsung Research America
665 Clyde Ave, Mountain View, CA 94043
hongxia.jin@samsung.com
ABSTRACT
Recommender systems typically require users’ history data
to provide a list of recommendations and such recommen-
dations usually reside on the cloud/server. However, the
release of such private data to the cloud has been shown to
put users at risk. It is highly desirable to provide users high-
quality personalized services while respecting their privacy.
In this paper, we develop the ﬁrst Enhanced Privacy-built-
In Client for Personalized Recommendation (EpicRec) sys-
tem that performs the data perturbation on the client side
to protect users’ privacy. Our system needs no assumption
of trusted server and no change on the recommendation al-
gorithms on the server side; and needs minimum user inter-
action in their preferred manner, which makes our solution
ﬁt very well into real world practical use.
The design of EpicRec system incorporates three main
modules: (1) usable privacy control interface that enables
two user preferred privacy controls, overall and category-
based controls, in the way they understand; (2) user privacy
level quantiﬁcation that automatically quantiﬁes user pri-
vacy concern level from these user understandable inputs;
(3) lightweight data perturbation algorithm that perturbs
user private data with provable guarantees on both diﬀeren-
tial privacy and data utility.
Using large-scale real world datasets, we show that, for
both overall and category-based privacy controls, EpicRec
performs best with respect to both perturbation quality and
personalized recommendation, with negligible computational
overhead. Therefore, EpicR...


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

Input:
title:EpicRec: Towards Practical Differentially Private Framework for Personalized
Recommendation
author:Yilin Shen and
Hongxia Jin
EpicRec: Towards Practical Differentially Private
Framework for Personalized Recommendation
Yilin Shen
Samsung Research America
665 Clyde Ave, Mountain View, CA 94043
yilin.shen@samsung.com
Hongxia Jin
Samsung Research America
665 Clyde Ave, Mountain View, CA 94043
hongxia.jin@samsung.com
ABSTRACT
Recommender systems typically require users’ history data
to provide a list of recommendations and such recommen-
dations usually reside on the cloud/server. However, the
release of such private data to the cloud has been shown to
put users at risk. It is highly desirable to provide users high-
quality personalized services while respecting their privacy.
In this paper, we develop the ﬁrst Enhanced Privacy-built-
In Client for Personalized Recommendation (EpicRec) sys-
tem that performs the data perturbation on the client side
to protect users’ privacy. Our system needs no assumption
of trusted server and no change on the recommendation al-
gorithms on the server side; and needs minimum user inter-
action in their preferred manner, which makes our solution
ﬁt very well into real world practical use.
The design of EpicRec system incorporates three main
modules: (1) usable privacy control interface that enables
two user preferred privacy controls, overall and category-
based controls, in the way they understand; (2) user privacy
level quantiﬁcation that automatically quantiﬁes user pri-
vacy concern level from these user understandable inputs;
(3) lightweight data perturbation algorithm that perturbs
user private data with provable guarantees on both diﬀeren-
tial privacy and data utility.
Using large-scale real world datasets, we show that, for
both overall and category-based privacy controls, EpicRec
performs best with respect to both perturbation quality and
personalized recommendation, with negligible computational
overhead. Therefore, EpicR...

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