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

Output:
安全论文分析：

title:"Roto-Rooting" your router: solution against new potential DoS attacks
on modern routers
author:Danai Chasaki
“Roto-Rooting” your Router:
Solution against New Potential DoS Attacks on Modern Routers
Department of Electrical and Computer Engineering
University of Massachusetts, Amherst, MA, USA
Danai Chasaki
{dchasaki}@ecs.umass.edu
ABSTRACT
Our work presents the ﬁrst practical example of an entirely
new class of network attacks – attacks that target the net-
work infrastructure. Modern routers use general purpose
programmable processors, and the software used for packet
processing on these systems is potentially vulnerable to re-
mote exploits. We describe a speciﬁc attack that can launch
a devastating denial-of-service attack by sending just a sin-
gle packet. We also show that there are eﬀective defense
techniques, based on processor monitoring, that can help in
detecting and avoiding such attacks.
Categories and Subject Descriptors
C.2.6 [Computer-Communication Networks]: Internet-
working—Routers; C.2.0 [Computer-Communication Net-
works]: General—Security and protection
General Terms
Design, Performance, Security
1.
INTRODUCTION
Modern routers are becoming vulnerable to new attacks
because of the technology shift towards programmable in-
frastructure [3]. Most service provider core routers contain
programmable multi-core architectures, e.g. Cisco Carrier
Routing Systems (CRS-1, CRS-3) and Juniper’s T series.
These routers are equipped with functionality beyond sim-
ple packet forwarding, ranging from load balancing to appli-
cation security, access control, e.g. F5’s BIG-IP products,
where these services are available on a single device. While
a lot of attention has been given to end system security,
very little work has addressed security concerns in the net-
work infrastructure itself. In our work, we consider the data
plane of the network where modern routers are now exposed
to vulnerabilities like any other software-based system.
We have shown that a ...


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

Input:
title:"Roto-Rooting" your router: solution against new potential DoS attacks
on modern routers
author:Danai Chasaki
“Roto-Rooting” your Router:
Solution against New Potential DoS Attacks on Modern Routers
Department of Electrical and Computer Engineering
University of Massachusetts, Amherst, MA, USA
Danai Chasaki
{dchasaki}@ecs.umass.edu
ABSTRACT
Our work presents the ﬁrst practical example of an entirely
new class of network attacks – attacks that target the net-
work infrastructure. Modern routers use general purpose
programmable processors, and the software used for packet
processing on these systems is potentially vulnerable to re-
mote exploits. We describe a speciﬁc attack that can launch
a devastating denial-of-service attack by sending just a sin-
gle packet. We also show that there are eﬀective defense
techniques, based on processor monitoring, that can help in
detecting and avoiding such attacks.
Categories and Subject Descriptors
C.2.6 [Computer-Communication Networks]: Internet-
working—Routers; C.2.0 [Computer-Communication Net-
works]: General—Security and protection
General Terms
Design, Performance, Security
1.
INTRODUCTION
Modern routers are becoming vulnerable to new attacks
because of the technology shift towards programmable in-
frastructure [3]. Most service provider core routers contain
programmable multi-core architectures, e.g. Cisco Carrier
Routing Systems (CRS-1, CRS-3) and Juniper’s T series.
These routers are equipped with functionality beyond sim-
ple packet forwarding, ranging from load balancing to appli-
cation security, access control, e.g. F5’s BIG-IP products,
where these services are available on a single device. While
a lot of attention has been given to end system security,
very little work has addressed security concerns in the net-
work infrastructure itself. In our work, we consider the data
plane of the network where modern routers are now exposed
to vulnerabilities like any other software-based system.
We have shown that a ...

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


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

Output:
安全论文分析：

title:An integrated approach to detection of fast and slow scanning worms
author:Frank Akujobi and
Ioannis Lambadaris and
Evangelos Kranakis
An Integrated Approach to Detection of Fast and Slow
Scanning Worms
Frank Akujobi
Department of Systems and
Computer Engineering
Carleton University
1125 Colonel By Dr., Ottawa,
fakujobi@sce.carleton.ca
ON K1S 5B6, Canada
Ioannis Lambadaris
Department of Systems and
Computer Engineering
Carleton University
1125 Colonel By Dr., Ottawa,
ioannis@sce.carleton.ca
ON K1S 5B6, Canada
Evangelos Kranakis
Department of Computer
Science
Carleton University
1125 Colonel By Dr., Ottawa,
kranakis@scs.carleton.ca
ON K1S 5B6, Canada
ABSTRACT

 !"
#$%
&'
()*
+,#
 -/.

 0	1
2-3
&4%
 35&'
()	/6037!0+%89
 --3::;
/0
<::%:
*='>.	3%
--?./@%8A7/06
	3()BCD
 	:E
:%:
F
 D
#G%
 C&'
()1D
-H
IJ%:-
&K%

&'
()@$
ML!%NLJ
	=NOPQ	8
%:%@*:R/:#ST	:E
L-
5
 )!:8
 C

%8N
G::%:U
)%:-A

&'
()=HOP53H
:@&6

;
 95
9
 -?.B:6
1037!0/:E
 8
 R:%J3
)

%8R%
 9
U-6
VJ%:1
95A	/?W.!E
G8
X)%ZY
&S["8\>
U-+W
6(R0-?8
:
0>"
 #;
]-
&
%
1(]
 -3%:3
02&'
(^
 8
 %J_!=26

%8R0,
+%
(NE
U9

`
L!A	%:aW
(b#U0	c
#EdU9
 `

(]
-?.
	:%:
 @5
`-?WEP

	3e
 f9-:M
 9hg'
.3
iW:%
A
(jJk&
 _l0	3#%
I:%JS3/03
T
 %:L	?P.F	0R
U
 m"...


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

Input:
title:An integrated approach to detection of fast and slow scanning worms
author:Frank Akujobi and
Ioannis Lambadaris and
Evangelos Kranakis
An Integrated Approach to Detection of Fast and Slow
Scanning Worms
Frank Akujobi
Department of Systems and
Computer Engineering
Carleton University
1125 Colonel By Dr., Ottawa,
fakujobi@sce.carleton.ca
ON K1S 5B6, Canada
Ioannis Lambadaris
Department of Systems and
Computer Engineering
Carleton University
1125 Colonel By Dr., Ottawa,
ioannis@sce.carleton.ca
ON K1S 5B6, Canada
Evangelos Kranakis
Department of Computer
Science
Carleton University
1125 Colonel By Dr., Ottawa,
kranakis@scs.carleton.ca
ON K1S 5B6, Canada
ABSTRACT

 !"
#$%
&'
()*
+,#
 -/.

 0	1
2-3
&4%
 35&'
()	/6037!0+%89
 --3::;
/0
<::%:
*='>.	3%
--?./@%8A7/06
	3()BCD
 	:E
:%:
F
 D
#G%
 C&'
()1D
-H
IJ%:-
&K%

&'
()@$
ML!%NLJ
	=NOPQ	8
%:%@*:R/:#ST	:E
L-
5
 )!:8
 C

%8N
G::%:U
)%:-A

&'
()=HOP53H
:@&6

;
 95
9
 -?.B:6
1037!0/:E
 8
 R:%J3
)

%8R%
 9
U-6
VJ%:1
95A	/?W.!E
G8
X)%ZY
&S["8\>
U-+W
6(R0-?8
:
0>"
 #;
]-
&
%
1(]
 -3%:3
02&'
(^
 8
 %J_!=26

%8R0,
+%
(NE
U9

`
L!A	%:aW
(b#U0	c
#EdU9
 `

(]
-?.
	:%:
 @5
`-?WEP

	3e
 f9-:M
 9hg'
.3
iW:%
A
(jJk&
 _l0	3#%
I:%JS3/03
T
 %:L	?P.F	0R
U
 m"...

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


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

Output:
安全论文分析：

title:Sub-Nanosecond Time of Flight on Commercial Wi-Fi Cards
author:Deepak Vasisht and
Swarun Kumar and
Dina Katabi
121122


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

Input:
title:Sub-Nanosecond Time of Flight on Commercial Wi-Fi Cards
author:Deepak Vasisht and
Swarun Kumar and
Dina Katabi
121122

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


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

Output:
安全论文分析：

title:Practical Comprehensive Bounds on Surreptitious Communication over
DNS
author:Vern Paxson and
Mihai Christodorescu and
Mobin Javed and
Josyula R. Rao and
Reiner Sailer and
Douglas Lee Schales and
Marc Ph. Stoecklin and
Kurt Thomas and
Wietse Z. Venema and
Nicholas Weaver
Practical Comprehensive Bounds
on Surreptitious Communication Over DNS
Vern Paxson, University of California, Berkeley, and International Computer Science Institute;
Mihai Christodorescu, Qualcomm Research; Mobin Javed, University of California, Berkeley;
Josyula Rao, Reiner Sailer, Douglas Lee Schales, and Marc Ph. Stoecklin, IBM Research;
Kurt Thomas, University of California, Berkeley; Wietse Venema, IBM Research;
Nicholas Weaver, International Computer Science Institute
and University of California, San Diego
Open access to the Proceedings of the 22nd USENIX Security Symposium is sponsored by USENIXThis paper is included in the Proceedings of the 22nd USENIX Security Symposium.August 14–16, 2013 • Washington, D.C., USAISBN 978-1-931971-03-4Practical Comprehensive Bounds on Surreptitious
Communication Over DNS
Vern Paxson(cid:31)∗ Mihai Christodorescu† Mobin Javed(cid:31) Josyula Rao‡ Reiner Sailer‡
Douglas Schales‡ Marc Ph. Stoecklin‡ Kurt Thomas(cid:31) Wietse Venema‡ Nicholas Weaver∗§
(cid:31)UC Berkeley
∗ICSI
†Qualcomm Research ‡IBM Research §UC San Diego
Abstract
DNS queries represent one of the most common forms of net-
work trafﬁc, and likely the least blocked by sites. As such, DNS
provides a highly attractive channel for attackers who wish to
communicate surreptitiously across a network perimeter, and
indeed a variety of tunneling toolkits exist [7, 10, 13–15]. We
develop a novel measurement procedure that fundamentally
limits the amount of information that a domain can receive sur-
reptitiously through DNS queries to an upper bound speciﬁed
by a site’s security policy, with the exact setting representing
a tradeoff between the scope of potential leakage versus the
quant...


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

Input:
title:Practical Comprehensive Bounds on Surreptitious Communication over
DNS
author:Vern Paxson and
Mihai Christodorescu and
Mobin Javed and
Josyula R. Rao and
Reiner Sailer and
Douglas Lee Schales and
Marc Ph. Stoecklin and
Kurt Thomas and
Wietse Z. Venema and
Nicholas Weaver
Practical Comprehensive Bounds
on Surreptitious Communication Over DNS
Vern Paxson, University of California, Berkeley, and International Computer Science Institute;
Mihai Christodorescu, Qualcomm Research; Mobin Javed, University of California, Berkeley;
Josyula Rao, Reiner Sailer, Douglas Lee Schales, and Marc Ph. Stoecklin, IBM Research;
Kurt Thomas, University of California, Berkeley; Wietse Venema, IBM Research;
Nicholas Weaver, International Computer Science Institute
and University of California, San Diego
Open access to the Proceedings of the 22nd USENIX Security Symposium is sponsored by USENIXThis paper is included in the Proceedings of the 22nd USENIX Security Symposium.August 14–16, 2013 • Washington, D.C., USAISBN 978-1-931971-03-4Practical Comprehensive Bounds on Surreptitious
Communication Over DNS
Vern Paxson(cid:31)∗ Mihai Christodorescu† Mobin Javed(cid:31) Josyula Rao‡ Reiner Sailer‡
Douglas Schales‡ Marc Ph. Stoecklin‡ Kurt Thomas(cid:31) Wietse Venema‡ Nicholas Weaver∗§
(cid:31)UC Berkeley
∗ICSI
†Qualcomm Research ‡IBM Research §UC San Diego
Abstract
DNS queries represent one of the most common forms of net-
work trafﬁc, and likely the least blocked by sites. As such, DNS
provides a highly attractive channel for attackers who wish to
communicate surreptitiously across a network perimeter, and
indeed a variety of tunneling toolkits exist [7, 10, 13–15]. We
develop a novel measurement procedure that fundamentally
limits the amount of information that a domain can receive sur-
reptitiously through DNS queries to an upper bound speciﬁed
by a site’s security policy, with the exact setting representing
a tradeoff between the scope of potential leakage versus the
quant...

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


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

Output:
安全论文分析：

title:Optimal Combination of Sampled Network Measurements
author:Nick G. Duffield and
Carsten Lund and
Mikkel Thorup
Optimal Combination of Sampled Network Measurements
AT&T Labs–Research, 180 Park Avenue, Florham Park, New Jersey, 07932, USA
Nick Dufﬁeld
Mikkel Thorup
{duffield,lund,mthorup}research.att.com
Carsten Lund
Abstract
IP network trafﬁc is commonly measured at multiple points
in order that all trafﬁc passes at least one observation point.
The resulting measurements are subsequently joined for
network analysis.
Many network management applications use measured
trafﬁc rates (differentiated into classes according to some
key) as their input data. But two factors complicate the
analysis. Trafﬁc can be represented multiple times in the
data, and the increasing use of sampling during measure-
ment means some classes of trafﬁc may be poorly repre-
sented.
In this paper, we show how to combine sampled trafﬁc
measurements in way that addresses both of the above is-
sues. We construct trafﬁc rate estimators that combine data
from different measurement datasets with minimal or close
to minimal variance. This is achieved by robust adaptation
to the estimated variance of each constituent. We motivate
the method with two applications: estimating the interface-
level trafﬁc matrix in a router, and estimating network-level
ﬂow rates from measurements taken at multiple routers.
1
Introduction
1.1 Background
The increasing speed of network links makes it infeasible to
collect complete data on all packets or network ﬂows. This
is due to the costs and scale of the resources that would
be required to accommodate the data in the measurement
infrastructure. These resources are (i) processing cycles at
the observation point (OP) which are typically scarce in a
router; (ii) transmission bandwidth to a collector; and (iii)
storage capacity and processing cycles for querying and
analysis at the collector.
These constraints motivate reduction of
the data.
Of three classical methods—...


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

Input:
title:Optimal Combination of Sampled Network Measurements
author:Nick G. Duffield and
Carsten Lund and
Mikkel Thorup
Optimal Combination of Sampled Network Measurements
AT&T Labs–Research, 180 Park Avenue, Florham Park, New Jersey, 07932, USA
Nick Dufﬁeld
Mikkel Thorup
{duffield,lund,mthorup}research.att.com
Carsten Lund
Abstract
IP network trafﬁc is commonly measured at multiple points
in order that all trafﬁc passes at least one observation point.
The resulting measurements are subsequently joined for
network analysis.
Many network management applications use measured
trafﬁc rates (differentiated into classes according to some
key) as their input data. But two factors complicate the
analysis. Trafﬁc can be represented multiple times in the
data, and the increasing use of sampling during measure-
ment means some classes of trafﬁc may be poorly repre-
sented.
In this paper, we show how to combine sampled trafﬁc
measurements in way that addresses both of the above is-
sues. We construct trafﬁc rate estimators that combine data
from different measurement datasets with minimal or close
to minimal variance. This is achieved by robust adaptation
to the estimated variance of each constituent. We motivate
the method with two applications: estimating the interface-
level trafﬁc matrix in a router, and estimating network-level
ﬂow rates from measurements taken at multiple routers.
1
Introduction
1.1 Background
The increasing speed of network links makes it infeasible to
collect complete data on all packets or network ﬂows. This
is due to the costs and scale of the resources that would
be required to accommodate the data in the measurement
infrastructure. These resources are (i) processing cycles at
the observation point (OP) which are typically scarce in a
router; (ii) transmission bandwidth to a collector; and (iii)
storage capacity and processing cycles for querying and
analysis at the collector.
These constraints motivate reduction of
the data.
Of three classical methods—...

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


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


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

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


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

Output:
安全论文分析：

title:Virtual Secure Platform: A Five-Stage Pipeline Processor over TFHE
author:Kotaro Matsuoka and
Ryotaro Banno and
Naoki Matsumoto and
Takashi Sato and
Song Bian
Virtual Secure Platform:
A Five-Stage Pipeline Processor over TFHE
Kotaro Matsuoka, Ryotaro Banno, Naoki Matsumoto,
Takashi Sato, and Song Bian, Kyoto University
https://www.usenix.org/conference/usenixsecurity21/presentation/matsuoka
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.Virtual Secure Platform: A Five-Stage Pipeline Processor over TFHE
Kotaro Matsuoka∗, Ryotaro Banno†, Naoki Matsumoto†, Takashi Sato‡, Song Bian‡
∗Undergraduate School of Electrical and Electronic Engineering, Kyoto University,
†Undergraduate School of Informatics and Mathematical Science, Kyoto University,
‡Department of Communications and Computer Engineering, Kyoto University
∗matsuoka.kotaro@gmail.com, †{ryotaro.banno, m.naoki9911}@gmail.com,
‡{takashi, sbian}@easter.kyoto-u.ac.jp
Abstract
We present Virtual Secure Platform (VSP), the ﬁrst com-
prehensive platform that implements a multi-opcode general-
purpose sequential processor over Fully Homomorphic En-
cryption (FHE) for Secure Multi-Party Computation (SMPC).
VSP protects both the data and functions on which the data
are evaluated from the adversary in a secure computation of-
ﬂoading situation like cloud computing. We proposed a com-
plete processor architecture with a ﬁve-stage pipeline, which
improves the performance of the VSP by providing more par-
allelism in circuit evaluation. In addition, we also designed a
custom Instruction Set Architecture (ISA) to reduce the gate
count of our processor, along with an entire set of toolchains
to ensure that arbitrary C programs can be compiled into our
custom ISA. In order to speed up instruction evaluation over
VSP, CMUX Memory based ROM and RAM constructions
ove...


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

Input:
title:Virtual Secure Platform: A Five-Stage Pipeline Processor over TFHE
author:Kotaro Matsuoka and
Ryotaro Banno and
Naoki Matsumoto and
Takashi Sato and
Song Bian
Virtual Secure Platform:
A Five-Stage Pipeline Processor over TFHE
Kotaro Matsuoka, Ryotaro Banno, Naoki Matsumoto,
Takashi Sato, and Song Bian, Kyoto University
https://www.usenix.org/conference/usenixsecurity21/presentation/matsuoka
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.Virtual Secure Platform: A Five-Stage Pipeline Processor over TFHE
Kotaro Matsuoka∗, Ryotaro Banno†, Naoki Matsumoto†, Takashi Sato‡, Song Bian‡
∗Undergraduate School of Electrical and Electronic Engineering, Kyoto University,
†Undergraduate School of Informatics and Mathematical Science, Kyoto University,
‡Department of Communications and Computer Engineering, Kyoto University
∗matsuoka.kotaro@gmail.com, †{ryotaro.banno, m.naoki9911}@gmail.com,
‡{takashi, sbian}@easter.kyoto-u.ac.jp
Abstract
We present Virtual Secure Platform (VSP), the ﬁrst com-
prehensive platform that implements a multi-opcode general-
purpose sequential processor over Fully Homomorphic En-
cryption (FHE) for Secure Multi-Party Computation (SMPC).
VSP protects both the data and functions on which the data
are evaluated from the adversary in a secure computation of-
ﬂoading situation like cloud computing. We proposed a com-
plete processor architecture with a ﬁve-stage pipeline, which
improves the performance of the VSP by providing more par-
allelism in circuit evaluation. In addition, we also designed a
custom Instruction Set Architecture (ISA) to reduce the gate
count of our processor, along with an entire set of toolchains
to ensure that arbitrary C programs can be compiled into our
custom ISA. In order to speed up instruction evaluation over
VSP, CMUX Memory based ROM and RAM constructions
ove...

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


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

Output:
安全论文分析：

title:Shield: vulnerability-driven network filters for preventing known
vulnerability exploits
author:Helen J. Wang and
Chuanxiong Guo and
Daniel R. Simon and
Alf Zugenmaier
Shield: Vulnerability-Driven Network Filters for Preventing
Known Vulnerability Exploits
Helen J. Wang, Chuanxiong Guo, Daniel R. Simon, and Alf Zugenmaier
{helenw, t-chuguo, dansimon, alfz}@microsoft.com
Microsoft Research
ABSTRACT
Software patching has not been eﬀective as a ﬁrst-line de-
fense against large-scale worm attacks, even when patches
have long been available for their corresponding vulnerabil-
ities. Generally, people have been reluctant to patch their
systems immediately, because patches are perceived to be
unreliable and disruptive to apply. To address this prob-
lem, we propose a ﬁrst-line worm defense in the network
stack, using shields — vulnerability-speciﬁc, exploit-generic
network ﬁlters installed in end systems once a vulnerability
is discovered, but before a patch is applied. These ﬁlters
examine the incoming or outgoing traﬃc of vulnerable ap-
plications, and correct traﬃc that exploits vulnerabilities.
Shields are less disruptive to install and uninstall, easier to
test for bad side eﬀects, and hence more reliable than tra-
ditional software patches. Further, shields are resilient to
polymorphic or metamorphic variations of exploits [43].
In this paper, we show that this concept is feasible by de-
scribing a prototype Shield framework implementation that
ﬁlters traﬃc above the transport layer. We have designed
a safe and restrictive language to describe vulnerabilities as
partial state machines of the vulnerable application. The ex-
pressiveness of the language has been veriﬁed by encoding
the signatures of several known vulnerabilites. Our eval-
uation provides evidence of Shield’s low false positive rate
and small impact on application throughput. An examina-
tion of a sample set of known vulnerabilities suggests that
Shield could be used to prevent exploitation of a ...


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

Input:
title:Shield: vulnerability-driven network filters for preventing known
vulnerability exploits
author:Helen J. Wang and
Chuanxiong Guo and
Daniel R. Simon and
Alf Zugenmaier
Shield: Vulnerability-Driven Network Filters for Preventing
Known Vulnerability Exploits
Helen J. Wang, Chuanxiong Guo, Daniel R. Simon, and Alf Zugenmaier
{helenw, t-chuguo, dansimon, alfz}@microsoft.com
Microsoft Research
ABSTRACT
Software patching has not been eﬀective as a ﬁrst-line de-
fense against large-scale worm attacks, even when patches
have long been available for their corresponding vulnerabil-
ities. Generally, people have been reluctant to patch their
systems immediately, because patches are perceived to be
unreliable and disruptive to apply. To address this prob-
lem, we propose a ﬁrst-line worm defense in the network
stack, using shields — vulnerability-speciﬁc, exploit-generic
network ﬁlters installed in end systems once a vulnerability
is discovered, but before a patch is applied. These ﬁlters
examine the incoming or outgoing traﬃc of vulnerable ap-
plications, and correct traﬃc that exploits vulnerabilities.
Shields are less disruptive to install and uninstall, easier to
test for bad side eﬀects, and hence more reliable than tra-
ditional software patches. Further, shields are resilient to
polymorphic or metamorphic variations of exploits [43].
In this paper, we show that this concept is feasible by de-
scribing a prototype Shield framework implementation that
ﬁlters traﬃc above the transport layer. We have designed
a safe and restrictive language to describe vulnerabilities as
partial state machines of the vulnerable application. The ex-
pressiveness of the language has been veriﬁed by encoding
the signatures of several known vulnerabilites. Our eval-
uation provides evidence of Shield’s low false positive rate
and small impact on application throughput. An examina-
tion of a sample set of known vulnerabilities suggests that
Shield could be used to prevent exploitation of a ...

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


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

Output:
安全论文分析：

title:ScaRR: Scalable Runtime Remote Attestation for Complex Systems
author:Flavio Toffalini and
Eleonora Losiouk and
Andrea Biondo and
Jianying Zhou and
Mauro Conti
Scalable Runtime Remote Attestation for Complex Systems
ScaRR:
Flavio Toffalini
SUTD
Eleonora Losiouk
University of Padua
Andrea Biondo
University of Padua
Jianying Zhou
SUTD
Mauro Conti
University of Padua
ﬂavio_toffalini@mymail.sutd.edu.sg, jianying_zhou@sutd.edu.sg
elosiouk@math.unipd.it, andrea.biondo.1@studenti.unipd.it, conti@math.unipd.it
Abstract
The introduction of remote attestation (RA) schemes has al-
lowed academia and industry to enhance the security of their
systems. The commercial products currently available enable
only the validation of static properties, such as applications ﬁn-
gerprint, and do not handle runtime properties, such as control-
ﬂow correctness. This limitation pushed researchers towards
the identiﬁcation of new approaches, called runtime RA. How-
ever, those mainly work on embedded devices, which share
very few common features with complex systems, such as
virtual machines in a cloud. A naive deployment of runtime
RA schemes for embedded devices on complex systems faces
scalability problems, such as the representation of complex
control-ﬂows or slow veriﬁcation phase.
In this work, we present ScaRR: the ﬁrst Scalable Runtime
Remote attestation schema for complex systems. Thanks to
its novel control-ﬂow model, ScaRR enables the deployment
of runtime RA on any application regardless of its complexity,
by also achieving good performance. We implemented ScaRR
and tested it on the benchmark suite SPEC CPU 2017. We
show that ScaRR can validate on average 2M control-ﬂow
events per second, deﬁnitely outperforming existing solutions
that support runtime RA on complex systems.
1
Introduction
RA is a procedure that allows an entity (i.e., the Veriﬁer) to
verify the status of a device (i.e., the Prover) from a remote
location. This is achieved by having ﬁrst the Veriﬁer sending
a c...


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

Input:
title:ScaRR: Scalable Runtime Remote Attestation for Complex Systems
author:Flavio Toffalini and
Eleonora Losiouk and
Andrea Biondo and
Jianying Zhou and
Mauro Conti
Scalable Runtime Remote Attestation for Complex Systems
ScaRR:
Flavio Toffalini
SUTD
Eleonora Losiouk
University of Padua
Andrea Biondo
University of Padua
Jianying Zhou
SUTD
Mauro Conti
University of Padua
ﬂavio_toffalini@mymail.sutd.edu.sg, jianying_zhou@sutd.edu.sg
elosiouk@math.unipd.it, andrea.biondo.1@studenti.unipd.it, conti@math.unipd.it
Abstract
The introduction of remote attestation (RA) schemes has al-
lowed academia and industry to enhance the security of their
systems. The commercial products currently available enable
only the validation of static properties, such as applications ﬁn-
gerprint, and do not handle runtime properties, such as control-
ﬂow correctness. This limitation pushed researchers towards
the identiﬁcation of new approaches, called runtime RA. How-
ever, those mainly work on embedded devices, which share
very few common features with complex systems, such as
virtual machines in a cloud. A naive deployment of runtime
RA schemes for embedded devices on complex systems faces
scalability problems, such as the representation of complex
control-ﬂows or slow veriﬁcation phase.
In this work, we present ScaRR: the ﬁrst Scalable Runtime
Remote attestation schema for complex systems. Thanks to
its novel control-ﬂow model, ScaRR enables the deployment
of runtime RA on any application regardless of its complexity,
by also achieving good performance. We implemented ScaRR
and tested it on the benchmark suite SPEC CPU 2017. We
show that ScaRR can validate on average 2M control-ﬂow
events per second, deﬁnitely outperforming existing solutions
that support runtime RA on complex systems.
1
Introduction
RA is a procedure that allows an entity (i.e., the Veriﬁer) to
verify the status of a device (i.e., the Prover) from a remote
location. This is achieved by having ﬁrst the Veriﬁer sending
a c...

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


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

Output:
安全论文分析：

title:Incentivizing censorship measurements via circumvention
author:Aqib Nisar and
Aqsa Kashaf and
Ihsan Ayyub Qazi and
Zartash Afzal Uzmi
Incentivizing Censorship Measurements via
Circumvention
Aqib Nisar, Aqsa Kashaf, Ihsan Ayyub Qazi, Zartash Afzal Uzmi∗
LUMS, Pakistan
ABSTRACT
We present C-Saw, a system that measures Internet censor-
ship by offering data-driven censorship circumvention to
users. The adaptive circumvention capability of C-Saw in-
centivizes users to opt-in by offering small page load times
(PLTs). As users crowdsource, the measurement data gets
richer, offering greater insights into censorship mechanisms
over a wider region, and in turn leading to even better cir-
cumvention capabilities. C-Saw incorporates user consent in
its design by measuring only those URLs that a user actually
visits. Using a cross-platform implementation of C-Saw, we
show that it is effective at collecting and disseminating cen-
sorship measurements, selecting circumvention approaches,
and optimizing user experience. C-Saw improves the average
PLT by up to 48% and 63% over Lantern and Tor, respectively.
We demonstrate the feasibility of a large-scale deployment
of C-Saw with a pilot study.
CCS CONCEPTS
• Social and professional topics → Censorship; Network
access control; • Security and privacy → Human and soci-
etal aspects of security and privacy; • Networks → Network
measurement;
ACM Reference Format:
Aqib Nisar, Aqsa Kashaf, Ihsan Ayyub Qazi, Zartash Afzal Uzmi.
2018. Incentivizing Censorship Measurements via Circumvention.
In SIGCOMM ’18: SIGCOMM 2018, August 20–25, 2018, Budapest,
Hungary. ACM, New York, NY, USA, 14 pages. https://doi.org/10.
1145/3230543.3230568
∗Aqsa Kashaf is currently with CMU and Aqib Nisar with USC.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies
are not made or distributed for profit or commercial advantage and that
copies bear this notice and the...


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

Input:
title:Incentivizing censorship measurements via circumvention
author:Aqib Nisar and
Aqsa Kashaf and
Ihsan Ayyub Qazi and
Zartash Afzal Uzmi
Incentivizing Censorship Measurements via
Circumvention
Aqib Nisar, Aqsa Kashaf, Ihsan Ayyub Qazi, Zartash Afzal Uzmi∗
LUMS, Pakistan
ABSTRACT
We present C-Saw, a system that measures Internet censor-
ship by offering data-driven censorship circumvention to
users. The adaptive circumvention capability of C-Saw in-
centivizes users to opt-in by offering small page load times
(PLTs). As users crowdsource, the measurement data gets
richer, offering greater insights into censorship mechanisms
over a wider region, and in turn leading to even better cir-
cumvention capabilities. C-Saw incorporates user consent in
its design by measuring only those URLs that a user actually
visits. Using a cross-platform implementation of C-Saw, we
show that it is effective at collecting and disseminating cen-
sorship measurements, selecting circumvention approaches,
and optimizing user experience. C-Saw improves the average
PLT by up to 48% and 63% over Lantern and Tor, respectively.
We demonstrate the feasibility of a large-scale deployment
of C-Saw with a pilot study.
CCS CONCEPTS
• Social and professional topics → Censorship; Network
access control; • Security and privacy → Human and soci-
etal aspects of security and privacy; • Networks → Network
measurement;
ACM Reference Format:
Aqib Nisar, Aqsa Kashaf, Ihsan Ayyub Qazi, Zartash Afzal Uzmi.
2018. Incentivizing Censorship Measurements via Circumvention.
In SIGCOMM ’18: SIGCOMM 2018, August 20–25, 2018, Budapest,
Hungary. ACM, New York, NY, USA, 14 pages. https://doi.org/10.
1145/3230543.3230568
∗Aqsa Kashaf is currently with CMU and Aqib Nisar with USC.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies
are not made or distributed for profit or commercial advantage and that
copies bear this notice and the...

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


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

Output:
安全论文分析：

title:Snipuzz: Black-box Fuzzing of IoT Firmware via Message Snippet Inference
author:Xiaotao Feng and
Ruoxi Sun and
Xiaogang Zhu and
Minhui Xue and
Sheng Wen and
Dongxi Liu and
Surya Nepal and
Yang Xiang
Snipuzz: Black-box Fuzzing of IoT Firmware
via Message Snippet Inference
Xiaotao Feng
Australia
Minhui Xue
Australia
Ruoxi Sun
Australia
Sheng Wen∗
Australia
Xiaogang Zhu∗
Australia
Dongxi Liu
CSIRO Data61
Australia
Swinburne University of Technology
The University of Adelaide
Swinburne University of Technology
The University of Adelaide
Swinburne University of Technology
Surya Nepal
CSIRO Data61
Australia
ABSTRACT
The proliferation of Internet of Things (IoT) devices has made peo-
ple’s lives more convenient, but it has also raised many security
concerns. Due to the difficulty of obtaining and emulating IoT
firmware, in the absence of internal execution information, black-
box fuzzing of IoT devices has become a viable option. However,
existing black-box fuzzers cannot form effective mutation optimiza-
tion mechanisms to guide their testing processes, mainly due to the
lack of feedback. In addition, because of the prevalent use of various
and non-standard communication message formats in IoT devices,
it is difficult or even impossible to apply existing grammar-based
fuzzing strategies. Therefore, an efficient fuzzing approach with
syntax inference is required in the IoT fuzzing domain.
To address these critical problems, we propose a novel automatic
black-box fuzzing for IoT firmware, termed Snipuzz. Snipuzz runs
as a client communicating with the devices and infers message
snippets for mutation based on the responses. Each snippet refers
to a block of consecutive bytes that reflect the approximate code
coverage in fuzzing. This mutation strategy based on message snip-
pets considerably narrows down the search space to change the
probing messages. We compared Snipuzz with four state-of-the-
art IoT fuzzing approaches, i.e., IoTFuzzer, BooFuzz, Doona, and
Nemesys. ...


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

Input:
title:Snipuzz: Black-box Fuzzing of IoT Firmware via Message Snippet Inference
author:Xiaotao Feng and
Ruoxi Sun and
Xiaogang Zhu and
Minhui Xue and
Sheng Wen and
Dongxi Liu and
Surya Nepal and
Yang Xiang
Snipuzz: Black-box Fuzzing of IoT Firmware
via Message Snippet Inference
Xiaotao Feng
Australia
Minhui Xue
Australia
Ruoxi Sun
Australia
Sheng Wen∗
Australia
Xiaogang Zhu∗
Australia
Dongxi Liu
CSIRO Data61
Australia
Swinburne University of Technology
The University of Adelaide
Swinburne University of Technology
The University of Adelaide
Swinburne University of Technology
Surya Nepal
CSIRO Data61
Australia
ABSTRACT
The proliferation of Internet of Things (IoT) devices has made peo-
ple’s lives more convenient, but it has also raised many security
concerns. Due to the difficulty of obtaining and emulating IoT
firmware, in the absence of internal execution information, black-
box fuzzing of IoT devices has become a viable option. However,
existing black-box fuzzers cannot form effective mutation optimiza-
tion mechanisms to guide their testing processes, mainly due to the
lack of feedback. In addition, because of the prevalent use of various
and non-standard communication message formats in IoT devices,
it is difficult or even impossible to apply existing grammar-based
fuzzing strategies. Therefore, an efficient fuzzing approach with
syntax inference is required in the IoT fuzzing domain.
To address these critical problems, we propose a novel automatic
black-box fuzzing for IoT firmware, termed Snipuzz. Snipuzz runs
as a client communicating with the devices and infers message
snippets for mutation based on the responses. Each snippet refers
to a block of consecutive bytes that reflect the approximate code
coverage in fuzzing. This mutation strategy based on message snip-
pets considerably narrows down the search space to change the
probing messages. We compared Snipuzz with four state-of-the-
art IoT fuzzing approaches, i.e., IoTFuzzer, BooFuzz, Doona, and
Nemesys. ...

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


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

Output:
安全论文分析：

title:SoK: A Framework for Unifying At-Risk User Research
author:Noel Warford and
Tara Matthews and
Kaitlyn Yang and
Omer Akgul and
Sunny Consolvo and
Patrick Gage Kelley and
Nathan Malkin and
Michelle L. Mazurek and
Manya Sleeper and
Kurt Thomas
2022 IEEE Symposium on Security and Privacy (SP)
SoK: A Framework for Unifying At-Risk User Research
Noel Warfordࢩ, Tara Matthews†, Kaitlyn Yangࢩ, Omer Akgulࢩ, Sunny Consolvo†,
Patrick Gage Kelley†, Nathan Malkinࢩ, Michelle L. Mazurekࢩ, Manya Sleeper†, and Kurt Thomas†
ࢩUniversity of Maryland, †Google
3
4
6
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
Abstract—At-risk users are people who experience risk factors
that augment or amplify their chances of being digitally attacked
and/or suﬀering disproportionate harms. In this systematization
work, we present a framework for reasoning about at-risk users
based on a wide-ranging meta-analysis of 95 papers. Across the
varied populations that we examined (e.g., children, activists,
people with disabilities), we identiﬁed 10 unifying contextual
risk factors—such as marginalization and access to a sensitive
resource—that augment or amplify digital-safety risks and their
resulting harms. We also identiﬁed technical and non-technical
practices that at-risk users adopt to attempt to protect themselves
from digital-safety risks. We use this framework to discuss
barriers that limit at-risk users’ ability or willingness to take
protective actions. We believe that researchers and technology
creators can use our framework to identify and shape research
investments to beneﬁt at-risk users, and to guide technology
design to better support at-risk users.
I. INTRODUCTION
Anyone can experience attacks related to their security, pri-
vacy, or safety online (i.e., digital safety), but at-risk users have
risk factors that augment...


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

Input:
title:SoK: A Framework for Unifying At-Risk User Research
author:Noel Warford and
Tara Matthews and
Kaitlyn Yang and
Omer Akgul and
Sunny Consolvo and
Patrick Gage Kelley and
Nathan Malkin and
Michelle L. Mazurek and
Manya Sleeper and
Kurt Thomas
2022 IEEE Symposium on Security and Privacy (SP)
SoK: A Framework for Unifying At-Risk User Research
Noel Warfordࢩ, Tara Matthews†, Kaitlyn Yangࢩ, Omer Akgulࢩ, Sunny Consolvo†,
Patrick Gage Kelley†, Nathan Malkinࢩ, Michelle L. Mazurekࢩ, Manya Sleeper†, and Kurt Thomas†
ࢩUniversity of Maryland, †Google
3
4
6
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
Abstract—At-risk users are people who experience risk factors
that augment or amplify their chances of being digitally attacked
and/or suﬀering disproportionate harms. In this systematization
work, we present a framework for reasoning about at-risk users
based on a wide-ranging meta-analysis of 95 papers. Across the
varied populations that we examined (e.g., children, activists,
people with disabilities), we identiﬁed 10 unifying contextual
risk factors—such as marginalization and access to a sensitive
resource—that augment or amplify digital-safety risks and their
resulting harms. We also identiﬁed technical and non-technical
practices that at-risk users adopt to attempt to protect themselves
from digital-safety risks. We use this framework to discuss
barriers that limit at-risk users’ ability or willingness to take
protective actions. We believe that researchers and technology
creators can use our framework to identify and shape research
investments to beneﬁt at-risk users, and to guide technology
design to better support at-risk users.
I. INTRODUCTION
Anyone can experience attacks related to their security, pri-
vacy, or safety online (i.e., digital safety), but at-risk users have
risk factors that augment...

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


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

Output:
安全论文分析：

title:An adaptive approach to dependable circuits for a digital power control
author:Aromhack Saysanasongkham and
Kenta Imai and
Masayuki Arai and
Satoshi Fukumoto and
Keiji Wada
An Adaptive Approach to Dependable Circuits for a
Digital Power Control
Aromhack SAYSANASONGKHAM
Masayuki ARAI
Keiji WADA
and Kenta IMAI
Graduate School of System Design
Tokyo Metropolitan University
and Satoshi FUKUMOTO
Faculty of System Design
Tokyo Metropolitan University
6-6, Asahigaoka, Hino
Tokyo 191-0065, Japan
Email: fdola, imaikentag@iel.sd.tmu.ac.jp
6-6, Asahigaoka, Hino
Tokyo 191-0065, Japan
Email: fm-arai, s-fukug@tmu.ac.jp
School of Science and Engineering
Faculty of Urban Liberal Arts
Tokyo Metropolitan University
1-2, Minamioosawa, Hachioji
Tokyo 192-0397, Japan
Email: kj-wada@tmu.ac.jp
Abstract—Recently, a microcomputer and a FPGA are apt
to be used for control of the power conversion circuits because
of their capability to simplify the parameter resetting and also
their ﬂexibility on the basis of programming by software. On the
other hand, the control circuits are getting extremely close to the
high current main circuit. Thus the electro-magnetic radiation
generated nearby the high current pulse may affect the control
circuit as transient faults. In this study, we focus on transient
noise caused by switching activities of a DC-DC converter and
propose a dependable digital power control circuit by FPGA. The
basic idea is to keep the sampling times as far away from the
switching times as possible to avoid the effects of transient noise.
A control circuit, with the proposed method applied, is designed
and its effectiveness is shown by simulations.
I.
INTRODUCTION
Recently, energy saving and ecological issues have catched
attentions from people around the globe. Of all others, efﬁcient
transformation of the switch mode power supply such as DC-
DC converter, AC-DC converter and so on are playing one
of the crucial rolls for energy saving and miniaturization of
electronic devices...


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

Input:
title:An adaptive approach to dependable circuits for a digital power control
author:Aromhack Saysanasongkham and
Kenta Imai and
Masayuki Arai and
Satoshi Fukumoto and
Keiji Wada
An Adaptive Approach to Dependable Circuits for a
Digital Power Control
Aromhack SAYSANASONGKHAM
Masayuki ARAI
Keiji WADA
and Kenta IMAI
Graduate School of System Design
Tokyo Metropolitan University
and Satoshi FUKUMOTO
Faculty of System Design
Tokyo Metropolitan University
6-6, Asahigaoka, Hino
Tokyo 191-0065, Japan
Email: fdola, imaikentag@iel.sd.tmu.ac.jp
6-6, Asahigaoka, Hino
Tokyo 191-0065, Japan
Email: fm-arai, s-fukug@tmu.ac.jp
School of Science and Engineering
Faculty of Urban Liberal Arts
Tokyo Metropolitan University
1-2, Minamioosawa, Hachioji
Tokyo 192-0397, Japan
Email: kj-wada@tmu.ac.jp
Abstract—Recently, a microcomputer and a FPGA are apt
to be used for control of the power conversion circuits because
of their capability to simplify the parameter resetting and also
their ﬂexibility on the basis of programming by software. On the
other hand, the control circuits are getting extremely close to the
high current main circuit. Thus the electro-magnetic radiation
generated nearby the high current pulse may affect the control
circuit as transient faults. In this study, we focus on transient
noise caused by switching activities of a DC-DC converter and
propose a dependable digital power control circuit by FPGA. The
basic idea is to keep the sampling times as far away from the
switching times as possible to avoid the effects of transient noise.
A control circuit, with the proposed method applied, is designed
and its effectiveness is shown by simulations.
I.
INTRODUCTION
Recently, energy saving and ecological issues have catched
attentions from people around the globe. Of all others, efﬁcient
transformation of the switch mode power supply such as DC-
DC converter, AC-DC converter and so on are playing one
of the crucial rolls for energy saving and miniaturization of
electronic devices...

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


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

Output:
安全论文分析：

title:User Interface Defect Detection by Hesitation Analysis
author:Robert W. Reeder and
Roy A. Maxion
User Interface Defect Detection by Hesitation Analysis
Robert W. Reeder and Roy A. Maxion
reeder@cs.cmu.edu, maxion@cs.cmu.edu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
Delays and errors are the frequent consequences of
people having difﬁculty with a user interface. Such de-
lays and errors can result in severe problems, particularly
for mission-critical applications in which speed and ac-
curacy are of the essence. User difﬁculty is often caused
by interface-design defects that confuse or mislead users.
Current techniques for isolating such defects are time-
consuming and expensive, because they require human an-
alysts to identify the points at which users experience dif-
ﬁculty; only then can diagnosis and repair of the defects
take place. This paper presents an automated method for
detecting instances of user difﬁculty based on identifying
hesitations during system use. The method’s accuracy was
evaluated by comparing its judgments of user difﬁculty with
ground truth generated by human analysts. The method’s
accuracy at a range of threshold parameter values is given;
representative points include 92% of periods of user difﬁ-
culty identiﬁed (with a 35% false-alarm rate); 86% (24%
false-alarm rate); and 20% (3% false-alarm rate). Appli-
cations of the method to addressing interface defects are
discussed.
1
Introduction
Undependable user interfaces present a major obstacle
to achieving overall system dependability. Avizienis et al.
[1], in outlining current challenges to dependable comput-
ing, state this in no uncertain terms:
The problems of complex human-machine inter-
actions (including user interfaces) remain a chal-
lenge that is becoming very critical – the means
to improve their dependability and security need
to be identiﬁed and incorporated.
User interface dependabi...


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

Input:
title:User Interface Defect Detection by Hesitation Analysis
author:Robert W. Reeder and
Roy A. Maxion
User Interface Defect Detection by Hesitation Analysis
Robert W. Reeder and Roy A. Maxion
reeder@cs.cmu.edu, maxion@cs.cmu.edu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
Delays and errors are the frequent consequences of
people having difﬁculty with a user interface. Such de-
lays and errors can result in severe problems, particularly
for mission-critical applications in which speed and ac-
curacy are of the essence. User difﬁculty is often caused
by interface-design defects that confuse or mislead users.
Current techniques for isolating such defects are time-
consuming and expensive, because they require human an-
alysts to identify the points at which users experience dif-
ﬁculty; only then can diagnosis and repair of the defects
take place. This paper presents an automated method for
detecting instances of user difﬁculty based on identifying
hesitations during system use. The method’s accuracy was
evaluated by comparing its judgments of user difﬁculty with
ground truth generated by human analysts. The method’s
accuracy at a range of threshold parameter values is given;
representative points include 92% of periods of user difﬁ-
culty identiﬁed (with a 35% false-alarm rate); 86% (24%
false-alarm rate); and 20% (3% false-alarm rate). Appli-
cations of the method to addressing interface defects are
discussed.
1
Introduction
Undependable user interfaces present a major obstacle
to achieving overall system dependability. Avizienis et al.
[1], in outlining current challenges to dependable comput-
ing, state this in no uncertain terms:
The problems of complex human-machine inter-
actions (including user interfaces) remain a chal-
lenge that is becoming very critical – the means
to improve their dependability and security need
to be identiﬁed and incorporated.
User interface dependabi...

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


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

Output:
安全论文分析：

title:A Data-Centric Approach to Insider Attack Detection in Database Systems
author:Sunu Mathew and
Michalis Petropoulos and
Hung Q. Ngo and
Shambhu J. Upadhyaya
A Data-Centric Approach to Insider Attack
Detection in Database Systems
Sunu Mathew(cid:63)1, Michalis Petropoulos2, Hung Q. Ngo2, and Shambhu
Upadhyaya2
1 Information Security,
Amazon.com Inc., Seattle WA 98104, USA,
smathew@amazon.com,
2 Computer Science and Engineering,
University at Buﬀalo, Buﬀalo NY 14260, USA,
(mpertropo, hungngo, shambhu)@buffalo.edu
Abstract. The insider threat against database management systems is
a dangerous security problem. Authorized users may abuse legitimate
privileges to masquerade as another user or to maliciously harvest data.
We propose a new direction to address the problem. We model users’
access patterns by proﬁling the data points that users access, in contrast
to analyzing the query expressions in prior approaches. Our data-centric
approach is based on the key observation that query syntax alone is a
poor discriminator of user intent, which is much better rendered by what
is accessed. We present a feature-extraction method to model users’ ac-
cess patterns. Statistical learning algorithms are trained and tested using
data from a real Graduate Admission database. Experimental results in-
dicate that the technique is very eﬀective, accurate, and is promising
in complementing existing database security solutions. Practical perfor-
mance issues are also addressed.
1
Introduction
Ensuring the security and privacy of data assets is a crucial and very diﬃcult
problem in our modern networked world. Relational database management sys-
tems (RDBMS) is the fundamental means of data organization, storage and
access in most organizations, services, and applications. Naturally, the preva-
lence of RDBMS’s led to the prevalence of security threats against RDBMS’s.
An intruder from the outside, for example, may be able to gain unauthorized
access to data by sending carefully craft...


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

Input:
title:A Data-Centric Approach to Insider Attack Detection in Database Systems
author:Sunu Mathew and
Michalis Petropoulos and
Hung Q. Ngo and
Shambhu J. Upadhyaya
A Data-Centric Approach to Insider Attack
Detection in Database Systems
Sunu Mathew(cid:63)1, Michalis Petropoulos2, Hung Q. Ngo2, and Shambhu
Upadhyaya2
1 Information Security,
Amazon.com Inc., Seattle WA 98104, USA,
smathew@amazon.com,
2 Computer Science and Engineering,
University at Buﬀalo, Buﬀalo NY 14260, USA,
(mpertropo, hungngo, shambhu)@buffalo.edu
Abstract. The insider threat against database management systems is
a dangerous security problem. Authorized users may abuse legitimate
privileges to masquerade as another user or to maliciously harvest data.
We propose a new direction to address the problem. We model users’
access patterns by proﬁling the data points that users access, in contrast
to analyzing the query expressions in prior approaches. Our data-centric
approach is based on the key observation that query syntax alone is a
poor discriminator of user intent, which is much better rendered by what
is accessed. We present a feature-extraction method to model users’ ac-
cess patterns. Statistical learning algorithms are trained and tested using
data from a real Graduate Admission database. Experimental results in-
dicate that the technique is very eﬀective, accurate, and is promising
in complementing existing database security solutions. Practical perfor-
mance issues are also addressed.
1
Introduction
Ensuring the security and privacy of data assets is a crucial and very diﬃcult
problem in our modern networked world. Relational database management sys-
tems (RDBMS) is the fundamental means of data organization, storage and
access in most organizations, services, and applications. Naturally, the preva-
lence of RDBMS’s led to the prevalence of security threats against RDBMS’s.
An intruder from the outside, for example, may be able to gain unauthorized
access to data by sending carefully craft...

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


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

Output:
安全论文分析：

title:SymNet: Scalable symbolic execution for modern networks
author:Radu Stoenescu and
Matei Popovici and
Lorina Negreanu and
Costin Raiciu
Symnet:
scalable	symbolic	execution	for
modern	networks
University	Politehnica of	Bucharest
Radu Stoenescu,	Matei Popovici,	Lorina Negreanu and
Costin	Raiciu
Networks	are	increasingly	complex
2
Understand	the	network
A
Reachability
Packet	modifications
Security	policy	violations
B
3
Static	verification	to	the	rescue
Data	plane	snapshot
Symbolic	Execution	Friendly	Language	(SEFL)	- Network	model
Network	model
Symnet – Verification	engine
Verification	engine
4
Choosing	a	modeling	language
C	code
• Expressive,	well	understood
• Symbolic	execution	captures
many	properties
• Very	expensive	to	verify
Middle	ground
Header	Space	Analysis
• Cheap,	scalable
• No	arbitrary	protocol	layering
• Only	captures	reachability
5
Symbol	execution	of	firewall	- C	code
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
6
Symbol	execution	of	firewall	- C	code
Path	1
p=*
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
7
Symbol	execution	of	firewall	- C	code
Path	1
p=*
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
8
Symbol	execution	of	firewall	- C	code
Path	2
Path	1
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
p->dst_port=80 p->dst_port!=80
9
Symbol	execution	of	firewall	- C	code
Path	2
Path	1
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
p->dst_port=80 p->dst_port!=80
10
Symbol	execution	of	firewall	- C	code
Path	2
Path	1
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
p->dst_port!=80
p->dst_port=80
filter	=	p
11
Symbol	execution	of	firewall	-...


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

Input:
title:SymNet: Scalable symbolic execution for modern networks
author:Radu Stoenescu and
Matei Popovici and
Lorina Negreanu and
Costin Raiciu
Symnet:
scalable	symbolic	execution	for
modern	networks
University	Politehnica of	Bucharest
Radu Stoenescu,	Matei Popovici,	Lorina Negreanu and
Costin	Raiciu
Networks	are	increasingly	complex
2
Understand	the	network
A
Reachability
Packet	modifications
Security	policy	violations
B
3
Static	verification	to	the	rescue
Data	plane	snapshot
Symbolic	Execution	Friendly	Language	(SEFL)	- Network	model
Network	model
Symnet – Verification	engine
Verification	engine
4
Choosing	a	modeling	language
C	code
• Expressive,	well	understood
• Symbolic	execution	captures
many	properties
• Very	expensive	to	verify
Middle	ground
Header	Space	Analysis
• Cheap,	scalable
• No	arbitrary	protocol	layering
• Only	captures	reachability
5
Symbol	execution	of	firewall	- C	code
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
6
Symbol	execution	of	firewall	- C	code
Path	1
p=*
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
7
Symbol	execution	of	firewall	- C	code
Path	1
p=*
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
8
Symbol	execution	of	firewall	- C	code
Path	2
Path	1
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
p->dst_port=80 p->dst_port!=80
9
Symbol	execution	of	firewall	- C	code
Path	2
Path	1
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
p->dst_port=80 p->dst_port!=80
10
Symbol	execution	of	firewall	- C	code
Path	2
Path	1
if (p->dst_port==80)
1: packet* filter(packet* p){
2:
4:
5:
6:
7:
8:
9:}
free p;
return NULL;
return p;
else {
}
p->dst_port!=80
p->dst_port=80
filter	=	p
11
Symbol	execution	of	firewall	-...

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


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

Output:
安全论文分析：

title:Extended cubes: enhancing the cube attack by extracting low-degree
non-linear equations
author:Shekh Faisal Abdul-Latip and
Reza Reyhanitabar and
Willy Susilo and
Jennifer Seberry
Extended Cubes: Enhancing the Cube Attack by
Extracting Low-Degree Non-Linear Equations
Shekh Faisal
(cid:3)
Abdul-Latip
School of Computer Science
and Software Engineering
University of Wollongong,
Australia
sfal620@uowmail.edu.au
Willy Susilo
School of Computer Science
and Software Engineering
University of Wollongong,
wsusilo@uow.edu.au
Australia
Mohammad Reza
Reyhanitabar
School of Computer Science
and Software Engineering
University of Wollongong,
rezar@uow.edu.au
Jennifer Seberry
Australia
School of Computer Science
and Software Engineering
University of Wollongong,
jennie@uow.edu.au
Australia
ABSTRACT
In this paper, we propose an e(cid:14)cient method for extracting
simple low-degree equations (e.g. quadratic ones) in addi-
tion to the linear ones, obtainable from the original cube
attack by Dinur and Shamir at EUROCRYPT 2009. This
extended cube attack can be successfully applied even to
cryptosystems in which the original cube attack may fail due
to the attacker’s inability in (cid:12)nding su(cid:14)ciently many inde-
pendent linear equations. As an application of our extended
method, we exhibit a side channel cube attack against the
PRESENT block cipher using the Hamming weight leakage
model. Our side channel attack improves upon the previ-
ous work of Yang, Wang and Qiao at CANS 2009 from two
aspects. First, we use the Hamming weight leakage mod-
el which is a more relaxed leakage assumption, supported
by many previously known practical results on side channel
attacks, compared to the more challenging leakage assump-
tion that the adversary has access to the \exact" value of
the internal state bits as used by Yang et al. Thanks to
applying the extended cube method, our attack has also a
reduced complexity compared to that of Yang et al. Name-
ly, for PRESENT-80 (80-bit key...


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

Input:
title:Extended cubes: enhancing the cube attack by extracting low-degree
non-linear equations
author:Shekh Faisal Abdul-Latip and
Reza Reyhanitabar and
Willy Susilo and
Jennifer Seberry
Extended Cubes: Enhancing the Cube Attack by
Extracting Low-Degree Non-Linear Equations
Shekh Faisal
(cid:3)
Abdul-Latip
School of Computer Science
and Software Engineering
University of Wollongong,
Australia
sfal620@uowmail.edu.au
Willy Susilo
School of Computer Science
and Software Engineering
University of Wollongong,
wsusilo@uow.edu.au
Australia
Mohammad Reza
Reyhanitabar
School of Computer Science
and Software Engineering
University of Wollongong,
rezar@uow.edu.au
Jennifer Seberry
Australia
School of Computer Science
and Software Engineering
University of Wollongong,
jennie@uow.edu.au
Australia
ABSTRACT
In this paper, we propose an e(cid:14)cient method for extracting
simple low-degree equations (e.g. quadratic ones) in addi-
tion to the linear ones, obtainable from the original cube
attack by Dinur and Shamir at EUROCRYPT 2009. This
extended cube attack can be successfully applied even to
cryptosystems in which the original cube attack may fail due
to the attacker’s inability in (cid:12)nding su(cid:14)ciently many inde-
pendent linear equations. As an application of our extended
method, we exhibit a side channel cube attack against the
PRESENT block cipher using the Hamming weight leakage
model. Our side channel attack improves upon the previ-
ous work of Yang, Wang and Qiao at CANS 2009 from two
aspects. First, we use the Hamming weight leakage mod-
el which is a more relaxed leakage assumption, supported
by many previously known practical results on side channel
attacks, compared to the more challenging leakage assump-
tion that the adversary has access to the \exact" value of
the internal state bits as used by Yang et al. Thanks to
applying the extended cube method, our attack has also a
reduced complexity compared to that of Yang et al. Name-
ly, for PRESENT-80 (80-bit key...

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


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

Output:
安全论文分析：

title:Towards detecting BGP route hijacking using the RPKI
author:Matthias W"ahlisch and
Olaf Maennel and
Thomas C. Schmidt
Towards Detecting BGP Route Hijacking using the RPKI
Matthias Wählisch
Freie Universität Berlin
waehlisch@ieee.org
Olaf Maennel
Loughborough University
olaf@maennel.net
Thomas C. Schmidt
HAW Hamburg
t.schmidt@ieee.org
ABSTRACT
Preﬁx hijacking has always been a big concern in the Internet. Some
events made it into the international world-news, but most of them
remain unreported or even unnoticed. The scale of the problem can
only be estimated.
The Resource Publication Infrastructure (RPKI) is an effort by
the IETF to secure the inter-domain routing system. It includes a
formally veriﬁable way of identifying who owns legitimately which
portion of the IP address space. The RPKI has been standardized
and prototype implementations are tested by Internet Service Pro-
viders (ISPs). Currently the system holds already about 2% of the
Internet routing table.
Therefore, in theory, it should be easy to detect hijacking of pre-
ﬁxes within that address space. We take an early look at BGP up-
date data and check those updates against the RPKI—in the same
way a router would do, once the system goes operational. We ﬁnd
many interesting dynamics, not all can be easily explained as hi-
jacking, but a signiﬁcant number are likely operational testing or
misconﬁgurations.
Categories and Subject Descriptors
C.2.2 [Computer-Communication Networks]: Network Protocols—
Routing Protocols
Keywords
BGP, RPKI, secure inter-domain routing, deployment
1.
INTRODUCTION
The Border Gateway Protocol (BGP) was designed with next
to no security in mind and is therefore quite vulnerable to attacks
such as preﬁx hijacks, protocol attacks, and accidental misconﬁgur-
ation [1, 2].
This lack of security made it easy to announce address space
that does belong to someone else—without the owners permission.
“Evil guys” use this to inject spam, to launch attacks, or perform
other ille...


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

Input:
title:Towards detecting BGP route hijacking using the RPKI
author:Matthias W"ahlisch and
Olaf Maennel and
Thomas C. Schmidt
Towards Detecting BGP Route Hijacking using the RPKI
Matthias Wählisch
Freie Universität Berlin
waehlisch@ieee.org
Olaf Maennel
Loughborough University
olaf@maennel.net
Thomas C. Schmidt
HAW Hamburg
t.schmidt@ieee.org
ABSTRACT
Preﬁx hijacking has always been a big concern in the Internet. Some
events made it into the international world-news, but most of them
remain unreported or even unnoticed. The scale of the problem can
only be estimated.
The Resource Publication Infrastructure (RPKI) is an effort by
the IETF to secure the inter-domain routing system. It includes a
formally veriﬁable way of identifying who owns legitimately which
portion of the IP address space. The RPKI has been standardized
and prototype implementations are tested by Internet Service Pro-
viders (ISPs). Currently the system holds already about 2% of the
Internet routing table.
Therefore, in theory, it should be easy to detect hijacking of pre-
ﬁxes within that address space. We take an early look at BGP up-
date data and check those updates against the RPKI—in the same
way a router would do, once the system goes operational. We ﬁnd
many interesting dynamics, not all can be easily explained as hi-
jacking, but a signiﬁcant number are likely operational testing or
misconﬁgurations.
Categories and Subject Descriptors
C.2.2 [Computer-Communication Networks]: Network Protocols—
Routing Protocols
Keywords
BGP, RPKI, secure inter-domain routing, deployment
1.
INTRODUCTION
The Border Gateway Protocol (BGP) was designed with next
to no security in mind and is therefore quite vulnerable to attacks
such as preﬁx hijacks, protocol attacks, and accidental misconﬁgur-
ation [1, 2].
This lack of security made it easy to announce address space
that does belong to someone else—without the owners permission.
“Evil guys” use this to inject spam, to launch attacks, or perform
other ille...

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


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

Output:
安全论文分析：

title:External Reviewers
author:
External Reviewers
Abhi Shelat
Abhilasha Bhargav-Spantzel
Adam M. Costello
Adam Stubblefield
Akihiko Tozawa
Alejandro C. Russo
Alessandro Armando
Alex Iliev
Alexander Kholosha
Alina Oprea
Andrei Serjantov
Andrew Odlyzko
Angelos Stavrou
Anil Somayaji
Anirudh Ramachandran
Anna Shubina
Anna Squicciarini
Anne Anderson
Arvind Seshadri
Aslan Askarov
Bart Preneel
Benessa Defend
Benjamin Morin
Bernard Vivinis
Bogdan Warinschi
Bor-Yuh Evan Chang
Brent Waters
Catherine Meadows
Cédric Fournet
Charles Reis
Chris Karlof
Chris Scott
Christian Cachin
Christian Kreibich
Cliff C. Zou
Cristina Nita-Rotaru
Cynthia McLain
Dakshi Agrawal
Dan Ellis
Dan Geer
Dan Simon
Dan Wendlandt
Daniel Hedin
David Jao
David Molnar
Dawson Engler
Debabrata Dash
Debra L. Cook
Dennis Hofheinz
Detlef Kähler
Didier Galmiche
Dogan Kesdogan
Don Towsley
Duminda Wijesekera
Ed Felten
Elaine Shi
Elie Bursztein
Emmanuel Thomé
Eric J. Austin
Eric Totel
Evan Cooke
Frédéric Majorczyk
Frédéric Sur
Gary Ellison
Gaurav Kc
George Necula
x
Giuseppe Ateniese
Glenn Wurster
Günter Karjoth
Hajime Inoue
Haowen Chan
Heinz Kreft
Hiroshi Maruyama
Jacques Traoré
Jaeyeon Jung
Jason Flinn
Jason Franklin
Jean Goubault-Larrecq
Jeff Offutt
Jérôme Lebegue
Ji-Won Byun
Johannes Blömer
John Ioannidis
John Wilander
Jonathan McCune
Jörn Müller-Quade
Joseph Pamula
Josh Benaloh
Jouni Viinikka
Jovan Dj. Goli(cid:252)
Julie Thorpe
Kaoru Kurosawa
Klaas Ole Kürtz
Kohichi Kamijoh
Kostas Anagnostakis
Kwang-Hyun Baek
Kyle W. Ingols
Lexi Pimenidis
Magnus Almgren
Manoj Prabhakaran
Marcus Peinado
Marianne Winslett
Mark Luk
Markus Kuhn
Masayuki Numao
Mathieu Turuani
Matthew Burnside
Megumi Nakamura
Michael Locasto
Michael Roe
Michael Szydlo
Mira Meyerovich
Mohamed Shehab
Mohammad Mannan
Moritz Becker
Moti Yung
Naishin Seki
Nenad Jovanovic
Nick Weaver
Ninghui Li
Olivier Bournez
Pablo Giambiagi
Paul Syve...


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

Input:
title:External Reviewers
author:
External Reviewers
Abhi Shelat
Abhilasha Bhargav-Spantzel
Adam M. Costello
Adam Stubblefield
Akihiko Tozawa
Alejandro C. Russo
Alessandro Armando
Alex Iliev
Alexander Kholosha
Alina Oprea
Andrei Serjantov
Andrew Odlyzko
Angelos Stavrou
Anil Somayaji
Anirudh Ramachandran
Anna Shubina
Anna Squicciarini
Anne Anderson
Arvind Seshadri
Aslan Askarov
Bart Preneel
Benessa Defend
Benjamin Morin
Bernard Vivinis
Bogdan Warinschi
Bor-Yuh Evan Chang
Brent Waters
Catherine Meadows
Cédric Fournet
Charles Reis
Chris Karlof
Chris Scott
Christian Cachin
Christian Kreibich
Cliff C. Zou
Cristina Nita-Rotaru
Cynthia McLain
Dakshi Agrawal
Dan Ellis
Dan Geer
Dan Simon
Dan Wendlandt
Daniel Hedin
David Jao
David Molnar
Dawson Engler
Debabrata Dash
Debra L. Cook
Dennis Hofheinz
Detlef Kähler
Didier Galmiche
Dogan Kesdogan
Don Towsley
Duminda Wijesekera
Ed Felten
Elaine Shi
Elie Bursztein
Emmanuel Thomé
Eric J. Austin
Eric Totel
Evan Cooke
Frédéric Majorczyk
Frédéric Sur
Gary Ellison
Gaurav Kc
George Necula
x
Giuseppe Ateniese
Glenn Wurster
Günter Karjoth
Hajime Inoue
Haowen Chan
Heinz Kreft
Hiroshi Maruyama
Jacques Traoré
Jaeyeon Jung
Jason Flinn
Jason Franklin
Jean Goubault-Larrecq
Jeff Offutt
Jérôme Lebegue
Ji-Won Byun
Johannes Blömer
John Ioannidis
John Wilander
Jonathan McCune
Jörn Müller-Quade
Joseph Pamula
Josh Benaloh
Jouni Viinikka
Jovan Dj. Goli(cid:252)
Julie Thorpe
Kaoru Kurosawa
Klaas Ole Kürtz
Kohichi Kamijoh
Kostas Anagnostakis
Kwang-Hyun Baek
Kyle W. Ingols
Lexi Pimenidis
Magnus Almgren
Manoj Prabhakaran
Marcus Peinado
Marianne Winslett
Mark Luk
Markus Kuhn
Masayuki Numao
Mathieu Turuani
Matthew Burnside
Megumi Nakamura
Michael Locasto
Michael Roe
Michael Szydlo
Mira Meyerovich
Mohamed Shehab
Mohammad Mannan
Moritz Becker
Moti Yung
Naishin Seki
Nenad Jovanovic
Nick Weaver
Ninghui Li
Olivier Bournez
Pablo Giambiagi
Paul Syve...

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


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

Output:
安全论文分析：

title:Informed content delivery across adaptive overlay networks
author:John W. Byers and
Jeffrey Considine and
Michael Mitzenmacher and
Stanislav Rost
Informed Content Delivery Across Adaptive Overlay
Networks ∗
John Byers
byers@cs.bu.edu
Jeffrey Considine
jconsidi@cs.bu.edu
Michael Mitzenmacher
Stanislav Rost
michaelm@eecs.harvard.edu
stanrost@lcs.mit.edu
Dept. of Computer Science
Boston University
Boston, Massachusetts
EECS
Harvard University
MIT Laboratory for
Computer Science
Cambridge, Massachusetts
Cambridge, Massachusetts
Abstract
Overlay networks have emerged as a powerful and highly ﬂexible
method for delivering content. We study how to optimize through-
put of large transfers across richly connected, adaptive overlay net-
works, focusing on the potential of collaborative transfers between
peers to supplement ongoing downloads. First, we make the case
for an erasure-resilient encoding of the content. Using the digital
fountain encoding approach, end-hosts can efﬁciently reconstruct
the original content of size n from a subset of any n symbols drawn
from a large universe of encoded symbols. Such an approach af-
fords reliability and a substantial degree of application-level ﬂex-
ibility, as it seamlessly accommodates connection migration and
parallel transfers while providing resilience to packet loss. How-
ever, since the sets of encoded symbols acquired by peers during
downloads may overlap substantially, care must be taken to enable
them to collaborate effectively. Our main contribution is a collec-
tion of useful algorithmic tools for efﬁcient estimation, summariza-
tion, and approximate reconciliation of sets of symbols between
pairs of collaborating peers, all of which keep message complexity
and computation to a minimum. Through simulations and experi-
ments on a prototype implementation, we demonstrate the perfor-
mance beneﬁts of our informed content delivery mechanisms and
how they complement existing overlay network architectures.
∗
John Byers, J...


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

Input:
title:Informed content delivery across adaptive overlay networks
author:John W. Byers and
Jeffrey Considine and
Michael Mitzenmacher and
Stanislav Rost
Informed Content Delivery Across Adaptive Overlay
Networks ∗
John Byers
byers@cs.bu.edu
Jeffrey Considine
jconsidi@cs.bu.edu
Michael Mitzenmacher
Stanislav Rost
michaelm@eecs.harvard.edu
stanrost@lcs.mit.edu
Dept. of Computer Science
Boston University
Boston, Massachusetts
EECS
Harvard University
MIT Laboratory for
Computer Science
Cambridge, Massachusetts
Cambridge, Massachusetts
Abstract
Overlay networks have emerged as a powerful and highly ﬂexible
method for delivering content. We study how to optimize through-
put of large transfers across richly connected, adaptive overlay net-
works, focusing on the potential of collaborative transfers between
peers to supplement ongoing downloads. First, we make the case
for an erasure-resilient encoding of the content. Using the digital
fountain encoding approach, end-hosts can efﬁciently reconstruct
the original content of size n from a subset of any n symbols drawn
from a large universe of encoded symbols. Such an approach af-
fords reliability and a substantial degree of application-level ﬂex-
ibility, as it seamlessly accommodates connection migration and
parallel transfers while providing resilience to packet loss. How-
ever, since the sets of encoded symbols acquired by peers during
downloads may overlap substantially, care must be taken to enable
them to collaborate effectively. Our main contribution is a collec-
tion of useful algorithmic tools for efﬁcient estimation, summariza-
tion, and approximate reconciliation of sets of symbols between
pairs of collaborating peers, all of which keep message complexity
and computation to a minimum. Through simulations and experi-
ments on a prototype implementation, we demonstrate the perfor-
mance beneﬁts of our informed content delivery mechanisms and
how they complement existing overlay network architectures.
∗
John Byers, J...

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


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

Output:
安全论文分析：

title:HFL: Hybrid Fuzzing on the Linux Kernel
author:Kyungtae Kim and
Dae R. Jeong and
Chung Hwan Kim and
Yeongjin Jang and
Insik Shin and
Byoungyoung Lee
HFL: Hybrid Fuzzing on the Linux Kernel
Kyungtae Kim† Dae R. Jeong‡ Chung Hwan Kim¶ Yeongjin Jang§ Insik Shin‡ Byoungyoung Lee∗†
†Purdue University
§Oregon State University
‡KAIST ¶NEC Laboratories America
∗Seoul National University
†kim1798@purdue.edu ‡{dae.r.jeong, insik.shin}@kaist.ac.kr ¶chungkim@nec-labs.com
§yeongjin.jang@oregonstate.edu ∗byoungyoung@snu.ac.kr
Abstract—Hybrid fuzzing, combining symbolic execution and
fuzzing,
is a promising approach for vulnerability discovery
because each approach can complement the other. However,
we observe that applying hybrid fuzzing to kernel testing is
challenging because the following unique characteristics of the
kernel make a naive adoption of hybrid fuzzing inefficient:
1) having indirect control transfers determined by system call
arguments, 2) controlling and matching internal system state via
system calls, and 3) inferring nested argument type for invoking
system calls. Failure to handling such challenges will render both
fuzzing and symbolic execution inefficient, and thereby, will result
in an inefficient hybrid fuzzing. Although these challenges are
essential to both fuzzing and symbolic execution, to the best of
our knowledge, existing kernel testing approaches either naively
use each technique separately without handling such challenges
or imprecisely handle a part of challenges only by static analysis.
To this end,
this paper proposes HFL, which not only
combines fuzzing with symbolic execution for hybrid fuzzing
but also addresses kernel-specific fuzzing challenges via three
distinct features: 1) converting indirect control transfers to direct
transfers, 2) inferring system call sequence to build a consistent
system state, and 3) identifying nested arguments types of system
calls. As a result, HFL found 24 previously unknown vulnera-
bilities in recent L...


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

Input:
title:HFL: Hybrid Fuzzing on the Linux Kernel
author:Kyungtae Kim and
Dae R. Jeong and
Chung Hwan Kim and
Yeongjin Jang and
Insik Shin and
Byoungyoung Lee
HFL: Hybrid Fuzzing on the Linux Kernel
Kyungtae Kim† Dae R. Jeong‡ Chung Hwan Kim¶ Yeongjin Jang§ Insik Shin‡ Byoungyoung Lee∗†
†Purdue University
§Oregon State University
‡KAIST ¶NEC Laboratories America
∗Seoul National University
†kim1798@purdue.edu ‡{dae.r.jeong, insik.shin}@kaist.ac.kr ¶chungkim@nec-labs.com
§yeongjin.jang@oregonstate.edu ∗byoungyoung@snu.ac.kr
Abstract—Hybrid fuzzing, combining symbolic execution and
fuzzing,
is a promising approach for vulnerability discovery
because each approach can complement the other. However,
we observe that applying hybrid fuzzing to kernel testing is
challenging because the following unique characteristics of the
kernel make a naive adoption of hybrid fuzzing inefficient:
1) having indirect control transfers determined by system call
arguments, 2) controlling and matching internal system state via
system calls, and 3) inferring nested argument type for invoking
system calls. Failure to handling such challenges will render both
fuzzing and symbolic execution inefficient, and thereby, will result
in an inefficient hybrid fuzzing. Although these challenges are
essential to both fuzzing and symbolic execution, to the best of
our knowledge, existing kernel testing approaches either naively
use each technique separately without handling such challenges
or imprecisely handle a part of challenges only by static analysis.
To this end,
this paper proposes HFL, which not only
combines fuzzing with symbolic execution for hybrid fuzzing
but also addresses kernel-specific fuzzing challenges via three
distinct features: 1) converting indirect control transfers to direct
transfers, 2) inferring system call sequence to build a consistent
system state, and 3) identifying nested arguments types of system
calls. As a result, HFL found 24 previously unknown vulnera-
bilities in recent L...

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


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

Output:
安全论文分析：

title:BBA+: Improving the Security and Applicability of Privacy-Preserving
Point Collection
author:Gunnar Hartung and
Max Hoffmann and
Matthias Nagel and
Andy Rupp
BBA+: Improving the Security and Applicability of
Privacy-Preserving Point Collection
Gunnar Hartung∗
Karlsruhe Institute of Technology
Department of Informatics
Karlsruhe, Germany
gunnar.hartung@kit.edu
Matthias Nagel‡
Karlsruhe Institute of Technology
Department of Informatics
Karlsruhe, Germany
matthias.nagel@kit.edu
Max Hoffmann†
Ruhr-Universität Bochum
Horst Görtz Institute for IT-Security
Bochum, Germany
max.hoffmann@rub.de
Andy Rupp§
Karlsruhe Institute of Technology
Department of Informatics
Karlsruhe, Germany
andy.rupp@kit.edu
ABSTRACT
Black-box accumulation (BBA) has recently been introduced as a
building-block for a variety of user-centric protocols such as loyalty,
refund, and incentive systems. Loosely speaking, this building block
may be viewed as a cryptographic “piggy bank” that allows a user
to collect points (aka incentives, coins, etc.) in an anonymous and
unlinkable way. A piggy bank may be “robbed” at some point by a
user, letting her spend the collected points, thereby only revealing
the total amount inside the piggy bank and its unique serial number.
In this paper we present BBA+, a definitional framework ex-
tending the BBA model in multiple ways: (1) We support offline
systems in the sense that there does not need to be a permanent
connection to a serial number database to check whether a pre-
sented piggy bank has already been robbed. (2) We enforce the
collection of “negative points” which users may not voluntarily
collect, as this is, for example, needed in pre-payment or reputation
systems. (3) The security property formalized for BBA+ schemes is
stronger and more natural than for BBA: Essentially, we demand
that the amount claimed to be inside a piggy bank must be exactly
the amount legitimately collected with this piggy bank. As piggy
bank transactions need to be unlinkable ...


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

Input:
title:BBA+: Improving the Security and Applicability of Privacy-Preserving
Point Collection
author:Gunnar Hartung and
Max Hoffmann and
Matthias Nagel and
Andy Rupp
BBA+: Improving the Security and Applicability of
Privacy-Preserving Point Collection
Gunnar Hartung∗
Karlsruhe Institute of Technology
Department of Informatics
Karlsruhe, Germany
gunnar.hartung@kit.edu
Matthias Nagel‡
Karlsruhe Institute of Technology
Department of Informatics
Karlsruhe, Germany
matthias.nagel@kit.edu
Max Hoffmann†
Ruhr-Universität Bochum
Horst Görtz Institute for IT-Security
Bochum, Germany
max.hoffmann@rub.de
Andy Rupp§
Karlsruhe Institute of Technology
Department of Informatics
Karlsruhe, Germany
andy.rupp@kit.edu
ABSTRACT
Black-box accumulation (BBA) has recently been introduced as a
building-block for a variety of user-centric protocols such as loyalty,
refund, and incentive systems. Loosely speaking, this building block
may be viewed as a cryptographic “piggy bank” that allows a user
to collect points (aka incentives, coins, etc.) in an anonymous and
unlinkable way. A piggy bank may be “robbed” at some point by a
user, letting her spend the collected points, thereby only revealing
the total amount inside the piggy bank and its unique serial number.
In this paper we present BBA+, a definitional framework ex-
tending the BBA model in multiple ways: (1) We support offline
systems in the sense that there does not need to be a permanent
connection to a serial number database to check whether a pre-
sented piggy bank has already been robbed. (2) We enforce the
collection of “negative points” which users may not voluntarily
collect, as this is, for example, needed in pre-payment or reputation
systems. (3) The security property formalized for BBA+ schemes is
stronger and more natural than for BBA: Essentially, we demand
that the amount claimed to be inside a piggy bank must be exactly
the amount legitimately collected with this piggy bank. As piggy
bank transactions need to be unlinkable ...

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


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

Output:
安全论文分析：

title:All Your Clicks Belong to Me: Investigating Click Interception on
the Web
author:Mingxue Zhang and
Wei Meng and
Sangho Lee and
Byoungyoung Lee and
Xinyu Xing
All Your Clicks Belong to Me:
Investigating Click Interception on the Web
Mingxue Zhang and Wei Meng, Chinese University of Hong Kong; Sangho Lee,
Microsoft Research; Byoungyoung Lee, Seoul National University and Purdue University;
Xinyu Xing, Pennsylvania State University
https://www.usenix.org/conference/usenixsecurity19/presentation/zhang
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.All Your Clicks Belong to Me: Investigating Click Interception on the Web
Mingxue Zhang
Chinese University of Hong Kong
Byoungyoung Lee
Seoul National University
Purdue University
Wei Meng
Chinese University of Hong Kong
Xinyu Xing
Pennsylvania State University
Sangho Lee
Microsoft Research
Abstract
Click is the prominent way that users interact with web appli-
cations. For example, we click hyperlinks to navigate among
different pages on the Web, click form submission buttons
to send data to websites, and click player controls to tune
video playback. Clicks are also critical in online advertising,
which fuels the revenue of billions of websites. Because of
the critical role of clicks in the Web ecosystem, attackers aim
to intercept genuine user clicks to either send malicious com-
mands to another application on behalf of the user or fabricate
realistic ad click traffic. However, existing studies mainly
consider one type of click interceptions in the cross-origin
settings via iframes, i.e., clickjacking. This does not compre-
hensively represent various types of click interceptions that
can be launched by malicious third-party JavaScript code.
In this paper, we therefore systematically investigate the
click interception practices on th...


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

Input:
title:All Your Clicks Belong to Me: Investigating Click Interception on
the Web
author:Mingxue Zhang and
Wei Meng and
Sangho Lee and
Byoungyoung Lee and
Xinyu Xing
All Your Clicks Belong to Me:
Investigating Click Interception on the Web
Mingxue Zhang and Wei Meng, Chinese University of Hong Kong; Sangho Lee,
Microsoft Research; Byoungyoung Lee, Seoul National University and Purdue University;
Xinyu Xing, Pennsylvania State University
https://www.usenix.org/conference/usenixsecurity19/presentation/zhang
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.All Your Clicks Belong to Me: Investigating Click Interception on the Web
Mingxue Zhang
Chinese University of Hong Kong
Byoungyoung Lee
Seoul National University
Purdue University
Wei Meng
Chinese University of Hong Kong
Xinyu Xing
Pennsylvania State University
Sangho Lee
Microsoft Research
Abstract
Click is the prominent way that users interact with web appli-
cations. For example, we click hyperlinks to navigate among
different pages on the Web, click form submission buttons
to send data to websites, and click player controls to tune
video playback. Clicks are also critical in online advertising,
which fuels the revenue of billions of websites. Because of
the critical role of clicks in the Web ecosystem, attackers aim
to intercept genuine user clicks to either send malicious com-
mands to another application on behalf of the user or fabricate
realistic ad click traffic. However, existing studies mainly
consider one type of click interceptions in the cross-origin
settings via iframes, i.e., clickjacking. This does not compre-
hensively represent various types of click interceptions that
can be launched by malicious third-party JavaScript code.
In this paper, we therefore systematically investigate the
click interception practices on th...

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


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

Output:
安全论文分析：

title:Is FIDO2 the Kingslayer of User Authentication? A Comparative
Usability Study of FIDO2 Passwordless Authentication
author:Sanam Ghorbani Lyastani and
Michael Schilling and
Michaela Neumayr and
Michael Backes and
Sven Bugiel
2020 IEEE Symposium on Security and Privacy
Is FIDO2 the Kingslayer of User Authentication?
A Comparative Usability Study of FIDO2
Passwordless Authentication
Sanam Ghorbani Lyastani, Michael Schilling, Michaela Neumayr, Michael Backes, Sven Bugiel
CISPA Helmholtz Center for Information Security
Saarbrücken, Germany
{sanam.lyastani, michael.schilling, neumayr, backes, bugiel}@cispa.saarland
Abstract—The newest contender for succeeding passwords as
the incumbent web authentication scheme is the FIDO2 standard.
Jointly developed and backed by the FIDO Alliance and the
W3C, FIDO2 has found support in virtually every browser,
ﬁnds increasing support by service providers, and has adoptions
beyond browser-software on its way. While it supports MFA and
2FA, its single-factor, passwordless authentication with security
tokens has received the bulk of attention and was hailed by
its supporters and the media as the solution that will replace
text-passwords on the web. Despite its obvious security and
deployability beneﬁts—a setting that no prior solution had in
this strong combination—the paradigm shift from a familiar
knowledge factor to purely a possession factor raises questions
about the acceptance of passwordless authentication by end-users.
This paper presents the ﬁrst large-scale lab study of FIDO2
single-factor authentication to collect insights about end-users’
perception, acceptance, and concerns about passwordless au-
thentication. Through hands-on tasks our participants gather
ﬁrst-hand experience with passwordless authentication using a
security key, which they afterwards reﬂect on in a survey. Our
results show that users are willing to accept a direct replacement
of text-based passwords with a security key for single-factor
authenticatio...


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

Input:
title:Is FIDO2 the Kingslayer of User Authentication? A Comparative
Usability Study of FIDO2 Passwordless Authentication
author:Sanam Ghorbani Lyastani and
Michael Schilling and
Michaela Neumayr and
Michael Backes and
Sven Bugiel
2020 IEEE Symposium on Security and Privacy
Is FIDO2 the Kingslayer of User Authentication?
A Comparative Usability Study of FIDO2
Passwordless Authentication
Sanam Ghorbani Lyastani, Michael Schilling, Michaela Neumayr, Michael Backes, Sven Bugiel
CISPA Helmholtz Center for Information Security
Saarbrücken, Germany
{sanam.lyastani, michael.schilling, neumayr, backes, bugiel}@cispa.saarland
Abstract—The newest contender for succeeding passwords as
the incumbent web authentication scheme is the FIDO2 standard.
Jointly developed and backed by the FIDO Alliance and the
W3C, FIDO2 has found support in virtually every browser,
ﬁnds increasing support by service providers, and has adoptions
beyond browser-software on its way. While it supports MFA and
2FA, its single-factor, passwordless authentication with security
tokens has received the bulk of attention and was hailed by
its supporters and the media as the solution that will replace
text-passwords on the web. Despite its obvious security and
deployability beneﬁts—a setting that no prior solution had in
this strong combination—the paradigm shift from a familiar
knowledge factor to purely a possession factor raises questions
about the acceptance of passwordless authentication by end-users.
This paper presents the ﬁrst large-scale lab study of FIDO2
single-factor authentication to collect insights about end-users’
perception, acceptance, and concerns about passwordless au-
thentication. Through hands-on tasks our participants gather
ﬁrst-hand experience with passwordless authentication using a
security key, which they afterwards reﬂect on in a survey. Our
results show that users are willing to accept a direct replacement
of text-based passwords with a security key for single-factor
authenticatio...

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


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

Output:
安全论文分析：

title:Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural
Networks
author:Kang Liu and
Brendan Dolan-Gavitt and
Siddharth Garg
Fine-Pruning: Defending Against
Backdooring Attacks on Deep
Neural Networks
Kang Liu(B), Brendan Dolan-Gavitt, and Siddharth Garg
New York University, Brooklyn, NY, USA
{kang.liu,brendandg,siddharth.garg}@nyu.edu
Abstract. Deep neural networks (DNNs) provide excellent performance
across a wide range of classiﬁcation tasks, but their training requires
high computational resources and is often outsourced to third parties.
Recent work has shown that outsourced training introduces the risk that
a malicious trainer will return a backdoored DNN that behaves normally
on most inputs but causes targeted misclassiﬁcations or degrades the
accuracy of the network when a trigger known only to the attacker is
present. In this paper, we provide the ﬁrst eﬀective defenses against back-
door attacks on DNNs. We implement three backdoor attacks from prior
work and use them to investigate two promising defenses, pruning and
ﬁne-tuning. We show that neither, by itself, is suﬃcient to defend against
sophisticated attackers. We then evaluate ﬁne-pruning, a combination of
pruning and ﬁne-tuning, and show that it successfully weakens or even
eliminates the backdoors, i.e., in some cases reducing the attack success
rate to 0% with only a 0.4% drop in accuracy for clean (non-triggering)
inputs. Our work provides the ﬁrst step toward defenses against backdoor
attacks in deep neural networks.
Keywords: Deep learning · Backdoor · Trojan · Pruning · Fine-tuning
1 Introduction
Deep learning has, over the past ﬁve years, come to dominate the ﬁeld of machine
learning as deep learning based approaches have been shown to outperform con-
ventional techniques in domains such as image recognition [1], speech recogni-
tion [17], and automated machine translation of natural language [6,21]. Training
these networks requires large amounts of data and high computationa...


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

Input:
title:Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural
Networks
author:Kang Liu and
Brendan Dolan-Gavitt and
Siddharth Garg
Fine-Pruning: Defending Against
Backdooring Attacks on Deep
Neural Networks
Kang Liu(B), Brendan Dolan-Gavitt, and Siddharth Garg
New York University, Brooklyn, NY, USA
{kang.liu,brendandg,siddharth.garg}@nyu.edu
Abstract. Deep neural networks (DNNs) provide excellent performance
across a wide range of classiﬁcation tasks, but their training requires
high computational resources and is often outsourced to third parties.
Recent work has shown that outsourced training introduces the risk that
a malicious trainer will return a backdoored DNN that behaves normally
on most inputs but causes targeted misclassiﬁcations or degrades the
accuracy of the network when a trigger known only to the attacker is
present. In this paper, we provide the ﬁrst eﬀective defenses against back-
door attacks on DNNs. We implement three backdoor attacks from prior
work and use them to investigate two promising defenses, pruning and
ﬁne-tuning. We show that neither, by itself, is suﬃcient to defend against
sophisticated attackers. We then evaluate ﬁne-pruning, a combination of
pruning and ﬁne-tuning, and show that it successfully weakens or even
eliminates the backdoors, i.e., in some cases reducing the attack success
rate to 0% with only a 0.4% drop in accuracy for clean (non-triggering)
inputs. Our work provides the ﬁrst step toward defenses against backdoor
attacks in deep neural networks.
Keywords: Deep learning · Backdoor · Trojan · Pruning · Fine-tuning
1 Introduction
Deep learning has, over the past ﬁve years, come to dominate the ﬁeld of machine
learning as deep learning based approaches have been shown to outperform con-
ventional techniques in domains such as image recognition [1], speech recogni-
tion [17], and automated machine translation of natural language [6,21]. Training
these networks requires large amounts of data and high computationa...

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


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

Output:
安全论文分析：

title:The Good, the Bad, and the Differences: Better Network Diagnostics
with Differential Provenance
author:Ang Chen and
Yang Wu and
Andreas Haeberlen and
Wenchao Zhou and
Boon Thau Loo
The Good, the Bad, and the Differences:
Better Network Diagnostics with
Differential Provenance
Ang Chen
Yang Wu
University of Pennsylvania
University of Pennsylvania
Andreas Haeberlen
Wenchao Zhou
Boon Thau Loo
University of Pennsylvania
Georgetown University
University of Pennsylvania
ABSTRACT
In this paper, we propose a new approach to diagnosing prob-
lems in distributed systems. Our approach is based on the in-
sight that many of the trickiest problems are anomalies. For
instance, in a network, problems often affect only a small
fraction of the trafﬁc (perhaps a certain subnet), or they only
manifest infrequently. Thus, it is quite common for the op-
erator to have “examples” of both working and non-working
trafﬁc readily available – perhaps a packet that was mis-
routed, and a similar packet that was routed correctly.
In
this case, the cause of the problem is likely to be wherever
the two packets were treated differently by the network.
We present the design of a debugger that can leverage this
information using a novel concept that we call differential
provenance. Differential provenance tracks the causal con-
nections between network states and state changes, just like
classical provenance, but it can additionally perform root-
cause analysis by reasoning about the differences between
two provenance trees. We have built a diagnostic tool that
is based on differential provenance, and we have used our
tool to debug a number of complex, realistic problems in
two scenarios: software-deﬁned networks and MapReduce
jobs. Our results show that differential provenance can de-
liver very concise diagnostic information; in many cases, it
can even identify the precise root cause of the problem.
CCS Concepts
•Networks → Network management; Network experimen-
tation; •Information systems ...


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

Input:
title:The Good, the Bad, and the Differences: Better Network Diagnostics
with Differential Provenance
author:Ang Chen and
Yang Wu and
Andreas Haeberlen and
Wenchao Zhou and
Boon Thau Loo
The Good, the Bad, and the Differences:
Better Network Diagnostics with
Differential Provenance
Ang Chen
Yang Wu
University of Pennsylvania
University of Pennsylvania
Andreas Haeberlen
Wenchao Zhou
Boon Thau Loo
University of Pennsylvania
Georgetown University
University of Pennsylvania
ABSTRACT
In this paper, we propose a new approach to diagnosing prob-
lems in distributed systems. Our approach is based on the in-
sight that many of the trickiest problems are anomalies. For
instance, in a network, problems often affect only a small
fraction of the trafﬁc (perhaps a certain subnet), or they only
manifest infrequently. Thus, it is quite common for the op-
erator to have “examples” of both working and non-working
trafﬁc readily available – perhaps a packet that was mis-
routed, and a similar packet that was routed correctly.
In
this case, the cause of the problem is likely to be wherever
the two packets were treated differently by the network.
We present the design of a debugger that can leverage this
information using a novel concept that we call differential
provenance. Differential provenance tracks the causal con-
nections between network states and state changes, just like
classical provenance, but it can additionally perform root-
cause analysis by reasoning about the differences between
two provenance trees. We have built a diagnostic tool that
is based on differential provenance, and we have used our
tool to debug a number of complex, realistic problems in
two scenarios: software-deﬁned networks and MapReduce
jobs. Our results show that differential provenance can de-
liver very concise diagnostic information; in many cases, it
can even identify the precise root cause of the problem.
CCS Concepts
•Networks → Network management; Network experimen-
tation; •Information systems ...

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


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

Output:
安全论文分析：

title:POSTER: Recovering Songs from a Hanging Light Bulb
author:Ben Nassi and
Yaron Pirutin and
Raz Swissa and
Adi Shamir and
Yuval Elovici and
Boris Zadov
Recovering Songs from a Hanging Light Bulb
Ben Nassi
Yaron Pirutin
Raz Swissa
nassib@post.bgu.ac.il
yaronpir@post.bgu.ac.il
Ben-Gurion University of the Negev
Ben-Gurion University of the Negev
Ben-Gurion University of the Negev
razsw@post.bgu.ac.il
Be’er Sheva, Israel
Boris Zadov
zadov@post.bgu.ac.il
Be’er Sheva, Israel
Be’er Sheva, Israel
Adi Shamir
adi.shamir@weizmann.ac.il
Weizmann Institute of Science
Rehovot, Israel
Be’er Sheva, Israel
Yuval Elovici
elovici@bgu.ac.il
Be’er Sheva, Israel
Ben-Gurion University of the Negev
Ben-Gurion University of the Negev
Abstract
In this paper, we introduce a novel side-channel attack for eaves-
dropping sound using an electro-optical sensor. We show how
small vibrations of a hanging bulb (in response to sound hitting its
surface), can be exploited by eavesdroppers to recover sound. We
evaluate our method’s performance in a realistic setup and show
that our method can be used by eavesdroppers to recover songs
from a target room containing the hanging light bulb.
CCS Concepts
• Security and privacy;
Keywords
Privacy, Sound Recovery, Side-Channel Attack
ACM Reference Format:
Ben Nassi, Yaron Pirutin, Raz Swissa, Adi Shamir, Yuval Elovici, and Boris
Zadov. 2021. POSTER: Recovering Songs from a Hanging Light Bulb. In
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Commu-
nications Security (CCS ’21), November 15–19, 2021, Virtual Event, Repub-
lic of Korea. ACM, New York, NY, USA, 3 pages. https://doi.org/10.1145/
3460120.3485336
1 Introduction
In recent years, several studies [2, 3, 5, 8] have shown that mea-
surements obtained from motion sensors located in proximity of
a victim can be used for the classification of words. These studies
variously demonstrated that the response of MEMS gyroscopes [5],
and accelerometers [2, 3, 8] to sound can be used to classify...