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

Output:
安全论文分析：

title:A Measurement Study of the Origins of End-to-End Delay Variations
author:Yaron Schwartz and
Yuval Shavitt and
Udi Weinsberg
A Measurement Study of the Origins of
End-to-End Delay Variations
Yaron Schwartz, Yuval Shavitt, and Udi Weinsberg
School of Electrical Engineering
Tel-Aviv University, Israel
Abstract. The end-to-end (e2e) stability of Internet routing has been
studied for over a decade, focusing on routes and delays. This paper
presents a novel technique for uncovering the origins of delay variations
by measuring the overlap between delay distribution of probed routes,
and how these are aﬀected by route stability.
Evaluation is performed using two large scale experiments from 2006
and 2009, each measuring between more than 100 broadly distributed
vantage points. Our main ﬁnding is that in both years, about 70% of
the measured source-destination pairs and roughly 95% of the academic
pairs, have delay variations mostly within the routes, while only 15-
20% of the pairs and less than 5% of the academic pairs witness a clear
diﬀerence between the delays of diﬀerent routes.
1 Introduction
The Internet has evolved in recent years to become a complex network, with
increasing usage of load-balancing and traﬃc shaping devices. These devices
change the way packets ﬂow, therefore aﬀecting the observed stability of routes
and delays between hosts. This, in turn, aﬀects various delay and jitter sensitive
applications, such as VoIP and IPTV. On the other hand, load on devices is
not constant and may change the delay packets observe along the same route
signiﬁcantly. Therefore, it is important to understand both the delay stability
along the path and to identify the source of the delay variability when such
variability exists.
Wang et al. [1] and more recently Pucha et al. [2] studied the impact that
speciﬁc routing events have on the overall delay. They showed that although
routing changes can result in signiﬁcant round trip delay increase, their vari-
ability is sma...


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

Input:
title:A Measurement Study of the Origins of End-to-End Delay Variations
author:Yaron Schwartz and
Yuval Shavitt and
Udi Weinsberg
A Measurement Study of the Origins of
End-to-End Delay Variations
Yaron Schwartz, Yuval Shavitt, and Udi Weinsberg
School of Electrical Engineering
Tel-Aviv University, Israel
Abstract. The end-to-end (e2e) stability of Internet routing has been
studied for over a decade, focusing on routes and delays. This paper
presents a novel technique for uncovering the origins of delay variations
by measuring the overlap between delay distribution of probed routes,
and how these are aﬀected by route stability.
Evaluation is performed using two large scale experiments from 2006
and 2009, each measuring between more than 100 broadly distributed
vantage points. Our main ﬁnding is that in both years, about 70% of
the measured source-destination pairs and roughly 95% of the academic
pairs, have delay variations mostly within the routes, while only 15-
20% of the pairs and less than 5% of the academic pairs witness a clear
diﬀerence between the delays of diﬀerent routes.
1 Introduction
The Internet has evolved in recent years to become a complex network, with
increasing usage of load-balancing and traﬃc shaping devices. These devices
change the way packets ﬂow, therefore aﬀecting the observed stability of routes
and delays between hosts. This, in turn, aﬀects various delay and jitter sensitive
applications, such as VoIP and IPTV. On the other hand, load on devices is
not constant and may change the delay packets observe along the same route
signiﬁcantly. Therefore, it is important to understand both the delay stability
along the path and to identify the source of the delay variability when such
variability exists.
Wang et al. [1] and more recently Pucha et al. [2] studied the impact that
speciﬁc routing events have on the overall delay. They showed that although
routing changes can result in signiﬁcant round trip delay increase, their vari-
ability is sma...

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


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

Output:
安全论文分析：

title:FragDroid: Automated User Interface Interaction with Activity and
Fragment Analysis in Android Applications
author:Jia Chen and
Ge Han and
Shanqing Guo and
Wenrui Diao
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
FragDroid: Automated User Interface Interaction
with Activity and Fragment Analysis in Android
Applications
Jia Chen†, Ge Han†, Shanqing Guo*†‡ and Wenrui Diao§
†School of Computer Science and Technology, Shandong University
‡Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education,
Email: chenjia@mail.sdu.edu.cn, hangehg@126.com
Shandong University, Jinan 250100, China
Email: guoshanqing@sdu.edu.cn
§Jinan University
Email: diaowenrui@link.cuhk.edu.hk
Abstract—Recent years have witnessed the enormous growth
of Android phones in the consumer market. On the other hand,
as the most popular mobile platform, Android also attracts lots
of attackers’ attention. As a result, more and more Android
malicious apps appear in the wild, which poses a serious threat
to user’s security and privacy. To such massive volume of Android
malware, automated UI testing techniques have become the
mainstream solutions because of the detection efﬁciency and
accuracy. However, all existing UI testing techniques treat the
Activity as the basic unit of UI interactions and cannot carry out a
ﬁne-grained analysis for Fragments. Due to the lack of Fragment-
level analysis, the path coverage is usually quite limited.
To ﬁll this gap,
in this paper, we propose FragDroid, a
novel automated UI testing framework supporting both Activity
and Fragment analysis. To achieve the Fragment-level testing,
we design the Activity & Fragment Transition Model (AFTM)
to simulate the internal
interactions of an app, and ATFM
could be utilized to generate test cases automatically through
UI interactions. With the assist of AFTM, FragDroid achieves
accessing most Activities and Fragments contained in the app
along with the capabili...


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

Input:
title:FragDroid: Automated User Interface Interaction with Activity and
Fragment Analysis in Android Applications
author:Jia Chen and
Ge Han and
Shanqing Guo and
Wenrui Diao
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
FragDroid: Automated User Interface Interaction
with Activity and Fragment Analysis in Android
Applications
Jia Chen†, Ge Han†, Shanqing Guo*†‡ and Wenrui Diao§
†School of Computer Science and Technology, Shandong University
‡Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education,
Email: chenjia@mail.sdu.edu.cn, hangehg@126.com
Shandong University, Jinan 250100, China
Email: guoshanqing@sdu.edu.cn
§Jinan University
Email: diaowenrui@link.cuhk.edu.hk
Abstract—Recent years have witnessed the enormous growth
of Android phones in the consumer market. On the other hand,
as the most popular mobile platform, Android also attracts lots
of attackers’ attention. As a result, more and more Android
malicious apps appear in the wild, which poses a serious threat
to user’s security and privacy. To such massive volume of Android
malware, automated UI testing techniques have become the
mainstream solutions because of the detection efﬁciency and
accuracy. However, all existing UI testing techniques treat the
Activity as the basic unit of UI interactions and cannot carry out a
ﬁne-grained analysis for Fragments. Due to the lack of Fragment-
level analysis, the path coverage is usually quite limited.
To ﬁll this gap,
in this paper, we propose FragDroid, a
novel automated UI testing framework supporting both Activity
and Fragment analysis. To achieve the Fragment-level testing,
we design the Activity & Fragment Transition Model (AFTM)
to simulate the internal
interactions of an app, and ATFM
could be utilized to generate test cases automatically through
UI interactions. With the assist of AFTM, FragDroid achieves
accessing most Activities and Fragments contained in the app
along with the capabili...

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


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

Output:
安全论文分析：

title:\emphMLAS: multiple level authentication scheme for VANETs
author:Tat Wing Chim and
Lucas Chi Kwong Hui and
Siu-Ming Yiu and
Victor O. K. Li
Ad Hoc Networks 10 (2012) 1445–1456
Contents lists available at SciVerse ScienceDirect
Ad Hoc Networks
j o u r n a l h o m e p a g e : w w w . e l s e v i e r . c o m / l o c a t e / a d h o c
MLAS: Multiple level authentication scheme for VANETs
T.W. Chim a,⇑
, S.M. Yiu a, Lucas C.K. Hui a, Victor O.K. Li b
a Department of Computer Science, The University of Hong Kong, Hong Kong
b Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
a r t i c l e
i n f o
a b s t r a c t
Article history:
Received 10 February 2011
Accepted 29 March 2012
Available online 25 April 2012
Keywords:
Secure vehicular sensor network
Message classiﬁcation
Authentication
Batch veriﬁcation
Proxy re-encryption
The vehicular ad hoc network (VANET) is an emerging type of network which enables vehi-
cles on roads to inter-communicate for driving safety. The basic idea is to allow arbitrary
vehicles to broadcast ad hoc messages (e.g. trafﬁc accidents) to other vehicles. However,
this raises the concern of security and privacy. Messages should be signed and veriﬁed
before they are trusted while the real identity of vehicles should not be revealed, but trace-
able by authorized party. Existing solutions either rely too heavily on a tamper-proof hard-
ware device, or do not have an effective message veriﬁcation scheme. In this paper, we
propose a multiple level authentication scheme which still makes use of tamper-proof
devices but the strong assumption that a long-term system master secret is preloaded into
all tamper-proof devices is removed. Instead the master secret can be updated if needed to
increase the security level. On the other hand, messages sent by vehicles are classiﬁed into
two types – regular messages and urgent messages. Regular messages can be veriﬁed by
neighboring vehicles by means of Hash-based Mess...


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

Input:
title:\emphMLAS: multiple level authentication scheme for VANETs
author:Tat Wing Chim and
Lucas Chi Kwong Hui and
Siu-Ming Yiu and
Victor O. K. Li
Ad Hoc Networks 10 (2012) 1445–1456
Contents lists available at SciVerse ScienceDirect
Ad Hoc Networks
j o u r n a l h o m e p a g e : w w w . e l s e v i e r . c o m / l o c a t e / a d h o c
MLAS: Multiple level authentication scheme for VANETs
T.W. Chim a,⇑
, S.M. Yiu a, Lucas C.K. Hui a, Victor O.K. Li b
a Department of Computer Science, The University of Hong Kong, Hong Kong
b Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
a r t i c l e
i n f o
a b s t r a c t
Article history:
Received 10 February 2011
Accepted 29 March 2012
Available online 25 April 2012
Keywords:
Secure vehicular sensor network
Message classiﬁcation
Authentication
Batch veriﬁcation
Proxy re-encryption
The vehicular ad hoc network (VANET) is an emerging type of network which enables vehi-
cles on roads to inter-communicate for driving safety. The basic idea is to allow arbitrary
vehicles to broadcast ad hoc messages (e.g. trafﬁc accidents) to other vehicles. However,
this raises the concern of security and privacy. Messages should be signed and veriﬁed
before they are trusted while the real identity of vehicles should not be revealed, but trace-
able by authorized party. Existing solutions either rely too heavily on a tamper-proof hard-
ware device, or do not have an effective message veriﬁcation scheme. In this paper, we
propose a multiple level authentication scheme which still makes use of tamper-proof
devices but the strong assumption that a long-term system master secret is preloaded into
all tamper-proof devices is removed. Instead the master secret can be updated if needed to
increase the security level. On the other hand, messages sent by vehicles are classiﬁed into
two types – regular messages and urgent messages. Regular messages can be veriﬁed by
neighboring vehicles by means of Hash-based Mess...

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


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

Output:
安全论文分析：

title:POSTER: Security Control System Enabling to Keep an Intra-LAN in
a Secure State Using Security-and-Performance Ratio Control Policies
author:Yutaka Juba and
Hung-Hsuan Huang and
Kyoji Kawagoe
Accepted Manuscript
S0167-4048(17)30140-2
http://dx.doi.org/doi: 10.1016/j.cose.2017.07.001
COSE 1167
Title: Secure data aggregation using access control and authentication for
wireless sensor networks
Author: Abdul Razaque, Syed S. Rizvi
PII:
DOI:
Reference:
To appear in:
Received date:
Revised date:
Accepted date:  3-7-2017
Please cite this article as:  Abdul Razaque, Syed S. Rizvi, Secure data aggregation using access
control and authentication for wireless sensor networks, Computers & Security (2017),
http://dx.doi.org/doi: 10.1016/j.cose.2017.07.001.
Computers & Security
20-1-2017
24-5-2017
This is a PDF file of an unedited manuscript that has been accepted for publication.  As a service
to our customers we are providing this early version of the manuscript.  The manuscript will
undergo copyediting, typesetting, and review of the resulting proof before it is published in its
final form.  Please note that during the production process errors may be discovered which could
affect the content, and all legal disclaimers that apply to the journal pertain.
Secure Data Aggregation Using Access Control
and Authentication for Wireless Sensor
Networks
1Department of Computer Science, New York Institute of Technology, USA
2Department of Information Sciences and Technology, Pennsylvania State University, Altoona, PA 16601
1Abdul Razaque and 2Syed S. Rizvi
1arazaque@nyit.edu and 2srizvi@psu.edu
Abstract
The existing secure data aggregation approaches for wireless sensor networks  were not designed for authorization,
energy  efficiency  and  proper  security,  leaving  them  prone  to  attacks.  In  this  paper,  we  introduce  the  secure  data
aggregation using the access control and authentication (SDAACA) protocol. Using this protocol, w...


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

Input:
title:POSTER: Security Control System Enabling to Keep an Intra-LAN in
a Secure State Using Security-and-Performance Ratio Control Policies
author:Yutaka Juba and
Hung-Hsuan Huang and
Kyoji Kawagoe
Accepted Manuscript
S0167-4048(17)30140-2
http://dx.doi.org/doi: 10.1016/j.cose.2017.07.001
COSE 1167
Title: Secure data aggregation using access control and authentication for
wireless sensor networks
Author: Abdul Razaque, Syed S. Rizvi
PII:
DOI:
Reference:
To appear in:
Received date:
Revised date:
Accepted date:  3-7-2017
Please cite this article as:  Abdul Razaque, Syed S. Rizvi, Secure data aggregation using access
control and authentication for wireless sensor networks, Computers & Security (2017),
http://dx.doi.org/doi: 10.1016/j.cose.2017.07.001.
Computers & Security
20-1-2017
24-5-2017
This is a PDF file of an unedited manuscript that has been accepted for publication.  As a service
to our customers we are providing this early version of the manuscript.  The manuscript will
undergo copyediting, typesetting, and review of the resulting proof before it is published in its
final form.  Please note that during the production process errors may be discovered which could
affect the content, and all legal disclaimers that apply to the journal pertain.
Secure Data Aggregation Using Access Control
and Authentication for Wireless Sensor
Networks
1Department of Computer Science, New York Institute of Technology, USA
2Department of Information Sciences and Technology, Pennsylvania State University, Altoona, PA 16601
1Abdul Razaque and 2Syed S. Rizvi
1arazaque@nyit.edu and 2srizvi@psu.edu
Abstract
The existing secure data aggregation approaches for wireless sensor networks  were not designed for authorization,
energy  efficiency  and  proper  security,  leaving  them  prone  to  attacks.  In  this  paper,  we  introduce  the  secure  data
aggregation using the access control and authentication (SDAACA) protocol. Using this protocol, w...

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


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

Output:
安全论文分析：

title:Measuring Home Networks with HomeNet Profiler
author:Lucas DiCioccio and
Renata Teixeira and
Catherine Rosenberg
Measuring Home Networks with HomeNet Proﬁler
Lucas DiCioccio1,2, Renata Teixeira2, and Catherine Rosenberg3
1 Technicolor
2 CNRS and UPMC Sorbonne Universit´es
3 University of Waterloo
Abstract. This paper designs HomeNet Proﬁler, a software that runs on any
computer connected inside a home network, to collect a wide range of measure-
ments about home networks including the set of devices, the set of services (with
UPnP and Zeroconf), and the characteristics of the WiFi environment. To attract a
larger number of users, HomeNet Proﬁler runs one-shot measurements upon user
demand. We evaluate this design choice against periodic measurements taken
from six home networks. Data collected from these six homes and with Home-
Net Proﬁler in more than 1,600 homes in France shed light on the diversity of de-
vices that connect to home networks and of the WiFi neighborhood across home
networks.
1 Introduction
The availability of cheap broadband Internet is popularizing Internet access from homes.
A household today can have a variety of networked devices ranging from personal de-
vices like laptops and smartphones to printers and media centers. These devices connect
among themselves and to the Internet via a local-area network—the home network. Al-
though there is increasing interest in home networking [1–3, 12, 19], there is yet little
data on current home networks. Most prior work has focused on measuring and charac-
terizing residential Internet access [4, 5, 9, 11, 13, 14, 17, 18]. The lack of data on home
networks is partially due to the challenges of measuring home networks at large scales.
The vast majority of home networks are behind network-address translators, so a de-
vice outside the home often cannot measure the characteristics of the home network
itself. Some prior studies have deployed measurement points inside the homes of a few
volunteers [10, ...


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

Input:
title:Measuring Home Networks with HomeNet Profiler
author:Lucas DiCioccio and
Renata Teixeira and
Catherine Rosenberg
Measuring Home Networks with HomeNet Proﬁler
Lucas DiCioccio1,2, Renata Teixeira2, and Catherine Rosenberg3
1 Technicolor
2 CNRS and UPMC Sorbonne Universit´es
3 University of Waterloo
Abstract. This paper designs HomeNet Proﬁler, a software that runs on any
computer connected inside a home network, to collect a wide range of measure-
ments about home networks including the set of devices, the set of services (with
UPnP and Zeroconf), and the characteristics of the WiFi environment. To attract a
larger number of users, HomeNet Proﬁler runs one-shot measurements upon user
demand. We evaluate this design choice against periodic measurements taken
from six home networks. Data collected from these six homes and with Home-
Net Proﬁler in more than 1,600 homes in France shed light on the diversity of de-
vices that connect to home networks and of the WiFi neighborhood across home
networks.
1 Introduction
The availability of cheap broadband Internet is popularizing Internet access from homes.
A household today can have a variety of networked devices ranging from personal de-
vices like laptops and smartphones to printers and media centers. These devices connect
among themselves and to the Internet via a local-area network—the home network. Al-
though there is increasing interest in home networking [1–3, 12, 19], there is yet little
data on current home networks. Most prior work has focused on measuring and charac-
terizing residential Internet access [4, 5, 9, 11, 13, 14, 17, 18]. The lack of data on home
networks is partially due to the challenges of measuring home networks at large scales.
The vast majority of home networks are behind network-address translators, so a de-
vice outside the home often cannot measure the characteristics of the home network
itself. Some prior studies have deployed measurement points inside the homes of a few
volunteers [10, ...

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


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

Output:
安全论文分析：

title:Treaty: Secure Distributed Transactions
author:Dimitra Giantsidi and
Maurice Bailleu and
Natacha Crooks and
Pramod Bhatotia
5
1
0
0
0
.
2
2
0
2
.
5
0
4
3
5
N
S
D
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
1
-
3
9
6
1
-
4
5
6
6
-
1
-
8
7
9
|
)
N
S
D
(
s
k
r
o
w
t
e
N
d
n
a
s
m
e
t
s
y
S
e
l
b
a
d
n
e
p
e
D
n
o
e
c
n
e
r
e
f
n
o
C
l
a
n
o
i
t
a
n
r
e
t
n
I
P
I
F
I
/
E
E
E
I
l
a
u
n
n
A
d
n
2
5
2
2
0
2
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
Treaty: Secure Distributed Transactions
Dimitra Giantsidi
University of Edinburgh
Maurice Bailleu
University of Edinburgh
Natacha Crooks
UC Berkeley
Pramod Bhatotia
TU Munich
Abstract—Distributed transaction processing is a fundamental
building block for large-scale data management in the cloud.
Given the threats of security violations in untrusted cloud
environments, our work focuses on: How to design a distributed
transactional KV store that achieves high-performance serializable
transactions, while providing strong security properties?
We introduce TREATY, a secure distributed transactional KV
storage system that supports serializable ACID transactions while
guaranteeing strong security properties: conﬁdentiality, integrity,
and freshness. TREATY leverages trusted execution environments
(TEEs) to bootstrap its security properties, but it extends the trust
provided by the limited enclave (volatile) memory region within a
single node to build a secure (stateful) distributed transactional KV
store over the untrusted storage, network and machines. To achieve
this, TREATY embodies a secure two-phase commit protocol co-
designed with a high-performance network library for TEEs.
Further, TREATY ensures secure and crash-consistent persistency
of committed transactions using a stabilization protocol. Our
evaluation on a real hardware testbed based on the YCSB
and TPC-C benchmarks shows that TREATY incurs reasonable
overheads, while achieving strong security p...


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

Input:
title:Treaty: Secure Distributed Transactions
author:Dimitra Giantsidi and
Maurice Bailleu and
Natacha Crooks and
Pramod Bhatotia
5
1
0
0
0
.
2
2
0
2
.
5
0
4
3
5
N
S
D
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
1
-
3
9
6
1
-
4
5
6
6
-
1
-
8
7
9
|
)
N
S
D
(
s
k
r
o
w
t
e
N
d
n
a
s
m
e
t
s
y
S
e
l
b
a
d
n
e
p
e
D
n
o
e
c
n
e
r
e
f
n
o
C
l
a
n
o
i
t
a
n
r
e
t
n
I
P
I
F
I
/
E
E
E
I
l
a
u
n
n
A
d
n
2
5
2
2
0
2
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
Treaty: Secure Distributed Transactions
Dimitra Giantsidi
University of Edinburgh
Maurice Bailleu
University of Edinburgh
Natacha Crooks
UC Berkeley
Pramod Bhatotia
TU Munich
Abstract—Distributed transaction processing is a fundamental
building block for large-scale data management in the cloud.
Given the threats of security violations in untrusted cloud
environments, our work focuses on: How to design a distributed
transactional KV store that achieves high-performance serializable
transactions, while providing strong security properties?
We introduce TREATY, a secure distributed transactional KV
storage system that supports serializable ACID transactions while
guaranteeing strong security properties: conﬁdentiality, integrity,
and freshness. TREATY leverages trusted execution environments
(TEEs) to bootstrap its security properties, but it extends the trust
provided by the limited enclave (volatile) memory region within a
single node to build a secure (stateful) distributed transactional KV
store over the untrusted storage, network and machines. To achieve
this, TREATY embodies a secure two-phase commit protocol co-
designed with a high-performance network library for TEEs.
Further, TREATY ensures secure and crash-consistent persistency
of committed transactions using a stabilization protocol. Our
evaluation on a real hardware testbed based on the YCSB
and TPC-C benchmarks shows that TREATY incurs reasonable
overheads, while achieving strong security p...

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


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

Output:
安全论文分析：

title:POSTER: Content-Agnostic Identification of Cryptojacking in Network
Traffic
author:Yebo Feng and
Devkishen Sisodia and
Jun Li
POSTER: Content-Agnostic Identification of Cryptojacking in
Network Traffic
Yebo Feng
University of Oregon
yebof@cs.uoregon.edu
Devkishen Sisodia
University of Oregon
dsisodia@cs.uoregon.edu
Jun Li
University of Oregon
lijun@cs.uoregon.edu
ABSTRACT
In this paper, we propose a method that detects cryptojacking ac-
tivities by analyzing content-agnostic network traffic flows. Our
method first distinguishes crypto-mining activities by profiling the
traffic with fast Fourier transform at each time window. It then
generates the variation vectors between adjacent time windows
and leverages a recurrent neural network to identify the cryptojack-
ing patterns. Compared with the existing approaches, this method
is privacy-preserving and can identify both browser-based and
malware-based cryptojacking activities. Additionally, this method
is easy to deploy. It can monitor all the devices within a network
by accessing packet headers from the gateway router.
CCS CONCEPTS
• Networks → Network monitoring; • Security and privacy
→ Intrusion/anomaly detection and malware mitigation.
KEYWORDS
cryptojacking, anomaly detection, network traffic classification
ACM Reference Format:
Yebo Feng, Devkishen Sisodia, and Jun Li. 2020. POSTER: Content-Agnostic
Identification of Cryptojacking in Network Traffic. In Proceedings of the 15th
ACM Asia Conference on Computer and Communications Security (ASIA CCS
’20), October 5–9, 2020, Taipei, Taiwan. ACM, New York, NY, USA, 3 pages.
https://doi.org/10.1145/3320269.3405440
1 INTRODUCTION
Cryptocurrencies have become popular, in large part due to their
tremendous value gains and innovative concepts. One such concept
is cryptocurrency mining (crypto-mining), which not only provides
a means to verify cryptocurrency transactions and generate new
cryptocurrency, but more importantly, helps establish consensus,
which is critic...


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

Input:
title:POSTER: Content-Agnostic Identification of Cryptojacking in Network
Traffic
author:Yebo Feng and
Devkishen Sisodia and
Jun Li
POSTER: Content-Agnostic Identification of Cryptojacking in
Network Traffic
Yebo Feng
University of Oregon
yebof@cs.uoregon.edu
Devkishen Sisodia
University of Oregon
dsisodia@cs.uoregon.edu
Jun Li
University of Oregon
lijun@cs.uoregon.edu
ABSTRACT
In this paper, we propose a method that detects cryptojacking ac-
tivities by analyzing content-agnostic network traffic flows. Our
method first distinguishes crypto-mining activities by profiling the
traffic with fast Fourier transform at each time window. It then
generates the variation vectors between adjacent time windows
and leverages a recurrent neural network to identify the cryptojack-
ing patterns. Compared with the existing approaches, this method
is privacy-preserving and can identify both browser-based and
malware-based cryptojacking activities. Additionally, this method
is easy to deploy. It can monitor all the devices within a network
by accessing packet headers from the gateway router.
CCS CONCEPTS
• Networks → Network monitoring; • Security and privacy
→ Intrusion/anomaly detection and malware mitigation.
KEYWORDS
cryptojacking, anomaly detection, network traffic classification
ACM Reference Format:
Yebo Feng, Devkishen Sisodia, and Jun Li. 2020. POSTER: Content-Agnostic
Identification of Cryptojacking in Network Traffic. In Proceedings of the 15th
ACM Asia Conference on Computer and Communications Security (ASIA CCS
’20), October 5–9, 2020, Taipei, Taiwan. ACM, New York, NY, USA, 3 pages.
https://doi.org/10.1145/3320269.3405440
1 INTRODUCTION
Cryptocurrencies have become popular, in large part due to their
tremendous value gains and innovative concepts. One such concept
is cryptocurrency mining (crypto-mining), which not only provides
a means to verify cryptocurrency transactions and generate new
cryptocurrency, but more importantly, helps establish consensus,
which is critic...

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


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

Output:
安全论文分析：

title:Intriguer: Field-Level Constraint Solving for Hybrid Fuzzing
author:Mingi Cho and
Seoyoung Kim and
Taekyoung Kwon
Intriguer: Field-Level Constraint Solving for Hybrid Fuzzing
Mingi Cho
Yonsei University
imgc@yonsei.ac.kr
Seoyoung Kim
Yonsei University
kseoy4046@yonsei.ac.kr
Taekyoung Kwon
Yonsei University
taekyoung@yonsei.ac.kr
ABSTRACT
Hybrid fuzzing, which combines fuzzing and concolic execution,
is promising in light of the recent performance improvements in
concolic engines. We have observed that there is room for further
improvement: symbolic emulation is still slow, unnecessary con-
straints dominate solving time, resources are overly allocated, and
hard-to-trigger bugs are missed.
To address these problems, we present a new hybrid fuzzer
named Intriguer. The key idea of Intriguer is field-level constraint
solving, which optimizes symbolic execution with field-level knowl-
edge. Intriguer performs instruction-level taint analysis and records
execution traces without data transfer instructions like mov. In-
triguer then reduces the execution traces for tainted instructions
that accessed a wide range of input bytes, and infers input fields to
build field transition trees. With these optimizations, Intriguer can
efficiently perform symbolic emulation for more relevant instruc-
tions and invoke a solver for complicated constraints only.
Our evaluation results indicate that Intriguer outperforms the
state-of-the-art fuzzers: Intriguer found all the bugs in the LAVA-
M(5h) benchmark dataset for ground truth performance, and also
discovered 43 new security bugs in seven real-world programs. We
reported the bugs and received 23 new CVEs.
CCS CONCEPTS
• Security and privacy → Software security engineering.
KEYWORDS
fuzzing; hybrid fuzzing; constraint solving
ACM Reference Format:
Mingi Cho, Seoyoung Kim, and Taekyoung Kwon. 2019. Intriguer: Field-
Level Constraint Solving for Hybrid Fuzzing. In 2019 ACM SIGSAC Con-
ference on Computer and Communications Security...


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

Input:
title:Intriguer: Field-Level Constraint Solving for Hybrid Fuzzing
author:Mingi Cho and
Seoyoung Kim and
Taekyoung Kwon
Intriguer: Field-Level Constraint Solving for Hybrid Fuzzing
Mingi Cho
Yonsei University
imgc@yonsei.ac.kr
Seoyoung Kim
Yonsei University
kseoy4046@yonsei.ac.kr
Taekyoung Kwon
Yonsei University
taekyoung@yonsei.ac.kr
ABSTRACT
Hybrid fuzzing, which combines fuzzing and concolic execution,
is promising in light of the recent performance improvements in
concolic engines. We have observed that there is room for further
improvement: symbolic emulation is still slow, unnecessary con-
straints dominate solving time, resources are overly allocated, and
hard-to-trigger bugs are missed.
To address these problems, we present a new hybrid fuzzer
named Intriguer. The key idea of Intriguer is field-level constraint
solving, which optimizes symbolic execution with field-level knowl-
edge. Intriguer performs instruction-level taint analysis and records
execution traces without data transfer instructions like mov. In-
triguer then reduces the execution traces for tainted instructions
that accessed a wide range of input bytes, and infers input fields to
build field transition trees. With these optimizations, Intriguer can
efficiently perform symbolic emulation for more relevant instruc-
tions and invoke a solver for complicated constraints only.
Our evaluation results indicate that Intriguer outperforms the
state-of-the-art fuzzers: Intriguer found all the bugs in the LAVA-
M(5h) benchmark dataset for ground truth performance, and also
discovered 43 new security bugs in seven real-world programs. We
reported the bugs and received 23 new CVEs.
CCS CONCEPTS
• Security and privacy → Software security engineering.
KEYWORDS
fuzzing; hybrid fuzzing; constraint solving
ACM Reference Format:
Mingi Cho, Seoyoung Kim, and Taekyoung Kwon. 2019. Intriguer: Field-
Level Constraint Solving for Hybrid Fuzzing. In 2019 ACM SIGSAC Con-
ference on Computer and Communications Security...

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


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

Output:
安全论文分析：

title:"It's stressful having all these phones": Investigating Sex Workers'
Safety Goals, Risks, and Practices Online
author:Allison McDonald and
Catherine Barwulor and
Michelle L. Mazurek and
Florian Schaub and
Elissa M. Redmiles
“It’s stressful having all these phones”:
Investigating Sex Workers’ Safety Goals, Risks,
and Practices Online
Allison McDonald, University of Michigan; Catherine Barwulor, Clemson University;
Michelle L. Mazurek, University of Maryland; Florian Schaub, University of Michigan;
Elissa M. Redmiles, Max Planck Institute for Software Systems
https://www.usenix.org/conference/usenixsecurity21/presentation/mcdonald
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.“It’s stressful having all these phones”:
Investigating Sex Workers’ Safety Goals, Risks, and Practices Online
Allison McDonald
University of Michigan
Florian Schaub
University of Michigan
Catherine Barwulor
Clemson University
Michelle L. Mazurek
University of Maryland
Elissa M. Redmiles
Max Planck Institute for Software Systems
Abstract
We investigate how a population of end-users with es-
pecially salient security and privacy risks — sex workers —
conceptualizes and manages their digital safety. The commer-
cial sex industry is increasingly Internet-mediated. As such,
sex workers are facing new challenges in protecting their dig-
ital privacy and security and avoiding serious consequences
such as stalking, blackmail, and social exclusion. Through
interviews (n=29) and a survey (n=65) with sex workers in
European countries where sex work is legal and regulated,
we ﬁnd that sex workers have well-deﬁned safety goals and
clear awareness of the risks to their safety: clients, deﬁcient
legal protections, and hostile digital platforms. In response to
these risks, our participants developed complex strategies for
protecting their saf...


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

Input:
title:"It's stressful having all these phones": Investigating Sex Workers'
Safety Goals, Risks, and Practices Online
author:Allison McDonald and
Catherine Barwulor and
Michelle L. Mazurek and
Florian Schaub and
Elissa M. Redmiles
“It’s stressful having all these phones”:
Investigating Sex Workers’ Safety Goals, Risks,
and Practices Online
Allison McDonald, University of Michigan; Catherine Barwulor, Clemson University;
Michelle L. Mazurek, University of Maryland; Florian Schaub, University of Michigan;
Elissa M. Redmiles, Max Planck Institute for Software Systems
https://www.usenix.org/conference/usenixsecurity21/presentation/mcdonald
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.“It’s stressful having all these phones”:
Investigating Sex Workers’ Safety Goals, Risks, and Practices Online
Allison McDonald
University of Michigan
Florian Schaub
University of Michigan
Catherine Barwulor
Clemson University
Michelle L. Mazurek
University of Maryland
Elissa M. Redmiles
Max Planck Institute for Software Systems
Abstract
We investigate how a population of end-users with es-
pecially salient security and privacy risks — sex workers —
conceptualizes and manages their digital safety. The commer-
cial sex industry is increasingly Internet-mediated. As such,
sex workers are facing new challenges in protecting their dig-
ital privacy and security and avoiding serious consequences
such as stalking, blackmail, and social exclusion. Through
interviews (n=29) and a survey (n=65) with sex workers in
European countries where sex work is legal and regulated,
we ﬁnd that sex workers have well-deﬁned safety goals and
clear awareness of the risks to their safety: clients, deﬁcient
legal protections, and hostile digital platforms. In response to
these risks, our participants developed complex strategies for
protecting their saf...

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


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

Output:
安全论文分析：

title:Stress balancing to mitigate NBTI effects in register files
author:Hussam Amrouch and
Thomas Ebi and
J"org Henkel
Stress Balancing to Mitigate NBTI Effects in
Register Files
Hussam Amrouch, Thomas Ebi, J¨org Henkel
Chair for Embedded Systems (CES), Karsruhe Institute of Technology (KIT), Germany
{amrouch,thomas.ebi, henkel}@kit.edu
Abstract—Negative Bias Temperature Instability (NBTI) is
considered one of the major reliability concerns of transistors
in current and upcoming technology nodes and a main cause of
their diminished lifetime. We propose a new means to mitigate
the effects of NBTI on SRAM-based register ﬁles, which are
particularly vulnerable due to their small structure size and
are under continuous voltage stress for prolonged intervals. The
conducted results from our technology simulator demonstrate
the severity of NBTI effects on the SRAM cells – especially
when process variation is taken into account. Based on the
presented analysis, we show that NBTI stress in different registers
needs to be tackled using different strategies corresponding to
their access patterns. To this end, we propose to selectively
increase the resilience of individual registers against NBTI. Our
technique balances the gate voltage stress of the two PMOS
transistors of an SRAM cell such that both are under stress
for approximately the same amount of time during operation –
thereby minimizing the deleterious effects of NBTI. We present
mitigation implementations in both hardware and in software
along with the incurred overhead. Through a wide range of
applications we can show that our technique reduces the NBTI-
induced reliability degradation by 35% on average. This is 22%
better than current State-of-the-Art.
Keywords—Embedded system, Reliability; Aging; Register File;
NBTI; Microarchitecture;
I.
INTRODUCTION
As technology scaling continues, new phenomena such as
NBTI start to threaten the correct functionality of transistors
over their lifetime, leading to a signiﬁc...


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

Input:
title:Stress balancing to mitigate NBTI effects in register files
author:Hussam Amrouch and
Thomas Ebi and
J"org Henkel
Stress Balancing to Mitigate NBTI Effects in
Register Files
Hussam Amrouch, Thomas Ebi, J¨org Henkel
Chair for Embedded Systems (CES), Karsruhe Institute of Technology (KIT), Germany
{amrouch,thomas.ebi, henkel}@kit.edu
Abstract—Negative Bias Temperature Instability (NBTI) is
considered one of the major reliability concerns of transistors
in current and upcoming technology nodes and a main cause of
their diminished lifetime. We propose a new means to mitigate
the effects of NBTI on SRAM-based register ﬁles, which are
particularly vulnerable due to their small structure size and
are under continuous voltage stress for prolonged intervals. The
conducted results from our technology simulator demonstrate
the severity of NBTI effects on the SRAM cells – especially
when process variation is taken into account. Based on the
presented analysis, we show that NBTI stress in different registers
needs to be tackled using different strategies corresponding to
their access patterns. To this end, we propose to selectively
increase the resilience of individual registers against NBTI. Our
technique balances the gate voltage stress of the two PMOS
transistors of an SRAM cell such that both are under stress
for approximately the same amount of time during operation –
thereby minimizing the deleterious effects of NBTI. We present
mitigation implementations in both hardware and in software
along with the incurred overhead. Through a wide range of
applications we can show that our technique reduces the NBTI-
induced reliability degradation by 35% on average. This is 22%
better than current State-of-the-Art.
Keywords—Embedded system, Reliability; Aging; Register File;
NBTI; Microarchitecture;
I.
INTRODUCTION
As technology scaling continues, new phenomena such as
NBTI start to threaten the correct functionality of transistors
over their lifetime, leading to a signiﬁc...

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


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

Output:
安全论文分析：

title:Separation of duties as a service
author:David A. Basin and
Samuel J. Burri and
G"unter Karjoth
CITY OF PALO ALTO OFFICE OF THE CITY AUDITOR
October 23, 2018
The Honorable City Council
Palo Alto, California
Policy and Services Committee Recommends the City Council Accept
the ERP Planning: Separation of Duties Audit
In accordance with the Fiscal Year 2018 Annual Audit Work Plan, the Office of the City Auditor
has completed the ERP Planning: Separation of Duties audit. The audit report presents one
finding and two recommendations. The Office of the City Auditor recommends that the Policy
and Services Committee review and recommend to the City Council acceptance of the ERP
Planning: Separation of Duties audit.
Respectfully submitted,
Harriet Richardson
City Auditor
ATTACHMENTS:
•  Attachment A: Separation of Duties Audit
Department Head:  Harriet Richardson, City Auditor
(PDF)
Page 2
ERP Planning: Separation of Duties
October 17, 2018
Office of the City Auditor
Harriet Richardson, City Auditor
Mimi Nguyen, Senior Performance Auditor
Lisa Wehara, Performance Auditor II
Jordan Christenson, Performance Auditor
Attachment A
Page intentionally left blank for double‐sided printing
Attachment AOFFICE OF THE CITY AUDITOR
EXECUTIVE SUMMARY
ERP Planning: Separation of Duties
October 17, 2018
PURPOSE OF THE AUDIT
The purpose of this audit was to evaluate the adequacy of separation of duties for various activities
in the current SAP system and make recommendations to ensure that any identified deficiencies
are corrected for the new ERP system.
REPORT HIGHLIGHTS
Finding:
Implementing
effective separation
of duties and ensuring
well‐restricted user
access controls for the
new ERP system will
decrease
vulnerabilities and
risks
The City uses varying automated and manual processes for separating key
business activities and duties among staff for the high‐risk activities we
reviewed, such as payroll processing, purchase o...


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

Input:
title:Separation of duties as a service
author:David A. Basin and
Samuel J. Burri and
G"unter Karjoth
CITY OF PALO ALTO OFFICE OF THE CITY AUDITOR
October 23, 2018
The Honorable City Council
Palo Alto, California
Policy and Services Committee Recommends the City Council Accept
the ERP Planning: Separation of Duties Audit
In accordance with the Fiscal Year 2018 Annual Audit Work Plan, the Office of the City Auditor
has completed the ERP Planning: Separation of Duties audit. The audit report presents one
finding and two recommendations. The Office of the City Auditor recommends that the Policy
and Services Committee review and recommend to the City Council acceptance of the ERP
Planning: Separation of Duties audit.
Respectfully submitted,
Harriet Richardson
City Auditor
ATTACHMENTS:
•  Attachment A: Separation of Duties Audit
Department Head:  Harriet Richardson, City Auditor
(PDF)
Page 2
ERP Planning: Separation of Duties
October 17, 2018
Office of the City Auditor
Harriet Richardson, City Auditor
Mimi Nguyen, Senior Performance Auditor
Lisa Wehara, Performance Auditor II
Jordan Christenson, Performance Auditor
Attachment A
Page intentionally left blank for double‐sided printing
Attachment AOFFICE OF THE CITY AUDITOR
EXECUTIVE SUMMARY
ERP Planning: Separation of Duties
October 17, 2018
PURPOSE OF THE AUDIT
The purpose of this audit was to evaluate the adequacy of separation of duties for various activities
in the current SAP system and make recommendations to ensure that any identified deficiencies
are corrected for the new ERP system.
REPORT HIGHLIGHTS
Finding:
Implementing
effective separation
of duties and ensuring
well‐restricted user
access controls for the
new ERP system will
decrease
vulnerabilities and
risks
The City uses varying automated and manual processes for separating key
business activities and duties among staff for the high‐risk activities we
reviewed, such as payroll processing, purchase o...

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


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

Output:
安全论文分析：

title:Are anonymity-seekers just like everybody else? An analysis of contributions
to Wikipedia from Tor
author:Chau Tran and
Kaylea Champion and
Andrea Forte and
Benjamin Mako Hill and
Rachel Greenstadt
2020 IEEE Symposium on Security and Privacy
Are anonymity-seekers just like everybody else?
An analysis of contributions to Wikipedia from Tor
Department of Computer Science & Engineering
Department of Communication
College of Computing & Informatics
Chau Tran
Kaylea Champion
Andrea Forte
New York University
New York, USA
chau.tran@nyu.edu
University of Washington
Seatle, USA
kaylea@uw.edu
Drexel University
Philadelphia, USA
af468@drexel.edu
Benjamin Mako Hill
Department of Communication
University of Washington
Seatle, USA
makohill@uw.edu
Rachel Greenstadt
Department of Computer Science & Engineering
New York University
New York, USA
greenstadt@nyu.edu
Abstract—User-generated content sites routinely block contri-
butions from users of privacy-enhancing proxies like Tor because
of a perception that proxies are a source of vandalism, spam,
and abuse. Although these blocks might be effective, collateral
damage in the form of unrealized valuable contributions from
anonymity seekers is invisible. One of the largest and most
important user-generated content sites, Wikipedia, has attempted
to block contributions from Tor users since as early as 2005.
We demonstrate that these blocks have been imperfect and
that thousands of attempts to edit on Wikipedia through Tor
have been successful. We draw upon several data sources and
analytical techniques to measure and describe the history of Tor
editing on Wikipedia over time and to compare contributions
from Tor users to those from other groups of Wikipedia users.
Our analysis suggests that although Tor users who slip through
Wikipedia’s ban contribute content that is more likely to be
reverted and to revert others, their contributions are otherwise
similar in quality to those from other unregistered participants
and to the init...


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

Input:
title:Are anonymity-seekers just like everybody else? An analysis of contributions
to Wikipedia from Tor
author:Chau Tran and
Kaylea Champion and
Andrea Forte and
Benjamin Mako Hill and
Rachel Greenstadt
2020 IEEE Symposium on Security and Privacy
Are anonymity-seekers just like everybody else?
An analysis of contributions to Wikipedia from Tor
Department of Computer Science & Engineering
Department of Communication
College of Computing & Informatics
Chau Tran
Kaylea Champion
Andrea Forte
New York University
New York, USA
chau.tran@nyu.edu
University of Washington
Seatle, USA
kaylea@uw.edu
Drexel University
Philadelphia, USA
af468@drexel.edu
Benjamin Mako Hill
Department of Communication
University of Washington
Seatle, USA
makohill@uw.edu
Rachel Greenstadt
Department of Computer Science & Engineering
New York University
New York, USA
greenstadt@nyu.edu
Abstract—User-generated content sites routinely block contri-
butions from users of privacy-enhancing proxies like Tor because
of a perception that proxies are a source of vandalism, spam,
and abuse. Although these blocks might be effective, collateral
damage in the form of unrealized valuable contributions from
anonymity seekers is invisible. One of the largest and most
important user-generated content sites, Wikipedia, has attempted
to block contributions from Tor users since as early as 2005.
We demonstrate that these blocks have been imperfect and
that thousands of attempts to edit on Wikipedia through Tor
have been successful. We draw upon several data sources and
analytical techniques to measure and describe the history of Tor
editing on Wikipedia over time and to compare contributions
from Tor users to those from other groups of Wikipedia users.
Our analysis suggests that although Tor users who slip through
Wikipedia’s ban contribute content that is more likely to be
reverted and to revert others, their contributions are otherwise
similar in quality to those from other unregistered participants
and to the init...

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


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

Output:
安全论文分析：

title:The Utility Argument - Making a Case for Broadband SLAs
author:Zachary S. Bischof and
Fabi'an E. Bustamante and
Rade Stanojevic
The Utility Argument – Making a Case
for Broadband SLAs
Zachary S. Bischof1(B), Fabi´an E. Bustamante1, and Rade Stanojevic2
1 Northwestern University, Evanston, USA
zbischof@eecs.northwestern.edu
2 Qatar Computing Research Institute, Al-Rayyan, Qatar
Abstract. Most residential broadband services are described in terms
of their maximum potential throughput rate, often advertised as having
speeds “up to X Mbps”. Though such promises are often met, they are
fairly limited in scope and, unfortunately, there is no basis for an appeal
if a customer were to receive compromised quality of service. While this
‘best eﬀort’ model was suﬃcient in the early days, we argue that as broad-
band customers and their devices become more dependent on Internet
connectivity, we will see an increased demand for more encompassing
Service Level Agreements (SLA).
In this paper, we study the design space of broadband SLAs and
explore some of the trade-oﬀs between the level of strictness of SLAs
and the cost of delivering them. We argue that certain SLAs could be
oﬀered almost immediately with minimal impact on retail prices, and
that ISPs (or third parties) could accurately infer the risk of oﬀering
SLA to individual customers – with accuracy comparable to that in the
car or credit insurance industry – and price the SLA service accordingly.
1 Introduction
In today’s broadband markets, service plans are typically described in terms of
their maximum download throughput rate, often advertised as “up to X Mbps”.
This advertised capacity, along with the associated monthly cost, are the two
primary, and many times only, pieces of information available to consumers
when comparing service providers. Such “constrained” service agreements place
services using technologies as diverse as ﬁber, DSL, WiMAX or satellite on
nearly equal grounds, and leave consumers witho...


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

Input:
title:The Utility Argument - Making a Case for Broadband SLAs
author:Zachary S. Bischof and
Fabi'an E. Bustamante and
Rade Stanojevic
The Utility Argument – Making a Case
for Broadband SLAs
Zachary S. Bischof1(B), Fabi´an E. Bustamante1, and Rade Stanojevic2
1 Northwestern University, Evanston, USA
zbischof@eecs.northwestern.edu
2 Qatar Computing Research Institute, Al-Rayyan, Qatar
Abstract. Most residential broadband services are described in terms
of their maximum potential throughput rate, often advertised as having
speeds “up to X Mbps”. Though such promises are often met, they are
fairly limited in scope and, unfortunately, there is no basis for an appeal
if a customer were to receive compromised quality of service. While this
‘best eﬀort’ model was suﬃcient in the early days, we argue that as broad-
band customers and their devices become more dependent on Internet
connectivity, we will see an increased demand for more encompassing
Service Level Agreements (SLA).
In this paper, we study the design space of broadband SLAs and
explore some of the trade-oﬀs between the level of strictness of SLAs
and the cost of delivering them. We argue that certain SLAs could be
oﬀered almost immediately with minimal impact on retail prices, and
that ISPs (or third parties) could accurately infer the risk of oﬀering
SLA to individual customers – with accuracy comparable to that in the
car or credit insurance industry – and price the SLA service accordingly.
1 Introduction
In today’s broadband markets, service plans are typically described in terms of
their maximum download throughput rate, often advertised as “up to X Mbps”.
This advertised capacity, along with the associated monthly cost, are the two
primary, and many times only, pieces of information available to consumers
when comparing service providers. Such “constrained” service agreements place
services using technologies as diverse as ﬁber, DSL, WiMAX or satellite on
nearly equal grounds, and leave consumers witho...

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


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

Output:
安全论文分析：

title:BRB: BetteR Batch Scheduling to Reduce Tail Latencies in Cloud Data
Stores
author:Waleed Reda and
P. Lalith Suresh and
Marco Canini and
Sean Braithwaite
BRB: BetteR Batch Scheduling to Reduce Tail Latencies in
Cloud Data Stores
Waleed Reda
Université catholique
de Louvain
Lalith Suresh∗
TU Berlin
Marco Canini
Université catholique
de Louvain
Sean Braithwaite
SoundCloud
ABSTRACT
A common pattern in the architectures of modern interac-
tive web-services is that of large request fan-outs, where even
a single end-user request (task ) arriving at an application
server triggers tens to thousands of data accesses (sub-tasks)
to diﬀerent stateful backend servers. The overall response
time of each task is bottlenecked by the completion time of
the slowest sub-task, making such workloads highly sensi-
tive to the tail of latency distribution of the backend tier.
The large number of decentralized application servers and
skewed workload patterns exacerbate the challenge in ad-
dressing this problem.
We address these challenges through BetteR Batch (BRB).
By carefully scheduling requests in a decentralized and task-
aware manner, BRB enables low-latency distributed storage
systems to deliver predictable performance in the presence
of large request fan-outs. Our preliminary simulation results
based on production workloads show that our proposed de-
sign is at the 99th percentile latency within 38% of an ideal
system model while oﬀering latency improvements over the
state-of-the-art by a factor of 2.
CCS Concepts
•General and reference → Performance; •Information
systems → Distributed storage;
1.
INTRODUCTION
Recent studies [3] showed that latency distributions in
Web-scale systems exhibit long-tail behaviors where the 99th
percentile latency can be more than one order of magnitude
higher than the median latency. To make matters worse,
modern applications are highly distributed. For instance,
interactive web services involve parallelization and aggrega-
tion of responses acr...


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

Input:
title:BRB: BetteR Batch Scheduling to Reduce Tail Latencies in Cloud Data
Stores
author:Waleed Reda and
P. Lalith Suresh and
Marco Canini and
Sean Braithwaite
BRB: BetteR Batch Scheduling to Reduce Tail Latencies in
Cloud Data Stores
Waleed Reda
Université catholique
de Louvain
Lalith Suresh∗
TU Berlin
Marco Canini
Université catholique
de Louvain
Sean Braithwaite
SoundCloud
ABSTRACT
A common pattern in the architectures of modern interac-
tive web-services is that of large request fan-outs, where even
a single end-user request (task ) arriving at an application
server triggers tens to thousands of data accesses (sub-tasks)
to diﬀerent stateful backend servers. The overall response
time of each task is bottlenecked by the completion time of
the slowest sub-task, making such workloads highly sensi-
tive to the tail of latency distribution of the backend tier.
The large number of decentralized application servers and
skewed workload patterns exacerbate the challenge in ad-
dressing this problem.
We address these challenges through BetteR Batch (BRB).
By carefully scheduling requests in a decentralized and task-
aware manner, BRB enables low-latency distributed storage
systems to deliver predictable performance in the presence
of large request fan-outs. Our preliminary simulation results
based on production workloads show that our proposed de-
sign is at the 99th percentile latency within 38% of an ideal
system model while oﬀering latency improvements over the
state-of-the-art by a factor of 2.
CCS Concepts
•General and reference → Performance; •Information
systems → Distributed storage;
1.
INTRODUCTION
Recent studies [3] showed that latency distributions in
Web-scale systems exhibit long-tail behaviors where the 99th
percentile latency can be more than one order of magnitude
higher than the median latency. To make matters worse,
modern applications are highly distributed. For instance,
interactive web services involve parallelization and aggrega-
tion of responses acr...

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


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

Output:
安全论文分析：

title:SafeConfig'17: Applying the Scientific Method to Active Cyber Defense
Research
author:Nicholas J. Multari and
Anoop Singhal and
Erin Miller
SafeConfig’17:  Applying the Scientific Method to Active Cyber
Defense Research
Nicholas J. Multari
Pacific Northwest National Lab,
Richland, WA, USA
nick.multari@pnnl.gov
Anoop Singhal
National Inst for Standards and
Technology, Rockville, MD, USA
anoop.singhal@nist.gov
Erin Miller
Pacific Northwest National Lab,
Richland, WA, USA
erin.miller@pnnl.gov
ABSTRACT
The  focus  of  this  workshop  is  the  application  of  scientific
practices  to  cyber  security  research.  The  objective  of  this
workshop is examine the implementation of science practices in
cyber  defense  research  and  understand  the  ramification  of
tradeoffs  between  simplifications  to  obtain interpretable  results
vs. observational studies of systems in the wild where the results
can  lead  to  ambiguous  interpretations.  The  research  papers
accepted  addressed  a  wide  variety of  technical  questions in  the
cyber domain and the maturity of the work spanned the range of
initial ideas and proofs of concept to mature work that is ready
for  operational  implementation.  Papers  were  evaluated  for  the
reproducibility of the work as represented by the documentation
of methods and testing environments.
CCS CONCEPTS
• General and reference~Experimentation   • Security and
privacy   • Networks~Network security • Networks~
Network experimentation   • Software and its
engineering~Software verification and validation
KEYWORDS
SafeConfig;  Testing;  Validation;  Security;  Resilience;  cyber;
testbeds;  metrics;
of
cybersecurity
experimentation;
cyber
science
1  INTRODUCTION
Recently, there has been a great deal of interest about the science
of  cybersecurity1,2,3,4.    In  order  to  be  considered  scientific,  the
processes  from  concept  through  testing  must  follow  a  series  of
steps to ensure ...


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

Input:
title:SafeConfig'17: Applying the Scientific Method to Active Cyber Defense
Research
author:Nicholas J. Multari and
Anoop Singhal and
Erin Miller
SafeConfig’17:  Applying the Scientific Method to Active Cyber
Defense Research
Nicholas J. Multari
Pacific Northwest National Lab,
Richland, WA, USA
nick.multari@pnnl.gov
Anoop Singhal
National Inst for Standards and
Technology, Rockville, MD, USA
anoop.singhal@nist.gov
Erin Miller
Pacific Northwest National Lab,
Richland, WA, USA
erin.miller@pnnl.gov
ABSTRACT
The  focus  of  this  workshop  is  the  application  of  scientific
practices  to  cyber  security  research.  The  objective  of  this
workshop is examine the implementation of science practices in
cyber  defense  research  and  understand  the  ramification  of
tradeoffs  between  simplifications  to  obtain interpretable  results
vs. observational studies of systems in the wild where the results
can  lead  to  ambiguous  interpretations.  The  research  papers
accepted  addressed  a  wide  variety of  technical  questions in  the
cyber domain and the maturity of the work spanned the range of
initial ideas and proofs of concept to mature work that is ready
for  operational  implementation.  Papers  were  evaluated  for  the
reproducibility of the work as represented by the documentation
of methods and testing environments.
CCS CONCEPTS
• General and reference~Experimentation   • Security and
privacy   • Networks~Network security • Networks~
Network experimentation   • Software and its
engineering~Software verification and validation
KEYWORDS
SafeConfig;  Testing;  Validation;  Security;  Resilience;  cyber;
testbeds;  metrics;
of
cybersecurity
experimentation;
cyber
science
1  INTRODUCTION
Recently, there has been a great deal of interest about the science
of  cybersecurity1,2,3,4.    In  order  to  be  considered  scientific,  the
processes  from  concept  through  testing  must  follow  a  series  of
steps to ensure ...

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


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

Output:
安全论文分析：

title:VScape: Assessing and Escaping Virtual Call Protections
author:Kaixiang Chen and
Chao Zhang and
Tingting Yin and
Xingman Chen and
Lei Zhao
VScape: Assessing and Escaping Virtual Call Protections
Kaixiang Chen, Institute for Network Science and Cyberspace, Tsinghua University;
Chao Zhang, Institute for Network Science and Cyberspace, Tsinghua University/
Beijing National Research Center for Information Science and Technology/
Tsinghua University-QI-ANXIN Group JCNS; Tingting Yin and Xingman Chen,
Institute for Network Science and Cyberspace, Tsinghua University; Lei Zhao,
School of Cyber Science and Engineering, Wuhan University
https://www.usenix.org/conference/usenixsecurity21/presentation/chen-kaixiang
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.VScape: Assessing and Escaping Virtual Call Protections
Kaixiang Chen1, Chao Zhang1;2;3(cid:12), Tingting Yin1, Xingman Chen1, Lei Zhao4
1Institute for Network Science and Cyberspace, Tsinghua University
2Beijing National Research Center for Information Science and Technology
3Tsinghua University-QI-ANXIN Group JCNS
4School of Cyber Science and Engineering, Wuhan University
{ckx18,ytt18,cxm16}@mails.tsinghua.edu.cn, chaoz@tsinghua.edu.cn, leizhao@whu.edu.cn
Abstract
Many control-ﬂow integrity (CFI) solutions have been pro-
posed to protect indirect control transfers (ICT), including
C++ virtual calls. Assessing the security guarantees of these
defenses is thus important but hard. In practice, for a (strong)
defense, it usually requires great manual efforts to assess
whether it could be bypassed, when given a speciﬁc (weak)
vulnerability. Existing automated exploit generation solu-
tions, which are proposed to assess the exploitability of vul-
nerabilities, have not addressed this issue yet.
In this paper, we point out that a wide range of virtual
call...


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

Input:
title:VScape: Assessing and Escaping Virtual Call Protections
author:Kaixiang Chen and
Chao Zhang and
Tingting Yin and
Xingman Chen and
Lei Zhao
VScape: Assessing and Escaping Virtual Call Protections
Kaixiang Chen, Institute for Network Science and Cyberspace, Tsinghua University;
Chao Zhang, Institute for Network Science and Cyberspace, Tsinghua University/
Beijing National Research Center for Information Science and Technology/
Tsinghua University-QI-ANXIN Group JCNS; Tingting Yin and Xingman Chen,
Institute for Network Science and Cyberspace, Tsinghua University; Lei Zhao,
School of Cyber Science and Engineering, Wuhan University
https://www.usenix.org/conference/usenixsecurity21/presentation/chen-kaixiang
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.VScape: Assessing and Escaping Virtual Call Protections
Kaixiang Chen1, Chao Zhang1;2;3(cid:12), Tingting Yin1, Xingman Chen1, Lei Zhao4
1Institute for Network Science and Cyberspace, Tsinghua University
2Beijing National Research Center for Information Science and Technology
3Tsinghua University-QI-ANXIN Group JCNS
4School of Cyber Science and Engineering, Wuhan University
{ckx18,ytt18,cxm16}@mails.tsinghua.edu.cn, chaoz@tsinghua.edu.cn, leizhao@whu.edu.cn
Abstract
Many control-ﬂow integrity (CFI) solutions have been pro-
posed to protect indirect control transfers (ICT), including
C++ virtual calls. Assessing the security guarantees of these
defenses is thus important but hard. In practice, for a (strong)
defense, it usually requires great manual efforts to assess
whether it could be bypassed, when given a speciﬁc (weak)
vulnerability. Existing automated exploit generation solu-
tions, which are proposed to assess the exploitability of vul-
nerabilities, have not addressed this issue yet.
In this paper, we point out that a wide range of virtual
call...

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


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

Output:
安全论文分析：

title:HLP: a next generation inter-domain routing protocol
author:Lakshminarayanan Subramanian and
Matthew Caesar and
Cheng Tien Ee and
Mark Handley and
Zhuoqing Morley Mao and
Scott Shenker and
Ion Stoica
HLP: A Next Generation Inter-domain Routing Protocol
Lakshminarayanan Subramanian∗ Matthew Caesar∗ Cheng Tien Ee∗ Mark Handley†
Morley Mao‡
Scott Shenker∗
Ion Stoica∗
ABSTRACT
It is well-known that BGP, the current inter-domain rout-
ing protocol, has many deﬁciencies. This paper describes a
hybrid link-state and path-vector protocol called HLP as an
alternative to BGP that has vastly better scalability, isolation
and convergence properties. Using current BGP routing in-
formation, we show that HLP, in comparison to BGP, can
reduce the churn-rate of route updates by a factor 400 as
well as isolate the eﬀect of routing events to a region 100
times smaller than that of BGP. For a majority of Internet
routes, HLP guarantees worst-case linear-time convergence.
We also describe a prototype implementation of HLP on top
of the XORP router platform. HLP is not intended to be a
ﬁnished and ﬁnal proposal for a replacement for BGP, but
is instead oﬀered as a starting point for debates about the
nature of the next-generation inter-domain routing protocol.
Categories and Subject Descriptors
C.2.6 [Communication Networks]: Internetworking
General Terms
Algorithms, Design, Experimentation, Performance.
Keywords
Inter-domain routing, BGP, scalability, convergence.
1.
INTRODUCTION
Inter-domain routing presents a formidable combination
of algorithmic and policy challenges. On the one hand, given
the size and the rapid growth of the Internet, any inter-
domain routing protocol should satisfy basic desirable algo-
rithmic properties, such as scalability, robustness, and rapid
convergence. On the other hand, for economic reasons inter-
domain routing should support policy routing, where ISPs
have the ﬂexibility to implement a wide variety of private
routing policies that ISPs choose n...


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

Input:
title:HLP: a next generation inter-domain routing protocol
author:Lakshminarayanan Subramanian and
Matthew Caesar and
Cheng Tien Ee and
Mark Handley and
Zhuoqing Morley Mao and
Scott Shenker and
Ion Stoica
HLP: A Next Generation Inter-domain Routing Protocol
Lakshminarayanan Subramanian∗ Matthew Caesar∗ Cheng Tien Ee∗ Mark Handley†
Morley Mao‡
Scott Shenker∗
Ion Stoica∗
ABSTRACT
It is well-known that BGP, the current inter-domain rout-
ing protocol, has many deﬁciencies. This paper describes a
hybrid link-state and path-vector protocol called HLP as an
alternative to BGP that has vastly better scalability, isolation
and convergence properties. Using current BGP routing in-
formation, we show that HLP, in comparison to BGP, can
reduce the churn-rate of route updates by a factor 400 as
well as isolate the eﬀect of routing events to a region 100
times smaller than that of BGP. For a majority of Internet
routes, HLP guarantees worst-case linear-time convergence.
We also describe a prototype implementation of HLP on top
of the XORP router platform. HLP is not intended to be a
ﬁnished and ﬁnal proposal for a replacement for BGP, but
is instead oﬀered as a starting point for debates about the
nature of the next-generation inter-domain routing protocol.
Categories and Subject Descriptors
C.2.6 [Communication Networks]: Internetworking
General Terms
Algorithms, Design, Experimentation, Performance.
Keywords
Inter-domain routing, BGP, scalability, convergence.
1.
INTRODUCTION
Inter-domain routing presents a formidable combination
of algorithmic and policy challenges. On the one hand, given
the size and the rapid growth of the Internet, any inter-
domain routing protocol should satisfy basic desirable algo-
rithmic properties, such as scalability, robustness, and rapid
convergence. On the other hand, for economic reasons inter-
domain routing should support policy routing, where ISPs
have the ﬂexibility to implement a wide variety of private
routing policies that ISPs choose n...

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


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

Output:
安全论文分析：

title:Chosen-ciphertext secure proxy re-encryption
author:Ran Canetti and
Susan Hohenberger
Chosen-Ciphertext Secure Proxy Re-Encryption
Ran Canetti∗
IBM T.J. Watson Research Center
Susan Hohenberger†
The Johns Hopkins University
ABSTRACT
In a proxy re-encryption (PRE) scheme, a proxy is given spe-
cial information that allows it to translate a ciphertext under
one key into a ciphertext of the same message under a diﬀer-
ent key. The proxy cannot, however, learn anything about
the messages encrypted under either key. PRE schemes
have many practical applications, including distributed stor-
age, email, and DRM. Previously proposed re-encryption
schemes achieved only semantic security; in contrast, ap-
plications often require security against chosen ciphertext
attacks. We propose a deﬁnition of security against chosen
ciphertext attacks for PRE schemes, and present a scheme
that satisﬁes the deﬁnition. Our construction is eﬃcient
and based only on the Decisional Bilinear Diﬃe-Hellman as-
sumption in the standard model. We also formally capture
CCA security for PRE schemes via both a game-based def-
inition and simulation-based deﬁnitions that guarantee uni-
versally composable security. We note that, simultaneously
with our work, Green and Ateniese proposed a CCA-secure
PRE, discussed herein.
Categories and Subject Descriptors: E.3 [Data En-
cryption]: Public Key Cryptosystems.
General Terms: Security, Algorithms, Theory.
Keywords: Encryption, Re-encryption, Chosen-Ciphertext
Security, Obfuscation.
1.
INTRODUCTION
Encryption is one of the most fundamental cryptographic
functions, and yet its practical adoption is often hampered
by key management problems. Suppose pk1 and pk 2 are
two independently chosen encryption keys. As pointed out
by Mambo and Okamoto [23], it is a common situation in
∗Supported by NSF grants CT-0430450 and CFF-0635297,
and a US-Israel Binational Science Foundation Grant.
†Research partially performed at IBM Zurich Research Lab-
oratory and supp...


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

Input:
title:Chosen-ciphertext secure proxy re-encryption
author:Ran Canetti and
Susan Hohenberger
Chosen-Ciphertext Secure Proxy Re-Encryption
Ran Canetti∗
IBM T.J. Watson Research Center
Susan Hohenberger†
The Johns Hopkins University
ABSTRACT
In a proxy re-encryption (PRE) scheme, a proxy is given spe-
cial information that allows it to translate a ciphertext under
one key into a ciphertext of the same message under a diﬀer-
ent key. The proxy cannot, however, learn anything about
the messages encrypted under either key. PRE schemes
have many practical applications, including distributed stor-
age, email, and DRM. Previously proposed re-encryption
schemes achieved only semantic security; in contrast, ap-
plications often require security against chosen ciphertext
attacks. We propose a deﬁnition of security against chosen
ciphertext attacks for PRE schemes, and present a scheme
that satisﬁes the deﬁnition. Our construction is eﬃcient
and based only on the Decisional Bilinear Diﬃe-Hellman as-
sumption in the standard model. We also formally capture
CCA security for PRE schemes via both a game-based def-
inition and simulation-based deﬁnitions that guarantee uni-
versally composable security. We note that, simultaneously
with our work, Green and Ateniese proposed a CCA-secure
PRE, discussed herein.
Categories and Subject Descriptors: E.3 [Data En-
cryption]: Public Key Cryptosystems.
General Terms: Security, Algorithms, Theory.
Keywords: Encryption, Re-encryption, Chosen-Ciphertext
Security, Obfuscation.
1.
INTRODUCTION
Encryption is one of the most fundamental cryptographic
functions, and yet its practical adoption is often hampered
by key management problems. Suppose pk1 and pk 2 are
two independently chosen encryption keys. As pointed out
by Mambo and Okamoto [23], it is a common situation in
∗Supported by NSF grants CT-0430450 and CFF-0635297,
and a US-Israel Binational Science Foundation Grant.
†Research partially performed at IBM Zurich Research Lab-
oratory and supp...

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


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

Output:
安全论文分析：

title:Tracing Transactions Across Cryptocurrency Ledgers
author:Haaroon Yousaf and
George Kappos and
Sarah Meiklejohn
Tracing Transactions Across Cryptocurrency Ledgers
Haaroon Yousaf, George Kappos, and Sarah Meiklejohn, University College London
https://www.usenix.org/conference/usenixsecurity19/presentation/yousaf
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.Tracing Transactions Across Cryptocurrency Ledgers
Haaroon Yousaf, George Kappos, and Sarah Meiklejohn
University College London
{h.yousaf,g.kappos,s.meiklejohn}@ucl.ac.uk
Abstract
One of the deﬁning features of a cryptocurrency is that its
ledger, containing all transactions that have ever taken place,
is globally visible. As one consequence of this degree of
transparency, a long line of recent research has demonstrated
that — even in cryptocurrencies that are speciﬁcally designed
to improve anonymity — it is often possible to track money
as it changes hands, and in some cases to de-anonymize users
entirely. With the recent proliferation of alternative cryptocur-
rencies, however, it becomes relevant to ask not only whether
or not money can be traced as it moves within the ledger
of a single cryptocurrency, but if it can in fact be traced as
it moves across ledgers. This is especially pertinent given
the rise in popularity of automated trading platforms such
as ShapeShift, which make it effortless to carry out such
cross-currency trades. In this paper, we use data scraped from
ShapeShift over a thirteen-month period and the data from
eight different blockchains to explore this question. Beyond
developing new heuristics and creating new types of links
across cryptocurrency ledgers, we also identify various pat-
terns of cross-currency trades and of the general usage of these
platforms, with the ultimate goal of understanding w...


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

Input:
title:Tracing Transactions Across Cryptocurrency Ledgers
author:Haaroon Yousaf and
George Kappos and
Sarah Meiklejohn
Tracing Transactions Across Cryptocurrency Ledgers
Haaroon Yousaf, George Kappos, and Sarah Meiklejohn, University College London
https://www.usenix.org/conference/usenixsecurity19/presentation/yousaf
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.Tracing Transactions Across Cryptocurrency Ledgers
Haaroon Yousaf, George Kappos, and Sarah Meiklejohn
University College London
{h.yousaf,g.kappos,s.meiklejohn}@ucl.ac.uk
Abstract
One of the deﬁning features of a cryptocurrency is that its
ledger, containing all transactions that have ever taken place,
is globally visible. As one consequence of this degree of
transparency, a long line of recent research has demonstrated
that — even in cryptocurrencies that are speciﬁcally designed
to improve anonymity — it is often possible to track money
as it changes hands, and in some cases to de-anonymize users
entirely. With the recent proliferation of alternative cryptocur-
rencies, however, it becomes relevant to ask not only whether
or not money can be traced as it moves within the ledger
of a single cryptocurrency, but if it can in fact be traced as
it moves across ledgers. This is especially pertinent given
the rise in popularity of automated trading platforms such
as ShapeShift, which make it effortless to carry out such
cross-currency trades. In this paper, we use data scraped from
ShapeShift over a thirteen-month period and the data from
eight different blockchains to explore this question. Beyond
developing new heuristics and creating new types of links
across cryptocurrency ledgers, we also identify various pat-
terns of cross-currency trades and of the general usage of these
platforms, with the ultimate goal of understanding w...

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


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

Output:
安全论文分析：

title:Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel
Hazards in SGX
author:Wenhao Wang and
Guoxing Chen and
Xiaorui Pan and
Yinqian Zhang and
XiaoFeng Wang and
Vincent Bindschaedler and
Haixu Tang and
Carl A. Gunter
Leaky Cauldron on the Dark Land: Understanding Memory
Side-Channel Hazards in SGX
Wenhao Wang1, Guoxing Chen3, Xiaorui Pan2, Yinqian Zhang3, XiaoFeng Wang2,
Vincent Bindschaedler4, Haixu Tang2, Carl A. Gunter4∗
1SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences & Indiana University Bloomington
2Indiana University Bloomington
3The Ohio State University
4University of Illinois at Urbana-Champaign
ABSTRACT
Side-channel risks of Intel SGX have recently attracted great atten-
tion. Under the spotlight is the newly discovered page-fault attack,
in which an OS-level adversary induces page faults to observe the
page-level access patterns of a protected process running in an SGX
enclave. With almost all proposed defense focusing on this attack,
little is known about whether such efforts indeed raise the bar for
the adversary, whether a simple variation of the attack renders
all protection ineffective, not to mention an in-depth understand-
ing of other attack surfaces in the SGX system. In the paper, we
report the first step toward systematic analyses of side-channel
threats that SGX faces, focusing on the risks associated with its
memory management. Our research identifies 8 potential attack
vectors, ranging from TLB to DRAM modules. More importantly, we
highlight the common misunderstandings about SGX memory side
channels, demonstrating that high frequent AEXs can be avoided
when recovering EdDSA secret key through a new page channel
and fine-grained monitoring of enclave programs (at the level of
64B) can be done through combining both cache and cross-enclave
DRAM channels. Our findings reveal the gap between the ongoing
security research on SGX and its side-channel weaknesses, rede-
fine the side-channel threat mode...


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

Input:
title:Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel
Hazards in SGX
author:Wenhao Wang and
Guoxing Chen and
Xiaorui Pan and
Yinqian Zhang and
XiaoFeng Wang and
Vincent Bindschaedler and
Haixu Tang and
Carl A. Gunter
Leaky Cauldron on the Dark Land: Understanding Memory
Side-Channel Hazards in SGX
Wenhao Wang1, Guoxing Chen3, Xiaorui Pan2, Yinqian Zhang3, XiaoFeng Wang2,
Vincent Bindschaedler4, Haixu Tang2, Carl A. Gunter4∗
1SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences & Indiana University Bloomington
2Indiana University Bloomington
3The Ohio State University
4University of Illinois at Urbana-Champaign
ABSTRACT
Side-channel risks of Intel SGX have recently attracted great atten-
tion. Under the spotlight is the newly discovered page-fault attack,
in which an OS-level adversary induces page faults to observe the
page-level access patterns of a protected process running in an SGX
enclave. With almost all proposed defense focusing on this attack,
little is known about whether such efforts indeed raise the bar for
the adversary, whether a simple variation of the attack renders
all protection ineffective, not to mention an in-depth understand-
ing of other attack surfaces in the SGX system. In the paper, we
report the first step toward systematic analyses of side-channel
threats that SGX faces, focusing on the risks associated with its
memory management. Our research identifies 8 potential attack
vectors, ranging from TLB to DRAM modules. More importantly, we
highlight the common misunderstandings about SGX memory side
channels, demonstrating that high frequent AEXs can be avoided
when recovering EdDSA secret key through a new page channel
and fine-grained monitoring of enclave programs (at the level of
64B) can be done through combining both cache and cross-enclave
DRAM channels. Our findings reveal the gap between the ongoing
security research on SGX and its side-channel weaknesses, rede-
fine the side-channel threat mode...

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


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

Output:
安全论文分析：

title:A Generic Approach to Automatic Deobfuscation of Executable Code
author:Babak Yadegari and
Brian Johannesmeyer and
Ben Whitely and
Saumya Debray
2015 IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy
A Generic Approach to Automatic Deobfuscation of Executable Code
Babak Yadegari
Brian Johannesmeyer
Benjamin Whitely
Saumya Debray
Department of Computer Science
The University of Arizona
{babaky, bjohannesmeyer, whitely, debray}@cs.arizona.edu
Tucson, AZ 85721
Abstract—Malicious software are usually obfuscated to avoid
detection and resist analysis. When new malware is encountered,
such obfuscations have to be penetrated or removed (“deobfus-
cated”) in order to understand the internal logic of the code
and devise countermeasures. This paper discusses a generic
approach for deobfuscation of obfuscated executable code. Our
approach does not make any assumptions about the nature of the
obfuscations used, but instead uses semantics-preserving program
transformations to simplify away obfuscation code. We have
applied a prototype implementation of our ideas to a variety
of different kinds of obfuscation,
including emulation-based
obfuscation, emulation-based obfuscation with runtime code
unpacking, and return-oriented programming. Our experimental
results are encouraging and suggest that this approach can be
effective in extracting the internal logic from code obfuscated
using a variety of obfuscation techniques, including tools such as
Themida that previous approaches could not handle.
Keywords-Deobfuscation; Virtualization-Obfuscation; Return
Oriented Programming
I. INTRODUCTION
Malicious software are usually deployed in heavily ob-
fuscated form, both to avoid detection and also to hinder
reverse engineering by security analysts. Much of the research
to date on automatic deobfuscation of code has focused on
obfuscation-speciﬁc approaches. While important and useful,
such approaches are of limited utility against obfuscations
that ar...


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

Input:
title:A Generic Approach to Automatic Deobfuscation of Executable Code
author:Babak Yadegari and
Brian Johannesmeyer and
Ben Whitely and
Saumya Debray
2015 IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy
A Generic Approach to Automatic Deobfuscation of Executable Code
Babak Yadegari
Brian Johannesmeyer
Benjamin Whitely
Saumya Debray
Department of Computer Science
The University of Arizona
{babaky, bjohannesmeyer, whitely, debray}@cs.arizona.edu
Tucson, AZ 85721
Abstract—Malicious software are usually obfuscated to avoid
detection and resist analysis. When new malware is encountered,
such obfuscations have to be penetrated or removed (“deobfus-
cated”) in order to understand the internal logic of the code
and devise countermeasures. This paper discusses a generic
approach for deobfuscation of obfuscated executable code. Our
approach does not make any assumptions about the nature of the
obfuscations used, but instead uses semantics-preserving program
transformations to simplify away obfuscation code. We have
applied a prototype implementation of our ideas to a variety
of different kinds of obfuscation,
including emulation-based
obfuscation, emulation-based obfuscation with runtime code
unpacking, and return-oriented programming. Our experimental
results are encouraging and suggest that this approach can be
effective in extracting the internal logic from code obfuscated
using a variety of obfuscation techniques, including tools such as
Themida that previous approaches could not handle.
Keywords-Deobfuscation; Virtualization-Obfuscation; Return
Oriented Programming
I. INTRODUCTION
Malicious software are usually deployed in heavily ob-
fuscated form, both to avoid detection and also to hinder
reverse engineering by security analysts. Much of the research
to date on automatic deobfuscation of code has focused on
obfuscation-speciﬁc approaches. While important and useful,
such approaches are of limited utility against obfuscations
that ar...

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


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

Output:
安全论文分析：

title:VulCAN: Efficient Component Authentication and Software Isolation
for Automotive Control Networks
author:Jo Van Bulck and
Jan Tobias M"uhlberg and
Frank Piessens
VulCAN: Efficient Component Authentication and Software
Isolation for Automotive Control Networks
Jo Van Bulck
imec-DistriNet, KU Leuven
jo.vanbulck@cs.kuleuven.be
Jan Tobias Mühlberg
imec-DistriNet, KU Leuven
jantobias.muehlberg@cs.kuleuven.be
Frank Piessens
imec-DistriNet, KU Leuven
frank.piessens@cs.kuleuven.be
ABSTRACT
Vehicular communication networks have been subject to a growing
number of attacks that put the safety of passengers at risk. This
resulted in millions of vehicles being recalled and lawsuits against
car manufacturers. While recent standardization efforts address
security, no practical solutions are implemented in current cars.
This paper presents VulCAN, a generic design for efficient ve-
hicle message authentication, plus software component attesta-
tion and isolation using lightweight trusted computing technology.
Specifically, we advance the state-of-the-art by not only protecting
against network attackers, but also against substantially stronger
adversaries capable of arbitrary code execution on participating
electronic control units. We demonstrate the feasibility and practi-
cality of VulCAN by implementing and evaluating two previously
proposed, industry standard-compliant message authentication pro-
tocols on top of Sancus, an open-source embedded protected mod-
ule architecture. Our results are promising, showing that strong,
hardware-enforced security guarantees can be met with a minimal
trusted computing base without violating real-time deadlines under
benign conditions.
CCS CONCEPTS
• Security and privacy → Embedded systems security; Dis-
tributed systems security; Key management; Security protocols;
Domain-specific security and privacy architectures;
KEYWORDS
Automotive security, CAN, Protected module, Trusted computing
ACM Reference Format:
Jo Van Bulck, Jan Tobia...


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

Input:
title:VulCAN: Efficient Component Authentication and Software Isolation
for Automotive Control Networks
author:Jo Van Bulck and
Jan Tobias M"uhlberg and
Frank Piessens
VulCAN: Efficient Component Authentication and Software
Isolation for Automotive Control Networks
Jo Van Bulck
imec-DistriNet, KU Leuven
jo.vanbulck@cs.kuleuven.be
Jan Tobias Mühlberg
imec-DistriNet, KU Leuven
jantobias.muehlberg@cs.kuleuven.be
Frank Piessens
imec-DistriNet, KU Leuven
frank.piessens@cs.kuleuven.be
ABSTRACT
Vehicular communication networks have been subject to a growing
number of attacks that put the safety of passengers at risk. This
resulted in millions of vehicles being recalled and lawsuits against
car manufacturers. While recent standardization efforts address
security, no practical solutions are implemented in current cars.
This paper presents VulCAN, a generic design for efficient ve-
hicle message authentication, plus software component attesta-
tion and isolation using lightweight trusted computing technology.
Specifically, we advance the state-of-the-art by not only protecting
against network attackers, but also against substantially stronger
adversaries capable of arbitrary code execution on participating
electronic control units. We demonstrate the feasibility and practi-
cality of VulCAN by implementing and evaluating two previously
proposed, industry standard-compliant message authentication pro-
tocols on top of Sancus, an open-source embedded protected mod-
ule architecture. Our results are promising, showing that strong,
hardware-enforced security guarantees can be met with a minimal
trusted computing base without violating real-time deadlines under
benign conditions.
CCS CONCEPTS
• Security and privacy → Embedded systems security; Dis-
tributed systems security; Key management; Security protocols;
Domain-specific security and privacy architectures;
KEYWORDS
Automotive security, CAN, Protected module, Trusted computing
ACM Reference Format:
Jo Van Bulck, Jan Tobia...

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


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

Output:
安全论文分析：

title:Scout: A Point of Presence Recommendation System Using Real User
Monitoring Data
author:Yang Yang and
Liang Zhang and
Ritesh Maheshwari and
Zaid Ali Kahn and
Deepak Agarwal and
Sanjay Dubey
Scout: A Point of Presence Recommendation
System Using Real User Monitoring Data
Yang Yang(B), Liang Zhang, Ritesh Maheshwari, Zaid Ali Kahn,
Deepak Agarwal, and Sanjay Dubey
LinkedIn, 2029 Stierlin Court, Mountain View, CA 94043, USA
{yyang,lizhang,rmaheshw,zali,dagarwal,sdubey}@linkedin.com
Abstract. This paper describes, Scout, a statistical modeling driven
approach to automatically recommend new Point of Presence (PoP) cen-
ters for web sites. PoPs help reduce a website’s page download time
dramatically. However, where to build the new PoP centers given the
current assets of existing ones is a problem that has rarely been studied
in a quantitative and principled way before; it was mainly done through
empirical studies or through applying industry experience and intuitions.
In this paper, we propose a novel approach that estimates the impact of
the PoP centers by building a statistical model using the real user mon-
itoring data collected by the web sites and recommend the next PoPs to
build. We also consider the problem of recommending PoPs using other
metrics such as user’s number of page views. We show empirically that
our approach works well, by experiments that use real data collected
from millions of user visits in a major social network site.
1 Introduction
Most websites serve dynamic content (e.g. HTML and JSON) from their data
centers and utilize Content Delivery Networks (CDN) for serving cacheable assets
such as Cascading Style Sheets (CSS), JavaScripts, images etc. Reducing the
download time of dynamic content is important to improve the experience of a
typical user visiting the site. One commonly adopted strategy by web companies
to accomplish this is to terminate user’s TCP connection closer to the user by
using Point of Presence centers (PoP).1
Point of Pr...


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

Input:
title:Scout: A Point of Presence Recommendation System Using Real User
Monitoring Data
author:Yang Yang and
Liang Zhang and
Ritesh Maheshwari and
Zaid Ali Kahn and
Deepak Agarwal and
Sanjay Dubey
Scout: A Point of Presence Recommendation
System Using Real User Monitoring Data
Yang Yang(B), Liang Zhang, Ritesh Maheshwari, Zaid Ali Kahn,
Deepak Agarwal, and Sanjay Dubey
LinkedIn, 2029 Stierlin Court, Mountain View, CA 94043, USA
{yyang,lizhang,rmaheshw,zali,dagarwal,sdubey}@linkedin.com
Abstract. This paper describes, Scout, a statistical modeling driven
approach to automatically recommend new Point of Presence (PoP) cen-
ters for web sites. PoPs help reduce a website’s page download time
dramatically. However, where to build the new PoP centers given the
current assets of existing ones is a problem that has rarely been studied
in a quantitative and principled way before; it was mainly done through
empirical studies or through applying industry experience and intuitions.
In this paper, we propose a novel approach that estimates the impact of
the PoP centers by building a statistical model using the real user mon-
itoring data collected by the web sites and recommend the next PoPs to
build. We also consider the problem of recommending PoPs using other
metrics such as user’s number of page views. We show empirically that
our approach works well, by experiments that use real data collected
from millions of user visits in a major social network site.
1 Introduction
Most websites serve dynamic content (e.g. HTML and JSON) from their data
centers and utilize Content Delivery Networks (CDN) for serving cacheable assets
such as Cascading Style Sheets (CSS), JavaScripts, images etc. Reducing the
download time of dynamic content is important to improve the experience of a
typical user visiting the site. One commonly adopted strategy by web companies
to accomplish this is to terminate user’s TCP connection closer to the user by
using Point of Presence centers (PoP).1
Point of Pr...

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


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

Output:
安全论文分析：

title:Your Cache Has Fallen: Cache-Poisoned Denial-of-Service Attack
author:Hoai Viet Nguyen and
Luigi Lo Iacono and
Hannes Federrath
Your Cache Has Fallen: Cache-Poisoned Denial-of-Service Attack
Hoai Viet Nguyen, Luigi Lo Iacono
Data & Application Security Group
Cologne University of Applied Sciences, Germany
{viet.nguyen,luigi.lo_iacono}@th-koeln.de
Hannes Federrath
Security in Distributed Systems Group
University of Hamburg, Germany
federrath@informatik.uni-hamburg.de
ABSTRACT
Web caching enables the reuse of HTTP responses with the aim
to reduce the number of requests that reach the origin server, the
volume of network traffic resulting from resource requests, and
the user-perceived latency of resource access. For these reasons,
a cache is a key component in modern distributed systems as it
enables applications to scale at large. In addition to optimizing
performance metrics, caches promote additional protection against
Denial of Service (DoS) attacks.
In this paper we introduce and analyze a new class of web cache
poisoning attacks. By provoking an error on the origin server that
is not detected by the intermediate caching system, the cache gets
poisoned with the server-generated error page and instrumented
to serve this useless content instead of the intended one, rendering
the victim service unavailable. In an extensive study of fifteen web
caching solutions we analyzed the negative impact of the Cache-
Poisoned DoS (CPDoS) attack—as we coined it. We show the practi-
cal relevance by identifying one proxy cache product and five CDN
services that are vulnerable to CPDoS. Amongst them are prominent
solutions that in turn cache high-value websites. The consequences
are severe as one simple request is sufficient to paralyze a victim
website within a large geographical region. The awareness of the
newly introduced CPDoS attack is highly valuable for researchers
for obtaining a comprehensive understanding of causes and coun-
termeasures as well as practitioners fo...


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

Input:
title:Your Cache Has Fallen: Cache-Poisoned Denial-of-Service Attack
author:Hoai Viet Nguyen and
Luigi Lo Iacono and
Hannes Federrath
Your Cache Has Fallen: Cache-Poisoned Denial-of-Service Attack
Hoai Viet Nguyen, Luigi Lo Iacono
Data & Application Security Group
Cologne University of Applied Sciences, Germany
{viet.nguyen,luigi.lo_iacono}@th-koeln.de
Hannes Federrath
Security in Distributed Systems Group
University of Hamburg, Germany
federrath@informatik.uni-hamburg.de
ABSTRACT
Web caching enables the reuse of HTTP responses with the aim
to reduce the number of requests that reach the origin server, the
volume of network traffic resulting from resource requests, and
the user-perceived latency of resource access. For these reasons,
a cache is a key component in modern distributed systems as it
enables applications to scale at large. In addition to optimizing
performance metrics, caches promote additional protection against
Denial of Service (DoS) attacks.
In this paper we introduce and analyze a new class of web cache
poisoning attacks. By provoking an error on the origin server that
is not detected by the intermediate caching system, the cache gets
poisoned with the server-generated error page and instrumented
to serve this useless content instead of the intended one, rendering
the victim service unavailable. In an extensive study of fifteen web
caching solutions we analyzed the negative impact of the Cache-
Poisoned DoS (CPDoS) attack—as we coined it. We show the practi-
cal relevance by identifying one proxy cache product and five CDN
services that are vulnerable to CPDoS. Amongst them are prominent
solutions that in turn cache high-value websites. The consequences
are severe as one simple request is sufficient to paralyze a victim
website within a large geographical region. The awareness of the
newly introduced CPDoS attack is highly valuable for researchers
for obtaining a comprehensive understanding of causes and coun-
termeasures as well as practitioners fo...

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