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

Output:
安全论文分析：

title:Machine learning attacks against the Asirra CAPTCHA
author:Philippe Golle
Machine Learning Attacks
Against the Asirra CAPTCHA
Philippe Golle
Palo Alto Research Center
Palo Alto, CA 94304, USA
pgolle@parc.com
ABSTRACT
The Asirra CAPTCHA [7], proposed at ACM CCS 2007,
relies on the problem of distinguishing images of cats and
dogs (a task that humans are very good at). The security
of Asirra is based on the presumed diﬃculty of classifying
these images automatically.
In this paper, we describe a classiﬁer which is 82.7% ac-
curate in telling apart the images of cats and dogs used in
Asirra. This classiﬁer is a combination of support-vector
machine classiﬁers trained on color and texture features ex-
tracted from images. Our classiﬁer allows us to solve a
12-image Asirra challenge automatically with probability
10.3%. This probability of success is signiﬁcantly higher
than the estimate of 0.2% given in [7] for machine vision at-
tacks. Our results suggest caution against deploying Asirra
without safeguards.
We also investigate the impact of our attacks on the partial
credit and token bucket algorithms proposed in [7]. The
partial credit algorithm weakens Asirra considerably and we
recommend against its use. The token bucket algorithm
helps mitigate the impact of our attacks and allows Asirra
to be deployed in a way that maintains an appealing balance
between usability and security. One contribution of our work
is to inform the choice of safeguard parameters in Asirra
deployments.
Categories and Subject Descriptors
K.6.5 [Computing Milieux]: Management of Computing
and Information Systems—Security and Protection
General Terms
Security
Keywords
CAPTCHA, reverse Turing test, machine learning, support
vector machine, classiﬁer.
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 ...


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

Input:
title:Machine learning attacks against the Asirra CAPTCHA
author:Philippe Golle
Machine Learning Attacks
Against the Asirra CAPTCHA
Philippe Golle
Palo Alto Research Center
Palo Alto, CA 94304, USA
pgolle@parc.com
ABSTRACT
The Asirra CAPTCHA [7], proposed at ACM CCS 2007,
relies on the problem of distinguishing images of cats and
dogs (a task that humans are very good at). The security
of Asirra is based on the presumed diﬃculty of classifying
these images automatically.
In this paper, we describe a classiﬁer which is 82.7% ac-
curate in telling apart the images of cats and dogs used in
Asirra. This classiﬁer is a combination of support-vector
machine classiﬁers trained on color and texture features ex-
tracted from images. Our classiﬁer allows us to solve a
12-image Asirra challenge automatically with probability
10.3%. This probability of success is signiﬁcantly higher
than the estimate of 0.2% given in [7] for machine vision at-
tacks. Our results suggest caution against deploying Asirra
without safeguards.
We also investigate the impact of our attacks on the partial
credit and token bucket algorithms proposed in [7]. The
partial credit algorithm weakens Asirra considerably and we
recommend against its use. The token bucket algorithm
helps mitigate the impact of our attacks and allows Asirra
to be deployed in a way that maintains an appealing balance
between usability and security. One contribution of our work
is to inform the choice of safeguard parameters in Asirra
deployments.
Categories and Subject Descriptors
K.6.5 [Computing Milieux]: Management of Computing
and Information Systems—Security and Protection
General Terms
Security
Keywords
CAPTCHA, reverse Turing test, machine learning, support
vector machine, classiﬁer.
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 ...

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


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

Output:
安全论文分析：

title:Constrained Concealment Attacks against Reconstruction-based Anomaly
Detectors in Industrial Control Systems
author:Alessandro Erba and
Riccardo Taormina and
Stefano Galelli and
Marcello Pogliani and
Michele Carminati and
Stefano Zanero and
Nils Ole Tippenhauer
Constrained Concealment Attacks against
Reconstruction-based Anomaly Detectors in
Industrial Control Systems
0
2
0
2
t
c
O
2
1
]
R
C
.
s
c
[
3
v
7
8
4
7
0
.
7
0
9
1
:
v
i
X
r
a
Alessandro Erba∗†
alessandro.erba@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
Riccardo Taormina
r.taormina@tudelft.nl
Delft University of
Technology
Delft, Netherlands
Stefano Galelli
stefano_galelli@sutd.edu.sg
Singapore University of
Technology and Design
Singapore
Marcello Pogliani
marcello.pogliani@polimi.it
Politecnico di Milano
Milan, Italy
Michele Carminati
michele.carminati@polimi.it
Politecnico di Milano
Milan, Italy
Stefano Zanero
stefano.zanero@polimi.it
Politecnico di Milano
Milan, Italy
Nils Ole Tippenhauer
tippenhauer@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
ABSTRACT
Recently, reconstruction-based anomaly detection was proposed
as an effective technique to detect attacks in dynamic industrial
control networks. Unlike classical network anomaly detectors that
observe the network traffic, reconstruction-based detectors operate
on the measured sensor data, leveraging physical process models
learned a priori.
In this work, we investigate different approaches to evade prior-
work reconstruction-based anomaly detectors by manipulating sen-
sor data so that the attack is concealed. We find that replay attacks
(commonly assumed to be very strong) show bad performance (i.e.,
increasing the number of alarms) if the attacker is constrained to
manipulate less than 95% of all features in the system, as hidden
correlations between the features are not replicated well. To ad-
dress this, we propose two novel attacks that manipulate a subset
of the se...


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

Input:
title:Constrained Concealment Attacks against Reconstruction-based Anomaly
Detectors in Industrial Control Systems
author:Alessandro Erba and
Riccardo Taormina and
Stefano Galelli and
Marcello Pogliani and
Michele Carminati and
Stefano Zanero and
Nils Ole Tippenhauer
Constrained Concealment Attacks against
Reconstruction-based Anomaly Detectors in
Industrial Control Systems
0
2
0
2
t
c
O
2
1
]
R
C
.
s
c
[
3
v
7
8
4
7
0
.
7
0
9
1
:
v
i
X
r
a
Alessandro Erba∗†
alessandro.erba@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
Riccardo Taormina
r.taormina@tudelft.nl
Delft University of
Technology
Delft, Netherlands
Stefano Galelli
stefano_galelli@sutd.edu.sg
Singapore University of
Technology and Design
Singapore
Marcello Pogliani
marcello.pogliani@polimi.it
Politecnico di Milano
Milan, Italy
Michele Carminati
michele.carminati@polimi.it
Politecnico di Milano
Milan, Italy
Stefano Zanero
stefano.zanero@polimi.it
Politecnico di Milano
Milan, Italy
Nils Ole Tippenhauer
tippenhauer@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
ABSTRACT
Recently, reconstruction-based anomaly detection was proposed
as an effective technique to detect attacks in dynamic industrial
control networks. Unlike classical network anomaly detectors that
observe the network traffic, reconstruction-based detectors operate
on the measured sensor data, leveraging physical process models
learned a priori.
In this work, we investigate different approaches to evade prior-
work reconstruction-based anomaly detectors by manipulating sen-
sor data so that the attack is concealed. We find that replay attacks
(commonly assumed to be very strong) show bad performance (i.e.,
increasing the number of alarms) if the attacker is constrained to
manipulate less than 95% of all features in the system, as hidden
correlations between the features are not replicated well. To ad-
dress this, we propose two novel attacks that manipulate a subset
of the se...

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


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

Output:
安全论文分析：

title:Preserving privacy in gps traces via uncertainty-aware path cloaking
author:Baik Hoh and
Marco Gruteser and
Hui Xiong and
Ansaf Alrabady
Preserving Privacy in GPS Traces via Uncertainty-Aware
Path Cloaking
Baik Hoh, Marco Gruteser
WINLAB / ECE Dept., Rutgers Univ.
Piscataway, NJ USA
baikhoh,gruteser@winlab.rutgers.edu
Hui Xiong
MSIS Dept., Rutgers Univ.
Newark, NJ USA
hui@rbs.rutgers.edu
Ansaf Alrabady
General Motors Corporation
Warren, MI USA
ansaf.alrabady@gm.com
ABSTRACT
Motivated by a probe-vehicle based automotive trafﬁc monitoring
system, this paper considers the problem of guaranteed anonymity
in a dataset of location traces while maintaining high data accuracy.
We ﬁnd through analysis of a set of GPS traces from 233 vehicles
that known privacy algorithms cannot meet accuracy requirements
or fail to provide privacy guarantees for drivers in low-density ar-
eas. To overcome these challenges, we develop a novel time-to-
confusion criterion to characterize privacy in a location dataset and
propose an uncertainty-aware path cloaking algorithm that hides
location samples in a dataset to provide a time-to-confusion guar-
antee for all vehicles. We show that this approach effectively guar-
antees worst case tracking bounds, while achieving signiﬁcant data
accuracy improvements.
Categories and Subject Descriptors
K.4.1 [Computers and Society]: Public Policy IssuesPrivacy; K.6
[Management of Computing and Information Systems]: Secu-
rity and Protection
General Terms
Algorithms, Measurements, Security
Keywords
Privacy, GPS, Trafﬁc
1.
INTRODUCTION
A new class of applications that mines aggregate location traces
from large numbers of users, spawned by the increasing ubiquity
of sensors and wireless communications, raises signiﬁcant privacy
concerns. One example and the motivation for this paper is automo-
tive trafﬁc monitoring through probe vehicles [20, 14, 30], which
infers trafﬁc congestion from position and speed information peri-
odically reported from GPS-eq...


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

Input:
title:Preserving privacy in gps traces via uncertainty-aware path cloaking
author:Baik Hoh and
Marco Gruteser and
Hui Xiong and
Ansaf Alrabady
Preserving Privacy in GPS Traces via Uncertainty-Aware
Path Cloaking
Baik Hoh, Marco Gruteser
WINLAB / ECE Dept., Rutgers Univ.
Piscataway, NJ USA
baikhoh,gruteser@winlab.rutgers.edu
Hui Xiong
MSIS Dept., Rutgers Univ.
Newark, NJ USA
hui@rbs.rutgers.edu
Ansaf Alrabady
General Motors Corporation
Warren, MI USA
ansaf.alrabady@gm.com
ABSTRACT
Motivated by a probe-vehicle based automotive trafﬁc monitoring
system, this paper considers the problem of guaranteed anonymity
in a dataset of location traces while maintaining high data accuracy.
We ﬁnd through analysis of a set of GPS traces from 233 vehicles
that known privacy algorithms cannot meet accuracy requirements
or fail to provide privacy guarantees for drivers in low-density ar-
eas. To overcome these challenges, we develop a novel time-to-
confusion criterion to characterize privacy in a location dataset and
propose an uncertainty-aware path cloaking algorithm that hides
location samples in a dataset to provide a time-to-confusion guar-
antee for all vehicles. We show that this approach effectively guar-
antees worst case tracking bounds, while achieving signiﬁcant data
accuracy improvements.
Categories and Subject Descriptors
K.4.1 [Computers and Society]: Public Policy IssuesPrivacy; K.6
[Management of Computing and Information Systems]: Secu-
rity and Protection
General Terms
Algorithms, Measurements, Security
Keywords
Privacy, GPS, Trafﬁc
1.
INTRODUCTION
A new class of applications that mines aggregate location traces
from large numbers of users, spawned by the increasing ubiquity
of sensors and wireless communications, raises signiﬁcant privacy
concerns. One example and the motivation for this paper is automo-
tive trafﬁc monitoring through probe vehicles [20, 14, 30], which
infers trafﬁc congestion from position and speed information peri-
odically reported from GPS-eq...

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


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

Output:
安全论文分析：

title:A general design towards secure ad-hoc collaboration
author:Masayuki Nakae and
Xinwen Zhang and
Ravi S. Sandhu
A  General  Design  towards  Secure  Ad-hoc  Collaboration
Masayuki Nakae
NEC Corporation
Kawasaki, Kanagawa, Japan
m-nakae@bp.jp.nec.com
Xinwen Zhang
George Mason University
Fairfax, Virginia, USA
xzhang6@gmu.edu
Ravi Sandhu
George Mason University
and TriCipher Inc., USA
sandhu@gmu.edu
ABSTRACT
We  propose  a  general  desgn  for  secure  collaboraton  systems,
whch  s  underpnned  wth  an  access  control  polcy  model,  an
admnstratve scheme, and an enforcement scheme, based on the
Typed Usage Control (TUCON) model. TUCON s a generalzed
form of the usage control model (UCON) proposed recently. By
utlzng mutable object attrbutes, UCON can reflect the dynamc
nature  of  ad-hoc  collaboratons  such  as  temporal  and/or  spatal
usages. In TUCON, every object has an object type as a persstent
attrbute,  whch  works  as  a  name  space  that  ndcates  an
organzaton  to  whch  the  object  belongs.  Wth  object  types,
TUCON  polces  can  dstnctly  control  ntra-organzaton  and
nter-organzaton nformaton flows. Ths approach acheves the
autonomy  of  collaboratve
the  mutual
confdentalty of collaboratng organzatons.
teams  as  well  as
Categories and Subject Descriptors
D..  [Operating  Systems]:  Securty  and  Protecton—Access
controls;  K..  [Management  of  Computing  and  Information
Systems]: Securty and Protecton—Unauthorized access
General Terms
Securty
Keywords
Access Control, Informaton flow, Usage Control, Collaboraton.
In order to ncrease the productvty and effcency of ntellectual
actvtes  such  as  scentfc  or  engneerng  research,
the
mportance of collaboratve work among concerned organzatons
s  well  understood.  To  date,  dstrbuted  computng  technologes
such as vrtual prvate networkng, peer-to-peer fle sharng, Web
s...


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

Input:
title:A general design towards secure ad-hoc collaboration
author:Masayuki Nakae and
Xinwen Zhang and
Ravi S. Sandhu
A  General  Design  towards  Secure  Ad-hoc  Collaboration
Masayuki Nakae
NEC Corporation
Kawasaki, Kanagawa, Japan
m-nakae@bp.jp.nec.com
Xinwen Zhang
George Mason University
Fairfax, Virginia, USA
xzhang6@gmu.edu
Ravi Sandhu
George Mason University
and TriCipher Inc., USA
sandhu@gmu.edu
ABSTRACT
We  propose  a  general  desgn  for  secure  collaboraton  systems,
whch  s  underpnned  wth  an  access  control  polcy  model,  an
admnstratve scheme, and an enforcement scheme, based on the
Typed Usage Control (TUCON) model. TUCON s a generalzed
form of the usage control model (UCON) proposed recently. By
utlzng mutable object attrbutes, UCON can reflect the dynamc
nature  of  ad-hoc  collaboratons  such  as  temporal  and/or  spatal
usages. In TUCON, every object has an object type as a persstent
attrbute,  whch  works  as  a  name  space  that  ndcates  an
organzaton  to  whch  the  object  belongs.  Wth  object  types,
TUCON  polces  can  dstnctly  control  ntra-organzaton  and
nter-organzaton nformaton flows. Ths approach acheves the
autonomy  of  collaboratve
the  mutual
confdentalty of collaboratng organzatons.
teams  as  well  as
Categories and Subject Descriptors
D..  [Operating  Systems]:  Securty  and  Protecton—Access
controls;  K..  [Management  of  Computing  and  Information
Systems]: Securty and Protecton—Unauthorized access
General Terms
Securty
Keywords
Access Control, Informaton flow, Usage Control, Collaboraton.
In order to ncrease the productvty and effcency of ntellectual
actvtes  such  as  scentfc  or  engneerng  research,
the
mportance of collaboratve work among concerned organzatons
s  well  understood.  To  date,  dstrbuted  computng  technologes
such as vrtual prvate networkng, peer-to-peer fle sharng, Web
s...

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


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

Output:
安全论文分析：

title:Privacy-Preserving Location Tracking of Lost or Stolen Devices: Cryptographic
Techniques and Replacing Trusted Third Parties with DHTs
author:Thomas Ristenpart and
Gabriel Maganis and
Arvind Krishnamurthy and
Tadayoshi Kohno
Privacy-Preserving Location Tracking of Lost or Stolen Devices:
Cryptographic Techniques and Replacing Trusted Third Parties with DHTs
Thomas Ristenpart∗
Gabriel Maganis†
∗University of California, San Diego
Arvind Krishnamurthy†
Tadayoshi Kohno†
†University of Washington
tristenp@cs.ucsd.edu
{gym,arvind,yoshi}@cs.washington.edu
Abstract
We tackle the problem of building privacy-preserving
device-tracking systems — or private methods to assist in
the recovery of lost or stolen Internet-connected mobile
devices. The main goals of such systems are seemingly
contradictory:
to hide the device’s legitimately-visited
locations from third-party services and other parties (lo-
cation privacy) while simultaneously using those same
services to help recover the device’s location(s) after it
goes missing (device-tracking). We propose a system,
named Adeona, that nevertheless meets both goals.
It
provides strong guarantees of location privacy while pre-
serving the ability to efﬁciently track missing devices.
We build a version of Adeona that uses OpenDHT as the
third party service, resulting in an immediately deploy-
able system that does not rely on any single trusted third
party. We describe numerous extensions for the basic de-
sign that increase Adeona’s suitability for particular de-
ployment environments.
1
Introduction
The growing ubiquity of mobile computing devices, and
our reliance upon them, means that losing them is simul-
taneously more likely and more damaging. For example,
the annual CSI/FBI Computer Crime and Security Sur-
vey ranks laptop and mobile device theft as a prevalent
and expensive problem for corporations [16]. To help
combat this growing problem, corporations and individ-
uals are deploying commercial device-tracking softwa...


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

Input:
title:Privacy-Preserving Location Tracking of Lost or Stolen Devices: Cryptographic
Techniques and Replacing Trusted Third Parties with DHTs
author:Thomas Ristenpart and
Gabriel Maganis and
Arvind Krishnamurthy and
Tadayoshi Kohno
Privacy-Preserving Location Tracking of Lost or Stolen Devices:
Cryptographic Techniques and Replacing Trusted Third Parties with DHTs
Thomas Ristenpart∗
Gabriel Maganis†
∗University of California, San Diego
Arvind Krishnamurthy†
Tadayoshi Kohno†
†University of Washington
tristenp@cs.ucsd.edu
{gym,arvind,yoshi}@cs.washington.edu
Abstract
We tackle the problem of building privacy-preserving
device-tracking systems — or private methods to assist in
the recovery of lost or stolen Internet-connected mobile
devices. The main goals of such systems are seemingly
contradictory:
to hide the device’s legitimately-visited
locations from third-party services and other parties (lo-
cation privacy) while simultaneously using those same
services to help recover the device’s location(s) after it
goes missing (device-tracking). We propose a system,
named Adeona, that nevertheless meets both goals.
It
provides strong guarantees of location privacy while pre-
serving the ability to efﬁciently track missing devices.
We build a version of Adeona that uses OpenDHT as the
third party service, resulting in an immediately deploy-
able system that does not rely on any single trusted third
party. We describe numerous extensions for the basic de-
sign that increase Adeona’s suitability for particular de-
ployment environments.
1
Introduction
The growing ubiquity of mobile computing devices, and
our reliance upon them, means that losing them is simul-
taneously more likely and more damaging. For example,
the annual CSI/FBI Computer Crime and Security Sur-
vey ranks laptop and mobile device theft as a prevalent
and expensive problem for corporations [16]. To help
combat this growing problem, corporations and individ-
uals are deploying commercial device-tracking softwa...

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


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

Output:
安全论文分析：

title:POSTER: RIA: an Audition-based Method to Protect the Runtime Integrity
of MapReduce Applications
author:Yongzhi Wang and
Yulong Shen
POSTER: RIA – an Audition-based Method to Protect the
Runtime Integrity of MapReduce Applications
Yongzhi Wang
School of Computer Science and Technology,
School of Computer Science and Technology
Xidian University, P.R. China
Key Laboratory of Grain Information Processing
and Control (Henan University of Technology),
Ministry of Education, P.R. China
yzwang@xidian.edu.cn
Yulong Shen
Xidian University, P.R. China
ylshen@mail.xidian.edu.cn
ABSTRACT
Public cloud vendors have been oﬀering varies big data com-
puting services. However, runtime integrity is one of the ma-
jor concerns that hinders the adoption of those services. In
this paper, we focus on MapReduce, a popular big data com-
puting framework, propose the runtime integrity audition
(RIA), a solution to verify the runtime integrity of MapRe-
duce applications. Based on the idea of RIA, we developed
a prototype system, called MR Auditor, and tested its ap-
plicability and the performance with multiple Hadoop appli-
cations. Our experimental results showed that MR Auditor
is an eﬃcient tool to detect runtime integrity violation and
incurs a moderate performance overhead.
Keywords
Computation Integrity, Remote Veriﬁcation, MapReduce
1.
INTRODUCTION
MapReduce, the fundamental framework supporting vari-
ous big data applications, has been delivered as a computa-
tion service by public cloud vendors. However, in this model,
since computations are performed remotely, security is be-
yond the control of customers. Security breach incidents
reported by mass media [1] and vulnerabilities discovered
by researchers [3] have obstructed the wide adoption of such
a service. Among varies security issues, runtime integrity
is one of the most critical ones that is closely related to the
MapReduce service. Existing works relying on speciﬁc hard-
ware environment [4], task redundancy [5], or ...


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

Input:
title:POSTER: RIA: an Audition-based Method to Protect the Runtime Integrity
of MapReduce Applications
author:Yongzhi Wang and
Yulong Shen
POSTER: RIA – an Audition-based Method to Protect the
Runtime Integrity of MapReduce Applications
Yongzhi Wang
School of Computer Science and Technology,
School of Computer Science and Technology
Xidian University, P.R. China
Key Laboratory of Grain Information Processing
and Control (Henan University of Technology),
Ministry of Education, P.R. China
yzwang@xidian.edu.cn
Yulong Shen
Xidian University, P.R. China
ylshen@mail.xidian.edu.cn
ABSTRACT
Public cloud vendors have been oﬀering varies big data com-
puting services. However, runtime integrity is one of the ma-
jor concerns that hinders the adoption of those services. In
this paper, we focus on MapReduce, a popular big data com-
puting framework, propose the runtime integrity audition
(RIA), a solution to verify the runtime integrity of MapRe-
duce applications. Based on the idea of RIA, we developed
a prototype system, called MR Auditor, and tested its ap-
plicability and the performance with multiple Hadoop appli-
cations. Our experimental results showed that MR Auditor
is an eﬃcient tool to detect runtime integrity violation and
incurs a moderate performance overhead.
Keywords
Computation Integrity, Remote Veriﬁcation, MapReduce
1.
INTRODUCTION
MapReduce, the fundamental framework supporting vari-
ous big data applications, has been delivered as a computa-
tion service by public cloud vendors. However, in this model,
since computations are performed remotely, security is be-
yond the control of customers. Security breach incidents
reported by mass media [1] and vulnerabilities discovered
by researchers [3] have obstructed the wide adoption of such
a service. Among varies security issues, runtime integrity
is one of the most critical ones that is closely related to the
MapReduce service. Existing works relying on speciﬁc hard-
ware environment [4], task redundancy [5], or ...

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


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

Output:
安全论文分析：

title:An empirical characterization of IFTTT: ecosystem, usage, and performance
author:Xianghang Mi and
Feng Qian and
Ying Zhang and
XiaoFeng Wang
An Empirical Characterization of IFTTT:
Ecosystem, Usage, and Performance
Feng Qian
Xianghang Mi
Indiana University Bloomington
xmi@indiana.edu
Ying Zhang
Facebook Inc.
zhangying@fb.com
Indiana University Bloomington
fengqian@indiana.edu
XiaoFeng Wang
Indiana University Bloomington
xw7@indiana.edu
ABSTRACT
IFTTT is a popular trigger-action programming platform whose
applets can automate more than 400 services of IoT devices and
web applications. We conduct an empirical study of IFTTT using
a combined approach of analyzing data collected for 6 months
and performing controlled experiments using a custom testbed.
We profile the interactions among different entities, measure
how applets are used by end users, and test the performance of
applet execution. Overall we observe the fast growth of the IFTTT
ecosystem and its increasing usage for automating IoT-related tasks,
which correspond to 52% of all services and 16% of the applet usage.
We also observe several performance inefficiencies and identify
their causes.
CCS CONCEPTS
• Networks → Home networks; Network performance evaluation;
• Computer systems organization → Embedded systems;
KEYWORDS
IFTTT, IoT, Measurement
ACM Reference Format:
Xianghang Mi, Feng Qian, Ying Zhang, and XiaoFeng Wang. 2017. An
Empirical Characterization of IFTTT: Ecosystem, Usage, and Performance.
In Proceedings of IMC ’17. ACM, New York, NY, USA, 7 pages. https://doi.
org/10.1145/3131365.3131369
1 INTRODUCTION
Consumer Internet of Things (IoT) devices such as smart home
gadgets are becoming increasingly popular. For example, Amazon
has sold more than 5 million Amazon Echo devices in just two
years since their debut in late 2014 [1]. Among many challenges
faced by today’s consumer IoT systems, policy management plays a
critical role in ensuring scalable, automated, secure, and resource-
efficient in...


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

Input:
title:An empirical characterization of IFTTT: ecosystem, usage, and performance
author:Xianghang Mi and
Feng Qian and
Ying Zhang and
XiaoFeng Wang
An Empirical Characterization of IFTTT:
Ecosystem, Usage, and Performance
Feng Qian
Xianghang Mi
Indiana University Bloomington
xmi@indiana.edu
Ying Zhang
Facebook Inc.
zhangying@fb.com
Indiana University Bloomington
fengqian@indiana.edu
XiaoFeng Wang
Indiana University Bloomington
xw7@indiana.edu
ABSTRACT
IFTTT is a popular trigger-action programming platform whose
applets can automate more than 400 services of IoT devices and
web applications. We conduct an empirical study of IFTTT using
a combined approach of analyzing data collected for 6 months
and performing controlled experiments using a custom testbed.
We profile the interactions among different entities, measure
how applets are used by end users, and test the performance of
applet execution. Overall we observe the fast growth of the IFTTT
ecosystem and its increasing usage for automating IoT-related tasks,
which correspond to 52% of all services and 16% of the applet usage.
We also observe several performance inefficiencies and identify
their causes.
CCS CONCEPTS
• Networks → Home networks; Network performance evaluation;
• Computer systems organization → Embedded systems;
KEYWORDS
IFTTT, IoT, Measurement
ACM Reference Format:
Xianghang Mi, Feng Qian, Ying Zhang, and XiaoFeng Wang. 2017. An
Empirical Characterization of IFTTT: Ecosystem, Usage, and Performance.
In Proceedings of IMC ’17. ACM, New York, NY, USA, 7 pages. https://doi.
org/10.1145/3131365.3131369
1 INTRODUCTION
Consumer Internet of Things (IoT) devices such as smart home
gadgets are becoming increasingly popular. For example, Amazon
has sold more than 5 million Amazon Echo devices in just two
years since their debut in late 2014 [1]. Among many challenges
faced by today’s consumer IoT systems, policy management plays a
critical role in ensuring scalable, automated, secure, and resource-
efficient in...

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


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

Output:
安全论文分析：

title:DEFTL: Implementing Plausibly Deniable Encryption in Flash Translation
Layer
author:Shijie Jia and
Luning Xia and
Bo Chen and
Peng Liu
DEFTL: Implementing Plausibly Deniable Encryption in Flash
Translation Layer
Shijie Jia†‡, Luning Xia†‡, Bo Chen§, Peng Liu¶
†Data Assurance and Communication Security Research Center, Chinese Academy of Sciences, Beijing, China
‡State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences,
Beijing, China
§Department of Computer Science, Michigan Technological University, USA
¶College of Information Sciences and Technology, The Pennsylvania State University, USA
{jiashijie,xialuning}@iie.ac.cn,bchen1@mtu.edu,pliu@ist.psu.edu
ABSTRACT
Mobile devices today have been increasingly used to store and
process sensitive information. To protect sensitive data, mobile
operating systems usually incorporate a certain level of encryption
to protect sensitive data. However, conventional encryption cannot
defend against a coercive attacker who can capture the device
owner, and force the owner to disclose keys used for decrypting
sensitive information. To defend against such a coercive adversary,
Plausibly Deniable Encryption (PDE) was introduced to allow the
device owner to deny the very existence of sensitive data stored
on his/her device. The existing PDE systems, built on (cid:30)ash storage
devices, are problematic, since they either neglect the special nature
of the underlying storage medium (which is usually NAND (cid:30)ash),
or su(cid:29)er from deniability compromises.
In this paper, we propose DEFTL, a Deniability Enabling Flash
Translation Layer for devices which use (cid:30)ash-based block devices
as storage media. DEFTL is the (cid:27)rst PDE design which incorporates
deniability to Flash Translation Layer (FTL), a pervasively deployed
“translation layer” which stays between NAND (cid:30)ash and the (cid:27)le
system in literally all the computing devices. A salient advantage
of ...


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

Input:
title:DEFTL: Implementing Plausibly Deniable Encryption in Flash Translation
Layer
author:Shijie Jia and
Luning Xia and
Bo Chen and
Peng Liu
DEFTL: Implementing Plausibly Deniable Encryption in Flash
Translation Layer
Shijie Jia†‡, Luning Xia†‡, Bo Chen§, Peng Liu¶
†Data Assurance and Communication Security Research Center, Chinese Academy of Sciences, Beijing, China
‡State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences,
Beijing, China
§Department of Computer Science, Michigan Technological University, USA
¶College of Information Sciences and Technology, The Pennsylvania State University, USA
{jiashijie,xialuning}@iie.ac.cn,bchen1@mtu.edu,pliu@ist.psu.edu
ABSTRACT
Mobile devices today have been increasingly used to store and
process sensitive information. To protect sensitive data, mobile
operating systems usually incorporate a certain level of encryption
to protect sensitive data. However, conventional encryption cannot
defend against a coercive attacker who can capture the device
owner, and force the owner to disclose keys used for decrypting
sensitive information. To defend against such a coercive adversary,
Plausibly Deniable Encryption (PDE) was introduced to allow the
device owner to deny the very existence of sensitive data stored
on his/her device. The existing PDE systems, built on (cid:30)ash storage
devices, are problematic, since they either neglect the special nature
of the underlying storage medium (which is usually NAND (cid:30)ash),
or su(cid:29)er from deniability compromises.
In this paper, we propose DEFTL, a Deniability Enabling Flash
Translation Layer for devices which use (cid:30)ash-based block devices
as storage media. DEFTL is the (cid:27)rst PDE design which incorporates
deniability to Flash Translation Layer (FTL), a pervasively deployed
“translation layer” which stays between NAND (cid:30)ash and the (cid:27)le
system in literally all the computing devices. A salient advantage
of ...

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


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

Output:
安全论文分析：

title:Assessing time coalescence techniques for the analysis of supercomputer
logs
author:Catello Di Martino and
Marcello Cinque and
Domenico Cotroneo
Assessing Time Coalescence Techniques for the
Analysis of Supercomputer Logs
Catello Di Martino
Center for Reliable and High-Performance Computing
University of Illinois at Urbana-Champaign
1308 W. Main Street, Urbana, IL 61801, USA
Email: dimart@illinois.edu
Marcello Cinque, Domenico Cotroneo
Dipartimento di Informatica e Sistemistica
Universit`a degli Studi di Napoli Federico II
Via Claudio 21, 80125 Napoli, Italy
Email:{macinque,cotroneo}@unina.it
speciﬁc coalescence window, they are grouped in the same
tuple, representing a single failure.
Abstract—This paper presents a novel approach to assess
time coalescence techniques. These techniques are widely used
to reconstruct the failure process of a system and to estimate
dependability measurements from its event logs. The approach
is based on the use of automatically generated logs, accompanied
by the exact knowledge of the ground truth on the failure process.
The assessment is conducted by comparing the presumed failure
process, reconstructed via coalescence, with the ground truth.
We focus on supercomputer logs, due to increasing importance
of automatic event log analysis for these systems. Experimental
results show how the approach allows to compare different time
coalescence techniques and to identify their weaknesses with
respect to given system settings. In addition, results revealed an
interesting correlation between errors caused by the coalescence
and errors in the estimation of dependability measurements.
Index Terms—Event Log Analysis, supercomputer dependabil-
ity, data coalescence, dependability assessment
I. INTRODUCTION
Event
logs represent one of the main data sources for
analyzing the dependability behavior of computer systems
during the operational phase. They are being largely used in
the context of supercomputers [1], [2], where the unattended
oper...


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

Input:
title:Assessing time coalescence techniques for the analysis of supercomputer
logs
author:Catello Di Martino and
Marcello Cinque and
Domenico Cotroneo
Assessing Time Coalescence Techniques for the
Analysis of Supercomputer Logs
Catello Di Martino
Center for Reliable and High-Performance Computing
University of Illinois at Urbana-Champaign
1308 W. Main Street, Urbana, IL 61801, USA
Email: dimart@illinois.edu
Marcello Cinque, Domenico Cotroneo
Dipartimento di Informatica e Sistemistica
Universit`a degli Studi di Napoli Federico II
Via Claudio 21, 80125 Napoli, Italy
Email:{macinque,cotroneo}@unina.it
speciﬁc coalescence window, they are grouped in the same
tuple, representing a single failure.
Abstract—This paper presents a novel approach to assess
time coalescence techniques. These techniques are widely used
to reconstruct the failure process of a system and to estimate
dependability measurements from its event logs. The approach
is based on the use of automatically generated logs, accompanied
by the exact knowledge of the ground truth on the failure process.
The assessment is conducted by comparing the presumed failure
process, reconstructed via coalescence, with the ground truth.
We focus on supercomputer logs, due to increasing importance
of automatic event log analysis for these systems. Experimental
results show how the approach allows to compare different time
coalescence techniques and to identify their weaknesses with
respect to given system settings. In addition, results revealed an
interesting correlation between errors caused by the coalescence
and errors in the estimation of dependability measurements.
Index Terms—Event Log Analysis, supercomputer dependabil-
ity, data coalescence, dependability assessment
I. INTRODUCTION
Event
logs represent one of the main data sources for
analyzing the dependability behavior of computer systems
during the operational phase. They are being largely used in
the context of supercomputers [1], [2], where the unattended
oper...

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


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

Output:
安全论文分析：

title:Identifying Sensitive URLs atWeb-Scale
author:Srdjan Matic and
Costas Iordanou and
Georgios Smaragdakis and
Nikolaos Laoutaris
Identifying Sensitive URLs at Web-Scale
Srdjan Matic
TU Berlin
Georgios Smaragdakis
TU Berlin
Costas Iordanou
Cyprus University of Technology
Nikolaos Laoutaris
IMDEA Networks Institute
ABSTRACT
Several data protection laws include special provisions for protect-
ing personal data relating to religion, health, sexual orientation, and
other sensitive categories. Having a well-defined list of sensitive
categories is sufficient for filing complaints manually, conducting
investigations, and prosecuting cases in courts of law. Data protec-
tion laws, however, do not define explicitly what type of content
falls under each sensitive category. Therefore, it is unclear how to
implement proactive measures such as informing users, blocking
trackers, and filing complaints automatically when users visit sensi-
tive domains. To empower such use cases we turn to the Curlie.org
crowdsourced taxonomy project for drawing training data to build
a text classifier for sensitive URLs. We demonstrate that our clas-
sifier can identify sensitive URLs with accuracy above 88%, and
even recognize specific sensitive categories with accuracy above
90%. We then use our classifier to search for sensitive URLs in a
corpus of 1 Billion URLs collected by the Common Crawl project.
We identify more than 155 millions sensitive URLs in more than 4
million domains. Despite their sensitive nature, more than 30% of
these URLs belong to domains that fail to use HTTPS. Also, in sen-
sitive web pages with third-party cookies, 87% of the third-parties
set at least one persistent cookie.
CCS CONCEPTS
· Security and privacy → Privacy protections; · Information
systems → World Wide Web; · Networks → Network measure-
ment.
ACM Reference Format:
Srdjan Matic, Costas Iordanou, Georgios Smaragdakis, and Nikolaos Laoutaris.
2020. Identifying Sensitive URLs at Web-Scale. In ACM Internet M...


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

Input:
title:Identifying Sensitive URLs atWeb-Scale
author:Srdjan Matic and
Costas Iordanou and
Georgios Smaragdakis and
Nikolaos Laoutaris
Identifying Sensitive URLs at Web-Scale
Srdjan Matic
TU Berlin
Georgios Smaragdakis
TU Berlin
Costas Iordanou
Cyprus University of Technology
Nikolaos Laoutaris
IMDEA Networks Institute
ABSTRACT
Several data protection laws include special provisions for protect-
ing personal data relating to religion, health, sexual orientation, and
other sensitive categories. Having a well-defined list of sensitive
categories is sufficient for filing complaints manually, conducting
investigations, and prosecuting cases in courts of law. Data protec-
tion laws, however, do not define explicitly what type of content
falls under each sensitive category. Therefore, it is unclear how to
implement proactive measures such as informing users, blocking
trackers, and filing complaints automatically when users visit sensi-
tive domains. To empower such use cases we turn to the Curlie.org
crowdsourced taxonomy project for drawing training data to build
a text classifier for sensitive URLs. We demonstrate that our clas-
sifier can identify sensitive URLs with accuracy above 88%, and
even recognize specific sensitive categories with accuracy above
90%. We then use our classifier to search for sensitive URLs in a
corpus of 1 Billion URLs collected by the Common Crawl project.
We identify more than 155 millions sensitive URLs in more than 4
million domains. Despite their sensitive nature, more than 30% of
these URLs belong to domains that fail to use HTTPS. Also, in sen-
sitive web pages with third-party cookies, 87% of the third-parties
set at least one persistent cookie.
CCS CONCEPTS
· Security and privacy → Privacy protections; · Information
systems → World Wide Web; · Networks → Network measure-
ment.
ACM Reference Format:
Srdjan Matic, Costas Iordanou, Georgios Smaragdakis, and Nikolaos Laoutaris.
2020. Identifying Sensitive URLs at Web-Scale. In ACM Internet M...

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


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

Output:
安全论文分析：

title:The CrossPath Attack: Disrupting the SDN Control Channel via Shared
Links
author:Jiahao Cao and
Qi Li and
Renjie Xie and
Kun Sun and
Guofei Gu and
Mingwei Xu and
Yuan Yang
The CrossPath Attack: Disrupting the
SDN Control Channel via Shared Links
Jiahao Cao, Qi Li, and Renjie Xie, Tsinghua University; Kun Sun, George Mason University;
Guofei Gu, Texas A&M University; Mingwei Xu and Yuan Yang, Tsinghua University
https://www.usenix.org/conference/usenixsecurity19/presentation/cao
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.The CrossPath Attack: Disrupting the SDN Control Channel via Shared Links
Jiahao Cao1,2, Qi Li2,3, Renjie Xie1,2, Kun Sun4, Guofei Gu5,
Mingwei Xu1,2, and Yuan Yang1,2
1Department of Computer Science and Technology, Tsinghua University
2Beijing National Research Center for Information Science and Technology, Tsinghua University
3Institute for Network Sciences and Cyberspace, Tsinghua University
4Department of Information Sciences and Technology, George Mason University
5SUCCESS LAB, Texas A&M University
Abstract
Software-Deﬁned Networking (SDN) enables network inno-
vations with a centralized controller controlling the whole
network through the control channel. Because the control
channel delivers all network control trafﬁc, its security and
reliability are of great importance. For the ﬁrst time in the
literature, we propose the CrossPath attack that disrupts the
SDN control channel by exploiting the shared links in paths
of control trafﬁc and data trafﬁc. In this attack, crafted data
trafﬁc can implicitly disrupt the forwarding of control trafﬁc
in the shared links. As the data trafﬁc does not enter the con-
trol channel, the attack is stealthy and cannot be easily per-
ceived by the controller. In order to identify the target paths
containing the shared li...


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

Input:
title:The CrossPath Attack: Disrupting the SDN Control Channel via Shared
Links
author:Jiahao Cao and
Qi Li and
Renjie Xie and
Kun Sun and
Guofei Gu and
Mingwei Xu and
Yuan Yang
The CrossPath Attack: Disrupting the
SDN Control Channel via Shared Links
Jiahao Cao, Qi Li, and Renjie Xie, Tsinghua University; Kun Sun, George Mason University;
Guofei Gu, Texas A&M University; Mingwei Xu and Yuan Yang, Tsinghua University
https://www.usenix.org/conference/usenixsecurity19/presentation/cao
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.The CrossPath Attack: Disrupting the SDN Control Channel via Shared Links
Jiahao Cao1,2, Qi Li2,3, Renjie Xie1,2, Kun Sun4, Guofei Gu5,
Mingwei Xu1,2, and Yuan Yang1,2
1Department of Computer Science and Technology, Tsinghua University
2Beijing National Research Center for Information Science and Technology, Tsinghua University
3Institute for Network Sciences and Cyberspace, Tsinghua University
4Department of Information Sciences and Technology, George Mason University
5SUCCESS LAB, Texas A&M University
Abstract
Software-Deﬁned Networking (SDN) enables network inno-
vations with a centralized controller controlling the whole
network through the control channel. Because the control
channel delivers all network control trafﬁc, its security and
reliability are of great importance. For the ﬁrst time in the
literature, we propose the CrossPath attack that disrupts the
SDN control channel by exploiting the shared links in paths
of control trafﬁc and data trafﬁc. In this attack, crafted data
trafﬁc can implicitly disrupt the forwarding of control trafﬁc
in the shared links. As the data trafﬁc does not enter the con-
trol channel, the attack is stealthy and cannot be easily per-
ceived by the controller. In order to identify the target paths
containing the shared li...

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


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

Output:
安全论文分析：

title:Reinforcement Learning-based Hierarchical Seed Scheduling for Greybox
Fuzzing
author:Jinghan Wang and
Chengyu Song and
Heng Yin
Reinforcement Learning-based Hierarchical Seed
Scheduling for Greybox Fuzzing
Jinghan Wang, Chengyu Song, Heng Yin
University of California, Riverside
jwang131@ucr.edu, {csong, heng}@cs.ucr.edu
Abstract—Coverage  metrics  play  an  essential  role  in  greybox
fuzzing.  Recent  work  has  shown  that  ﬁne-grained  coverage
metrics could allow a fuzzer to detect bugs that cannot be covered
by  traditional  edge  coverage.  However,  ﬁne-grained  coverage
metrics  will  also  select  more  seeds,  which  cannot  be  efﬁciently
scheduled by existing algorithms. This work addresses this prob-
lem by introducing a new concept of multi-level coverage metric
and the corresponding reinforcement-learning-based hierarchical
scheduler.  Evaluation  of  our  prototype  on  DARPA  CGC  showed
that our approach outperforms AFL and AFLFAST signiﬁcantly: it
can detect 20% more bugs, achieve higher coverage on 83 out of
180  challenges,  and  achieve  the  same  coverage  on  60  challenges.
More  importantly,  it  can  detect  the  same  number  of  bugs  and
achieve  the  same  coverage  faster.  On  FuzzBench,  our  approach
achieves  higher  coverage  than  AFL++  (Qemu)  on  10  out  of  20
projects.
I.
INTRODUCTION
Greybox fuzzing is a state-of-the-art testing technique that
has been widely adopted by the industry and has successfully
found  tens  of  thousands  of  vulnerabilities  in  widely  used
software.  For  example,  the  OSS-Fuzz  [20]  project  has  found
more  than  10,000  bugs  in  popular  open-sourced  projects  like
OpenSSL  since  its  launch  in  December  2016.
As  shown  in  Figure  1,  greybox  fuzzing  can  be  modeled
as  a  genetic  process  where  new  inputs  are  generated  through
mutation  and  crossover/splice.  The  generated  inputs  are  se-
lected according to a ﬁtness function. Selected inp...


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

Input:
title:Reinforcement Learning-based Hierarchical Seed Scheduling for Greybox
Fuzzing
author:Jinghan Wang and
Chengyu Song and
Heng Yin
Reinforcement Learning-based Hierarchical Seed
Scheduling for Greybox Fuzzing
Jinghan Wang, Chengyu Song, Heng Yin
University of California, Riverside
jwang131@ucr.edu, {csong, heng}@cs.ucr.edu
Abstract—Coverage  metrics  play  an  essential  role  in  greybox
fuzzing.  Recent  work  has  shown  that  ﬁne-grained  coverage
metrics could allow a fuzzer to detect bugs that cannot be covered
by  traditional  edge  coverage.  However,  ﬁne-grained  coverage
metrics  will  also  select  more  seeds,  which  cannot  be  efﬁciently
scheduled by existing algorithms. This work addresses this prob-
lem by introducing a new concept of multi-level coverage metric
and the corresponding reinforcement-learning-based hierarchical
scheduler.  Evaluation  of  our  prototype  on  DARPA  CGC  showed
that our approach outperforms AFL and AFLFAST signiﬁcantly: it
can detect 20% more bugs, achieve higher coverage on 83 out of
180  challenges,  and  achieve  the  same  coverage  on  60  challenges.
More  importantly,  it  can  detect  the  same  number  of  bugs  and
achieve  the  same  coverage  faster.  On  FuzzBench,  our  approach
achieves  higher  coverage  than  AFL++  (Qemu)  on  10  out  of  20
projects.
I.
INTRODUCTION
Greybox fuzzing is a state-of-the-art testing technique that
has been widely adopted by the industry and has successfully
found  tens  of  thousands  of  vulnerabilities  in  widely  used
software.  For  example,  the  OSS-Fuzz  [20]  project  has  found
more  than  10,000  bugs  in  popular  open-sourced  projects  like
OpenSSL  since  its  launch  in  December  2016.
As  shown  in  Figure  1,  greybox  fuzzing  can  be  modeled
as  a  genetic  process  where  new  inputs  are  generated  through
mutation  and  crossover/splice.  The  generated  inputs  are  se-
lected according to a ﬁtness function. Selected inp...

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


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

Output:
安全论文分析：

title:A Machine-Checked Proof of Security for AWS Key Management Service
author:Jos'e Bacelar Almeida and
Manuel Barbosa and
Gilles Barthe and
Matthew Campagna and
Ernie Cohen and
Benjamin Gr'egoire and
Vitor Pereira and
Bernardo Portela and
Pierre-Yves Strub and
Serdar Tasiran
A Machine-Checked Proof of Security for AWS Key Management
Service
Jos´e Bacelar Almeida1, Manuel Barbosa2, Gilles Barthe3, Matthew Campagna4, Ernie Cohen4,
Benjamin Gregoire5, Vitor Pereira2, Bernardo Portela2, Pierre-Yves Strub5, and Serdar Tasiran4
1 University of Minho and INESC TEC
2 University of Porto (FCUP) and INESC TEC
3 IMDEA Software Institute
4 Amazon Web Services
5 INRIA Sophia Antipolis
6 ´Ecole Polytechnique
Abstract. We present a machine-checked proof of security for the domain management protocol of
Amazon Web Services’ KMS (Key Management Service) a critical security service used throughout
AWS and by AWS customers. Domain management is at the core of AWS KMS; it governs the top-
level keys that anchor the security of encryption services at AWS. We show that the protocol securely
implements an ideal distributed encryption mechanism under standard cryptographic assumptions. The
proof is machine-checked in the EasyCrypt proof assistant and is the largest EasyCrypt development
to date.
1 Introduction
Today’s cloud services use sophisticated distributed architectures and algorithms to make data
highly available and durable. To improve security, data at rest is typically encrypted, and de-
crypted only when/where necessary. The encryption keys themselves must be similarly durable and
available; however, directly providing all keys to whichever service needs to use them unnecessarily
increases the attack surface. For the most sensitive keys, it is more prudent to encapsulate them
within a separate distributed encryption service. Such a service allows the creation of new keys, and
uses these keys to encrypt and decrypt data, but does not expose the keys themselves to cli...


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

Input:
title:A Machine-Checked Proof of Security for AWS Key Management Service
author:Jos'e Bacelar Almeida and
Manuel Barbosa and
Gilles Barthe and
Matthew Campagna and
Ernie Cohen and
Benjamin Gr'egoire and
Vitor Pereira and
Bernardo Portela and
Pierre-Yves Strub and
Serdar Tasiran
A Machine-Checked Proof of Security for AWS Key Management
Service
Jos´e Bacelar Almeida1, Manuel Barbosa2, Gilles Barthe3, Matthew Campagna4, Ernie Cohen4,
Benjamin Gregoire5, Vitor Pereira2, Bernardo Portela2, Pierre-Yves Strub5, and Serdar Tasiran4
1 University of Minho and INESC TEC
2 University of Porto (FCUP) and INESC TEC
3 IMDEA Software Institute
4 Amazon Web Services
5 INRIA Sophia Antipolis
6 ´Ecole Polytechnique
Abstract. We present a machine-checked proof of security for the domain management protocol of
Amazon Web Services’ KMS (Key Management Service) a critical security service used throughout
AWS and by AWS customers. Domain management is at the core of AWS KMS; it governs the top-
level keys that anchor the security of encryption services at AWS. We show that the protocol securely
implements an ideal distributed encryption mechanism under standard cryptographic assumptions. The
proof is machine-checked in the EasyCrypt proof assistant and is the largest EasyCrypt development
to date.
1 Introduction
Today’s cloud services use sophisticated distributed architectures and algorithms to make data
highly available and durable. To improve security, data at rest is typically encrypted, and de-
crypted only when/where necessary. The encryption keys themselves must be similarly durable and
available; however, directly providing all keys to whichever service needs to use them unnecessarily
increases the attack surface. For the most sensitive keys, it is more prudent to encapsulate them
within a separate distributed encryption service. Such a service allows the creation of new keys, and
uses these keys to encrypt and decrypt data, but does not expose the keys themselves to cli...

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


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

Output:
安全论文分析：

title:SybilGuard: defending against sybil attacks via social networks
author:Haifeng Yu and
Michael Kaminsky and
Phillip B. Gibbons and
Abraham Flaxman
576
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 3, JUNE 2008
SybilGuard: Defending Against Sybil Attacks via
Social Networks
Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Member, IEEE, and Abraham D. Flaxman
Abstract—Peer-to-peer and other decentralized, distributed sys-
tems are known to be particularly vulnerable to sybil attacks. In a
sybil attack, a malicious user obtains multiple fake identities and
pretends to be multiple, distinct nodes in the system. By control-
ling a large fraction of the nodes in the system, the malicious user
is able to “out vote” the honest users in collaborative tasks such as
Byzantine failure defenses. This paper presents SybilGuard, a novel
protocol for limiting the corruptive inﬂuences of sybil attacks. Our
protocol is based on the “social network” among user identities,
where an edge between two identities indicates a human-estab-
lished trust relationship. Malicious users can create many identi-
ties but few trust relationships. Thus, there is a disproportionately
small “cut” in the graph between the sybil nodes and the honest
nodes. SybilGuard exploits this property to bound the number of
identities a malicious user can create. We show the effectiveness of
SybilGuard both analytically and experimentally.
Index Terms—Social networks, sybil attack, SybilGuard, sybil
identity.
I. INTRODUCTION
AS THE SCALE of a decentralized distributed system in-
creases, the presence of malicious behavior (e.g., Byzan-
tine failures) becomes the norm rather than the exception. Most
designs against such malicious behavior rely on the assumption
that a certain fraction of the nodes in the system are honest. For
example, virtually all protocols for tolerating Byzantine failures
assume that at least 2/3 of the nodes are honest. This makes these
protocols vulnerable to sybil attacks [1], in whi...


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

Input:
title:SybilGuard: defending against sybil attacks via social networks
author:Haifeng Yu and
Michael Kaminsky and
Phillip B. Gibbons and
Abraham Flaxman
576
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 3, JUNE 2008
SybilGuard: Defending Against Sybil Attacks via
Social Networks
Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Member, IEEE, and Abraham D. Flaxman
Abstract—Peer-to-peer and other decentralized, distributed sys-
tems are known to be particularly vulnerable to sybil attacks. In a
sybil attack, a malicious user obtains multiple fake identities and
pretends to be multiple, distinct nodes in the system. By control-
ling a large fraction of the nodes in the system, the malicious user
is able to “out vote” the honest users in collaborative tasks such as
Byzantine failure defenses. This paper presents SybilGuard, a novel
protocol for limiting the corruptive inﬂuences of sybil attacks. Our
protocol is based on the “social network” among user identities,
where an edge between two identities indicates a human-estab-
lished trust relationship. Malicious users can create many identi-
ties but few trust relationships. Thus, there is a disproportionately
small “cut” in the graph between the sybil nodes and the honest
nodes. SybilGuard exploits this property to bound the number of
identities a malicious user can create. We show the effectiveness of
SybilGuard both analytically and experimentally.
Index Terms—Social networks, sybil attack, SybilGuard, sybil
identity.
I. INTRODUCTION
AS THE SCALE of a decentralized distributed system in-
creases, the presence of malicious behavior (e.g., Byzan-
tine failures) becomes the norm rather than the exception. Most
designs against such malicious behavior rely on the assumption
that a certain fraction of the nodes in the system are honest. For
example, virtually all protocols for tolerating Byzantine failures
assume that at least 2/3 of the nodes are honest. This makes these
protocols vulnerable to sybil attacks [1], in whi...

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


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

Output:
安全论文分析：

title:Practical Over-Threshold Multi-Party Private Set Intersection
author:Rasoul Akhavan Mahdavi and
Thomas Humphries and
Bailey Kacsmar and
Simeon Krastnikov and
Nils Lukas and
John A. Premkumar and
Masoumeh Shafieinejad and
Simon Oya and
Florian Kerschbaum and
Erik-Oliver Blass
Practical Multi-party Private Set Intersection
from Symmetric-Key Techniques∗
Vladimir Kolesnikov†
Naor Matania‡
Benny Pinkas‡ Mike Rosulek§
Ni Trieu§
August 24, 2017
Abstract
We present a new paradigm for multi-party private set intersection (PSI) that allows n parties to
compute the intersection of their datasets without revealing any additional information. We explore a
variety of instantiations of this paradigm. Our protocols avoid computationally expensive public-key
operations and are secure in the presence of any number of semi-honest participants (i.e., without an
honest majority).
We demonstrate the practicality of our protocols with an implementation. To the best of our knowl-
edge, this is the ﬁrst implementation of a multi-party PSI protocol. For 5 parties with data-sets of 220
items each, our protocol requires only 72 seconds. In an optimization achieving a slightly weaker variant
of security (augmented semi-honest model), the same task requires only 22 seconds.
The technical core of our protocol is oblivious evaluation of a programmable pseudorandom function
(OPPRF), which we instantiate in three diﬀerent ways. We believe our new OPPRF abstraction and
constructions may be of independent interest.
1 Introduction
In the problem of private set intersection (PSI), several parties each hold a set of items and wish to learn
the intersection of these sets and nothing else. Today, two-party PSI is a truly practical primitive, with
extremely fast cryptographically secure implementations [PSSZ15, KKRT16, PSZ16]. Incredibly, these im-
plementations are only a small factor slower than the na¨ıve and insecure method of exchanging hashed values.
Among the speciﬁc functions of interest in s...


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

Input:
title:Practical Over-Threshold Multi-Party Private Set Intersection
author:Rasoul Akhavan Mahdavi and
Thomas Humphries and
Bailey Kacsmar and
Simeon Krastnikov and
Nils Lukas and
John A. Premkumar and
Masoumeh Shafieinejad and
Simon Oya and
Florian Kerschbaum and
Erik-Oliver Blass
Practical Multi-party Private Set Intersection
from Symmetric-Key Techniques∗
Vladimir Kolesnikov†
Naor Matania‡
Benny Pinkas‡ Mike Rosulek§
Ni Trieu§
August 24, 2017
Abstract
We present a new paradigm for multi-party private set intersection (PSI) that allows n parties to
compute the intersection of their datasets without revealing any additional information. We explore a
variety of instantiations of this paradigm. Our protocols avoid computationally expensive public-key
operations and are secure in the presence of any number of semi-honest participants (i.e., without an
honest majority).
We demonstrate the practicality of our protocols with an implementation. To the best of our knowl-
edge, this is the ﬁrst implementation of a multi-party PSI protocol. For 5 parties with data-sets of 220
items each, our protocol requires only 72 seconds. In an optimization achieving a slightly weaker variant
of security (augmented semi-honest model), the same task requires only 22 seconds.
The technical core of our protocol is oblivious evaluation of a programmable pseudorandom function
(OPPRF), which we instantiate in three diﬀerent ways. We believe our new OPPRF abstraction and
constructions may be of independent interest.
1 Introduction
In the problem of private set intersection (PSI), several parties each hold a set of items and wish to learn
the intersection of these sets and nothing else. Today, two-party PSI is a truly practical primitive, with
extremely fast cryptographically secure implementations [PSSZ15, KKRT16, PSZ16]. Incredibly, these im-
plementations are only a small factor slower than the na¨ıve and insecure method of exchanging hashed values.
Among the speciﬁc functions of interest in s...

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


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

Output:
安全论文分析：

title:Mantis: Reactive Programmable Switches
author:Liangcheng Yu and
John Sonchack and
Vincent Liu
Mantis:	Reactive	Programmable	Switches
L i a n g c h e n g 	 Y u , 	 J o h n 	 S o n c h a c k , 	 V i n c e n t 	 L i u
To d a y ’ s   N e t w o r k s   R e a c t
• A common task: reacting to current network conditions
• Detecting failures and then rerouting
• Identifying malicious flows and then filtering
• Recognizing load imbalance and then adjusting
• In data centers, reactions need be fast
To d a y ’ s   P r i m i t i v e s   f o r   R e a c t i o n
SDNs or conventional control loops
Flexible but slow
Built-in data plane primitives
Fast but restrictive
Programmable switches?
Constraints on operations in actions, number of stages, SRAM
accesses, egress/ingress communication, in-band match-action
updates…
To d a y ’ s   P r i m i t i v e s   f o r   R e a c t i o n
Can we enable fine-grained reactions with
minimum latency and maximum flexibility?
SDNs or conventional control loops
Flexible but slow
Built-in data plane primitives
Fast but restrictive
Programmable switches?
Constraints on operations in actions, number of stages, SRAM
accesses, egress/ingress communication, in-band match-action
updates…
A p p r o a c h
Can we enable fine-grained reactions with
minimum latency and maximum flexibility?
1. Push the reactions as close to the switch ASIC as possible
2. Co-design the data plane program for fine-grained malleability
and ease of use
M a n t i s   O v e r v i e w
Usable, fast, and expressive in-network reactions on today’s RMT switches
Simple extension to P4
Arbitrary C code
10s of us
Generates code for dynamic reconfigurability/serializability
A b s t r a c t i o n
1. Malleable entities
• Amenable to fine-grained reconfiguration at runtime
2. Reactions
• Package reaction logic into a C-like function
A n a t o m y   o f   M a n t i s
1
2
4
3
M1   Language
M2   Translation
M3   Isolation
M4   Execution
M 1 :   S t a r t   w i...


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

Input:
title:Mantis: Reactive Programmable Switches
author:Liangcheng Yu and
John Sonchack and
Vincent Liu
Mantis:	Reactive	Programmable	Switches
L i a n g c h e n g 	 Y u , 	 J o h n 	 S o n c h a c k , 	 V i n c e n t 	 L i u
To d a y ’ s   N e t w o r k s   R e a c t
• A common task: reacting to current network conditions
• Detecting failures and then rerouting
• Identifying malicious flows and then filtering
• Recognizing load imbalance and then adjusting
• In data centers, reactions need be fast
To d a y ’ s   P r i m i t i v e s   f o r   R e a c t i o n
SDNs or conventional control loops
Flexible but slow
Built-in data plane primitives
Fast but restrictive
Programmable switches?
Constraints on operations in actions, number of stages, SRAM
accesses, egress/ingress communication, in-band match-action
updates…
To d a y ’ s   P r i m i t i v e s   f o r   R e a c t i o n
Can we enable fine-grained reactions with
minimum latency and maximum flexibility?
SDNs or conventional control loops
Flexible but slow
Built-in data plane primitives
Fast but restrictive
Programmable switches?
Constraints on operations in actions, number of stages, SRAM
accesses, egress/ingress communication, in-band match-action
updates…
A p p r o a c h
Can we enable fine-grained reactions with
minimum latency and maximum flexibility?
1. Push the reactions as close to the switch ASIC as possible
2. Co-design the data plane program for fine-grained malleability
and ease of use
M a n t i s   O v e r v i e w
Usable, fast, and expressive in-network reactions on today’s RMT switches
Simple extension to P4
Arbitrary C code
10s of us
Generates code for dynamic reconfigurability/serializability
A b s t r a c t i o n
1. Malleable entities
• Amenable to fine-grained reconfiguration at runtime
2. Reactions
• Package reaction logic into a C-like function
A n a t o m y   o f   M a n t i s
1
2
4
3
M1   Language
M2   Translation
M3   Isolation
M4   Execution
M 1 :   S t a r t   w i...

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


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

Output:
安全论文分析：

title:Understanding soft error propagation using Efficient vulnerability-driven
fault injection
author:Xin Xu and
Man-Lap Li
Understanding
Efficient
Vulnerability-Driven
Fault Injection
Soft Error Propagation
Using
Department
Xin  Xu and Man-Lap Li
of Electrical  and  Computer
Engineering
School of Engineering
and Applied Science
George Washington
University
Washington,
xuxin@gwmail
.gwu.edu
DC  20052
Abstract-Extreme
CMOS scaling
is expected
to significantly
campaign to focus on likely non-derated
the evaluation
becomes less
T his paper makes the observation
avoided to allow
of the underlying
number of errors
of future microprocessors,
hardware-software
(SFI)
fault injection
statistical
prompting
cross-layer
solutions.
the error coverage
because a significant
effort on low-cost
To evaluate,
by SFI are often derated,
and less efficient.
impact the reliability
recent research
reliability
is often used to estimate
method. Unfortunately,
injected
rigorous
that many derated errors can be gracefully
the fault injection
faults that stress the method-under-test.
injection
bility
CriticalFault,
by 29 % and 59 % of  the biased injections
aborts or silent data corruptions,
SFI. Moreover,
of these non-derated
designing
calFault
current  systems,
also conduct more in-depth
future reliability
to map out relevant
our results
called CriticalFault
show that the injection
future cross-layer
we characterize
but reliability
is highly effective
in identifying
researchers
solutions.
framework
solutions
relevant
analysis
Overall,
and meaningful
using CriticalFault.
analysis
We propose a biased
that employs vulnera
faults for stress testing.
With
space is reduced
cause either software
both are improvements
from
behaviors
faults and discuss the implications
propagation
different
of
not only Criti
test cases for
and engineers
can
in deveoping
Index Terms-Fault
Injection,
Fault Analysis,
V...


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

Input:
title:Understanding soft error propagation using Efficient vulnerability-driven
fault injection
author:Xin Xu and
Man-Lap Li
Understanding
Efficient
Vulnerability-Driven
Fault Injection
Soft Error Propagation
Using
Department
Xin  Xu and Man-Lap Li
of Electrical  and  Computer
Engineering
School of Engineering
and Applied Science
George Washington
University
Washington,
xuxin@gwmail
.gwu.edu
DC  20052
Abstract-Extreme
CMOS scaling
is expected
to significantly
campaign to focus on likely non-derated
the evaluation
becomes less
T his paper makes the observation
avoided to allow
of the underlying
number of errors
of future microprocessors,
hardware-software
(SFI)
fault injection
statistical
prompting
cross-layer
solutions.
the error coverage
because a significant
effort on low-cost
To evaluate,
by SFI are often derated,
and less efficient.
impact the reliability
recent research
reliability
is often used to estimate
method. Unfortunately,
injected
rigorous
that many derated errors can be gracefully
the fault injection
faults that stress the method-under-test.
injection
bility
CriticalFault,
by 29 % and 59 % of  the biased injections
aborts or silent data corruptions,
SFI. Moreover,
of these non-derated
designing
calFault
current  systems,
also conduct more in-depth
future reliability
to map out relevant
our results
called CriticalFault
show that the injection
future cross-layer
we characterize
but reliability
is highly effective
in identifying
researchers
solutions.
framework
solutions
relevant
analysis
Overall,
and meaningful
using CriticalFault.
analysis
We propose a biased
that employs vulnera
faults for stress testing.
With
space is reduced
cause either software
both are improvements
from
behaviors
faults and discuss the implications
propagation
different
of
not only Criti
test cases for
and engineers
can
in deveoping
Index Terms-Fault
Injection,
Fault Analysis,
V...

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


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

Output:
安全论文分析：

title:Detection of Early-Stage Enterprise Infection by Mining Large-Scale
Log Data
author:Alina Oprea and
Zhou Li and
Ting-Fang Yen and
Sang H. Chin and
Sumayah A. Alrwais
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Detection of Early-Stage Enterprise Infection by
Mining Large-Scale Log Data
Alina Oprea∗, Zhou Li∗, Ting-Fang Yen†, Sang H. Chin‡ and Sumayah Alrwais§
∗RSA Laboratories, Cambridge, MA, USA, Email: {alina.oprea; zhou.li}@rsa.com
†E8 Security, Palo Alto, CA, USA, Email: tingfang.yen@gmail.com
‡Draper Laboratory, Cambridge, MA, USA and Boston University, Boston, MA, USA, Email: schin@draper.com
§Indiana University, Bloomington, IN, USA, Email: salrwais@umail.iu.edu
Recent years have seen the rise of sophisticated attacks
including advanced persistent threats (APT) which pose severe
risks to organizations and governments. Additionally, new
malware strains appear at a higher rate than ever before.
Since many of these malware evade existing security products,
traditional defenses deployed by enterprises today often fail at
detecting infections at an early stage.
We address the problem of detecting early-stage APT
infection by proposing a new framework based on belief
propagation inspired from graph theory. We demonstrate that
our techniques perform well on two large datasets. We achieve
high accuracy on two months of DNS logs released by Los
Alamos National Lab (LANL), which include APT infection
attacks simulated by LANL domain experts. We also apply
our algorithms to 38TB of web proxy logs collected at the
border of a large enterprise and identify hundreds of malicious
domains overlooked by state-of-the-art security products.
I.
INTRODUCTION
The cybersecurity landscape is evolving constantly. More
sophisticated attacks including Advanced Persistent Threats
(APTs) [13], [34], [1], [2] have emerged recently targeting or-
ganization...


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

Input:
title:Detection of Early-Stage Enterprise Infection by Mining Large-Scale
Log Data
author:Alina Oprea and
Zhou Li and
Ting-Fang Yen and
Sang H. Chin and
Sumayah A. Alrwais
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Detection of Early-Stage Enterprise Infection by
Mining Large-Scale Log Data
Alina Oprea∗, Zhou Li∗, Ting-Fang Yen†, Sang H. Chin‡ and Sumayah Alrwais§
∗RSA Laboratories, Cambridge, MA, USA, Email: {alina.oprea; zhou.li}@rsa.com
†E8 Security, Palo Alto, CA, USA, Email: tingfang.yen@gmail.com
‡Draper Laboratory, Cambridge, MA, USA and Boston University, Boston, MA, USA, Email: schin@draper.com
§Indiana University, Bloomington, IN, USA, Email: salrwais@umail.iu.edu
Recent years have seen the rise of sophisticated attacks
including advanced persistent threats (APT) which pose severe
risks to organizations and governments. Additionally, new
malware strains appear at a higher rate than ever before.
Since many of these malware evade existing security products,
traditional defenses deployed by enterprises today often fail at
detecting infections at an early stage.
We address the problem of detecting early-stage APT
infection by proposing a new framework based on belief
propagation inspired from graph theory. We demonstrate that
our techniques perform well on two large datasets. We achieve
high accuracy on two months of DNS logs released by Los
Alamos National Lab (LANL), which include APT infection
attacks simulated by LANL domain experts. We also apply
our algorithms to 38TB of web proxy logs collected at the
border of a large enterprise and identify hundreds of malicious
domains overlooked by state-of-the-art security products.
I.
INTRODUCTION
The cybersecurity landscape is evolving constantly. More
sophisticated attacks including Advanced Persistent Threats
(APTs) [13], [34], [1], [2] have emerged recently targeting or-
ganization...

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


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

Output:
安全论文分析：

title:Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge
Proofs for Boolean and Arithmetic Circuits
author:Chenkai Weng and
Kang Yang and
Jonathan Katz and
Xiao Wang
6
5
0
0
0
.
1
2
0
2
.
1
0
0
0
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
1
2
0
2
©
0
0
.
1
3
$
/
1
2
/
5
-
4
3
9
8
-
1
8
2
7
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
1
2
0
2
2021 IEEE Symposium on Security and Privacy (SP)
Wolverine: Fast, Scalable, and Communication-Efﬁcient Zero-Knowledge Proofs for
Boolean and Arithmetic Circuits
Chenkai Weng
Kang Yang∗
Northwestern University
State Key Laboratory of Cryptology
Jonathan Katz†
University of Maryland
Xiao Wang∗
Northwestern University
Abstract—Efﬁcient zero-knowledge (ZK) proofs for arbitrary
boolean or arithmetic circuits have recently attracted much atten-
tion. Existing solutions suffer from either signiﬁcant prover over-
head (i.e., high memory usage) or relatively high communication
complexity (at least κ bits per gate, for computational security
parameter κ). In this paper, we propose a new protocol for
constant-round interactive ZK proofs that simultaneously allows
for an efﬁcient prover with asymptotically optimal memory usage
and signiﬁcantly lower communication compared to protocols
with similar memory efﬁciency. Speciﬁcally:
• The prover in our ZK protocol has linear running time and,
perhaps more importantly, memory usage linear in the memory
needed to evaluate the circuit non-cryptographically. This
allows our proof system to scale easily to very large circuits.
• For statistical security parameter ρ = 40, our ZK protocol
communicates roughly 9 bits/gate for boolean circuits and 2–4
ﬁeld elements/gate for arithmetic circuits over large ﬁelds.
Using 5 threads, 400 MB of memory, and a 200 Mbps network
to evaluate a circuit with hundreds of billions of gates, our
implementation (ρ = 40, κ = 128) runs at a rate of 0.45 µs/gate
in the boolean case, and 1.6 µs/gate for an arithmetic ...


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

Input:
title:Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge
Proofs for Boolean and Arithmetic Circuits
author:Chenkai Weng and
Kang Yang and
Jonathan Katz and
Xiao Wang
6
5
0
0
0
.
1
2
0
2
.
1
0
0
0
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
1
2
0
2
©
0
0
.
1
3
$
/
1
2
/
5
-
4
3
9
8
-
1
8
2
7
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
1
2
0
2
2021 IEEE Symposium on Security and Privacy (SP)
Wolverine: Fast, Scalable, and Communication-Efﬁcient Zero-Knowledge Proofs for
Boolean and Arithmetic Circuits
Chenkai Weng
Kang Yang∗
Northwestern University
State Key Laboratory of Cryptology
Jonathan Katz†
University of Maryland
Xiao Wang∗
Northwestern University
Abstract—Efﬁcient zero-knowledge (ZK) proofs for arbitrary
boolean or arithmetic circuits have recently attracted much atten-
tion. Existing solutions suffer from either signiﬁcant prover over-
head (i.e., high memory usage) or relatively high communication
complexity (at least κ bits per gate, for computational security
parameter κ). In this paper, we propose a new protocol for
constant-round interactive ZK proofs that simultaneously allows
for an efﬁcient prover with asymptotically optimal memory usage
and signiﬁcantly lower communication compared to protocols
with similar memory efﬁciency. Speciﬁcally:
• The prover in our ZK protocol has linear running time and,
perhaps more importantly, memory usage linear in the memory
needed to evaluate the circuit non-cryptographically. This
allows our proof system to scale easily to very large circuits.
• For statistical security parameter ρ = 40, our ZK protocol
communicates roughly 9 bits/gate for boolean circuits and 2–4
ﬁeld elements/gate for arithmetic circuits over large ﬁelds.
Using 5 threads, 400 MB of memory, and a 200 Mbps network
to evaluate a circuit with hundreds of billions of gates, our
implementation (ρ = 40, κ = 128) runs at a rate of 0.45 µs/gate
in the boolean case, and 1.6 µs/gate for an arithmetic ...

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


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

Output:
安全论文分析：

title:IBBE-SGX: Cryptographic Group Access Control Using Trusted Execution
Environments
author:Stefan Contiu and
Rafael Pires and
S'ebastien Vaucher and
Marcelo Pasin and
Pascal Felber and
Laurent R'eveillère
IBBE-SGX: Cryptographic Group Access Control
using Trusted Execution Environments
Stefan Contiu∗‡, Rafael Pires†, S´ebastien Vaucher†, Marcelo Pasin†, Pascal Felber† and Laurent R´eveill`ere∗
∗University of Bordeaux, France, firstname.lastname@u-bordeaux.fr
†University of Neuchˆatel, Switzerland, firstname.lastname@unine.ch
‡Scille SAS, France
8
1
0
2
l
u
J
7
2
]
R
C
.
s
c
[
2
v
3
6
5
1
0
.
5
0
8
1
:
v
i
X
r
a
Abstract—While many cloud storage systems allow users to
protect their data by making use of encryption, only few support
collaborative editing on that data. A major challenge for enabling
such collaboration is the need to enforce cryptographic access
control policies in a secure and efﬁcient manner. In this paper,
we introduce IBBE-SGX, a new cryptographic access control
extension that is efﬁcient both in terms of computation and
storage even when processing large and dynamic workloads of
membership operations, while at the same time offering zero
knowledge guarantees.
IBBE-SGX builds upon Identity-Based Broadcasting Encryp-
tion (IBBE). We address IBBE’s impracticality for cloud de-
ployments by exploiting Intel Software Guard Extensions (SGX)
to derive cuts in the computational complexity. Moreover, we
propose a group partitioning mechanism such that the compu-
tational cost of membership update is bound to a ﬁxed constant
partition size rather than the size of the whole group. We have
implemented and evaluated our new access control extension.
Results highlight that IBBE-SGX performs membership changes
1.2 orders of magnitude faster than the traditional approach of
Hybrid Encryption (HE), producing group metadata that are 6
orders of magnitude smaller than HE, while at the same time
offering zero knowledge guarantees.
I. INTRODUCTION
Cloud s...


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

Input:
title:IBBE-SGX: Cryptographic Group Access Control Using Trusted Execution
Environments
author:Stefan Contiu and
Rafael Pires and
S'ebastien Vaucher and
Marcelo Pasin and
Pascal Felber and
Laurent R'eveillère
IBBE-SGX: Cryptographic Group Access Control
using Trusted Execution Environments
Stefan Contiu∗‡, Rafael Pires†, S´ebastien Vaucher†, Marcelo Pasin†, Pascal Felber† and Laurent R´eveill`ere∗
∗University of Bordeaux, France, firstname.lastname@u-bordeaux.fr
†University of Neuchˆatel, Switzerland, firstname.lastname@unine.ch
‡Scille SAS, France
8
1
0
2
l
u
J
7
2
]
R
C
.
s
c
[
2
v
3
6
5
1
0
.
5
0
8
1
:
v
i
X
r
a
Abstract—While many cloud storage systems allow users to
protect their data by making use of encryption, only few support
collaborative editing on that data. A major challenge for enabling
such collaboration is the need to enforce cryptographic access
control policies in a secure and efﬁcient manner. In this paper,
we introduce IBBE-SGX, a new cryptographic access control
extension that is efﬁcient both in terms of computation and
storage even when processing large and dynamic workloads of
membership operations, while at the same time offering zero
knowledge guarantees.
IBBE-SGX builds upon Identity-Based Broadcasting Encryp-
tion (IBBE). We address IBBE’s impracticality for cloud de-
ployments by exploiting Intel Software Guard Extensions (SGX)
to derive cuts in the computational complexity. Moreover, we
propose a group partitioning mechanism such that the compu-
tational cost of membership update is bound to a ﬁxed constant
partition size rather than the size of the whole group. We have
implemented and evaluated our new access control extension.
Results highlight that IBBE-SGX performs membership changes
1.2 orders of magnitude faster than the traditional approach of
Hybrid Encryption (HE), producing group metadata that are 6
orders of magnitude smaller than HE, while at the same time
offering zero knowledge guarantees.
I. INTRODUCTION
Cloud s...

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


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

Output:
安全论文分析：

title:Preventing Memory Error Exploits with WIT
author:Periklis Akritidis and
Cristian Cadar and
Costin Raiciu and
Manuel Costa and
Miguel Castro
Preventing memory error exploits with WIT
Periklis Akritidis
∗
∗
Cristian Cadar
Costin Raiciu
∗
Manuel Costa
Miguel Castro
Microsoft Research, Cambridge UK
Abstract
code or the language runtime.
Attacks often exploit memory errors to gain control over
the execution of vulnerable programs. These attacks remain
a serious problem despite previous research on techniques
to prevent them. We present Write Integrity Testing (WIT), a
new technique that provides practical protection from these
attacks. WIT uses points-to analysis at compile time to
compute the control-ﬂow graph and the set of objects that
can be written by each instruction in the program. Then
it generates code instrumented to prevent instructions from
modifying objects that are not in the set computed by the
static analysis, and to ensure that indirect control transfers
are allowed by the control-ﬂow graph. To improve cover-
age where the analysis is not precise enough, WIT inserts
small guards between the original program objects. We de-
scribe an efﬁcient implementation with optimizations to re-
duce space and time overhead. This implementation can be
used in practice because it compiles C and C++ programs
without modiﬁcations, it has high coverage with no false
positives, and it has low overhead. WIT’s average runtime
overhead is only 7% across a set of CPU intensive bench-
marks and it is negligible when IO is the bottleneck.
1. Introduction
Attackers can exploit software errors to control vulnera-
ble programs. Programs written in unsafe languages like C
and C++ are particularly vulnerable because of memory er-
rors, for example, buffer overﬂows and underﬂows [5, 35],
dangling pointers [7], and double frees [26]. Despite pre-
vious research on techniques to prevent these attacks (see
Section 8), at least 40% of the vulnerabilities published by
US-CERT in the ...


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

Input:
title:Preventing Memory Error Exploits with WIT
author:Periklis Akritidis and
Cristian Cadar and
Costin Raiciu and
Manuel Costa and
Miguel Castro
Preventing memory error exploits with WIT
Periklis Akritidis
∗
∗
Cristian Cadar
Costin Raiciu
∗
Manuel Costa
Miguel Castro
Microsoft Research, Cambridge UK
Abstract
code or the language runtime.
Attacks often exploit memory errors to gain control over
the execution of vulnerable programs. These attacks remain
a serious problem despite previous research on techniques
to prevent them. We present Write Integrity Testing (WIT), a
new technique that provides practical protection from these
attacks. WIT uses points-to analysis at compile time to
compute the control-ﬂow graph and the set of objects that
can be written by each instruction in the program. Then
it generates code instrumented to prevent instructions from
modifying objects that are not in the set computed by the
static analysis, and to ensure that indirect control transfers
are allowed by the control-ﬂow graph. To improve cover-
age where the analysis is not precise enough, WIT inserts
small guards between the original program objects. We de-
scribe an efﬁcient implementation with optimizations to re-
duce space and time overhead. This implementation can be
used in practice because it compiles C and C++ programs
without modiﬁcations, it has high coverage with no false
positives, and it has low overhead. WIT’s average runtime
overhead is only 7% across a set of CPU intensive bench-
marks and it is negligible when IO is the bottleneck.
1. Introduction
Attackers can exploit software errors to control vulnera-
ble programs. Programs written in unsafe languages like C
and C++ are particularly vulnerable because of memory er-
rors, for example, buffer overﬂows and underﬂows [5, 35],
dangling pointers [7], and double frees [26]. Despite pre-
vious research on techniques to prevent these attacks (see
Section 8), at least 40% of the vulnerabilities published by
US-CERT in the ...

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


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

Output:
安全论文分析：

title:WooKey: designing a trusted and efficient USB device
author:Ryad Benadjila and
Arnauld Michelizza and
Mathieu Renard and
Philippe Thierry and
Philippe Trebuchet
WooKey:
designing a Trusted and Efficient
USB Device
WooKey:
Designing a T r u s
t
e
d
and Efficie n t U S B
D
e
v i c e
Ryad BENADJILA
1
Mathieu RENARD
1
Arnauld MICHELIZZA
1
Philippe THIERRY
1
Philippe TREBUCHET
1
1ANSSI, prenom.nom@ssi.gouv.fr
13 December 2019
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
USB : Usages and threats
Peripheral type ?
Keyboard, mouse, …
1/13
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
USB Controler
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
Flash
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
Flash
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
USB Controler
B a d U S B
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threat Model
Stealing the SD card and read data
2/13
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threat Model
Stealing the SD card and read data
Software Attack on the USB key
2/13
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threat Model
Stealing the SD card and read data
Hardware Attacks
Software Attack on the USB key
2/13
|Introduction |Ha...


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

Input:
title:WooKey: designing a trusted and efficient USB device
author:Ryad Benadjila and
Arnauld Michelizza and
Mathieu Renard and
Philippe Thierry and
Philippe Trebuchet
WooKey:
designing a Trusted and Efficient
USB Device
WooKey:
Designing a T r u s
t
e
d
and Efficie n t U S B
D
e
v i c e
Ryad BENADJILA
1
Mathieu RENARD
1
Arnauld MICHELIZZA
1
Philippe THIERRY
1
Philippe TREBUCHET
1
1ANSSI, prenom.nom@ssi.gouv.fr
13 December 2019
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
USB : Usages and threats
Peripheral type ?
Keyboard, mouse, …
1/13
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
USB Controler
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
Flash
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
Flash
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threats
USB Controler
B a d U S B
1/13
FIRMWARE|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threat Model
Stealing the SD card and read data
2/13
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threat Model
Stealing the SD card and read data
Software Attack on the USB key
2/13
|Introduction |Hardware |Software |EwoK micro-kernel |Conclusion
|USB |Threat Model |Open solutions |The WooKey Project
Threat Model
Stealing the SD card and read data
Hardware Attacks
Software Attack on the USB key
2/13
|Introduction |Ha...

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


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

Output:
安全论文分析：

title:A chipset level network backdoor: bypassing host-based firewall &
IDS
author:Sherri Sparks and
Shawn Embleton and
Cliff Changchun Zou
A Chipset Level Network Backdoor:
Bypassing Host-Based Firewall & IDS
Sherri Sparks, Shawn Embleton, Cliff C. Zou
School of Electrical Engineering and Computer Science
University of Central Florida
4000 Central Florida Blvd., Orlando, FL USA 32816-2362
+1-407-823-5015
{sparks, embleton}@clearhatconsulting.com, czou@eecs.ucf.edu
ABSTRACT
Chipsets  refer  to  a  set  of  specialized  chips  on  a  computer's
motherboard or an expansion card [12]. In this paper we present a
proof of concept chipset level rootkit/network backdoor. It interacts
directly  with  network  interface  card  hardware  based  on  a  widely
deployed Intel chipset 8255x, and we tested it successfully on two
different  Ethernet  cards  with  this  chipset.  The  network  backdoor
has the ability to both covertly send out packets and receive packets,
without  the  need  to  disable  security  software  installed  in  the
compromised  host  in  order  to  hide  its  presence.  Because  of  its
low-level position in a computer system, the backdoor is capable of
bypassing virtually all commodity firewall and host-based intrusion
detection
including  popular,  widely  deployed
applications  like  Snort  and  Zone  Alarm  Security  Suite.  Such
network backdoors, while complicated and hardware specific, are
likely  to  become  serious  threats  in  high  profile  attacks  like
corporate espionage or cyber terrorist attacks.
software,
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection – invasive
software, security kernels
General Terms
Security
Keywords
Rootkit, network backdoor, hardware security
1.  INTRODUCTION
Host-based  firewalls  and  intrusion  detection  systems  have  made
significant advances in both technology and scope of deployment
within the past few years.  Despite these adva...


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

Input:
title:A chipset level network backdoor: bypassing host-based firewall &
IDS
author:Sherri Sparks and
Shawn Embleton and
Cliff Changchun Zou
A Chipset Level Network Backdoor:
Bypassing Host-Based Firewall & IDS
Sherri Sparks, Shawn Embleton, Cliff C. Zou
School of Electrical Engineering and Computer Science
University of Central Florida
4000 Central Florida Blvd., Orlando, FL USA 32816-2362
+1-407-823-5015
{sparks, embleton}@clearhatconsulting.com, czou@eecs.ucf.edu
ABSTRACT
Chipsets  refer  to  a  set  of  specialized  chips  on  a  computer's
motherboard or an expansion card [12]. In this paper we present a
proof of concept chipset level rootkit/network backdoor. It interacts
directly  with  network  interface  card  hardware  based  on  a  widely
deployed Intel chipset 8255x, and we tested it successfully on two
different  Ethernet  cards  with  this  chipset.  The  network  backdoor
has the ability to both covertly send out packets and receive packets,
without  the  need  to  disable  security  software  installed  in  the
compromised  host  in  order  to  hide  its  presence.  Because  of  its
low-level position in a computer system, the backdoor is capable of
bypassing virtually all commodity firewall and host-based intrusion
detection
including  popular,  widely  deployed
applications  like  Snort  and  Zone  Alarm  Security  Suite.  Such
network backdoors, while complicated and hardware specific, are
likely  to  become  serious  threats  in  high  profile  attacks  like
corporate espionage or cyber terrorist attacks.
software,
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection – invasive
software, security kernels
General Terms
Security
Keywords
Rootkit, network backdoor, hardware security
1.  INTRODUCTION
Host-based  firewalls  and  intrusion  detection  systems  have  made
significant advances in both technology and scope of deployment
within the past few years.  Despite these adva...

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


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

Input:
title:Mind Your Blocks: On the Stealthiness of Malicious BGP Hijacks
author:Pierre-Antoine Vervier and
Olivier Thonnard and
Marc Dacier
Mind Your Blocks:
On the Stealthiness of Malicious BGP Hijacks
Pierre-Antoine Vervier
Symantec Research Labs/Eurecom
Olivier Thonnard
Symantec Research Labs
Marc Dacier
Qatar Computing Research Institute
Pierre-Antoine_Vervier@symantec.com
Olivier_Thonnard@symantec.com
mdacier@qf.org.qa
Abstract—Some recent research presented evidence of blocks
of IP addresses being stolen by BGP hijackers to launch spam
campaigns
[35]. This was the ﬁrst time BGP hijacks were
seen in the wild. Since then, only a very few anecdotal cases
have been reported as if hackers were not interested in running
these attacks. However, it is a common belief among network
operators and ISPs that these attacks could be taking place
but, so far, no one has produced evidence to back up that
claim. In this paper, we analyse 18 months of data collected
by an infrastructure speciﬁcally built to answer that question:
are intentional stealthy BGP hijacks routinely taking place in
the Internet? The identiﬁcation of what we believe to be more
than 2,000 malicious hijacks leads to a positive answer. The lack
of ground truth is, of course, a problem but we managed to get
conﬁrmation of some of our ﬁndings thanks to an ISP unwittingly
involved in hijack cases we have spotted. This paper aims at
being an eye opener for the community by shedding some light
on this undocumented threat. We also hope that it will spur new
research to understand why these hijacks are taking place and
how they can be mitigated. Depending on how BGP attacks are
carried out, they can be very disruptive for the whole Internet
and should be looked at very closely. As of today, as much as
20% of the whole IPv4 address space is currently allocated but
not publicly announced, which makes it potentially vulnerable to
such malicious BGP hijacks.
I.
INTRODUCTION
The current Internet routing infrastructure is ...

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


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

Output:
安全论文分析：

title:SoftCast: one-size-fits-all wireless video
author:Szymon Jakubczak and
Dina Katabi
SoftCast: One-Size-Fits-All Wireless Video
Szymon Jakubczak
Massachusetts Institute of Technology
szym@mit.edu
Massachusetts Institute of Technology
Dina Katabi
dk@mit.edu
ABSTRACT
The focus of this demonstration is the performance of stream-
ing video over the mobile wireless channel. We compare two
schemes: the standard approach to video which transmits
H.264/AVC-encoded stream over 802.11-like PHY, and Soft-
Cast – a clean-slate design for wireless video where the source
transmits one video stream that each receiver decodes to a
video quality commensurate with its speciﬁc instantaneous
channel quality.
Categories and Subject Descriptors: C.2 Computer-
Communication Networks : Miscellaneous
General Terms: Algorithms, Design, Performance, Theory
Keywords: wireless networks, scalable video communica-
tions, joint source-channel coding
1.
INTRODUCTION
Mobile video broadcast presents a signiﬁcant challenge
to conventional wireless design. With mobility, the chan-
nel quality can exhibit fast unpredictable variations [3,9].
Video codecs however operate over groups of pictures (GOP)
and hence cannot instantaneously adapt the video rate to
the channel bit rate. As a result, a mobile receiver suﬀers
from video glitches and stales [2]. With multicast, diﬀerent
receivers experience diﬀerent channel qualities (SNRs) and
hence support diﬀerent bit rates. The transmitter however
has to pick a single transmission bit rate. As a result, the
transmitter has to send at the lowest bit rate supported by
all multicast receivers, which reduces everyone to the video
quality of the worst multicast receiver.
This demo advocates SoftCast, an alternative design for
wireless video streaming. SoftCast uses a novel encoding tech-
nique that allows it to broadcast a single stream from which
each receiver can decode a video quality commensurate with
its instantaneous channel quality. Thus, a mobile receiver...