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

Input:
title:Rusted Anchors: A National Client-Side View of Hidden Root CAs in
the Web PKI Ecosystem
author:Yiming Zhang and
Baojun Liu and
Chaoyi Lu and
Zhou Li and
Haixin Duan and
Jiachen Li and
Zaifeng Zhang
Rusted Anchors: A National Client-Side View of Hidden Root
CAs in the Web PKI Ecosystem
Yiming Zhang1,2, Baojun Liu1 !, Chaoyi Lu1,3, Zhou Li4
Haixin Duan1,5 !, Jiachen Li1 and Zaifeng Zhang3
1 Tsinghua University, China 2 Beijing National Research Center for Information Science and Technology, China
3 360Netlab, China 4 University of California, Irvine, USA 5 QI-ANXIN Technology Research Institute, China
ABSTRACT
HTTPS secures communications in the web and heavily relies on
the Web PKI for authentication. In the Web PKI, Certificate Author-
ities (CAs) are organizations that provide trust and issue digital
certificates. Web clients rely on public root stores maintained by
operating systems or browsers, with hundreds of audited CAs as
trust anchors. However, as reported by security incidents, hidden
root CAs beyond the public root programs have been imported into
local root stores, which allows adversaries to gain trust from web
clients.
In this paper, we provide the first client-side, nation-wide view of
hidden root CAs in the Web PKI ecosystem. Through cooperation
with a leading browser vendor, we analyze certificate chains in
web visits, together with their verification statuses, from volunteer
users in 5 months. In total, over 1.17 million hidden root certificates
are captured and they cause a profound impact from the angle
of web clients and traffic. Further, we identify around 5 thousand
organizations that hold hidden root certificates, including fake root
CAs that impersonate large trusted ones. Finally, we highlight that
the implementation of hidden root CAs and certificates is highly
flawed, and issues such as weak keys and signature algorithms are
prevalent. Our findings uncover that the ecosystem of hidden root
CAs is massive and dynamic, and shed light o...

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


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

Output:
安全论文分析：

title:Undermining User Privacy on Mobile Devices Using AI
author:Berk G"ulmezoglu and
Andreas Zankl and
M. Caner Tol and
Saad Islam and
Thomas Eisenbarth and
Berk Sunar
Undermining User Privacy on Mobile Devices Using AI
Berk Gulmezoglu
M. Caner Tol
Andreas Zankl
Fraunhofer AISEC
andreas.zankl@aisec.fraunhofer.de
Worcester Polytechnic Institute
bgulmezoglu@wpi.edu
Middle East Technical University
caner.tol@metu.edu.tr
Saad Islam
Worcester Polytechnic Institute
sislam@wpi.edu
Thomas Eisenbarth
University of Lübeck
thomas.eisenbarth@uni-luebeck.de
Berk Sunar
Worcester Polytechnic Institute
sunar@wpi.edu
ABSTRACT
Over the past years, literature has shown that attacks exploiting
the microarchitecture of modern processors pose a serious threat to
user privacy. This is because applications leave distinct footprints in
the processor, which malware can use to infer user activities. In this
work, we show that these inference attacks can greatly be enhanced
with advanced AI techniques. In particular, we focus on profiling
the activity in the last-level cache (LLC) of ARM processors. We
employ a simple Prime+Probe based monitoring technique to ob-
tain cache traces, which we classify with deep learning methods
including convolutional neural networks. We demonstrate our ap-
proach on an off-the-shelf Android phone by launching a successful
attack from an unprivileged, zero-permission app in well under
a minute. The app detects running applications, opened websites,
and streaming videos with up to 98% accuracy and a profiling phase
of at most 6 seconds. This is possible, as deep learning compensates
measurement disturbances stemming from the inherently noisy
LLC monitoring and unfavorable cache characteristics. In summary,
our results show that thanks to advanced AI techniques, inference
attacks are becoming alarmingly easy to execute in practice. This
once more calls for countermeasures that confine microarchitec-
tural leakage and protect mobile phone applications, especi...


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

Input:
title:Undermining User Privacy on Mobile Devices Using AI
author:Berk G"ulmezoglu and
Andreas Zankl and
M. Caner Tol and
Saad Islam and
Thomas Eisenbarth and
Berk Sunar
Undermining User Privacy on Mobile Devices Using AI
Berk Gulmezoglu
M. Caner Tol
Andreas Zankl
Fraunhofer AISEC
andreas.zankl@aisec.fraunhofer.de
Worcester Polytechnic Institute
bgulmezoglu@wpi.edu
Middle East Technical University
caner.tol@metu.edu.tr
Saad Islam
Worcester Polytechnic Institute
sislam@wpi.edu
Thomas Eisenbarth
University of Lübeck
thomas.eisenbarth@uni-luebeck.de
Berk Sunar
Worcester Polytechnic Institute
sunar@wpi.edu
ABSTRACT
Over the past years, literature has shown that attacks exploiting
the microarchitecture of modern processors pose a serious threat to
user privacy. This is because applications leave distinct footprints in
the processor, which malware can use to infer user activities. In this
work, we show that these inference attacks can greatly be enhanced
with advanced AI techniques. In particular, we focus on profiling
the activity in the last-level cache (LLC) of ARM processors. We
employ a simple Prime+Probe based monitoring technique to ob-
tain cache traces, which we classify with deep learning methods
including convolutional neural networks. We demonstrate our ap-
proach on an off-the-shelf Android phone by launching a successful
attack from an unprivileged, zero-permission app in well under
a minute. The app detects running applications, opened websites,
and streaming videos with up to 98% accuracy and a profiling phase
of at most 6 seconds. This is possible, as deep learning compensates
measurement disturbances stemming from the inherently noisy
LLC monitoring and unfavorable cache characteristics. In summary,
our results show that thanks to advanced AI techniques, inference
attacks are becoming alarmingly easy to execute in practice. This
once more calls for countermeasures that confine microarchitec-
tural leakage and protect mobile phone applications, especi...

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


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

Output:
安全论文分析：

title:Donky: Domain Keys - Efficient In-Process Isolation for RISC-V and
x86
author:David Schrammel and
Samuel Weiser and
Stefan Steinegger and
Martin Schwarzl and
Michael Schwarz and
Stefan Mangard and
Daniel Gruss
Donky: Domain Keys – Efficient In-Process Isolation
for RISC-V and x86
David Schrammel, Samuel Weiser, Stefan Steinegger, Martin Schwarzl, Michael
Schwarz, Stefan Mangard, and Daniel Gruss, Graz University of Technology
https://www.usenix.org/conference/usenixsecurity20/presentation/schrammel
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Donky: Domain Keys – Efﬁcient In-Process Isolation
for RISC-V and x86
David Schrammel, Samuel Weiser, Stefan Steinegger, Martin Schwarzl,
Michael Schwarz, Stefan Mangard, Daniel Gruss
Graz University of Technology
Abstract
Efﬁcient and secure in-process isolation is in great demand,
as evidenced in the shift towards JavaScript and the recent re-
vival of memory protection keys. Yet, state-of-the-art systems
do not offer strong security or struggle with frequent domain
crossings and oftentimes intrusive kernel modiﬁcations.
We propose Donky, an efﬁcient hardware-software co-
design for strong in-process isolation based on dynamic mem-
ory protection domains. The two components of our design
are a secure software framework and a non-intrusive hardware
extension. We facilitate domain switches entirely in userspace,
thus minimizing switching overhead as well as kernel com-
plexity. We show the versatility of Donky in three realistic use
cases, secure V8 sandboxing, software vaults, and untrusted
third-party libraries. We provide an open-source implemen-
tation on a RISC-V Ariane CPU and an Intel-MPK-based
emulation mode for x86. We evaluate the security and per-
formance of our implementation for RISC-V synthesized on
an FPGA. We also evaluate the performance on x...


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

Input:
title:Donky: Domain Keys - Efficient In-Process Isolation for RISC-V and
x86
author:David Schrammel and
Samuel Weiser and
Stefan Steinegger and
Martin Schwarzl and
Michael Schwarz and
Stefan Mangard and
Daniel Gruss
Donky: Domain Keys – Efficient In-Process Isolation
for RISC-V and x86
David Schrammel, Samuel Weiser, Stefan Steinegger, Martin Schwarzl, Michael
Schwarz, Stefan Mangard, and Daniel Gruss, Graz University of Technology
https://www.usenix.org/conference/usenixsecurity20/presentation/schrammel
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Donky: Domain Keys – Efﬁcient In-Process Isolation
for RISC-V and x86
David Schrammel, Samuel Weiser, Stefan Steinegger, Martin Schwarzl,
Michael Schwarz, Stefan Mangard, Daniel Gruss
Graz University of Technology
Abstract
Efﬁcient and secure in-process isolation is in great demand,
as evidenced in the shift towards JavaScript and the recent re-
vival of memory protection keys. Yet, state-of-the-art systems
do not offer strong security or struggle with frequent domain
crossings and oftentimes intrusive kernel modiﬁcations.
We propose Donky, an efﬁcient hardware-software co-
design for strong in-process isolation based on dynamic mem-
ory protection domains. The two components of our design
are a secure software framework and a non-intrusive hardware
extension. We facilitate domain switches entirely in userspace,
thus minimizing switching overhead as well as kernel com-
plexity. We show the versatility of Donky in three realistic use
cases, secure V8 sandboxing, software vaults, and untrusted
third-party libraries. We provide an open-source implemen-
tation on a RISC-V Ariane CPU and an Intel-MPK-based
emulation mode for x86. We evaluate the security and per-
formance of our implementation for RISC-V synthesized on
an FPGA. We also evaluate the performance on x...

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


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

Output:
安全论文分析：

title:Proxy Re-Encryption Based on Homomorphic Encryption
author:Reda Bellafqira and
Gouenou Coatrieux and
Dalel Bouslimi and
Gw'enol'e Quellec and
Michel Cozic
Proxy Re-Encryption Based on Homomorphic Encryption
Reda Bellafqira
IMT Atlantique
Brest, Cedex, France
reda.bellafqira@imt-atlantique.fr
Gouenou Coatrieux
IMT Atlantique
Brest, Cedex, France
gouenou.coatrieux@imt-atlantique.fr
Dalel Bouslimi
IMT Atlantique
Brest, Cedex, France
dalel.bouslimi@imt-atlantique.fr
Gwénolé Quellec
gwenole.quellec@inserm.fr
Inserm
Brest, France
Michel Cozic
MED.e.COM
Plougastel Daoulas, France
mcozic@wanadoo.fr
ABSTRACT
In this paper, we propose an homomorphic proxy re-encryption
scheme (HPRE) that allows different users to share data they out-
sourced homomorphically encrypted using their respective public
keys with the possibility by next to process such data remotely.
Its originality stands on a solution we propose so as to compute
the difference of data encrypted with Damgard-Jurik cryptosystem.
It takes also advantage of a secure combined linear congruential
generator that we implemented in the Damgard-Jurik encrypted
domain. Basically, in our HPRE scheme, the two users, the delegator
and the delegate, ask the cloud server to generate an encrypted noise
based on a secret key, both users previously agreed on. Based on
our solution to compute the difference in Damgard-Jurik encrypted
domain, the cloud computes in clear the differences in-between the
encrypted noise and the encrypted data of the delegator, obtaining
thus blinded data. In order the delegate gets access to the data,
the cloud just has to encrypt these differences using the delegate’s
public key and then removes the noise. This solution doesn’t need
extra communication between the cloud and the delegator. Our
HPRE was implemented in the case of the sharing of uncompressed
images stored in the cloud showing good time computation perfor-
mance, it is unidirectional and collusion-resistant. Nevertheless, it
...


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

Input:
title:Proxy Re-Encryption Based on Homomorphic Encryption
author:Reda Bellafqira and
Gouenou Coatrieux and
Dalel Bouslimi and
Gw'enol'e Quellec and
Michel Cozic
Proxy Re-Encryption Based on Homomorphic Encryption
Reda Bellafqira
IMT Atlantique
Brest, Cedex, France
reda.bellafqira@imt-atlantique.fr
Gouenou Coatrieux
IMT Atlantique
Brest, Cedex, France
gouenou.coatrieux@imt-atlantique.fr
Dalel Bouslimi
IMT Atlantique
Brest, Cedex, France
dalel.bouslimi@imt-atlantique.fr
Gwénolé Quellec
gwenole.quellec@inserm.fr
Inserm
Brest, France
Michel Cozic
MED.e.COM
Plougastel Daoulas, France
mcozic@wanadoo.fr
ABSTRACT
In this paper, we propose an homomorphic proxy re-encryption
scheme (HPRE) that allows different users to share data they out-
sourced homomorphically encrypted using their respective public
keys with the possibility by next to process such data remotely.
Its originality stands on a solution we propose so as to compute
the difference of data encrypted with Damgard-Jurik cryptosystem.
It takes also advantage of a secure combined linear congruential
generator that we implemented in the Damgard-Jurik encrypted
domain. Basically, in our HPRE scheme, the two users, the delegator
and the delegate, ask the cloud server to generate an encrypted noise
based on a secret key, both users previously agreed on. Based on
our solution to compute the difference in Damgard-Jurik encrypted
domain, the cloud computes in clear the differences in-between the
encrypted noise and the encrypted data of the delegator, obtaining
thus blinded data. In order the delegate gets access to the data,
the cloud just has to encrypt these differences using the delegate’s
public key and then removes the noise. This solution doesn’t need
extra communication between the cloud and the delegator. Our
HPRE was implemented in the case of the sharing of uncompressed
images stored in the cloud showing good time computation perfor-
mance, it is unidirectional and collusion-resistant. Nevertheless, it
...

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


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

Output:
安全论文分析：

title:An Efficient Man-Machine Recognition Method Based On Mouse Trajectory
Feature De-redundancy
author:Xiaofeng Lu and
Zhenhan Feng and
Jupeng Xia
An Efficient Man-Machine Recognition Method Based On Mouse
Trajectory Feature De-redundancy
Xiaofeng Lu
luxf@bupt.edu.cn
School of Cyberspace Security,
Beijing University of Posts and
Telecommunications
Beijing, China
Zhenhan Feng
pixel@bupt.edu.cn
School of Cyberspace Security,
Beijing University of Posts and
Telecommunications
Beijing, China
Jupeng Xia
jupeng.xia@antgroup.com
Alipay (Hangzhou) Information &
Technology Co., Ltd.
Hangzhou, China
ABSTRACT
Behavioral authentication codes are widely used to resist abnor-
mal network traffic. Mouse sliding behavior as an authentication
method has the characteristics of less private information and easy
data sampling. This paper analyses the attack mode of the machine
sliding track data, extracts the physical quantity characteristics of
the sliding path. Features importance scores are used to select the
candidate features, and further Pearson correlation co- efficient
is used to filter out the features with high correlation. This paper
use XGBoost model as a classifier. In addition, an efficient evasion
attack detection method is proposed to deal with complex human
behavior evasion attacks. The experiment was carried out on two
mouse sliding datasets. The experimental results show that the
proposed method achieves 99.09% accuracy and 99.88% recall rate,
and can complete the man-machine identification in 2ms.
CCS CONCEPTS
• Security and privacy → Biometrics; • Computing method-
ologies → Boosting.
KEYWORDS
Behavior Authentication Code, Human-Machine Recognition, Mouse
Trajectory, Evasion Attack Detection, Machine Learning
ACM Reference Format:
Xiaofeng Lu, Zhenhan Feng, and Jupeng Xia. 2021. An Efficient Man-Machine
Recognition Method Based On Mouse Trajectory Feature De-redundancy.
In Annual Computer Security Applications Conference (ACSAC ’21), Decem-
ber 6–10, 2021, Virtua...


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

Input:
title:An Efficient Man-Machine Recognition Method Based On Mouse Trajectory
Feature De-redundancy
author:Xiaofeng Lu and
Zhenhan Feng and
Jupeng Xia
An Efficient Man-Machine Recognition Method Based On Mouse
Trajectory Feature De-redundancy
Xiaofeng Lu
luxf@bupt.edu.cn
School of Cyberspace Security,
Beijing University of Posts and
Telecommunications
Beijing, China
Zhenhan Feng
pixel@bupt.edu.cn
School of Cyberspace Security,
Beijing University of Posts and
Telecommunications
Beijing, China
Jupeng Xia
jupeng.xia@antgroup.com
Alipay (Hangzhou) Information &
Technology Co., Ltd.
Hangzhou, China
ABSTRACT
Behavioral authentication codes are widely used to resist abnor-
mal network traffic. Mouse sliding behavior as an authentication
method has the characteristics of less private information and easy
data sampling. This paper analyses the attack mode of the machine
sliding track data, extracts the physical quantity characteristics of
the sliding path. Features importance scores are used to select the
candidate features, and further Pearson correlation co- efficient
is used to filter out the features with high correlation. This paper
use XGBoost model as a classifier. In addition, an efficient evasion
attack detection method is proposed to deal with complex human
behavior evasion attacks. The experiment was carried out on two
mouse sliding datasets. The experimental results show that the
proposed method achieves 99.09% accuracy and 99.88% recall rate,
and can complete the man-machine identification in 2ms.
CCS CONCEPTS
• Security and privacy → Biometrics; • Computing method-
ologies → Boosting.
KEYWORDS
Behavior Authentication Code, Human-Machine Recognition, Mouse
Trajectory, Evasion Attack Detection, Machine Learning
ACM Reference Format:
Xiaofeng Lu, Zhenhan Feng, and Jupeng Xia. 2021. An Efficient Man-Machine
Recognition Method Based On Mouse Trajectory Feature De-redundancy.
In Annual Computer Security Applications Conference (ACSAC ’21), Decem-
ber 6–10, 2021, Virtua...

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


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

Output:
安全论文分析：

title:SWIRL: A Scalable Watermark to Detect Correlated Network Flows
author:Amir Houmansadr and
Nikita Borisov
SWIRL: A Scalable Watermark to Detect Correlated Network Flows
Amir Houmansadr
Nikita Borisov
Department of Electrical and Computer Engineering
E-mail: {ahouman2,nikita}@illinois.edu
University of Illinois at Urbana-Champaign
Abstract
Flow watermarks are active trafﬁc analysis techniques
that help establish a causal connection between two net-
work ﬂows by content-independent manipulations, e.g., al-
tering packet timings. Watermarks provide a much more
scalable approach for ﬂow correlation than passive trafﬁc
analysis. Previous designs of scalable watermarks, how-
ever, were subject to multi-ﬂow attacks. They also intro-
duced delays too large to be used in most environments.
We design SWIRL, a Scalable Watermark that is Invisi-
ble and Resilient to packet Losses. SWIRL is the ﬁrst water-
mark that is practical to use for large-scale trafﬁc analysis.
SWIRL uses a ﬂow-dependent approach to resist multi-ﬂow
attacks, marking each ﬂow with a different pattern. SWIRL
is robust to packet losses and network jitter, yet it intro-
duces only small delays that are invisible to both benign
users and determined adversaries. We analyze the perfor-
mance of SWIRL both analytically and on the PlanetLab
testbed, demonstrating very low error rates. We consider
applications of SWIRL to stepping stone detection and link-
ing anonymous communication. We also propose a novel
application of watermarks to defend against congestion at-
tacks on Tor.
1
Introduction
Network intruders usually try to hide their real location
by relaying their trafﬁc through a number of intermediate
hosts, called stepping stones [25]. The trafﬁc is encrypted,
preventing simple identiﬁcation of stepping stones; instead,
trafﬁc analysis techniques are used to ﬁnd ﬂows that have
similar characteristics, based on features such as packet tim-
ings, counts, and sizes [3, 6, 17, 20, 23, 25]. Trafﬁc analysis
...


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

Input:
title:SWIRL: A Scalable Watermark to Detect Correlated Network Flows
author:Amir Houmansadr and
Nikita Borisov
SWIRL: A Scalable Watermark to Detect Correlated Network Flows
Amir Houmansadr
Nikita Borisov
Department of Electrical and Computer Engineering
E-mail: {ahouman2,nikita}@illinois.edu
University of Illinois at Urbana-Champaign
Abstract
Flow watermarks are active trafﬁc analysis techniques
that help establish a causal connection between two net-
work ﬂows by content-independent manipulations, e.g., al-
tering packet timings. Watermarks provide a much more
scalable approach for ﬂow correlation than passive trafﬁc
analysis. Previous designs of scalable watermarks, how-
ever, were subject to multi-ﬂow attacks. They also intro-
duced delays too large to be used in most environments.
We design SWIRL, a Scalable Watermark that is Invisi-
ble and Resilient to packet Losses. SWIRL is the ﬁrst water-
mark that is practical to use for large-scale trafﬁc analysis.
SWIRL uses a ﬂow-dependent approach to resist multi-ﬂow
attacks, marking each ﬂow with a different pattern. SWIRL
is robust to packet losses and network jitter, yet it intro-
duces only small delays that are invisible to both benign
users and determined adversaries. We analyze the perfor-
mance of SWIRL both analytically and on the PlanetLab
testbed, demonstrating very low error rates. We consider
applications of SWIRL to stepping stone detection and link-
ing anonymous communication. We also propose a novel
application of watermarks to defend against congestion at-
tacks on Tor.
1
Introduction
Network intruders usually try to hide their real location
by relaying their trafﬁc through a number of intermediate
hosts, called stepping stones [25]. The trafﬁc is encrypted,
preventing simple identiﬁcation of stepping stones; instead,
trafﬁc analysis techniques are used to ﬁnd ﬂows that have
similar characteristics, based on features such as packet tim-
ings, counts, and sizes [3, 6, 17, 20, 23, 25]. Trafﬁc analysis
...

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


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

Output:
安全论文分析：

title:Robust key generation from signal envelopes in wireless networks
author:Babak Azimi-Sadjadi and
Aggelos Kiayias and
Alejandra Mercado and
B"ulent Yener
Robust Key Generation from Signal Envelopes in Wireless
Networks
∗
Babak Azimi-Sadjadi
Intelligent Automation, Inc.
15400 Calhoun Drive, Suite
400 Rockville, MD, USA
babak@i-a-i.com
Aggelos Kiayias
Department of Computer
Science Engineering
University of Connecticut,
Storrs, CT, USA
aggelos@cse.uconn.edu
Alejandra Mercado
Department of Electrical
Computer & Systems
Engineering, Rensselaer
Polytechnic Institute, Troy NY,
and
ADG, Hughes Network
Systems, Germantown MD,
mercado@ecse.rpi.edu
USA
Bulent Yener
Department of Computer
Science
Rensselaer Polytechnic
Institute, Troy, NY, USA
yener@cs.rpi.edu
ABSTRACT
The broadcast nature of a wireless link provides a natural
eavesdropping and intervention capability to an adversary.
Thus, securing a wireless link is essential to the security of
a wireless network, and key generation algorithms are nec-
essary for securing wireless links. However, traditional key
agreement algorithms can be very costly in many settings,
e.g. in wireless ad-hoc networks, since they consume scarce
resources such as bandwidth and battery power.
Traditional key agreement algorithms are not suitable for
wireless ad-hoc networks since they consume scarce resources
such as bandwidth and battery power.
This paper presents a novel approach that couples the
physical layer characteristics of wireless networks with key
generation algorithms. It is based on the wireless commu-
nication phenomenon known as the principle of reciprocity
which states that in the absence of interference both trans-
mitter and receiver experience the same signal envelope.
The key-observation here is that the signal envelope infor-
mation can provide to the two transceivers two correlated
random sources that provide suﬃcient amounts of entropy
which can be used to extract a cryptographic key. In con-
trast, it is virtua...


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

Input:
title:Robust key generation from signal envelopes in wireless networks
author:Babak Azimi-Sadjadi and
Aggelos Kiayias and
Alejandra Mercado and
B"ulent Yener
Robust Key Generation from Signal Envelopes in Wireless
Networks
∗
Babak Azimi-Sadjadi
Intelligent Automation, Inc.
15400 Calhoun Drive, Suite
400 Rockville, MD, USA
babak@i-a-i.com
Aggelos Kiayias
Department of Computer
Science Engineering
University of Connecticut,
Storrs, CT, USA
aggelos@cse.uconn.edu
Alejandra Mercado
Department of Electrical
Computer & Systems
Engineering, Rensselaer
Polytechnic Institute, Troy NY,
and
ADG, Hughes Network
Systems, Germantown MD,
mercado@ecse.rpi.edu
USA
Bulent Yener
Department of Computer
Science
Rensselaer Polytechnic
Institute, Troy, NY, USA
yener@cs.rpi.edu
ABSTRACT
The broadcast nature of a wireless link provides a natural
eavesdropping and intervention capability to an adversary.
Thus, securing a wireless link is essential to the security of
a wireless network, and key generation algorithms are nec-
essary for securing wireless links. However, traditional key
agreement algorithms can be very costly in many settings,
e.g. in wireless ad-hoc networks, since they consume scarce
resources such as bandwidth and battery power.
Traditional key agreement algorithms are not suitable for
wireless ad-hoc networks since they consume scarce resources
such as bandwidth and battery power.
This paper presents a novel approach that couples the
physical layer characteristics of wireless networks with key
generation algorithms. It is based on the wireless commu-
nication phenomenon known as the principle of reciprocity
which states that in the absence of interference both trans-
mitter and receiver experience the same signal envelope.
The key-observation here is that the signal envelope infor-
mation can provide to the two transceivers two correlated
random sources that provide suﬃcient amounts of entropy
which can be used to extract a cryptographic key. In con-
trast, it is virtua...

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


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

Output:
安全论文分析：

title:PDS Steering and Program Committees
author:
PDS Steering and Program Committees
Steering Committee
R.K. Iyer (UIUC, USA) (Chair)
K.S. Trivedi (Duke University, USA) (Co-Chair)
J. Abraham (University of Texas at Austin, USA)
A. Avižienis (Vytautas Magnus University, Lithuania)
G. Balbo (University of Torino, Italy)
R. Chillarege (Chillarege, Inc., USA)
G. Haring (University of Vienna, Austria)
R. Harper (IBM Research, USA)
J.-C. Laprie (LAAS-CNRS, France)
R. Marie (University of Rennes, France)
E.J. McCluskey (Stanford University, USA)
W.H. Sanders (UIUC, USA)
M. Woodside (Carleton University, Canada)
Program Committee
S. Bagchi (Purdue University, USA)
A. Bobbio (University of Piemonte Orientale, Italy)
P. Buchholz (University of Dortmund, Germany)
J. Cao (Hong Kong Polytechnic University, Hong Kong)
J. Carrasco (University of Catalunya, Spain)
R. Chillarege (Chillarege Inc., USA)
G. Ciardo (UC Riverside, USA)
D. Costa (Critical Software, Portugal)
M. Cukier (University of Maryland, USA)
T. Dohi (Hiroshima University, Japan)
J. Dugan (University of Virginia, USA)
K. Goseva-Popstojanova (West Virginia University, USA)
R. Harper (IBM Research, USA)
G. Heijenk (University of Twente, Netherlands)
Z. Kalbarczyk (UIUC, USA)
K. Kanoun (LAAS-CNRS, France)
J. Karlsson (Chalmers University of Technology, Sweden)
K. Keeton (HP Labs, USA)
Y. Kimura (Fujitsu, Japan)
xxv
S.-Y. Kuo (National Taiwan University, Taiwan)
I. Lee (Hanyang University, Korea)
Z. Li (Institute of Computing Technology, China)
H. Madeira (University of Coimbra, Portugal)
M. Massink (CNUCE, Italy)
R. Maxion (Carnegie Mellon University, USA)
V. Mendiratta (Lucent Bell Labs, USA)
A. van Moorsel (Consultant, Germany)
B. Murphy (Microsoft Research, UK)
N. Neves (University of Lisbon, Portugal)
D. Nicol (UIUC, USA)
G. Rubino (IRISA, France)
W.H. Sanders (UIUC, USA)
M. Siegle (UBW München, Germany)
A. Somani (Iowa State University, USA)
A. Tai (IA Tech Inc.,...


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

Input:
title:PDS Steering and Program Committees
author:
PDS Steering and Program Committees
Steering Committee
R.K. Iyer (UIUC, USA) (Chair)
K.S. Trivedi (Duke University, USA) (Co-Chair)
J. Abraham (University of Texas at Austin, USA)
A. Avižienis (Vytautas Magnus University, Lithuania)
G. Balbo (University of Torino, Italy)
R. Chillarege (Chillarege, Inc., USA)
G. Haring (University of Vienna, Austria)
R. Harper (IBM Research, USA)
J.-C. Laprie (LAAS-CNRS, France)
R. Marie (University of Rennes, France)
E.J. McCluskey (Stanford University, USA)
W.H. Sanders (UIUC, USA)
M. Woodside (Carleton University, Canada)
Program Committee
S. Bagchi (Purdue University, USA)
A. Bobbio (University of Piemonte Orientale, Italy)
P. Buchholz (University of Dortmund, Germany)
J. Cao (Hong Kong Polytechnic University, Hong Kong)
J. Carrasco (University of Catalunya, Spain)
R. Chillarege (Chillarege Inc., USA)
G. Ciardo (UC Riverside, USA)
D. Costa (Critical Software, Portugal)
M. Cukier (University of Maryland, USA)
T. Dohi (Hiroshima University, Japan)
J. Dugan (University of Virginia, USA)
K. Goseva-Popstojanova (West Virginia University, USA)
R. Harper (IBM Research, USA)
G. Heijenk (University of Twente, Netherlands)
Z. Kalbarczyk (UIUC, USA)
K. Kanoun (LAAS-CNRS, France)
J. Karlsson (Chalmers University of Technology, Sweden)
K. Keeton (HP Labs, USA)
Y. Kimura (Fujitsu, Japan)
xxv
S.-Y. Kuo (National Taiwan University, Taiwan)
I. Lee (Hanyang University, Korea)
Z. Li (Institute of Computing Technology, China)
H. Madeira (University of Coimbra, Portugal)
M. Massink (CNUCE, Italy)
R. Maxion (Carnegie Mellon University, USA)
V. Mendiratta (Lucent Bell Labs, USA)
A. van Moorsel (Consultant, Germany)
B. Murphy (Microsoft Research, UK)
N. Neves (University of Lisbon, Portugal)
D. Nicol (UIUC, USA)
G. Rubino (IRISA, France)
W.H. Sanders (UIUC, USA)
M. Siegle (UBW München, Germany)
A. Somani (Iowa State University, USA)
A. Tai (IA Tech Inc.,...

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


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

Output:
安全论文分析：

title:DUET: integration of dynamic and static analyses for malware clustering
with cluster ensembles
author:Xin Hu and
Kang G. Shin
DUET: Integration of Dynamic and Static Analyses for Malware
Clustering with Cluster Ensembles
Xin Hu
IBM T.J. Watson Research Labs
huxin@us.ibm.com
Kang G. Shin
University of Michigan, Ann Arbor
kgshin@eecs.umich.edu
ABSTRACT
Automatic malware clustering plays a vital role in combating
the rapidly growing number of malware variants. Most ex-
isting malware clustering algorithms operate on either static
instruction features or dynamic behavior features to parti-
tion malware into families. However, these two distinct ap-
proaches have their own strengths and weaknesses in han-
dling diﬀerent types of malware. Moreover, diﬀerent cluster-
ing algorithms and even multiple runs of the same algorithms
may produce inconsistent or even contradictory results. To
remedy this heterogeneity and lack of robustness of a single
clustering algorithm, we propose a novel system called DUET
by exploiting the complementary nature of static and dy-
namic clustering algorithms and optimally integrating their
results. By using the concept of clustering ensemble, DUET
combines partitions from individual clustering algorithms
into a single consensus partition with better quality and ro-
bustness. DUET improves existing ensemble algorithms by
incorporating cluster-quality measures to eﬀectively recon-
cile diﬀerences and/or contradictions between base malware
clusterings. Using real-world malware samples, we compare
the performance of DUET (in terms of clustering precision,
recall and coverage) with individual state-of-the-art static
and dynamic clustering component. The comprehensive ex-
periments demonstrate DUET’s capability of improving the
coverage of malware samples by 20–40% while keeping the
precision near the optimum achievable by any individual
clustering algorithm.
1.
INTRODUCTION
The growing popularity of automatic malware-creation
toolkits, which a...


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

Input:
title:DUET: integration of dynamic and static analyses for malware clustering
with cluster ensembles
author:Xin Hu and
Kang G. Shin
DUET: Integration of Dynamic and Static Analyses for Malware
Clustering with Cluster Ensembles
Xin Hu
IBM T.J. Watson Research Labs
huxin@us.ibm.com
Kang G. Shin
University of Michigan, Ann Arbor
kgshin@eecs.umich.edu
ABSTRACT
Automatic malware clustering plays a vital role in combating
the rapidly growing number of malware variants. Most ex-
isting malware clustering algorithms operate on either static
instruction features or dynamic behavior features to parti-
tion malware into families. However, these two distinct ap-
proaches have their own strengths and weaknesses in han-
dling diﬀerent types of malware. Moreover, diﬀerent cluster-
ing algorithms and even multiple runs of the same algorithms
may produce inconsistent or even contradictory results. To
remedy this heterogeneity and lack of robustness of a single
clustering algorithm, we propose a novel system called DUET
by exploiting the complementary nature of static and dy-
namic clustering algorithms and optimally integrating their
results. By using the concept of clustering ensemble, DUET
combines partitions from individual clustering algorithms
into a single consensus partition with better quality and ro-
bustness. DUET improves existing ensemble algorithms by
incorporating cluster-quality measures to eﬀectively recon-
cile diﬀerences and/or contradictions between base malware
clusterings. Using real-world malware samples, we compare
the performance of DUET (in terms of clustering precision,
recall and coverage) with individual state-of-the-art static
and dynamic clustering component. The comprehensive ex-
periments demonstrate DUET’s capability of improving the
coverage of malware samples by 20–40% while keeping the
precision near the optimum achievable by any individual
clustering algorithm.
1.
INTRODUCTION
The growing popularity of automatic malware-creation
toolkits, which a...

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


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

Output:
安全论文分析：

title:An Empirical Study of Textual Key-Fingerprint Representations
author:Sergej Dechand and
Dominik Sch"urmann and
Karoline Busse and
Yasemin Acar and
Sascha Fahl and
Matthew Smith
An Empirical Study of Textual
Key-Fingerprint Representations
Sergej Dechand, University of Bonn; Dominik Schürmann, Technische Universität
Braunschweig; Karoline Busse, University of Bonn; Yasemin Acar and Sascha Fahl,
Saarland University; Matthew Smith, University of Bonn
 https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/dechand
This paper is included in the Proceedings of the 25th USENIX Security SymposiumAugust 10–12, 2016 • Austin, TXISBN 978-1-931971-32-4Open access to the Proceedings of the 25th USENIX Security Symposium is sponsored by USENIX An Empirical Study of Textual Key-Fingerprint Representations
Sergej Dechand
USECAP, University of Bonn
Yasemin Acar
CISPA, Saarland University
Dominik Sch¨urmann
IBR, TU Braunschweig
Sascha Fahl
CISPA, Saarland University
Karoline Busse
USECAP, University of Bonn
Matthew Smith
USECAP, University of Bonn
Abstract
Many security protocols still rely on manual ﬁngerprint
comparisons for authentication. The most well-known
and widely used key-ﬁngerprint representation are hexa-
decimal strings as used in various security tools. With
the introduction of end-to-end security in WhatsApp and
other messengers, the discussion on how to best repre-
sent key-ﬁngerprints for users is receiving a lot of inter-
est.
We conduct a 1047 participant study evaluating six
different textual key-ﬁngerprint representations with re-
gards to their performance and usability. We focus on
textual ﬁngerprints as the most robust and deployable
representation.
Our ﬁndings show that the currently used hexadeci-
mal representation is more prone to partial preimage at-
tacks in comparison to others. Based on our ﬁndings,
we make the recommendation that two alternative repre-
sentations should be adopted. The highest attack detec-...


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

Input:
title:An Empirical Study of Textual Key-Fingerprint Representations
author:Sergej Dechand and
Dominik Sch"urmann and
Karoline Busse and
Yasemin Acar and
Sascha Fahl and
Matthew Smith
An Empirical Study of Textual
Key-Fingerprint Representations
Sergej Dechand, University of Bonn; Dominik Schürmann, Technische Universität
Braunschweig; Karoline Busse, University of Bonn; Yasemin Acar and Sascha Fahl,
Saarland University; Matthew Smith, University of Bonn
 https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/dechand
This paper is included in the Proceedings of the 25th USENIX Security SymposiumAugust 10–12, 2016 • Austin, TXISBN 978-1-931971-32-4Open access to the Proceedings of the 25th USENIX Security Symposium is sponsored by USENIX An Empirical Study of Textual Key-Fingerprint Representations
Sergej Dechand
USECAP, University of Bonn
Yasemin Acar
CISPA, Saarland University
Dominik Sch¨urmann
IBR, TU Braunschweig
Sascha Fahl
CISPA, Saarland University
Karoline Busse
USECAP, University of Bonn
Matthew Smith
USECAP, University of Bonn
Abstract
Many security protocols still rely on manual ﬁngerprint
comparisons for authentication. The most well-known
and widely used key-ﬁngerprint representation are hexa-
decimal strings as used in various security tools. With
the introduction of end-to-end security in WhatsApp and
other messengers, the discussion on how to best repre-
sent key-ﬁngerprints for users is receiving a lot of inter-
est.
We conduct a 1047 participant study evaluating six
different textual key-ﬁngerprint representations with re-
gards to their performance and usability. We focus on
textual ﬁngerprints as the most robust and deployable
representation.
Our ﬁndings show that the currently used hexadeci-
mal representation is more prone to partial preimage at-
tacks in comparison to others. Based on our ﬁndings,
we make the recommendation that two alternative repre-
sentations should be adopted. The highest attack detec-...

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


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

Output:
安全论文分析：

title:Quantifying the Impact of Blocklisting in the Age of Address Reuse
author:Sivaramakrishnan Ramanathan and
Anushah Hossain and
Jelena Mirkovic and
Minlan Yu and
Sadia Afroz
Quantifying the Impact of Blocklisting in the Age of Address
Reuse
Sivaramakrishnan
Ramanathan
University of Southern California
satyaman@usc.edu
Anushah Hossain
UC Berkeley, ICSI
anushah@icsi.berkeley.edu
Jelena Mirkovic
USC Information Sciences Institute
sunshine@isi.edu
Minlan Yu
Harvard University
minlanyu@g.harvard.edu
ABSTRACT
Blocklists, consisting of known malicious IP addresses, can be used
as a simple method to block malicious traffic. However, blocklists
can potentially lead to unjust blocking of legitimate users due to IP
address reuse, where more users could be blocked than intended. IP
addresses can be reused either at the same time (Network Address
Translation) or over time (dynamic addressing). We propose two
new techniques to identify reused addresses. We built a crawler
using the BitTorrent Distributed Hash Table to detect NATed ad-
dresses and use the RIPE Atlas measurement logs to detect dy-
namically allocated address spaces. We then analyze 151 publicly
available IPv4 blocklists to show the implications of reused ad-
dresses and find that 53–60% of blocklists contain reused addresses
having about 30.6K–45.1K listings of reused addresses. We also find
that reused addresses can potentially affect as many as 78 legitimate
users for as many as 44 days.
CCS CONCEPTS
• Networks → Network measurement; • Security and privacy
→ Network security;
KEYWORDS
IP address reuse, blocklists, unjust blocking
ACM Reference Format:
Sivaramakrishnan Ramanathan, Anushah Hossain, Jelena Mirkovic, Minlan
Yu, and Sadia Afroz. 2020. Quantifying the Impact of Blocklisting in the
Age of Address Reuse. In ACM Internet Measurement Conference (IMC ’20),
October 27–29, 2020, Virtual Event, USA. ACM, New York, NY, USA, 10 pages.
https://doi.org/10.1145/3419394.3423657
1 INTRODUCTION
Consider one user’s...


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

Output:
安全论文分析：

title:Why PCs Are Fragile and What We Can Do About It: A Study of Windows
Registry Problems
author:Archana Ganapathi and
Yi-Min Wang and
Ni Lao and
Ji-Rong Wen
Why PCs Are Fragile and What We Can Do About It:
A Study of Windows Registry Problems
Archana Ganapathi                 Yi-Min Wang                 Ni Lao and Ji-Rong Wen
    University of California
Berkeley, CA
    Microsoft Research
        Redmond, WA
     Microsoft Research
          Beijing, China
Abstract
framework
Software configuration problems are a major source
of failures in computer systems. In this paper, we present
a  new
for  categorizing  configuration
problems.  We  apply  this  categorization  to  Windows
Registry-related  problems  obtained
from  various
internal  as  well  as  external  sources.  Although
infrequent,  Registry-related  problems  are  difficult  to
diagnose  and  repair.  Consequently  they  frustrate  the
users. We classify problems based on their manifestation
and the scope of impact to gain useful insights into how
problems affect users and why PCs are fragile. We then
describe  techniques  to  identify  and  eliminate  such
Registry
failures.  We  propose  health  predicate
monitoring for detecting known problems, fault injection
for
improving  application  robustness,  and  access
protection mechanisms for preventing fragility problems.
1.  Introduction
and
complex
for
interesting
Windows-based  personal  computers  (PCs)  offer  a
platform
software
interactions. However, undisciplined uses and sharing of
persistent configuration data by Windows programs have
made PCs more vulnerable to fragility.  In particular, the
Windows  Registry  stores  large  quantities  of  complex,
undocumented  and  unprotected  configuration  data,
making  it  the  single  most  vulnerable  component  of  the
Windows  operating system. Understanding and undoing
Registry damage is a non-trivial task to the average user.
The problem is as ...


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

Input:
title:Why PCs Are Fragile and What We Can Do About It: A Study of Windows
Registry Problems
author:Archana Ganapathi and
Yi-Min Wang and
Ni Lao and
Ji-Rong Wen
Why PCs Are Fragile and What We Can Do About It:
A Study of Windows Registry Problems
Archana Ganapathi                 Yi-Min Wang                 Ni Lao and Ji-Rong Wen
    University of California
Berkeley, CA
    Microsoft Research
        Redmond, WA
     Microsoft Research
          Beijing, China
Abstract
framework
Software configuration problems are a major source
of failures in computer systems. In this paper, we present
a  new
for  categorizing  configuration
problems.  We  apply  this  categorization  to  Windows
Registry-related  problems  obtained
from  various
internal  as  well  as  external  sources.  Although
infrequent,  Registry-related  problems  are  difficult  to
diagnose  and  repair.  Consequently  they  frustrate  the
users. We classify problems based on their manifestation
and the scope of impact to gain useful insights into how
problems affect users and why PCs are fragile. We then
describe  techniques  to  identify  and  eliminate  such
Registry
failures.  We  propose  health  predicate
monitoring for detecting known problems, fault injection
for
improving  application  robustness,  and  access
protection mechanisms for preventing fragility problems.
1.  Introduction
and
complex
for
interesting
Windows-based  personal  computers  (PCs)  offer  a
platform
software
interactions. However, undisciplined uses and sharing of
persistent configuration data by Windows programs have
made PCs more vulnerable to fragility.  In particular, the
Windows  Registry  stores  large  quantities  of  complex,
undocumented  and  unprotected  configuration  data,
making  it  the  single  most  vulnerable  component  of  the
Windows  operating system. Understanding and undoing
Registry damage is a non-trivial task to the average user.
The problem is as ...

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


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

Output:
安全论文分析：

title:Ethane: taking control of the enterprise
author:Mart'ın Casado and
Michael J. Freedman and
Justin Pettit and
Jianying Luo and
Nick McKeown and
Scott Shenker
Ethane: Taking Control of the Enterprise
Martìn Casado, Michael J. Freedman,
Justin Pettit, Jianying Luo,
and Nick McKeown
Stanford University
Scott Shenker
U.C. Berkeley and ICSI
ABSTRACT
This paper presents Ethane, a new network architecture for the
enterprise. Ethane allows managers to deﬁne a single network-
wide ﬁne-grain policy, and then enforces it directly. Ethane cou-
ples extremely simple ﬂow-based Ethernet switches with a central-
ized controller that manages the admittance and routing of ﬂows.
While radical, this design is backwards-compatible with existing
hosts and switches.
We have implemented Ethane in both hardware and software,
supporting both wired and wireless hosts. Our operational Ethane
network has supported over 300 hosts for the past four months in
in Stanford University’s network, and this deployment experience
has signiﬁcantly affected Ethane’s design.
Categories and Subject Descriptors
C.2.6 [Computer Communication Networks]: Internetworking;
C.2.1 [Computer Communication Networks]: Network Archi-
tecture and Design
General Terms
Design, Experimentation, Performance
Keywords
Network, Architecture, Security, Management
1.
INTRODUCTION
Enterprise networks are often large, run a wide variety of appli-
cations and protocols, and typically operate under strict reliability
and security constraints; thus, they represent a challenging envi-
ronment for network management. The stakes are high, as busi-
ness productivity can be severely hampered by network misconﬁg-
urations or break-ins. Yet the current solutions are weak, making
enterprise network management both expensive and error-prone.
Indeed, most networks today require substantial manual conﬁgura-
tion by trained operators [11, 22, 23, 25] to achieve even moderate
security [24]. A Yankee Group report found that 62% of network...


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

Input:
title:Ethane: taking control of the enterprise
author:Mart'ın Casado and
Michael J. Freedman and
Justin Pettit and
Jianying Luo and
Nick McKeown and
Scott Shenker
Ethane: Taking Control of the Enterprise
Martìn Casado, Michael J. Freedman,
Justin Pettit, Jianying Luo,
and Nick McKeown
Stanford University
Scott Shenker
U.C. Berkeley and ICSI
ABSTRACT
This paper presents Ethane, a new network architecture for the
enterprise. Ethane allows managers to deﬁne a single network-
wide ﬁne-grain policy, and then enforces it directly. Ethane cou-
ples extremely simple ﬂow-based Ethernet switches with a central-
ized controller that manages the admittance and routing of ﬂows.
While radical, this design is backwards-compatible with existing
hosts and switches.
We have implemented Ethane in both hardware and software,
supporting both wired and wireless hosts. Our operational Ethane
network has supported over 300 hosts for the past four months in
in Stanford University’s network, and this deployment experience
has signiﬁcantly affected Ethane’s design.
Categories and Subject Descriptors
C.2.6 [Computer Communication Networks]: Internetworking;
C.2.1 [Computer Communication Networks]: Network Archi-
tecture and Design
General Terms
Design, Experimentation, Performance
Keywords
Network, Architecture, Security, Management
1.
INTRODUCTION
Enterprise networks are often large, run a wide variety of appli-
cations and protocols, and typically operate under strict reliability
and security constraints; thus, they represent a challenging envi-
ronment for network management. The stakes are high, as busi-
ness productivity can be severely hampered by network misconﬁg-
urations or break-ins. Yet the current solutions are weak, making
enterprise network management both expensive and error-prone.
Indeed, most networks today require substantial manual conﬁgura-
tion by trained operators [11, 22, 23, 25] to achieve even moderate
security [24]. A Yankee Group report found that 62% of network...

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


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

Output:
安全论文分析：

title:Introduction to the fifth workshop on dependable and secure nanocomputing
author:Jean Arlat and
Cristian Constantinescu and
Johan Karlsson and
Takashi Nanya and
Alan Wood
Introduction to the Fifth Workshop on Dependable and Secure Nanocomputing
Jean Arlat1, Cristian Constantinescu2, Johan Karlsson3, Takashi Nanya4, Alan Wood5
1 LAAS-CNRS and Université de Toulouse, 7, Av. du Colonel Roche 31077 Toulouse – France <jean.arlat@laas.fr>
2 AMD, 2950 E Harmony Rd., Fort Collins, CO 80528 – USA <cristian.constantinescu@amd.com>
3 Dept. of Computer Science & Eng., Chalmers University of Technology, 41296 Göteborg – Sweden <johan@chalmers.se>
4 Canon Inc., 3-30-2 Shimomaruko, Ohta-ku, Tokyo 146-8501 – Japan  <nanya.takashi@canon.co.jp>
5 Oracle, 501 Island Parkway, Belmont, CA 94002 – USA <alan.wood@oracle.com>
I. MOTIVATION AND OBJECTIVES
Nanocomputing  and  related-enabling  technologies  hold
the  promise  of  higher  performance  and
lower  power
consumption, as well as increased communication capabilities
and  functionality.  In  addition  to  the  impact  on  today
computerized systems, nanocomputing is an essential lever to
foster the emerging cyberphysical system paradigm. However,
the dependability and security of these unprecedentedly small
devices,  of  their  deployment,  and  of  their  interconnection
remain uncertain.  The main sources of concern are:
•  Nanometer devices are expected to be highly sensitive
to  process  variations.  The  guard-bands  used  today  for
avoiding
impact  of  such  variations  will  not
represent  a  feasible  solution  in  the  future.  As  a
consequence,  timing  errors  and  their  higher  frequency
of occurrence have to be addressed.
the
•  New  and  intricate  failure  modes,  specific  to  new
materials, are expected to raise serious challenges to the
design and test engineers.
•  Environment induced errors, such as single event upsets
(SEU), are likely to occur more frequently than in th...


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

Input:
title:Introduction to the fifth workshop on dependable and secure nanocomputing
author:Jean Arlat and
Cristian Constantinescu and
Johan Karlsson and
Takashi Nanya and
Alan Wood
Introduction to the Fifth Workshop on Dependable and Secure Nanocomputing
Jean Arlat1, Cristian Constantinescu2, Johan Karlsson3, Takashi Nanya4, Alan Wood5
1 LAAS-CNRS and Université de Toulouse, 7, Av. du Colonel Roche 31077 Toulouse – France <jean.arlat@laas.fr>
2 AMD, 2950 E Harmony Rd., Fort Collins, CO 80528 – USA <cristian.constantinescu@amd.com>
3 Dept. of Computer Science & Eng., Chalmers University of Technology, 41296 Göteborg – Sweden <johan@chalmers.se>
4 Canon Inc., 3-30-2 Shimomaruko, Ohta-ku, Tokyo 146-8501 – Japan  <nanya.takashi@canon.co.jp>
5 Oracle, 501 Island Parkway, Belmont, CA 94002 – USA <alan.wood@oracle.com>
I. MOTIVATION AND OBJECTIVES
Nanocomputing  and  related-enabling  technologies  hold
the  promise  of  higher  performance  and
lower  power
consumption, as well as increased communication capabilities
and  functionality.  In  addition  to  the  impact  on  today
computerized systems, nanocomputing is an essential lever to
foster the emerging cyberphysical system paradigm. However,
the dependability and security of these unprecedentedly small
devices,  of  their  deployment,  and  of  their  interconnection
remain uncertain.  The main sources of concern are:
•  Nanometer devices are expected to be highly sensitive
to  process  variations.  The  guard-bands  used  today  for
avoiding
impact  of  such  variations  will  not
represent  a  feasible  solution  in  the  future.  As  a
consequence,  timing  errors  and  their  higher  frequency
of occurrence have to be addressed.
the
•  New  and  intricate  failure  modes,  specific  to  new
materials, are expected to raise serious challenges to the
design and test engineers.
•  Environment induced errors, such as single event upsets
(SEU), are likely to occur more frequently than in th...

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


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

Output:
安全论文分析：

title:On the Safety of IoT Device Physical Interaction Control
author:Wenbo Ding and
Hongxin Hu
On the Safety of IoT Device Physical Interaction Control
Wenbo Ding
Clemson University
wding@clemson.edu
Hongxin Hu
Clemson University
hongxih@clemson.edu
applications (a.k.a. appified IoT platforms) to manage devices in
an unattended manner, for example, turning on lights when users
return home, monitoring users’ kids from afar, or locking home
doors while users drive away [38].
ABSTRACT
Emerging Internet of Things (IoT) platforms provide increased func-
tionality to enable human interaction with the physical world in
an autonomous manner. The physical interaction features of IoT
platforms allow IoT devices to make an impact on the physical
environment. However, such features also bring new safety chal-
lenges, where attackers can leverage stealthy physical interactions
to launch attacks against IoT systems. In this paper, we propose
a framework called IoTMon that discovers any possible physical
interactions and generates all potential interaction chains across
applications in the IoT environment. IoTMon also includes an as-
sessment of the safety risk of each discovered inter-app interaction
chain based on its physical influence. To demonstrate the feasibility
of our approach, we provide a proof-of-concept implementation
of IoTMon and present a comprehensive system evaluation on
the Samsung SmartThings platform. We study 185 official Smart-
Things applications and find they can form 162 hidden inter-app
interaction chains through physical surroundings. In particular, our
experiment reveals that 37 interaction chains are highly risky and
could be potentially exploited to impact the safety of the IoT envi-
ronment.
KEYWORDS
Safety; Internet of Things; Physical Interaction Control
ACM Reference Format:
Wenbo Ding and Hongxin Hu. 2018. On the Safety of IoT Device Physical
Interaction Control. In 2018 ACM SIGSAC Conference on Computer and
Communications Security (CCS ’18), O...


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

Input:
title:On the Safety of IoT Device Physical Interaction Control
author:Wenbo Ding and
Hongxin Hu
On the Safety of IoT Device Physical Interaction Control
Wenbo Ding
Clemson University
wding@clemson.edu
Hongxin Hu
Clemson University
hongxih@clemson.edu
applications (a.k.a. appified IoT platforms) to manage devices in
an unattended manner, for example, turning on lights when users
return home, monitoring users’ kids from afar, or locking home
doors while users drive away [38].
ABSTRACT
Emerging Internet of Things (IoT) platforms provide increased func-
tionality to enable human interaction with the physical world in
an autonomous manner. The physical interaction features of IoT
platforms allow IoT devices to make an impact on the physical
environment. However, such features also bring new safety chal-
lenges, where attackers can leverage stealthy physical interactions
to launch attacks against IoT systems. In this paper, we propose
a framework called IoTMon that discovers any possible physical
interactions and generates all potential interaction chains across
applications in the IoT environment. IoTMon also includes an as-
sessment of the safety risk of each discovered inter-app interaction
chain based on its physical influence. To demonstrate the feasibility
of our approach, we provide a proof-of-concept implementation
of IoTMon and present a comprehensive system evaluation on
the Samsung SmartThings platform. We study 185 official Smart-
Things applications and find they can form 162 hidden inter-app
interaction chains through physical surroundings. In particular, our
experiment reveals that 37 interaction chains are highly risky and
could be potentially exploited to impact the safety of the IoT envi-
ronment.
KEYWORDS
Safety; Internet of Things; Physical Interaction Control
ACM Reference Format:
Wenbo Ding and Hongxin Hu. 2018. On the Safety of IoT Device Physical
Interaction Control. In 2018 ACM SIGSAC Conference on Computer and
Communications Security (CCS ’18), O...

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


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

Output:
安全论文分析：

title:Keystroke-Based User Identification on Smart Phones
author:Saira Zahid and
Muhammad Shahzad and
Syed Ali Khayam and
Muddassar Farooq
Keystroke-Based User Identiﬁcation
on Smart Phones
Saira Zahid1, Muhammad Shahzad1, Syed Ali Khayam1,2,
and Muddassar Farooq1
1 Next Generation Intelligent Networks Research Center (nexGIN RC)
National University of Computer & Emerging Sciences (FAST-NUCES)
{saira.zahid,muhammad.shahzad,muddassar.farooq}@nexginrc.org
Islamabad, Pakistan
2 School of Electrical Engineering & Computer Science (SEECS)
National University of Sciences & Technology (NUST)
Islamabad, Pakistan
ali.khayam@seecs.edu.pk
Abstract. Smart phones are now being used to store users’ identities and
sensitive information/data. Therefore, it is important to authenticate le-
gitimate users of a smart phone and to block imposters. In this paper, we
demonstrate that keystroke dynamics of a smart phone user can be trans-
lated into a viable features’ set for accurate user identiﬁcation. To this
end, we collect and analyze keystroke data of 25 diverse smart phone users.
Based on this analysis, we select six distinguishing keystroke features that
can be used for user identiﬁcation. We show that these keystroke features
for diﬀerent users are diﬀused and therefore a fuzzy classiﬁer is well-suited
to cluster and classify them. We then optimize the front-end fuzzy clas-
siﬁer using Particle Swarm Optimization (PSO) and Genetic Algorithm
(GA) as back-end dynamic optimizers to adapt to variations in usage pat-
terns. Finally, we provide a novel keystroke dynamics based PIN (Personal
Identiﬁcation Number) veriﬁcation mode to ensure information security
on smart phones. The results of our experiments show that the proposed
user identiﬁcation system has an average error rate of 2% after the detec-
tion mode and the error rate of rejecting legitimate users drops to zero
in the PIN veriﬁcation mode. We also compare error rates (in terms of
detecting both legitimate users and imposte...


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

Input:
title:Keystroke-Based User Identification on Smart Phones
author:Saira Zahid and
Muhammad Shahzad and
Syed Ali Khayam and
Muddassar Farooq
Keystroke-Based User Identiﬁcation
on Smart Phones
Saira Zahid1, Muhammad Shahzad1, Syed Ali Khayam1,2,
and Muddassar Farooq1
1 Next Generation Intelligent Networks Research Center (nexGIN RC)
National University of Computer & Emerging Sciences (FAST-NUCES)
{saira.zahid,muhammad.shahzad,muddassar.farooq}@nexginrc.org
Islamabad, Pakistan
2 School of Electrical Engineering & Computer Science (SEECS)
National University of Sciences & Technology (NUST)
Islamabad, Pakistan
ali.khayam@seecs.edu.pk
Abstract. Smart phones are now being used to store users’ identities and
sensitive information/data. Therefore, it is important to authenticate le-
gitimate users of a smart phone and to block imposters. In this paper, we
demonstrate that keystroke dynamics of a smart phone user can be trans-
lated into a viable features’ set for accurate user identiﬁcation. To this
end, we collect and analyze keystroke data of 25 diverse smart phone users.
Based on this analysis, we select six distinguishing keystroke features that
can be used for user identiﬁcation. We show that these keystroke features
for diﬀerent users are diﬀused and therefore a fuzzy classiﬁer is well-suited
to cluster and classify them. We then optimize the front-end fuzzy clas-
siﬁer using Particle Swarm Optimization (PSO) and Genetic Algorithm
(GA) as back-end dynamic optimizers to adapt to variations in usage pat-
terns. Finally, we provide a novel keystroke dynamics based PIN (Personal
Identiﬁcation Number) veriﬁcation mode to ensure information security
on smart phones. The results of our experiments show that the proposed
user identiﬁcation system has an average error rate of 2% after the detec-
tion mode and the error rate of rejecting legitimate users drops to zero
in the PIN veriﬁcation mode. We also compare error rates (in terms of
detecting both legitimate users and imposte...

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


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

Output:
安全论文分析：

title:Crash graphs: An aggregated view of multiple crashes to improve crash
triage
author:Sunghun Kim and
Thomas Zimmermann and
Nachiappan Nagappan
Crash Graphs: An Aggregated View of Multiple Crashes to Improve Crash Triage
Sunghun Kim*
Hong Kong University of Science and Technology
Hong Kong
hunkim@cse.ust.hk
Abstract—Crash  reporting  systems  play  an  important  role  in
the overall reliability and dependability of the system helping
in  identifying  and  debugging  crashes  in  software  systems
deployed in the field. In Microsoft for example, the Windows
Error Reporting (WER) system receives crash data from users,
classifies them, and presents crash information for developers
to  fix  crashes.  However,  most  crash  reporting  systems  deal
with crashes individually; they compare crashes individually to
classify  them,  which  may  cause  misclassification.  Developers
need  to  download  multiple  crash  data  files  for  debugging,
which requires non-trivial effort. In this paper, we propose an
approach  based  on  crash  graphs,  which  are  an  aggregated
view  of  multiple  crashes.  Our  experience  with  crash  graphs
indicates  that  it  reduces  misclassification  and  helps  identify
fixable crashes in advance.
INTRODUCTION
Keywords-component; crash; graph; triaging; network
I.
Crash  reporting  systems 1  such  as  Windows  Error
Reporting (WER) [13], Mozilla Crash Stats [15], and Apple
CrashReporter  [3]  have  been  widely  deployed  in  practice.
The crash reporting systems help organizations determine the
overall reliability of their software systems in the field.
The  crash  reporting  systems  collect  crash  related  data,
classify  them,  and  present  the  information  to  developers  to
fix crashes [9, 11]. For example, WER receives crash stack
traces  from  users  in  the  field.  Then,  WER  identifies  crash
root  cause(s)  using  heuristics  (analyzing  the  traces  using
machine learning/pattern ...


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

Input:
title:Crash graphs: An aggregated view of multiple crashes to improve crash
triage
author:Sunghun Kim and
Thomas Zimmermann and
Nachiappan Nagappan
Crash Graphs: An Aggregated View of Multiple Crashes to Improve Crash Triage
Sunghun Kim*
Hong Kong University of Science and Technology
Hong Kong
hunkim@cse.ust.hk
Abstract—Crash  reporting  systems  play  an  important  role  in
the overall reliability and dependability of the system helping
in  identifying  and  debugging  crashes  in  software  systems
deployed in the field. In Microsoft for example, the Windows
Error Reporting (WER) system receives crash data from users,
classifies them, and presents crash information for developers
to  fix  crashes.  However,  most  crash  reporting  systems  deal
with crashes individually; they compare crashes individually to
classify  them,  which  may  cause  misclassification.  Developers
need  to  download  multiple  crash  data  files  for  debugging,
which requires non-trivial effort. In this paper, we propose an
approach  based  on  crash  graphs,  which  are  an  aggregated
view  of  multiple  crashes.  Our  experience  with  crash  graphs
indicates  that  it  reduces  misclassification  and  helps  identify
fixable crashes in advance.
INTRODUCTION
Keywords-component; crash; graph; triaging; network
I.
Crash  reporting  systems 1  such  as  Windows  Error
Reporting (WER) [13], Mozilla Crash Stats [15], and Apple
CrashReporter  [3]  have  been  widely  deployed  in  practice.
The crash reporting systems help organizations determine the
overall reliability of their software systems in the field.
The  crash  reporting  systems  collect  crash  related  data,
classify  them,  and  present  the  information  to  developers  to
fix crashes [9, 11]. For example, WER receives crash stack
traces  from  users  in  the  field.  Then,  WER  identifies  crash
root  cause(s)  using  heuristics  (analyzing  the  traces  using
machine learning/pattern ...

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


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

Output:
安全论文分析：

title:HyperSentry: enabling stealthy in-context measurement of hypervisor
integrity
author:Ahmed M. Azab and
Peng Ning and
Zhi Wang and
Xuxian Jiang and
Xiaolan Zhang and
Nathan C. Skalsky
HyperSentry: Enabling Stealthy In-context Measurement of
Hypervisor Integrity ࢩ
Ahmed M. Azab
Peng Ning
Zhi Wang
Xuxian Jiang
Department of Computer Science, North Carolina State University
{amazab, pning, zhi_wang, xuxian_jiang}@ncsu.edu
Xiaolan Zhang
Nathan C. Skalsky
IBM T.J. Watson Research Center
cxzhang@us.ibm.com
IBM Systems & Technology Group
nskalsky@us.ibm.com
ABSTRACT
6DEI F=FAH FHAIAJI 0OFAH5AJHO = LA BH=AMH J A
=>A EJACHEJO A=IKHAAJ B = HKEC DOFAHLEIH H =O
JDAH DECDAIJ FHELEACA@ IBJM=HA =OAH  = IOIJA 7EA
ANEIJEC IKJEI BH FHJA?JEC FHELEACA@ IBJM=HA 0OFAH
5AJHO @AI J EJH@K?A = DECDAH FHELEACA@ IBJM=HA =OAH
>AM JDA EJACHEJO A=IKHAAJ J=HCAJ MDE?D ?K@ IJ=HJ
=JDAH H=?A MEJD =E?EKI =JJ=?AHI E >J=EEC JDA DECD
AIJ FHELEACA E JDA IOIJA 1IJA=@ 0OFAH5AJHO EJH@K?AI
= IBJM=HA ?FAJ JD=J EI FHFAHO EI=JA@ BH JDA DO
FAHLEIH J A=>A IJA=JDO =@ E?JANJ A=IKHAAJ B
JDA HKJEA EJACHEJO B JDA DOFAHLEIH 9DEA IJA=JDEAII
EI A?AII=HO J AIKHA JD=J = ?FHEIA@ DOFAHLEIH @AI
J D=LA = ?D=?A J DE@A JDA =JJ=? JH=?AI KF @AJA?J
EC = KF?EC A=IKHAAJ E?JANJ A=IKHAAJ EI
A?AII=HO J HAJHEALA = JDA AA@A@ EFKJI BH = IK??AIIBK
EJACHEJO A=IKHAAJ
0OFAH5AJHO KIAI = KJB>=@ ?D=A AC 1JAE
CAJ 2=JBH ==CAAJ 1JAHB=?A 121 MDE?D EI ?
O =L=E=>A  IAHLAH F=JBHI J JHECCAH JDA IJA=JDO
A=IKHAAJ =@ =@FJI JDA 5OIJA ==CAAJ @A
5 J FHJA?J EJI >=IA ?@A =@ ?HEJE?= @=J= ) AO ?
JHE>KJE B 0OFAH5AJHO EI JDA IAJ B LA JA?DEGKAI JD=J
LAH?A 5ߣI EEJ=JE FHLE@EC = EJACHEJO A=IKHA
AJ =CAJ MEJD  JDA I=A ?JANJK= EBH=JE =L=E
=>A J JDA DOFAHLEIH   ?FAJAO FHJA?JA@ A...


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

Input:
title:HyperSentry: enabling stealthy in-context measurement of hypervisor
integrity
author:Ahmed M. Azab and
Peng Ning and
Zhi Wang and
Xuxian Jiang and
Xiaolan Zhang and
Nathan C. Skalsky
HyperSentry: Enabling Stealthy In-context Measurement of
Hypervisor Integrity ࢩ
Ahmed M. Azab
Peng Ning
Zhi Wang
Xuxian Jiang
Department of Computer Science, North Carolina State University
{amazab, pning, zhi_wang, xuxian_jiang}@ncsu.edu
Xiaolan Zhang
Nathan C. Skalsky
IBM T.J. Watson Research Center
cxzhang@us.ibm.com
IBM Systems & Technology Group
nskalsky@us.ibm.com
ABSTRACT
6DEI F=FAH FHAIAJI 0OFAH5AJHO = LA BH=AMH J A
=>A EJACHEJO A=IKHAAJ B = HKEC DOFAHLEIH H =O
JDAH DECDAIJ FHELEACA@ IBJM=HA =OAH  = IOIJA 7EA
ANEIJEC IKJEI BH FHJA?JEC FHELEACA@ IBJM=HA 0OFAH
5AJHO @AI J EJH@K?A = DECDAH FHELEACA@ IBJM=HA =OAH
>AM JDA EJACHEJO A=IKHAAJ J=HCAJ MDE?D ?K@ IJ=HJ
=JDAH H=?A MEJD =E?EKI =JJ=?AHI E >J=EEC JDA DECD
AIJ FHELEACA E JDA IOIJA 1IJA=@ 0OFAH5AJHO EJH@K?AI
= IBJM=HA ?FAJ JD=J EI FHFAHO EI=JA@ BH JDA DO
FAHLEIH J A=>A IJA=JDO =@ E?JANJ A=IKHAAJ B
JDA HKJEA EJACHEJO B JDA DOFAHLEIH 9DEA IJA=JDEAII
EI A?AII=HO J AIKHA JD=J = ?FHEIA@ DOFAHLEIH @AI
J D=LA = ?D=?A J DE@A JDA =JJ=? JH=?AI KF @AJA?J
EC = KF?EC A=IKHAAJ E?JANJ A=IKHAAJ EI
A?AII=HO J HAJHEALA = JDA AA@A@ EFKJI BH = IK??AIIBK
EJACHEJO A=IKHAAJ
0OFAH5AJHO KIAI = KJB>=@ ?D=A AC 1JAE
CAJ 2=JBH ==CAAJ 1JAHB=?A 121 MDE?D EI ?
O =L=E=>A  IAHLAH F=JBHI J JHECCAH JDA IJA=JDO
A=IKHAAJ =@ =@FJI JDA 5OIJA ==CAAJ @A
5 J FHJA?J EJI >=IA ?@A =@ ?HEJE?= @=J= ) AO ?
JHE>KJE B 0OFAH5AJHO EI JDA IAJ B LA JA?DEGKAI JD=J
LAH?A 5ߣI EEJ=JE FHLE@EC = EJACHEJO A=IKHA
AJ =CAJ MEJD  JDA I=A ?JANJK= EBH=JE =L=E
=>A J JDA DOFAHLEIH   ?FAJAO FHJA?JA@ A...

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


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

Output:
安全论文分析：

title:OcuLock: Exploring Human Visual System for Authentication in Virtual
Reality Head-mounted Display
author:Shiqing Luo and
Anh Nguyen and
Chen Song and
Feng Lin and
Wenyao Xu and
Zhisheng Yan
OcuLock: Exploring Human Visual System for
Authentication in Virtual Reality Head-mounted
Display
Shiqing Luo∗, Anh Nguyen∗, Chen Song†, Feng Lin‡, Wenyao Xu§ and Zhisheng Yan∗
∗Georgia State University, Email: {sluo10, anguyen139}@student.gsu.edu, zyan@gsu.edu
†San Diego State University, Email: csong@sdsu.edu
‡Zhejiang University, Email: ﬂin@zju.edu.cn
§SUNY Buffalo, Email: wenyaoxu@buffalo.edu
Abstract—The increasing popularity of virtual reality (VR) in
a wide spectrum of applications has generated sensitive personal
data such as medical records and credit card information. While
protecting such data from unauthorized access is critical, directly
applying traditional authentication methods (e.g., PIN) through
new VR input modalities such as remote controllers and head nav-
igation would cause security issues. The authentication action can
be purposefully observed by attackers to infer the authentication
input. Unlike any other mobile devices, VR presents immersive
experience via a head-mounted display (HMD) that fully covers
users’ eye area without public exposure. Leveraging this feature,
we explore human visual system (HVS) as a novel biometric
authentication tailored for VR platforms. While previous works
used eye globe movement (gaze) to authenticate smartphones or
PCs, they suffer from a high error rate and low stability since
eye gaze is highly dependent on cognitive states. In this paper,
we explore the HVS as a whole to consider not just the eye
globe movement but also the eyelid, extraocular muscles, cells,
and surrounding nerves in the HVS. Exploring HVS biostructure
and unique HVS features triggered by immersive VR content can
enhance authentication stability. To this end, we present OcuLock,
an HVS-based system for reliable and unobservable VR HMD
authentica...


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

Input:
title:OcuLock: Exploring Human Visual System for Authentication in Virtual
Reality Head-mounted Display
author:Shiqing Luo and
Anh Nguyen and
Chen Song and
Feng Lin and
Wenyao Xu and
Zhisheng Yan
OcuLock: Exploring Human Visual System for
Authentication in Virtual Reality Head-mounted
Display
Shiqing Luo∗, Anh Nguyen∗, Chen Song†, Feng Lin‡, Wenyao Xu§ and Zhisheng Yan∗
∗Georgia State University, Email: {sluo10, anguyen139}@student.gsu.edu, zyan@gsu.edu
†San Diego State University, Email: csong@sdsu.edu
‡Zhejiang University, Email: ﬂin@zju.edu.cn
§SUNY Buffalo, Email: wenyaoxu@buffalo.edu
Abstract—The increasing popularity of virtual reality (VR) in
a wide spectrum of applications has generated sensitive personal
data such as medical records and credit card information. While
protecting such data from unauthorized access is critical, directly
applying traditional authentication methods (e.g., PIN) through
new VR input modalities such as remote controllers and head nav-
igation would cause security issues. The authentication action can
be purposefully observed by attackers to infer the authentication
input. Unlike any other mobile devices, VR presents immersive
experience via a head-mounted display (HMD) that fully covers
users’ eye area without public exposure. Leveraging this feature,
we explore human visual system (HVS) as a novel biometric
authentication tailored for VR platforms. While previous works
used eye globe movement (gaze) to authenticate smartphones or
PCs, they suffer from a high error rate and low stability since
eye gaze is highly dependent on cognitive states. In this paper,
we explore the HVS as a whole to consider not just the eye
globe movement but also the eyelid, extraocular muscles, cells,
and surrounding nerves in the HVS. Exploring HVS biostructure
and unique HVS features triggered by immersive VR content can
enhance authentication stability. To this end, we present OcuLock,
an HVS-based system for reliable and unobservable VR HMD
authentica...

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


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

Output:
安全论文分析：

title:TimeVM: a framework for online intrusion mitigation and fast recovery
using multi-time-lag traffic replay
author:Khalid Elbadawi and
Ehab Al-Shaer
TimeVM: A Framework for Online Intrusion Mitigation and
Fast Recovery Using Multi-Time-Lag Trafﬁc Replay
Khalid Elbadawi
School of Computing
DePaul University
Chicago, IL 60604
badawi@cs.depaul.edu
Ehab Al-Shaer
School of Computing
DePaul University
Chicago, IL 60604
ehab@cs.depaul.edu
ABSTRACT
Network intrusions become a signiﬁcation threat to network
servers and its availability. A simple intrusion can suspend
the organization’s network services and can lead to a ﬁnan-
cial disaster. In this paper, we propose a framework called
TimeVM to mitigate, or even eliminate, the infection of a
network intrusion on-line as fast as possible. The frame-
work is based on the virtual machine technology and traﬃc-
replay-based recovery. TimeVM gives the illusion of “time
machine”. TimeVM logs only the network traﬃc to a server
and replays the logged traﬃc to multiple “shadow” virtual
machines (Shadow VM) after diﬀerent time delays (time
lags). Consequently, each Shadow VM will represent the
server at diﬀerent time in history. When attack/infection
is detected, TimeVM enables navigating through the traf-
ﬁc history (logs), picking uninfected Shadow VM, removing
the attack traﬃc, and then fast-replaying the entire traﬃc
history to this Shadow VM. As a result, a typical up-to-date
uninfected version of the original system can be constructed.
The paper shows the implementation details for TimeVM.
It also addresses many practical challenges related to how
to conﬁgure and deploy TimeVM in a system in order to
minimize the recovery time. We present analytical frame-
work and extensive evaluation to validate our approach in
diﬀerent environments.
Categories and Subject Descriptors
K.6.5 [Management of Computing and Information
Systems]: Security and Protection—Invasive software; D.4.8
[Operating System]: Performance—modeling and predic-...


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

Input:
title:TimeVM: a framework for online intrusion mitigation and fast recovery
using multi-time-lag traffic replay
author:Khalid Elbadawi and
Ehab Al-Shaer
TimeVM: A Framework for Online Intrusion Mitigation and
Fast Recovery Using Multi-Time-Lag Trafﬁc Replay
Khalid Elbadawi
School of Computing
DePaul University
Chicago, IL 60604
badawi@cs.depaul.edu
Ehab Al-Shaer
School of Computing
DePaul University
Chicago, IL 60604
ehab@cs.depaul.edu
ABSTRACT
Network intrusions become a signiﬁcation threat to network
servers and its availability. A simple intrusion can suspend
the organization’s network services and can lead to a ﬁnan-
cial disaster. In this paper, we propose a framework called
TimeVM to mitigate, or even eliminate, the infection of a
network intrusion on-line as fast as possible. The frame-
work is based on the virtual machine technology and traﬃc-
replay-based recovery. TimeVM gives the illusion of “time
machine”. TimeVM logs only the network traﬃc to a server
and replays the logged traﬃc to multiple “shadow” virtual
machines (Shadow VM) after diﬀerent time delays (time
lags). Consequently, each Shadow VM will represent the
server at diﬀerent time in history. When attack/infection
is detected, TimeVM enables navigating through the traf-
ﬁc history (logs), picking uninfected Shadow VM, removing
the attack traﬃc, and then fast-replaying the entire traﬃc
history to this Shadow VM. As a result, a typical up-to-date
uninfected version of the original system can be constructed.
The paper shows the implementation details for TimeVM.
It also addresses many practical challenges related to how
to conﬁgure and deploy TimeVM in a system in order to
minimize the recovery time. We present analytical frame-
work and extensive evaluation to validate our approach in
diﬀerent environments.
Categories and Subject Descriptors
K.6.5 [Management of Computing and Information
Systems]: Security and Protection—Invasive software; D.4.8
[Operating System]: Performance—modeling and predic-...

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


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

Output:
安全论文分析：

title:The One-Page Setting: A Higher Standard for Evaluating Website Fingerprinting
Defenses
author:Tao Wang
The One-Page Setting: A Higher Standard for Evaluating Website
Fingerprinting Defenses
Tao Wang
taowang@sfu.ca
Simon Fraser University
Burnaby, Canada
ABSTRACT
To defeat Website Fingerprinting (WF) attacks that threaten pri-
vacy on anonymity technologies such as Tor, defenses have been
proposed and evaluated under the multi-page setting. The multi-
page setting was designed as a difficult setting for the attacker and
therefore gives too much of an advantage to the defense, allowing
weak defenses to show success. We argue that all WF defenses
should instead be evaluated under the one-page setting so that the
defender needs to meet a higher standard of success.
Evaluating known WF defenses under the one-page setting, we
found that Decoy, Front and Tamaraw all failed to defend against
WF attacks. None of these defenses were shown to be vulnerable in
previous work. In Tamaraw’s case, the attacker’s TPR increases 13
times from 2.9% to 37% with 4.4% FPR; he can also achieve 91% TPR
and 21% FPR. We also found that these attacks were able to succeed
in a wide array of newly defined WF scenarios that could not be
captured by the standard laboratory scenario. In response, we create
the first defense that is strong enough for the one-page setting by
augmenting Tamaraw with greater randomization overhead so that
its anonymity sets are more evenly dispersed.
CCS CONCEPTS
• Security and privacy → Pseudonymity, anonymity and un-
traceability; • Networks → Network privacy and anonymity.
KEYWORDS
Anonymity networks; traffic analysis; website fingerprinting
ACM Reference Format:
Tao Wang. 2021. The One-Page Setting: A Higher Standard for Evaluating
Website Fingerprinting Defenses. In Proceedings of the 2021 ACM SIGSAC
Conference on Computer and Communications Security (CCS ’21), November
15–19, 2021, Virtual Event, Republic of Korea. ACM, New York, NY, USA,
13 pages. https://...


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

Input:
title:The One-Page Setting: A Higher Standard for Evaluating Website Fingerprinting
Defenses
author:Tao Wang
The One-Page Setting: A Higher Standard for Evaluating Website
Fingerprinting Defenses
Tao Wang
taowang@sfu.ca
Simon Fraser University
Burnaby, Canada
ABSTRACT
To defeat Website Fingerprinting (WF) attacks that threaten pri-
vacy on anonymity technologies such as Tor, defenses have been
proposed and evaluated under the multi-page setting. The multi-
page setting was designed as a difficult setting for the attacker and
therefore gives too much of an advantage to the defense, allowing
weak defenses to show success. We argue that all WF defenses
should instead be evaluated under the one-page setting so that the
defender needs to meet a higher standard of success.
Evaluating known WF defenses under the one-page setting, we
found that Decoy, Front and Tamaraw all failed to defend against
WF attacks. None of these defenses were shown to be vulnerable in
previous work. In Tamaraw’s case, the attacker’s TPR increases 13
times from 2.9% to 37% with 4.4% FPR; he can also achieve 91% TPR
and 21% FPR. We also found that these attacks were able to succeed
in a wide array of newly defined WF scenarios that could not be
captured by the standard laboratory scenario. In response, we create
the first defense that is strong enough for the one-page setting by
augmenting Tamaraw with greater randomization overhead so that
its anonymity sets are more evenly dispersed.
CCS CONCEPTS
• Security and privacy → Pseudonymity, anonymity and un-
traceability; • Networks → Network privacy and anonymity.
KEYWORDS
Anonymity networks; traffic analysis; website fingerprinting
ACM Reference Format:
Tao Wang. 2021. The One-Page Setting: A Higher Standard for Evaluating
Website Fingerprinting Defenses. In Proceedings of the 2021 ACM SIGSAC
Conference on Computer and Communications Security (CCS ’21), November
15–19, 2021, Virtual Event, Republic of Korea. ACM, New York, NY, USA,
13 pages. https://...

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


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

Output:
安全论文分析：

title:On the Secrecy of Timing-Based Active Watermarking Trace-Back Techniques
author:Pai Peng and
Peng Ning and
Douglas S. Reeves
On the Secrecy of Timing-Based Active Watermarking Trace-Back Techniques∗
Pai Peng
Peng Ning
Douglas S. Reeves
Cyber Defense Laboratory
Department of Computer Science
North Carolina State University
Raleigh, NC 27695, USA
Abstract
Timing-based active watermarking schemes are devel-
oped to trace back attackers through stepping stone con-
nections or anonymizing networks. By slightly changing
packet timing, these schemes achieve robust correlation
for encrypted network connections under timing perturba-
tion. However, the manipulation on packet timing makes
the schemes themselves a potential target of intelligent at-
tackers. In this paper, we analyze the secrecy of the timing-
based active watermarking techniques for tracing through
stepping stones, and propose an attack scheme based on an-
alyzing the packet delays between adjacent stepping stones.
We develop attack techniques to infer important watermark
parameters, and to recover and duplicate embedded water-
marks. The resulting techniques enable an attacker to de-
feat the tracing systems in certain cases by removing water-
marks from the stepping stone connections, or replicating
watermarks in non-stepping stone connections. We also de-
velop techniques to determine in real-time whether a step-
ping stone connection is being watermarked for trace-back
purposes. We have performed substantial experiments using
real-world data to evaluate these techniques. The experi-
mental results demonstrate that for the watermark scheme
being attacked (1) embedded watermarks can be success-
fully recovered and duplicated when the watermark param-
eters are not chosen carefully, and (2) the existence of wa-
termarks in a network ﬂow can always be quickly detected.
1. Introduction
The rapid growth of the Internet not only brings the
global connectivity to the general public, but also offers
maliciou...


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

Input:
title:On the Secrecy of Timing-Based Active Watermarking Trace-Back Techniques
author:Pai Peng and
Peng Ning and
Douglas S. Reeves
On the Secrecy of Timing-Based Active Watermarking Trace-Back Techniques∗
Pai Peng
Peng Ning
Douglas S. Reeves
Cyber Defense Laboratory
Department of Computer Science
North Carolina State University
Raleigh, NC 27695, USA
Abstract
Timing-based active watermarking schemes are devel-
oped to trace back attackers through stepping stone con-
nections or anonymizing networks. By slightly changing
packet timing, these schemes achieve robust correlation
for encrypted network connections under timing perturba-
tion. However, the manipulation on packet timing makes
the schemes themselves a potential target of intelligent at-
tackers. In this paper, we analyze the secrecy of the timing-
based active watermarking techniques for tracing through
stepping stones, and propose an attack scheme based on an-
alyzing the packet delays between adjacent stepping stones.
We develop attack techniques to infer important watermark
parameters, and to recover and duplicate embedded water-
marks. The resulting techniques enable an attacker to de-
feat the tracing systems in certain cases by removing water-
marks from the stepping stone connections, or replicating
watermarks in non-stepping stone connections. We also de-
velop techniques to determine in real-time whether a step-
ping stone connection is being watermarked for trace-back
purposes. We have performed substantial experiments using
real-world data to evaluate these techniques. The experi-
mental results demonstrate that for the watermark scheme
being attacked (1) embedded watermarks can be success-
fully recovered and duplicated when the watermark param-
eters are not chosen carefully, and (2) the existence of wa-
termarks in a network ﬂow can always be quickly detected.
1. Introduction
The rapid growth of the Internet not only brings the
global connectivity to the general public, but also offers
maliciou...

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


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

Output:
安全论文分析：

title:On the structure and characteristics of user agent string
author:Jeffery Kline and
Paul Barford and
Aaron Cahn and
Joel Sommers
On the Structure and Characteristics of User Agent String
Jeff Kline
comScore, Inc.
jkline@comscore.com
University of Wisconsin-Madison
Paul Barford
comScore, Inc.
pb@cs.wisc.edu
Aaron Cahn
comScore, Inc.
acahn@comscore.com
Joel Sommers
Colgate University
jsommers@colgate.edu
ABSTRACT
User agent (UA) strings transmitted during HTTP transactions
convey client system configuration details to ensure that content
returned by a server is appropriate for the requesting host. As
such, analysis of UA strings and their structure offers a unique per-
spective on active client systems in the Internet and when tracked
longitudinally, offers a perspective on the nature of system and
configuration dynamics. In this paper, we describe our study of
UA string characteristics. Our work is based on analyzing a unique
corpus of over 1B UA strings collected over a period of 2 years by
comScore. We begin by analyzing the general characteristics of
UA strings, focusing on the most prevalent strings and dynamic
behaviors. We identify the top 10 most popular User Agents, which
account for 26% of total daily volume. These strings describe the
expected instances of popular platforms such as Microsoft, Apple
and Google. We then report on the characteristics of low-volume
UA strings, which has important implications for unique device
identification. We show that this class of user agent generates the
overwhelming majority of traffic, with between 2M and 10M in-
stances observed each day. We show that the distribution of UA
strings has temporal dependence and we show the distribution
measured depends on the type of content served. Finally, we report
on two large-scale UA anomalies characterized by web browsers
sending false and misleading UAs in their web requests.
CCS CONCEPTS
• Information systems → Web log analysis; Traffic analysis;
Data mining; • Software and...


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

Input:
title:On the structure and characteristics of user agent string
author:Jeffery Kline and
Paul Barford and
Aaron Cahn and
Joel Sommers
On the Structure and Characteristics of User Agent String
Jeff Kline
comScore, Inc.
jkline@comscore.com
University of Wisconsin-Madison
Paul Barford
comScore, Inc.
pb@cs.wisc.edu
Aaron Cahn
comScore, Inc.
acahn@comscore.com
Joel Sommers
Colgate University
jsommers@colgate.edu
ABSTRACT
User agent (UA) strings transmitted during HTTP transactions
convey client system configuration details to ensure that content
returned by a server is appropriate for the requesting host. As
such, analysis of UA strings and their structure offers a unique per-
spective on active client systems in the Internet and when tracked
longitudinally, offers a perspective on the nature of system and
configuration dynamics. In this paper, we describe our study of
UA string characteristics. Our work is based on analyzing a unique
corpus of over 1B UA strings collected over a period of 2 years by
comScore. We begin by analyzing the general characteristics of
UA strings, focusing on the most prevalent strings and dynamic
behaviors. We identify the top 10 most popular User Agents, which
account for 26% of total daily volume. These strings describe the
expected instances of popular platforms such as Microsoft, Apple
and Google. We then report on the characteristics of low-volume
UA strings, which has important implications for unique device
identification. We show that this class of user agent generates the
overwhelming majority of traffic, with between 2M and 10M in-
stances observed each day. We show that the distribution of UA
strings has temporal dependence and we show the distribution
measured depends on the type of content served. Finally, we report
on two large-scale UA anomalies characterized by web browsers
sending false and misleading UAs in their web requests.
CCS CONCEPTS
• Information systems → Web log analysis; Traffic analysis;
Data mining; • Software and...

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


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

Output:
安全论文分析：

title:ShadowMove: A Stealthy Lateral Movement Strategy
author:Amirreza Niakanlahiji and
Jinpeng Wei and
Md Rabbi Alam and
Qingyang Wang and
Bei-Tseng Chu
ShadowMove: A Stealthy Lateral Movement Strategy
Amirreza Niakanlahiji, University of Illinois Springfield; Jinpeng Wei and
Md Rabbi Alam, UNC Charlotte; Qingyang Wang, Louisiana State University;
Bei-Tseng Chu, UNC Charlotte
https://www.usenix.org/conference/usenixsecurity20/presentation/niakanlahiji
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.ShadowMove: A Stealthy Lateral Movement Strategy
Amirreza Niakanlahiji∗
University of Illinois Springﬁeld
aniak2@uis.edu
Jinpeng Wei
UNC Charlotte
jwei8@uncc.edu
Md Rabbi Alam
UNC Charlotte
malam5@uncc.edu
Qingyang Wang
Louisiana State University
qwang26@lsu.edu
Bei-Tseng Chu
UNC Charlotte
billchu@uncc.edu
Abstract
Advanced Persistence Threat (APT) attacks use various
strategies and techniques to move laterally within an enter-
prise environment; however, the existing strategies and tech-
niques have limitations such as requiring elevated permissions,
creating new connections, performing new authentications, or
requiring process injections. Based on these characteristics,
many host and network-based solutions have been proposed
to prevent or detect such lateral movement attempts. In this
paper, we present a novel stealthy lateral movement strategy,
ShadowMove, in which only established connections between
systems in an enterprise network are misused for lateral move-
ments. It has a set of unique features such as requiring no
elevated privilege, no new connection, no extra authentication,
and no process injection, which makes it stealthy against state-
of-the-art detection mechanisms. ShadowMove is enabled by
a novel socket duplication approach that allows a malicious
process to silently abuse TCP connections es...


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

Input:
title:ShadowMove: A Stealthy Lateral Movement Strategy
author:Amirreza Niakanlahiji and
Jinpeng Wei and
Md Rabbi Alam and
Qingyang Wang and
Bei-Tseng Chu
ShadowMove: A Stealthy Lateral Movement Strategy
Amirreza Niakanlahiji, University of Illinois Springfield; Jinpeng Wei and
Md Rabbi Alam, UNC Charlotte; Qingyang Wang, Louisiana State University;
Bei-Tseng Chu, UNC Charlotte
https://www.usenix.org/conference/usenixsecurity20/presentation/niakanlahiji
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.ShadowMove: A Stealthy Lateral Movement Strategy
Amirreza Niakanlahiji∗
University of Illinois Springﬁeld
aniak2@uis.edu
Jinpeng Wei
UNC Charlotte
jwei8@uncc.edu
Md Rabbi Alam
UNC Charlotte
malam5@uncc.edu
Qingyang Wang
Louisiana State University
qwang26@lsu.edu
Bei-Tseng Chu
UNC Charlotte
billchu@uncc.edu
Abstract
Advanced Persistence Threat (APT) attacks use various
strategies and techniques to move laterally within an enter-
prise environment; however, the existing strategies and tech-
niques have limitations such as requiring elevated permissions,
creating new connections, performing new authentications, or
requiring process injections. Based on these characteristics,
many host and network-based solutions have been proposed
to prevent or detect such lateral movement attempts. In this
paper, we present a novel stealthy lateral movement strategy,
ShadowMove, in which only established connections between
systems in an enterprise network are misused for lateral move-
ments. It has a set of unique features such as requiring no
elevated privilege, no new connection, no extra authentication,
and no process injection, which makes it stealthy against state-
of-the-art detection mechanisms. ShadowMove is enabled by
a novel socket duplication approach that allows a malicious
process to silently abuse TCP connections es...

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


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

Output:
安全论文分析：

title:Measuring the Practical Impact of DNSSEC Deployment
author:Wilson Lian and
Eric Rescorla and
Hovav Shacham and
Stefan Savage
Measuring the Practical Impact
of DNSSEC Deployment
Wilson Lian, University of California, San Diego; Eric Rescorla, RTFM, Inc.;
Hovav Shacham and Stefan Savage, 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Measuring the practical impact of DNSSEC Deployment
Wilson Lian
UC San Diego
Eric Rescorla
RTFM, Inc.
Hovav Shacham
UC San Diego
Stefan Savage
UC San Diego
Abstract
DNSSEC extends DNS with a public-key infras-
tructure, providing compatible clients with crypto-
graphic assurance for DNS records they obtain, even
in the presence of an active network attacker. As
with many Internet protocol deployments, admin-
istrators deciding whether to deploy DNSSEC for
their DNS zones must perform cost/beneﬁt analy-
sis. For some fraction of clients — those that perform
DNSSEC validation — the zone will be protected
from malicious hijacking. But another fraction of
clients — those whose DNS resolvers are buggy and
incompatible with DNSSEC — will no longer be able
to connect to the zone. Deploying DNSSEC requires
making a cost-beneﬁt decision, balancing security for
some users with denial of service for others.
We have performed a large-scale measurement of
the eﬀects of DNSSEC on client name resolution us-
ing an ad network to collect results from over 500,000
geographically-distributed clients. Our ﬁndings cor-
roborate those of previous researchers in showing
that a relatively small fraction of users are protected
by DNSSEC-validating resolvers. And we show, for
the ﬁrst time, that enabling DNSSEC measurably in-
creases end-to-end resolution failures. For every 10
clients that are protected from DNS tampering when
a dom...


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

Input:
title:Measuring the Practical Impact of DNSSEC Deployment
author:Wilson Lian and
Eric Rescorla and
Hovav Shacham and
Stefan Savage
Measuring the Practical Impact
of DNSSEC Deployment
Wilson Lian, University of California, San Diego; Eric Rescorla, RTFM, Inc.;
Hovav Shacham and Stefan Savage, 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Measuring the practical impact of DNSSEC Deployment
Wilson Lian
UC San Diego
Eric Rescorla
RTFM, Inc.
Hovav Shacham
UC San Diego
Stefan Savage
UC San Diego
Abstract
DNSSEC extends DNS with a public-key infras-
tructure, providing compatible clients with crypto-
graphic assurance for DNS records they obtain, even
in the presence of an active network attacker. As
with many Internet protocol deployments, admin-
istrators deciding whether to deploy DNSSEC for
their DNS zones must perform cost/beneﬁt analy-
sis. For some fraction of clients — those that perform
DNSSEC validation — the zone will be protected
from malicious hijacking. But another fraction of
clients — those whose DNS resolvers are buggy and
incompatible with DNSSEC — will no longer be able
to connect to the zone. Deploying DNSSEC requires
making a cost-beneﬁt decision, balancing security for
some users with denial of service for others.
We have performed a large-scale measurement of
the eﬀects of DNSSEC on client name resolution us-
ing an ad network to collect results from over 500,000
geographically-distributed clients. Our ﬁndings cor-
roborate those of previous researchers in showing
that a relatively small fraction of users are protected
by DNSSEC-validating resolvers. And we show, for
the ﬁrst time, that enabling DNSSEC measurably in-
creases end-to-end resolution failures. For every 10
clients that are protected from DNS tampering when
a dom...

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