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

Input:
title:Seven Months' Worth of Mistakes: A Longitudinal Study of Typosquatting
Abuse
author:Pieter Agten and
Wouter Joosen and
Frank Piessens and
Nick Nikiforakis
Seven Months’ Worth of Mistakes:
A Longitudinal Study of Typosquatting Abuse
Pieter Agten∗, Wouter Joosen∗, Frank Piessens∗ and Nick Nikiforakis†
∗ iMinds-DistriNet, KU Leuven,
{firstname}.{lastname}@cs.kuleuven.be
† Department of Computer Science, Stony Brook University,
nick@cs.stonybrook.edu
Abstract—Typosquatting is the act of purposefully registering
a domain name that is a mistype of a popular domain name.
It is a concept that has been known and studied for over 15
years, yet still thoroughly practiced up until this day. While
previous typosquatting studies have always taken a snapshot of
the typosquatting landscape or base their longitudinal results
only on domain registration data, we present the ﬁrst content-
based,
longitudinal study of typosquatting. We collected data
about the typosquatting domains of the 500 most popular sites of
the Internet every day, for a period of seven months, and we use
this data to establish whether previously discovered typosquatting
trends still hold today, and to provide new results and insights
in the typosquatting landscape. In particular we reveal that,
even though 95% of the popular domains we investigated are
actively targeted by typosquatters, only few trademark owners
protect themselves against this practice by proactively registering
their own typosquatting domains. We take advantage of the
longitudinal aspect of our study to show, among other results,
that typosquatting domains change hands from typosquatters
to legitimate owners and vice versa, and that typosquatters
vary their monetization strategy by hosting different types of
pages over time. Our study also reveals that a large fraction of
typosquatting domains can be traced back to a small group of
typosquatting page hosters and that certain top-level domains are
much more prone to typosquatting than oth...

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


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

Output:
安全论文分析：

title:Crossing the "Valley of Death": Transitioning Research into Commercial
Products - A Personal Perspective
author:W. Douglas Maughan
2010 IEEE Symposium on Security and Privacy
Crossing the “Valley of Death”: Transitioning Research into Commercial Products
A Personal Perspective
W. Douglas Maughan
Potomac Institute for Policy Studies
Arlington, Virginia  USA
Douglas.Maughan@verizon.net
Abstract—Many  researchers  with  innovative  ideas  just  never
seem  to  be  able  to  bring  those  ideas  to  market.  One  of  the
biggest problems within the cybersecurity research community
is  transitioning  technology  into  commercial  product.  This
paper discusses these technology transition activities from the
view  of  a  program  manager  and  offers  several  examples  of
successful transition for consideration.
Keywords-  technology  transition;  cybersecurity;  research;
development; open source; small business
I. INTRODUCTION
A  consistent  problem  encountered  in  the  world  of
research  and  development  (R&D),  which  is  especially  true
for the field of cyber security, is taking the research through
a path of development, testing, evaluation, and transition into
operational  environments.  Past  experience  shows
that
transition plans developed and applied early in the life cycle
of the research program, with probable paths for the research
product,  are  effective  in  achieving  successful  transfer  from
research to application and use. Transition plans are subject
to  change  and  must  be
reviewed  often.  Different
technologies  are  better  suited  for  different  technology
transition  paths  and  in  some  instances  the  choice  of  the
transition  path  will  ultimately  determine  success  or  failure
for
the  “research  product”  becoming  a  “commercial
product”.
A July 2007 Department of Defense Report to Congress
on  Technology  Transition  noted  there  is  evidence  that  a
chasm  exists  between  the  ...


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

Input:
title:Crossing the "Valley of Death": Transitioning Research into Commercial
Products - A Personal Perspective
author:W. Douglas Maughan
2010 IEEE Symposium on Security and Privacy
Crossing the “Valley of Death”: Transitioning Research into Commercial Products
A Personal Perspective
W. Douglas Maughan
Potomac Institute for Policy Studies
Arlington, Virginia  USA
Douglas.Maughan@verizon.net
Abstract—Many  researchers  with  innovative  ideas  just  never
seem  to  be  able  to  bring  those  ideas  to  market.  One  of  the
biggest problems within the cybersecurity research community
is  transitioning  technology  into  commercial  product.  This
paper discusses these technology transition activities from the
view  of  a  program  manager  and  offers  several  examples  of
successful transition for consideration.
Keywords-  technology  transition;  cybersecurity;  research;
development; open source; small business
I. INTRODUCTION
A  consistent  problem  encountered  in  the  world  of
research  and  development  (R&D),  which  is  especially  true
for the field of cyber security, is taking the research through
a path of development, testing, evaluation, and transition into
operational  environments.  Past  experience  shows
that
transition plans developed and applied early in the life cycle
of the research program, with probable paths for the research
product,  are  effective  in  achieving  successful  transfer  from
research to application and use. Transition plans are subject
to  change  and  must  be
reviewed  often.  Different
technologies  are  better  suited  for  different  technology
transition  paths  and  in  some  instances  the  choice  of  the
transition  path  will  ultimately  determine  success  or  failure
for
the  “research  product”  becoming  a  “commercial
product”.
A July 2007 Department of Defense Report to Congress
on  Technology  Transition  noted  there  is  evidence  that  a
chasm  exists  between  the  ...

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


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

Output:
安全论文分析：

title:Using GANs for Sharing Networked Time Series Data: Challenges, Initial
Promise, and Open Questions
author:Zinan Lin and
Alankar Jain and
Chen Wang and
Giulia C. Fanti and
Vyas Sekar
Using GANs for Sharing Networked Time Series Data:
Challenges, Initial Promise, and Open Questions
Zinan Lin
Chen Wang
Alankar Jain
IBM
New York, NY
Chen.Wang1@ibm.com
Carnegie Mellon University
Pittsburgh, PA
zinanl@andrew.cmu.edu
Carnegie Mellon University
Pittsburgh, PA
alankarjain91@gmail.com
Giulia Fanti
Carnegie Mellon University
Pittsburgh, PA
gfanti@andrew.cmu.edu
Vyas Sekar
Carnegie Mellon University
Pittsburgh, PA
vsekar@andrew.cmu.edu
ABSTRACT
Limited data access is a longstanding barrier to data-driven re-
search and development in the networked systems community.
In this work, we explore if and how generative adversarial net-
works (GANs) can be used to incentivize data sharing by enabling
a generic framework for sharing synthetic datasets with minimal
expert knowledge. As a specific target, our focus in this paper is
on time series datasets with metadata (e.g., packet loss rate mea-
surements with corresponding ISPs). We identify key challenges
of existing GAN approaches for such workloads with respect to
fidelity (e.g., long-term dependencies, complex multidimensional
relationships, mode collapse) and privacy (i.e., existing guarantees
are poorly understood and can sacrifice fidelity). To improve fi-
delity, we design a custom workflow called DoppelGANger (DG)
and demonstrate that across diverse real-world datasets (e.g., band-
width measurements, cluster requests, web sessions) and use cases
(e.g., structural characterization, predictive modeling, algorithm
comparison), DG achieves up to 43% better fidelity than baseline
models. Although we do not resolve the privacy problem in this
work, we identify fundamental challenges with both classical no-
tions of privacy and recent advances to improve the privacy prop-
erties of GANs, and suggest a potential roadmap for add...


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

Input:
title:Using GANs for Sharing Networked Time Series Data: Challenges, Initial
Promise, and Open Questions
author:Zinan Lin and
Alankar Jain and
Chen Wang and
Giulia C. Fanti and
Vyas Sekar
Using GANs for Sharing Networked Time Series Data:
Challenges, Initial Promise, and Open Questions
Zinan Lin
Chen Wang
Alankar Jain
IBM
New York, NY
Chen.Wang1@ibm.com
Carnegie Mellon University
Pittsburgh, PA
zinanl@andrew.cmu.edu
Carnegie Mellon University
Pittsburgh, PA
alankarjain91@gmail.com
Giulia Fanti
Carnegie Mellon University
Pittsburgh, PA
gfanti@andrew.cmu.edu
Vyas Sekar
Carnegie Mellon University
Pittsburgh, PA
vsekar@andrew.cmu.edu
ABSTRACT
Limited data access is a longstanding barrier to data-driven re-
search and development in the networked systems community.
In this work, we explore if and how generative adversarial net-
works (GANs) can be used to incentivize data sharing by enabling
a generic framework for sharing synthetic datasets with minimal
expert knowledge. As a specific target, our focus in this paper is
on time series datasets with metadata (e.g., packet loss rate mea-
surements with corresponding ISPs). We identify key challenges
of existing GAN approaches for such workloads with respect to
fidelity (e.g., long-term dependencies, complex multidimensional
relationships, mode collapse) and privacy (i.e., existing guarantees
are poorly understood and can sacrifice fidelity). To improve fi-
delity, we design a custom workflow called DoppelGANger (DG)
and demonstrate that across diverse real-world datasets (e.g., band-
width measurements, cluster requests, web sessions) and use cases
(e.g., structural characterization, predictive modeling, algorithm
comparison), DG achieves up to 43% better fidelity than baseline
models. Although we do not resolve the privacy problem in this
work, we identify fundamental challenges with both classical no-
tions of privacy and recent advances to improve the privacy prop-
erties of GANs, and suggest a potential roadmap for add...

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


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

Output:
安全论文分析：

title:Cloudy with a Chance of Breach: Forecasting Cyber Security Incidents
author:Yang Liu and
Armin Sarabi and
Jing Zhang and
Parinaz Naghizadeh and
Manish Karir and
Michael Bailey and
Mingyan Liu
Cloudy with a Chance of Breach:
Forecasting Cyber Security Incidents
Yang Liu, Armin Sarabi, Jing Zhang, and Parinaz Naghizadeh, University of Michigan;
Manish Karir, QuadMetrics, Inc.; Michael Bailey, University of Illinois at Urbana-Champaign;
Mingyan Liu, University of Michigan and QuadMetrics, Inc.
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/liu
This paper is included in the Proceedings of the
24th USENIX Security Symposium
August 12–14, 2015 • Washington, D.C.
ISBN  978-1-939133-11-3
Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXCloudy with a Chance of Breach: Forecasting Cyber Security Incidents
Yang Liu1, Armin Sarabi1, Jing Zhang1, Parinaz Naghizadeh1
Manish Karir2, Michael Bailey3, Mingyan Liu1,2
1 EECS Department, University of Michigan, Ann Arbor
3 ECE Department, University of Illinois, Urbana-Champaign
2 QuadMetrics, Inc.
Abstract
In this study we characterize the extent to which cyber
security incidents, such as those referenced by Verizon
in its annual Data Breach Investigations Reports (DBIR),
can be predicted based on externally observable prop-
erties of an organization’s network. We seek to proac-
tively forecast an organization’s breaches and to do so
without cooperation of the organization itself. To ac-
complish this goal, we collect 258 externally measur-
able features about an organization’s network from two
main categories: mismanagement symptoms, such as
misconﬁgured DNS or BGP within a network, and mali-
cious activity time series, which include spam, phishing,
and scanning activity sourced from these organizations.
Using these features we train and test a Random For-
est (RF) classiﬁer against more than 1,000 incident re-
ports taken from the VERIS commun...


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

Input:
title:Cloudy with a Chance of Breach: Forecasting Cyber Security Incidents
author:Yang Liu and
Armin Sarabi and
Jing Zhang and
Parinaz Naghizadeh and
Manish Karir and
Michael Bailey and
Mingyan Liu
Cloudy with a Chance of Breach:
Forecasting Cyber Security Incidents
Yang Liu, Armin Sarabi, Jing Zhang, and Parinaz Naghizadeh, University of Michigan;
Manish Karir, QuadMetrics, Inc.; Michael Bailey, University of Illinois at Urbana-Champaign;
Mingyan Liu, University of Michigan and QuadMetrics, Inc.
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/liu
This paper is included in the Proceedings of the
24th USENIX Security Symposium
August 12–14, 2015 • Washington, D.C.
ISBN  978-1-939133-11-3
Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXCloudy with a Chance of Breach: Forecasting Cyber Security Incidents
Yang Liu1, Armin Sarabi1, Jing Zhang1, Parinaz Naghizadeh1
Manish Karir2, Michael Bailey3, Mingyan Liu1,2
1 EECS Department, University of Michigan, Ann Arbor
3 ECE Department, University of Illinois, Urbana-Champaign
2 QuadMetrics, Inc.
Abstract
In this study we characterize the extent to which cyber
security incidents, such as those referenced by Verizon
in its annual Data Breach Investigations Reports (DBIR),
can be predicted based on externally observable prop-
erties of an organization’s network. We seek to proac-
tively forecast an organization’s breaches and to do so
without cooperation of the organization itself. To ac-
complish this goal, we collect 258 externally measur-
able features about an organization’s network from two
main categories: mismanagement symptoms, such as
misconﬁgured DNS or BGP within a network, and mali-
cious activity time series, which include spam, phishing,
and scanning activity sourced from these organizations.
Using these features we train and test a Random For-
est (RF) classiﬁer against more than 1,000 incident re-
ports taken from the VERIS commun...

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


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

Output:
安全论文分析：

title:Achieving Flexibility for ABE with Outsourcing via Proxy Re-Encryption
author:Zuoxia Yu and
Man Ho Au and
Rupeng Yang and
Junzuo Lai and
Qiuliang Xu
Achieving Flexibility for ABE with Outsourcing via Proxy
Re-Encryption
Zuoxia Yu
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
zuoxia.yu@gmail.com
Man Ho Au∗
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
csallen@comp.polyu.edu.hk
Rupeng Yang
School of Computer Science and
Technology, Shandong University;
Department of Computing,
The Hong Kong Polytechnic
University
Jinan, China
orbbyrp@gmail.com
Junzuo Lai
College of Information Science and
Technology, Jinan University,
Guangzhou, China;
State Key Laboratory of Cryptology,
Beijing, China
laijunzuo@gmail.com
Qiuliang Xu
School of Computer Science and
Technology,
Shandong University
Jinan, China
xql@sdu.edu.cn
ABSTRACT
Outsourcing the decryption of attribute-based encryption (ABE)
ciphertext is a promising way to tackle the question of how users
can perform decryption efficiently. However, existing solutions re-
quire the type of the target ciphertext to be determined at the setup
of the outsourcing scheme. As such, making the target cryptosys-
tems (or the clients) to be versatile becomes an issue that warrants
investigations. In this paper, the problem we wish to tackle is to
transform an ABE ciphertext to any client who is using the same,
or possibly different, public-key encryption (PKE) system with the
sender. The problem is of practical interest since it is hard to require
all clients to use the same PKE, especially in the case of remote and
cross-system data sharing. In addition, we also consider whether
robust client-side decryption scheme can be adopted. This feature
is not supported in the existing ABE with outsourcing.
We introduce cross-system proxy re-encryptions (CS-PRE), a
new re-encryption paradigm in which a semi-trusted proxy con-
verts a ciphertext of a source cryptosystem (Π0) into...


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

Input:
title:Achieving Flexibility for ABE with Outsourcing via Proxy Re-Encryption
author:Zuoxia Yu and
Man Ho Au and
Rupeng Yang and
Junzuo Lai and
Qiuliang Xu
Achieving Flexibility for ABE with Outsourcing via Proxy
Re-Encryption
Zuoxia Yu
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
zuoxia.yu@gmail.com
Man Ho Au∗
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
csallen@comp.polyu.edu.hk
Rupeng Yang
School of Computer Science and
Technology, Shandong University;
Department of Computing,
The Hong Kong Polytechnic
University
Jinan, China
orbbyrp@gmail.com
Junzuo Lai
College of Information Science and
Technology, Jinan University,
Guangzhou, China;
State Key Laboratory of Cryptology,
Beijing, China
laijunzuo@gmail.com
Qiuliang Xu
School of Computer Science and
Technology,
Shandong University
Jinan, China
xql@sdu.edu.cn
ABSTRACT
Outsourcing the decryption of attribute-based encryption (ABE)
ciphertext is a promising way to tackle the question of how users
can perform decryption efficiently. However, existing solutions re-
quire the type of the target ciphertext to be determined at the setup
of the outsourcing scheme. As such, making the target cryptosys-
tems (or the clients) to be versatile becomes an issue that warrants
investigations. In this paper, the problem we wish to tackle is to
transform an ABE ciphertext to any client who is using the same,
or possibly different, public-key encryption (PKE) system with the
sender. The problem is of practical interest since it is hard to require
all clients to use the same PKE, especially in the case of remote and
cross-system data sharing. In addition, we also consider whether
robust client-side decryption scheme can be adopted. This feature
is not supported in the existing ABE with outsourcing.
We introduce cross-system proxy re-encryptions (CS-PRE), a
new re-encryption paradigm in which a semi-trusted proxy con-
verts a ciphertext of a source cryptosystem (Π0) into...

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


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

Output:
安全论文分析：

title:T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
author:Xiaopeng Li and
Qiang Zeng and
Lannan Luo and
Tongbo Luo
T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
Xiaopeng Li
University of South Carolina
xl4@email.sc.edu
Lannan Luo
University of South Carolina
lluo@cse.sc.edu
Qiang Zeng∗
University of South Carolina
zeng1@cse.sc.edu
Tongbo Luo
JD.com
tongbo.luo@jd.com
ABSTRACT
Secure pairing is key to trustworthy deployment and application of
Internet of Things (IoT) devices. However, IoT devices lack conven-
tional user interfaces, such as keyboards and displays, which makes
many traditional pairing approaches inapplicable. Proximity-based
pairing approaches are very usable, but can be exploited by co-
located malicious devices. Approaches based on a user’s physical
operations on IoT devices are more secure, but typically require
inertial sensors, while many devices do not satisfy this require-
ment. A secure and usable pairing approach that can be applied to
heterogeneous IoT devices still does not exist. We develop a tech-
nique, Universal Operation Sensing, which allows an IoT device to
sense the user’s physical operations on it without requiring inertial
sensors. With this technique, a user holding a smartphone or wear-
ing a wristband can finish pairing in seconds through some very
simple operations, e.g., pressing a button or twisting a knob. More-
over, we reveal an inaccuracy issue in original fuzzy commitment
and propose faithful fuzzy commitment to resolve it. We design
a pairing protocol using faithful fuzzy commitment, and build a
prototype system named Touch-to-Pair (T2Pair, for short). The
comprehensive evaluation shows that it is secure and usable.
CCS CONCEPTS
• Security and privacy→ Security services; Network security;
• Computer systems organization→ Sensor networks.
KEYWORDS
Pairing; Internet of Things; fuzzy commitment; PAKE
ACM Reference Format:
Xiaopeng Li, Qiang Zeng, Lannan Luo, and Tongbo Luo. 2020. T2Pair...


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

Input:
title:T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
author:Xiaopeng Li and
Qiang Zeng and
Lannan Luo and
Tongbo Luo
T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
Xiaopeng Li
University of South Carolina
xl4@email.sc.edu
Lannan Luo
University of South Carolina
lluo@cse.sc.edu
Qiang Zeng∗
University of South Carolina
zeng1@cse.sc.edu
Tongbo Luo
JD.com
tongbo.luo@jd.com
ABSTRACT
Secure pairing is key to trustworthy deployment and application of
Internet of Things (IoT) devices. However, IoT devices lack conven-
tional user interfaces, such as keyboards and displays, which makes
many traditional pairing approaches inapplicable. Proximity-based
pairing approaches are very usable, but can be exploited by co-
located malicious devices. Approaches based on a user’s physical
operations on IoT devices are more secure, but typically require
inertial sensors, while many devices do not satisfy this require-
ment. A secure and usable pairing approach that can be applied to
heterogeneous IoT devices still does not exist. We develop a tech-
nique, Universal Operation Sensing, which allows an IoT device to
sense the user’s physical operations on it without requiring inertial
sensors. With this technique, a user holding a smartphone or wear-
ing a wristband can finish pairing in seconds through some very
simple operations, e.g., pressing a button or twisting a knob. More-
over, we reveal an inaccuracy issue in original fuzzy commitment
and propose faithful fuzzy commitment to resolve it. We design
a pairing protocol using faithful fuzzy commitment, and build a
prototype system named Touch-to-Pair (T2Pair, for short). The
comprehensive evaluation shows that it is secure and usable.
CCS CONCEPTS
• Security and privacy→ Security services; Network security;
• Computer systems organization→ Sensor networks.
KEYWORDS
Pairing; Internet of Things; fuzzy commitment; PAKE
ACM Reference Format:
Xiaopeng Li, Qiang Zeng, Lannan Luo, and Tongbo Luo. 2020. T2Pair...

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


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

Output:
安全论文分析：

title:RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment
and Invalid Route Origins
author:Taejoong Chung and
Emile Aben and
Tim Bruijnzeels and
Balakrishnan Chandrasekaran and
David R. Choffnes and
Dave Levin and
Bruce M. Maggs and
Alan Mislove and
Roland van Rijswijk-Deij and
John P. Rula and
Nick Sullivan
RPKI is Coming of Age
A Longitudinal Study of RPKI Deployment and Invalid Route Origins
Taejoong Chung
Rochester Institute of Technology
Balakrishnan Chandrasekaran
Max Planck Institute for Informatics
Bruce M. Maggs
Duke University and
Akamai Technologies
Emile Aben
RIPE NCC
David Choffnes
Northeastern University
Alan Mislove
Northeastern University
Tim Bruijnzeels
NLNetLabs
Dave Levin
University of Maryland
Roland van Rijswijk-Deij
University of Twente and
NLNetLabs
John Rula
Akamai Technologies
Nick Sullivan
Cloudflare
ABSTRACT
Despite its critical role in Internet connectivity, the Border Gateway
Protocol (BGP) remains highly vulnerable to attacks such as prefix
hijacking, where an Autonomous System (AS) announces routes
for IP space it does not control. To address this issue, the Resource
Public Key Infrastructure (RPKI) was developed starting in 2008,
with deployment beginning in 2011. This paper performs the first
comprehensive, longitudinal study of the deployment, coverage,
and quality of RPKI.
We use a unique dataset containing all RPKI Route Origin Autho-
rizations (ROAs) from the moment RPKI was first deployed, more
than 8 years ago. We combine this dataset with BGP announce-
ments from more than 3,300 BGP collectors worldwide. Our analysis
shows the after a gradual start, RPKI has seen a rapid increase in
adoption over the past two years. We also show that although
misconfigurations were rampant when RPKI was first deployed
(causing many announcements to appear as invalid) they are quite
rare today. We develop a taxonomy of invalid RPKI announcements,
then quantify their prevalence. We further identify suspicious an-
nouncements indicativ...


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

Input:
title:RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment
and Invalid Route Origins
author:Taejoong Chung and
Emile Aben and
Tim Bruijnzeels and
Balakrishnan Chandrasekaran and
David R. Choffnes and
Dave Levin and
Bruce M. Maggs and
Alan Mislove and
Roland van Rijswijk-Deij and
John P. Rula and
Nick Sullivan
RPKI is Coming of Age
A Longitudinal Study of RPKI Deployment and Invalid Route Origins
Taejoong Chung
Rochester Institute of Technology
Balakrishnan Chandrasekaran
Max Planck Institute for Informatics
Bruce M. Maggs
Duke University and
Akamai Technologies
Emile Aben
RIPE NCC
David Choffnes
Northeastern University
Alan Mislove
Northeastern University
Tim Bruijnzeels
NLNetLabs
Dave Levin
University of Maryland
Roland van Rijswijk-Deij
University of Twente and
NLNetLabs
John Rula
Akamai Technologies
Nick Sullivan
Cloudflare
ABSTRACT
Despite its critical role in Internet connectivity, the Border Gateway
Protocol (BGP) remains highly vulnerable to attacks such as prefix
hijacking, where an Autonomous System (AS) announces routes
for IP space it does not control. To address this issue, the Resource
Public Key Infrastructure (RPKI) was developed starting in 2008,
with deployment beginning in 2011. This paper performs the first
comprehensive, longitudinal study of the deployment, coverage,
and quality of RPKI.
We use a unique dataset containing all RPKI Route Origin Autho-
rizations (ROAs) from the moment RPKI was first deployed, more
than 8 years ago. We combine this dataset with BGP announce-
ments from more than 3,300 BGP collectors worldwide. Our analysis
shows the after a gradual start, RPKI has seen a rapid increase in
adoption over the past two years. We also show that although
misconfigurations were rampant when RPKI was first deployed
(causing many announcements to appear as invalid) they are quite
rare today. We develop a taxonomy of invalid RPKI announcements,
then quantify their prevalence. We further identify suspicious an-
nouncements indicativ...

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


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

Output:
安全论文分析：

title:Profiling BGP Serial Hijackers: Capturing Persistent Misbehavior
in the Global Routing Table
author:Cecilia Testart and
Philipp Richter and
Alistair King and
Alberto Dainotti and
David Clark
Profiling BGP Serial Hijackers: Capturing Persistent
Misbehavior in the Global Routing Table
Cecilia Testart
MIT
ctestart@csail.mit.edu
Philipp Richter
MIT
richterp@csail.mit.edu
Alistair King
CAIDA, UC San Diego
alistair@caida.org
Alberto Dainotti
CAIDA, UC San Diego
alberto@caida.org
ABSTRACT
BGP hijacks remain an acute problem in today’s Internet, with wide-
spread consequences. While hijack detection systems are readily
available, they typically rely on a priori prefix-ownership infor-
mation and are reactive in nature. In this work, we take on a new
perspective on BGP hijacking activity: we introduce and track the
long-term routing behavior of serial hijackers, networks that re-
peatedly hijack address blocks for malicious purposes, often over
the course of many months or even years. Based on a ground truth
dataset that we construct by extracting information from network
operator mailing lists, we illuminate the dominant routing char-
acteristics of serial hijackers, and how they differ from legitimate
networks. We then distill features that can capture these behavioral
differences and train a machine learning model to automatically
identify Autonomous Systems (ASes) that exhibit characteristics
similar to serial hijackers. Our classifier identifies ≈ 900 ASes with
similar behavior in the global IPv4 routing table. We analyze and
categorize these networks, finding a wide range of indicators of
malicious activity, misconfiguration, as well as benign hijacking
activity. Our work presents a solid first step towards identifying
and understanding this important category of networks, which
can aid network operators in taking proactive measures to defend
themselves against prefix hijacking and serve as input for current
and future detection systems.
CCS CONCEPTS
• Networks →...


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

Input:
title:Profiling BGP Serial Hijackers: Capturing Persistent Misbehavior
in the Global Routing Table
author:Cecilia Testart and
Philipp Richter and
Alistair King and
Alberto Dainotti and
David Clark
Profiling BGP Serial Hijackers: Capturing Persistent
Misbehavior in the Global Routing Table
Cecilia Testart
MIT
ctestart@csail.mit.edu
Philipp Richter
MIT
richterp@csail.mit.edu
Alistair King
CAIDA, UC San Diego
alistair@caida.org
Alberto Dainotti
CAIDA, UC San Diego
alberto@caida.org
ABSTRACT
BGP hijacks remain an acute problem in today’s Internet, with wide-
spread consequences. While hijack detection systems are readily
available, they typically rely on a priori prefix-ownership infor-
mation and are reactive in nature. In this work, we take on a new
perspective on BGP hijacking activity: we introduce and track the
long-term routing behavior of serial hijackers, networks that re-
peatedly hijack address blocks for malicious purposes, often over
the course of many months or even years. Based on a ground truth
dataset that we construct by extracting information from network
operator mailing lists, we illuminate the dominant routing char-
acteristics of serial hijackers, and how they differ from legitimate
networks. We then distill features that can capture these behavioral
differences and train a machine learning model to automatically
identify Autonomous Systems (ASes) that exhibit characteristics
similar to serial hijackers. Our classifier identifies ≈ 900 ASes with
similar behavior in the global IPv4 routing table. We analyze and
categorize these networks, finding a wide range of indicators of
malicious activity, misconfiguration, as well as benign hijacking
activity. Our work presents a solid first step towards identifying
and understanding this important category of networks, which
can aid network operators in taking proactive measures to defend
themselves against prefix hijacking and serve as input for current
and future detection systems.
CCS CONCEPTS
• Networks →...

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


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

Output:
安全论文分析：

title:Airshark: detecting non-WiFi RF devices using commodity WiFi hardware
author:Shravan K. Rayanchu and
Ashish Patro and
Suman Banerjee
Airshark: Detecting Non-WiFi RF Devices
using Commodity WiFi Hardware
Shravan Rayanchu, Ashish Patro, Suman Banerjee
{shravan, patro, suman}@cs.wisc.edu
University of Wisconsin, Madison, USA
ABSTRACT
In this paper, we propose Airshark—a system that detects
multiple non-WiFi RF devices in real-time and using only
commodity WiFi hardware.
To motivate the need for
systems like Airshark, we start with measurement study
that characterizes the usage and prevalence of non-WiFi
devices across many locations. We then present the design and
implementation of Airshark. Airshark extracts unique features
using the functionality provided by a WiFi card to detect
multiple non-WiFi devices including ﬁxed frequency devices
(e.g., ZigBee, analog cordless phone), frequency hoppers
(e.g., Bluetooth, game controllers like Xbox), and broadband
interferers (e.g., microwave ovens). Airshark has an average
detection accuracy of 9196%, even in the presence of
multiple simultaneously active RF devices operating at a
wide range of signal strengths (80 to 30 dBm), while
maintaining a low false positive rate. Through a deployment
in two production WLANs, we show that Airshark can be
a useful tool to the WLAN administrators in understanding
non-WiFi interference.
Categories and Subject Descriptors
C.2.1 [Network Architecture and Design]: Wireless
Communication
General Terms
Design, Experimentation, Measurement, Performance
Keywords
WiFi, 802.11, Spectrum, Non-WiFi, RF Device Detection,
Interference, Wireless Network Monitoring
1.
INTRODUCTION
The unlicensed wireless spectrum continues to be home
for a large range of devices. Examples include cordless
phones, Bluetooth headsets, various types of audio and video
transmitters (security cameras and baby monitors), wireless
game controllers (Xbox and Wii), various ZigBee devices (e.g.,
Permission to make digital...


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

Input:
title:Airshark: detecting non-WiFi RF devices using commodity WiFi hardware
author:Shravan K. Rayanchu and
Ashish Patro and
Suman Banerjee
Airshark: Detecting Non-WiFi RF Devices
using Commodity WiFi Hardware
Shravan Rayanchu, Ashish Patro, Suman Banerjee
{shravan, patro, suman}@cs.wisc.edu
University of Wisconsin, Madison, USA
ABSTRACT
In this paper, we propose Airshark—a system that detects
multiple non-WiFi RF devices in real-time and using only
commodity WiFi hardware.
To motivate the need for
systems like Airshark, we start with measurement study
that characterizes the usage and prevalence of non-WiFi
devices across many locations. We then present the design and
implementation of Airshark. Airshark extracts unique features
using the functionality provided by a WiFi card to detect
multiple non-WiFi devices including ﬁxed frequency devices
(e.g., ZigBee, analog cordless phone), frequency hoppers
(e.g., Bluetooth, game controllers like Xbox), and broadband
interferers (e.g., microwave ovens). Airshark has an average
detection accuracy of 9196%, even in the presence of
multiple simultaneously active RF devices operating at a
wide range of signal strengths (80 to 30 dBm), while
maintaining a low false positive rate. Through a deployment
in two production WLANs, we show that Airshark can be
a useful tool to the WLAN administrators in understanding
non-WiFi interference.
Categories and Subject Descriptors
C.2.1 [Network Architecture and Design]: Wireless
Communication
General Terms
Design, Experimentation, Measurement, Performance
Keywords
WiFi, 802.11, Spectrum, Non-WiFi, RF Device Detection,
Interference, Wireless Network Monitoring
1.
INTRODUCTION
The unlicensed wireless spectrum continues to be home
for a large range of devices. Examples include cordless
phones, Bluetooth headsets, various types of audio and video
transmitters (security cameras and baby monitors), wireless
game controllers (Xbox and Wii), various ZigBee devices (e.g.,
Permission to make digital...

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


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

Output:
安全论文分析：

title:On the Potential for Discrimination via Composition
author:Giridhari Venkatadri and
Alan Mislove
On the Potential for Discrimination via Composition
Giridhari Venkatadri
Northeastern University
Alan Mislove
Northeastern University
ABSTRACT
The success of platforms such as Facebook and Google has been
due in no small part to features that allow advertisers to target ads
in a fine-grained manner. However, these features open up the po-
tential for discriminatory advertising when advertisers include or
exclude users of protected classes—either directly or indirectly—in
a discriminatory fashion. Despite the fact that advertisers are able
to compose various targeting features together, the existing mitiga-
tions to discriminatory targeting have focused only on individual
features; there are concerns that such composition could result in
targeting that is more discriminatory than the features individually.
In this paper, we first demonstrate how compositions of individ-
ual targeting features can yield discriminatory ad targeting even
for Facebook’s restricted targeting features for ads in special cat-
egories (meant to protect against discriminatory advertising). We
then conduct the first study of the potential for discrimination that
spans across three major advertising platforms (Facebook, Google,
and LinkedIn), showing how the potential for discriminatory adver-
tising is pervasive across these platforms. Our work further points
to the need for more careful mitigations to address the issue of
discriminatory ad targeting.
CCS CONCEPTS
• Security and privacy → Social aspects of security and pri-
vacy; • Information systems → Online advertising; Social
networks.
KEYWORDS
Targeted advertising, Advertising platforms, Discriminatory ad
targeting
ACM Reference Format:
Giridhari Venkatadri and Alan Mislove. 2020. On the Potential for Discrimi-
nation via Composition. In ACM Internet Measurement Conference (IMC ’20),
October 27–29, 2020, Virtual Event, USA. ACM, New York...


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

Input:
title:On the Potential for Discrimination via Composition
author:Giridhari Venkatadri and
Alan Mislove
On the Potential for Discrimination via Composition
Giridhari Venkatadri
Northeastern University
Alan Mislove
Northeastern University
ABSTRACT
The success of platforms such as Facebook and Google has been
due in no small part to features that allow advertisers to target ads
in a fine-grained manner. However, these features open up the po-
tential for discriminatory advertising when advertisers include or
exclude users of protected classes—either directly or indirectly—in
a discriminatory fashion. Despite the fact that advertisers are able
to compose various targeting features together, the existing mitiga-
tions to discriminatory targeting have focused only on individual
features; there are concerns that such composition could result in
targeting that is more discriminatory than the features individually.
In this paper, we first demonstrate how compositions of individ-
ual targeting features can yield discriminatory ad targeting even
for Facebook’s restricted targeting features for ads in special cat-
egories (meant to protect against discriminatory advertising). We
then conduct the first study of the potential for discrimination that
spans across three major advertising platforms (Facebook, Google,
and LinkedIn), showing how the potential for discriminatory adver-
tising is pervasive across these platforms. Our work further points
to the need for more careful mitigations to address the issue of
discriminatory ad targeting.
CCS CONCEPTS
• Security and privacy → Social aspects of security and pri-
vacy; • Information systems → Online advertising; Social
networks.
KEYWORDS
Targeted advertising, Advertising platforms, Discriminatory ad
targeting
ACM Reference Format:
Giridhari Venkatadri and Alan Mislove. 2020. On the Potential for Discrimi-
nation via Composition. In ACM Internet Measurement Conference (IMC ’20),
October 27–29, 2020, Virtual Event, USA. ACM, New York...

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


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

Output:
安全论文分析：

title:Set It and Forget It! Turnkey ECC for Instant Integration
author:Dmitry Belyavsky and
Billy Bob Brumley and
Jes'us-Javier Chi-Dom'ınguez and
Luis Rivera-Zamarripa and
Igor Ustinov
SETITANDFORGETIT!TURNKEYECCFORINSTANTINTEGRATION
AnnualComputerSecurityApplicationsConference(ACSAC2020)
December7-11
DimitryBelyavsky1,BillyBobBrumley2,Jesús-JavierChi-Domínguez2,LuisRivera-Zamarripa2,
andIgorUstinov1
{billy.brumley,jesus.chidominguez,luis.riverazamarripa}@tuni.,{beldmit,igus}@cryptocom.ru
1CryptocomLtd,Moscow,RussianFederation
2NetworkandInformationSecurityGroup(NISEC),TampereUniversity,Finland
TableofContents
Motivation
ECCKiila
Conclusions
ACSAC|2
Motivation
SomeattacksonOpenSSL’sECCimplementation.
(cid:73) BrumleyandHakala2009,therst(microarchitecture)timingattack
(cid:73) CountermeasuresbyKäsper2011,andGueronandKrasnov2015
(cid:73) AftertheformalvericationbyLiuetal.2019reporteddefects
(cid:73) CVE-2018-5407“PortSmash”byAldayaetal.2019
(cid:73) “LadderLeak”attackbyAranhaetal.2020
(cid:73) Functionalcorrectness: CVE-2011-4354istheonlyreal-worldbugattack
Someprojectsjustnarrowfeatures;thisitisnotviableoptionforprojectsmore
complete.
ACSAC|3
ECCKIILA
Alibrarythatfullyautomatestheimplementation,testing,andintegrationofECC
stacksfor OpenSSL, GOST-engine,and NSS.
ECCKIILA
op3les1
Validations
Curves
DBjson
LUTs
Makotemp Arith
OpenSSL
GOST-engine
C-code
NSS
Threatmodel: weincludedinourmodeltotimingattacks
Kiilameans wedgeinFinnish
1e.g. https://www.hyperelliptic.org/EFD/g1p/auto-code/twisted/extended/doubling/dbl-2008-hwcd.op3
ACSAC|4
CurvestestedwithECCKiila
Curve
secp192r1/ P-192
secp256r1/ P-256
secp521r1/ P-521
secp256k1
secp384r1
brainpool192t1
brainpool256t1
brainpool320t1
brainpool384t1
brainpool512t1
SM2(Chinesestandard)
X25519/ ED25519/ Wei25519
X448/ ED448/ Wei448
P-384
P-521
id_GostR3410_2001_CryptoPro_A_ParamSet
id_GostR3410_2001_CryptoPro_B_ParamSet
id_GostR3410_2001_CryptoPro_C_ParamSet
id_tc26_gost_3410_2012_512_paramSetA
id_tc26_gost_34...


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

Input:
title:Set It and Forget It! Turnkey ECC for Instant Integration
author:Dmitry Belyavsky and
Billy Bob Brumley and
Jes'us-Javier Chi-Dom'ınguez and
Luis Rivera-Zamarripa and
Igor Ustinov
SETITANDFORGETIT!TURNKEYECCFORINSTANTINTEGRATION
AnnualComputerSecurityApplicationsConference(ACSAC2020)
December7-11
DimitryBelyavsky1,BillyBobBrumley2,Jesús-JavierChi-Domínguez2,LuisRivera-Zamarripa2,
andIgorUstinov1
{billy.brumley,jesus.chidominguez,luis.riverazamarripa}@tuni.,{beldmit,igus}@cryptocom.ru
1CryptocomLtd,Moscow,RussianFederation
2NetworkandInformationSecurityGroup(NISEC),TampereUniversity,Finland
TableofContents
Motivation
ECCKiila
Conclusions
ACSAC|2
Motivation
SomeattacksonOpenSSL’sECCimplementation.
(cid:73) BrumleyandHakala2009,therst(microarchitecture)timingattack
(cid:73) CountermeasuresbyKäsper2011,andGueronandKrasnov2015
(cid:73) AftertheformalvericationbyLiuetal.2019reporteddefects
(cid:73) CVE-2018-5407“PortSmash”byAldayaetal.2019
(cid:73) “LadderLeak”attackbyAranhaetal.2020
(cid:73) Functionalcorrectness: CVE-2011-4354istheonlyreal-worldbugattack
Someprojectsjustnarrowfeatures;thisitisnotviableoptionforprojectsmore
complete.
ACSAC|3
ECCKIILA
Alibrarythatfullyautomatestheimplementation,testing,andintegrationofECC
stacksfor OpenSSL, GOST-engine,and NSS.
ECCKIILA
op3les1
Validations
Curves
DBjson
LUTs
Makotemp Arith
OpenSSL
GOST-engine
C-code
NSS
Threatmodel: weincludedinourmodeltotimingattacks
Kiilameans wedgeinFinnish
1e.g. https://www.hyperelliptic.org/EFD/g1p/auto-code/twisted/extended/doubling/dbl-2008-hwcd.op3
ACSAC|4
CurvestestedwithECCKiila
Curve
secp192r1/ P-192
secp256r1/ P-256
secp521r1/ P-521
secp256k1
secp384r1
brainpool192t1
brainpool256t1
brainpool320t1
brainpool384t1
brainpool512t1
SM2(Chinesestandard)
X25519/ ED25519/ Wei25519
X448/ ED448/ Wei448
P-384
P-521
id_GostR3410_2001_CryptoPro_A_ParamSet
id_GostR3410_2001_CryptoPro_B_ParamSet
id_GostR3410_2001_CryptoPro_C_ParamSet
id_tc26_gost_3410_2012_512_paramSetA
id_tc26_gost_34...

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


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

Output:
安全论文分析：

title:Crowdsourcing Measurements of Mobile Network Performance and Mobility
During a Large Scale Event
author:Alexander Fr"ommgen and
Jens Heuschkel and
Patrick Jahnke and
Fabio Cuozzo and
Immanuel Schweizer and
Patrick Eugster and
Max M"uhlh"auser and
Alejandro P. Buchmann
Crowdsourcing Measurements of Mobile
Network Performance and Mobility During
a Large Scale Event
Alexander Fr¨ommgen1(B), Jens Heuschkel2, Patrick Jahnke3, Fabio Cuozzo1,
Immanuel Schweizer2, Patrick Eugster3, Max M¨uhlh¨auser2,
and Alejandro Buchmann1
1 Databases and Distributed Systems, TU Darmstadt, Darmstadt, Germany
{froemmgen,cuozzo,buchmann}@dvs.tu-darmstadt.de
2 Telecooperation Lab, TU Darmstadt, Darmstadt, Germany
{jens.heuschkel,schweizer,max}@tk.informatik.tu-darmstadt.de
3 Distributed Systems Programming, TU Darmstadt, Darmstadt, Germany
{jahnke,peugster}@dsp.tu-darmstadt.de
Abstract. Cellular infrastructure in urban areas is provisioned to easily
cope with the usual daily demands. When facing shockingly high loads,
e.g., due to large scale sport or music events, users complain about perfor-
mance degradations of the mobile network. Analyzing the impact of large
scale events on the mobile network infrastructure and how users perceive
overload situations is essential to improve user experience. Therefore, a
large data set is required to get a detailed understanding of the diﬀerences
between providers, mobile devices, mobile network access technologies,
and the mobility of people.
In this paper, we present experiences and results from a crowdsourc-
ing measurement during a music festival in Germany with over 110,000
visitors per day. More than 1,000 visitors ran our crowdsourcing app to
collect active and passive measurements of the mobile network and the
user mobility. We show that there is signiﬁcant performance degradation
during the festival regarding DNS and HTTP failures as well as increased
load times. Furthermore, we evaluate the impact of the carrier, the access
...


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

Input:
title:Crowdsourcing Measurements of Mobile Network Performance and Mobility
During a Large Scale Event
author:Alexander Fr"ommgen and
Jens Heuschkel and
Patrick Jahnke and
Fabio Cuozzo and
Immanuel Schweizer and
Patrick Eugster and
Max M"uhlh"auser and
Alejandro P. Buchmann
Crowdsourcing Measurements of Mobile
Network Performance and Mobility During
a Large Scale Event
Alexander Fr¨ommgen1(B), Jens Heuschkel2, Patrick Jahnke3, Fabio Cuozzo1,
Immanuel Schweizer2, Patrick Eugster3, Max M¨uhlh¨auser2,
and Alejandro Buchmann1
1 Databases and Distributed Systems, TU Darmstadt, Darmstadt, Germany
{froemmgen,cuozzo,buchmann}@dvs.tu-darmstadt.de
2 Telecooperation Lab, TU Darmstadt, Darmstadt, Germany
{jens.heuschkel,schweizer,max}@tk.informatik.tu-darmstadt.de
3 Distributed Systems Programming, TU Darmstadt, Darmstadt, Germany
{jahnke,peugster}@dsp.tu-darmstadt.de
Abstract. Cellular infrastructure in urban areas is provisioned to easily
cope with the usual daily demands. When facing shockingly high loads,
e.g., due to large scale sport or music events, users complain about perfor-
mance degradations of the mobile network. Analyzing the impact of large
scale events on the mobile network infrastructure and how users perceive
overload situations is essential to improve user experience. Therefore, a
large data set is required to get a detailed understanding of the diﬀerences
between providers, mobile devices, mobile network access technologies,
and the mobility of people.
In this paper, we present experiences and results from a crowdsourc-
ing measurement during a music festival in Germany with over 110,000
visitors per day. More than 1,000 visitors ran our crowdsourcing app to
collect active and passive measurements of the mobile network and the
user mobility. We show that there is signiﬁcant performance degradation
during the festival regarding DNS and HTTP failures as well as increased
load times. Furthermore, we evaluate the impact of the carrier, the access
...

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


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

Output:
安全论文分析：

title:PHYS: Profiled-HYbrid Sampling for soft error reliability benchmarking
author:Jinho Suh and
Murali Annavaram and
Michel Dubois
PHYS: Profiled-HYbrid Sampling for Soft Error Reliability Benchmarking
Ming Hsieh Department of Electrical Engineering, University of Southern California
Jinho Suh, Murali Annavaram, and Michel Dubois
Los Angeles, CA, USA
{jinhosuh, annavara}@usc.edu, dubois@paris.usc.edu
a
sampling
for
framework
Abstract—In this paper, we introduce PHYS (Profiled-HYbrid
Sampling),
soft-error
benchmarking of caches. Reliability simulations of caches are
much  more  complex  than  performance  simulations  and
therefore  exhibit  large  simulation  slowdowns  (two  orders  of
magnitude)  over  performance  simulations.  The  major
problem is that the reliability lifetime of every accessed block
must  be  tracked  from  beginning  to  end,  on  top  of  simulating
the  benchmark,  in  order  to  track  the  total  number  of
vulnerability  cycles  (VCs)  between  two  accesses  to  the  block.
Because  of  the  need  to  track  SDCs  (silent  error  corruption)
and to distinguish between true and false DUEs (detected but
unrecoverable errors) vulnerability cycles cannot be truncated
when  data  is  written  back  from  cache  to  main  memory.
Vulnerability cycles must be maintained even during a block's
sojourn in main memory to track whether corrupted values in
a block are used by the processor, until program termination.
PHYS  solves  this  problem  by  sampling  intervals  between
accesses  to  each  memory  block,  instead  of  sampling  the
execution  of  the  processor  in  a  time  interval  as  is  classically
done in performance simulations. At first a statistical profiling
phase  captures  the  distribution  of  VCs  for  every  block.  This
profiling step provides a statistical guarantee of the minimum
sampling rate of access intervals needed to meet a desired FIT
error target with a given confidence interva...


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

Input:
title:PHYS: Profiled-HYbrid Sampling for soft error reliability benchmarking
author:Jinho Suh and
Murali Annavaram and
Michel Dubois
PHYS: Profiled-HYbrid Sampling for Soft Error Reliability Benchmarking
Ming Hsieh Department of Electrical Engineering, University of Southern California
Jinho Suh, Murali Annavaram, and Michel Dubois
Los Angeles, CA, USA
{jinhosuh, annavara}@usc.edu, dubois@paris.usc.edu
a
sampling
for
framework
Abstract—In this paper, we introduce PHYS (Profiled-HYbrid
Sampling),
soft-error
benchmarking of caches. Reliability simulations of caches are
much  more  complex  than  performance  simulations  and
therefore  exhibit  large  simulation  slowdowns  (two  orders  of
magnitude)  over  performance  simulations.  The  major
problem is that the reliability lifetime of every accessed block
must  be  tracked  from  beginning  to  end,  on  top  of  simulating
the  benchmark,  in  order  to  track  the  total  number  of
vulnerability  cycles  (VCs)  between  two  accesses  to  the  block.
Because  of  the  need  to  track  SDCs  (silent  error  corruption)
and to distinguish between true and false DUEs (detected but
unrecoverable errors) vulnerability cycles cannot be truncated
when  data  is  written  back  from  cache  to  main  memory.
Vulnerability cycles must be maintained even during a block's
sojourn in main memory to track whether corrupted values in
a block are used by the processor, until program termination.
PHYS  solves  this  problem  by  sampling  intervals  between
accesses  to  each  memory  block,  instead  of  sampling  the
execution  of  the  processor  in  a  time  interval  as  is  classically
done in performance simulations. At first a statistical profiling
phase  captures  the  distribution  of  VCs  for  every  block.  This
profiling step provides a statistical guarantee of the minimum
sampling rate of access intervals needed to meet a desired FIT
error target with a given confidence interva...

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


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

Output:
安全论文分析：

title:Hypnoguard: Protecting Secrets across Sleep-wake Cycles
author:Lianying Zhao and
Mohammad Mannan
Hypnoguard: Protecting Secrets across Sleep-wake Cycles
Lianying Zhao and Mohammad Mannan
Concordia Institute for Information Systems Engineering
Concordia University, Montreal, Canada
{z_lianyi, mmannan}@ciise.concordia.ca
ABSTRACT
Attackers can get physical control of a computer in sleep
(S3/suspend-to-RAM), if it is lost, stolen, or the owner is
being coerced. High-value memory-resident secrets, includ-
ing disk encryption keys, and private signature/encryption
keys for PGP, may be extracted (e.g., via cold-boot or DMA
attacks), by physically accessing such a computer. Our goal
is to alleviate threats of extracting secrets from a computer
in sleep, without relying on an Internet-facing service.
We propose Hypnoguard to protect all memory-resident
OS/user data across S3 suspensions, by ﬁrst performing an
in-place full memory encryption before entering sleep, and
then restoring the plaintext content at wakeup-time through
an environment-bound, password-based authentication pro-
cess. The memory encryption key is eﬀectively “sealed” in a
Trusted Platform Module (TPM) chip with the measure-
ment of the execution environment supported by CPU’s
trusted execution mode (e.g., Intel TXT, AMD-V/SVM).
Password guessing within Hypnoguard may cause the mem-
ory content to be permanently inaccessible, while guessing
without Hypnoguard is equivalent to brute-forcing a high-
entropy key (due to TPM protection). We achieved full
memory encryption/decryption in less than a second on a
mainstream computer (Intel i7-4771 CPU with 8GB RAM,
taking advantage of multi-core processing and AES-NI), an
apparently acceptable delay for sleep-wake transitions. To
the best of our knowledge, Hypnoguard provides the ﬁrst
wakeup-time secure environment for authentication and key
unlocking, without requiring per-application changes.
1.
INTRODUCTION
Most computers, especially laptops,
remain in sl...


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

Input:
title:Hypnoguard: Protecting Secrets across Sleep-wake Cycles
author:Lianying Zhao and
Mohammad Mannan
Hypnoguard: Protecting Secrets across Sleep-wake Cycles
Lianying Zhao and Mohammad Mannan
Concordia Institute for Information Systems Engineering
Concordia University, Montreal, Canada
{z_lianyi, mmannan}@ciise.concordia.ca
ABSTRACT
Attackers can get physical control of a computer in sleep
(S3/suspend-to-RAM), if it is lost, stolen, or the owner is
being coerced. High-value memory-resident secrets, includ-
ing disk encryption keys, and private signature/encryption
keys for PGP, may be extracted (e.g., via cold-boot or DMA
attacks), by physically accessing such a computer. Our goal
is to alleviate threats of extracting secrets from a computer
in sleep, without relying on an Internet-facing service.
We propose Hypnoguard to protect all memory-resident
OS/user data across S3 suspensions, by ﬁrst performing an
in-place full memory encryption before entering sleep, and
then restoring the plaintext content at wakeup-time through
an environment-bound, password-based authentication pro-
cess. The memory encryption key is eﬀectively “sealed” in a
Trusted Platform Module (TPM) chip with the measure-
ment of the execution environment supported by CPU’s
trusted execution mode (e.g., Intel TXT, AMD-V/SVM).
Password guessing within Hypnoguard may cause the mem-
ory content to be permanently inaccessible, while guessing
without Hypnoguard is equivalent to brute-forcing a high-
entropy key (due to TPM protection). We achieved full
memory encryption/decryption in less than a second on a
mainstream computer (Intel i7-4771 CPU with 8GB RAM,
taking advantage of multi-core processing and AES-NI), an
apparently acceptable delay for sleep-wake transitions. To
the best of our knowledge, Hypnoguard provides the ﬁrst
wakeup-time secure environment for authentication and key
unlocking, without requiring per-application changes.
1.
INTRODUCTION
Most computers, especially laptops,
remain in sl...

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


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

Output:
安全论文分析：

title:Analysis of Communities of Interest in Data Networks
author:William Aiello and
Charles R. Kalmanek and
Patrick D. McDaniel and
Subhabrata Sen and
Oliver Spatscheck and
Jacobus E. van der Merwe
Analysis of Communities of Interest in Data Networks(cid:1)
William Aiello , Charles Kalmanek , Patrick McDaniel ,
Subhabrata Sen , Oliver Spatscheck , and Jacobus Van der Merwe
 Department of Computer Science, University of British Columbia,
Vancouver, B.C. V6T 1Z4, Canada
aiello@cs.ubc.ca
 AT&T Labs (cid:150) Research, Florham Park, NJ 07932, U.S.A
 crk,sen,spatsch,kobus
@research.att.com
	 Department of Computer Science and Engineering, Penn State University,
University Park, PA 16802, U.S.A
mcdaniel@cse.psu.edu
Abstract. Communities of interest (COI) have been applied in a variety of envi-
ronments ranging from characterizing the online buying behavior of individuals
to detecting fraud in telephone networks. The common thread among these ap-
plications is that the historical COI of an individual can be used to predict future
behavior as well as the behavior of other members of the COI. It would clearly be
bene(cid:2)cial if COIs can be used in the same manner to characterize and predict the
behavior of hosts within a data network. In this paper, we introduce a methodol-
ogy for evaluating various aspects of COIs of hosts within an IP network. In the
context of this study, we broadly de(cid:2)ne a COI as a collection of interacting hosts.
We apply our methodology using data collected from a large enterprise network
over a eleven week period. First, we study the distributions and stability of the
size of COIs. Second, we evaluate multiple heuristics to determine a stable core
set of COIs and determine the stability of these sets over time. Third, we evaluate
how much of the communication is not captured by these core COI sets.
1 Introduction
Data networks are growing in size and complexity. A myriad of new services, mobil-
ity, and wireless communication make ...


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

Input:
title:Analysis of Communities of Interest in Data Networks
author:William Aiello and
Charles R. Kalmanek and
Patrick D. McDaniel and
Subhabrata Sen and
Oliver Spatscheck and
Jacobus E. van der Merwe
Analysis of Communities of Interest in Data Networks(cid:1)
William Aiello , Charles Kalmanek , Patrick McDaniel ,
Subhabrata Sen , Oliver Spatscheck , and Jacobus Van der Merwe
 Department of Computer Science, University of British Columbia,
Vancouver, B.C. V6T 1Z4, Canada
aiello@cs.ubc.ca
 AT&T Labs (cid:150) Research, Florham Park, NJ 07932, U.S.A
 crk,sen,spatsch,kobus
@research.att.com
	 Department of Computer Science and Engineering, Penn State University,
University Park, PA 16802, U.S.A
mcdaniel@cse.psu.edu
Abstract. Communities of interest (COI) have been applied in a variety of envi-
ronments ranging from characterizing the online buying behavior of individuals
to detecting fraud in telephone networks. The common thread among these ap-
plications is that the historical COI of an individual can be used to predict future
behavior as well as the behavior of other members of the COI. It would clearly be
bene(cid:2)cial if COIs can be used in the same manner to characterize and predict the
behavior of hosts within a data network. In this paper, we introduce a methodol-
ogy for evaluating various aspects of COIs of hosts within an IP network. In the
context of this study, we broadly de(cid:2)ne a COI as a collection of interacting hosts.
We apply our methodology using data collected from a large enterprise network
over a eleven week period. First, we study the distributions and stability of the
size of COIs. Second, we evaluate multiple heuristics to determine a stable core
set of COIs and determine the stability of these sets over time. Third, we evaluate
how much of the communication is not captured by these core COI sets.
1 Introduction
Data networks are growing in size and complexity. A myriad of new services, mobil-
ity, and wireless communication make ...

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


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

Output:
安全论文分析：

title:Bayesian Event Classification for Intrusion Detection
author:Christopher Kr"ugel and
Darren Mutz and
William K. Robertson and
Fredrik Valeur
Bayesian Event Classiﬁcation for Intrusion Detection
Christopher Kruegel Darren Mutz William Robertson
Fredrik Valeur
Reliable Software Group
University of California, Santa Barbara
{chris, dhm, wkr, fredrik}@cs.ucsb.edu
Abstract
Intrusion detection systems (IDSs) attempt to identify at-
tacks by comparing collected data to predeﬁned signatures
known to be malicious (misuse-based IDSs) or to a model
of legal behavior (anomaly-based IDSs). Anomaly-based
approaches have the advantage of being able to detect pre-
viously unknown attacks, but they suffer from the difﬁculty
of building robust models of acceptable behavior which may
result in a large number of false alarms. Almost all current
anomaly-based intrusion detection systems classify an in-
put event as normal or anomalous by analyzing its features,
utilizing a number of different models. A decision for an in-
put event is made by aggregating the results of all employed
models.
We have identiﬁed two reasons for the large number of
false alarms, caused by incorrect classiﬁcation of events in
current systems. One is the simplistic aggregation of model
outputs in the decision phase. Often, only the sum of the
model results is calculated and compared to a threshold.
The other reason is the lack of integration of additional
information into the decision process. This additional in-
formation can be related to the models, such as the conﬁ-
dence in a model’s output, or can be extracted from exter-
nal sources. To mitigate these shortcomings, we propose
an event classiﬁcation scheme that is based on Bayesian
networks. Bayesian networks improve the aggregation of
different model outputs and allow one to seamlessly incor-
porate additional information. Experimental results show
that the accuracy of the event classiﬁcation process is sig-
niﬁcantly improved using our propos...


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

Input:
title:Bayesian Event Classification for Intrusion Detection
author:Christopher Kr"ugel and
Darren Mutz and
William K. Robertson and
Fredrik Valeur
Bayesian Event Classiﬁcation for Intrusion Detection
Christopher Kruegel Darren Mutz William Robertson
Fredrik Valeur
Reliable Software Group
University of California, Santa Barbara
{chris, dhm, wkr, fredrik}@cs.ucsb.edu
Abstract
Intrusion detection systems (IDSs) attempt to identify at-
tacks by comparing collected data to predeﬁned signatures
known to be malicious (misuse-based IDSs) or to a model
of legal behavior (anomaly-based IDSs). Anomaly-based
approaches have the advantage of being able to detect pre-
viously unknown attacks, but they suffer from the difﬁculty
of building robust models of acceptable behavior which may
result in a large number of false alarms. Almost all current
anomaly-based intrusion detection systems classify an in-
put event as normal or anomalous by analyzing its features,
utilizing a number of different models. A decision for an in-
put event is made by aggregating the results of all employed
models.
We have identiﬁed two reasons for the large number of
false alarms, caused by incorrect classiﬁcation of events in
current systems. One is the simplistic aggregation of model
outputs in the decision phase. Often, only the sum of the
model results is calculated and compared to a threshold.
The other reason is the lack of integration of additional
information into the decision process. This additional in-
formation can be related to the models, such as the conﬁ-
dence in a model’s output, or can be extracted from exter-
nal sources. To mitigate these shortcomings, we propose
an event classiﬁcation scheme that is based on Bayesian
networks. Bayesian networks improve the aggregation of
different model outputs and allow one to seamlessly incor-
porate additional information. Experimental results show
that the accuracy of the event classiﬁcation process is sig-
niﬁcantly improved using our propos...

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


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

Output:
安全论文分析：

title:Differentially Private Publishing of High-dimensional Data Using Sensitivity
Control
author:Wei-Yen Day and
Ninghui Li
Differentially Private Publishing of High-dimensional Data
Using Sensitivity Control
Wei-Yen Day
Department of Computer Science
Purdue University
West Lafayette, IN USA
wday@purdue.edu
Ninghui Li
Department of Computer Science
Purdue University
West Lafayette, IN USA
ninghui@cs.purdue.edu
ABSTRACT
In this paper, we present DPSense, an approach to publish statis-
tical information from datasets under differential privacy via sensi-
tivity control. More speciﬁcally, we consider the problem of pub-
lishing column counts for high-dimensional datasets, such as query
logs or the Netﬂix dataset. The key challenge is that as the sen-
sitivity is high, high-magnitude noises need to be added to satisfy
differential privacy. We explore how to effectively performs sen-
sitivity control, i.e., limiting the contribution of each tuple in the
dataset. We introduce a novel low-sensitivity quality function that
enables one to effectively choose a contribution limit while satis-
fying differential privacy. Based on DPSense, we further pro-
pose an extension to correct the under-estimation bias, which we
call DPSense-S. Experimental results show that our proposed ap-
proaches advance the state of the art for publishing noisy column
counts and for ﬁnding the columns with the highest counts. Finally,
we give the analysis and discussion for the stability of DPSense
and DPSense-S, which beneﬁts from the high correlation between
quality function and error, as well as other insights of DPSense,
DPSense-S, and existing approaches.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Privacy
General Terms
Algorithms
Keywords
Differential privacy; Private data publishing; High-dimensional data
1.
INTRODUCTION
Private data publishing has enabled researchers to utilize the data
without personal privacy breach. The statistics from dataset of-
ten contain useful ...


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

Input:
title:Differentially Private Publishing of High-dimensional Data Using Sensitivity
Control
author:Wei-Yen Day and
Ninghui Li
Differentially Private Publishing of High-dimensional Data
Using Sensitivity Control
Wei-Yen Day
Department of Computer Science
Purdue University
West Lafayette, IN USA
wday@purdue.edu
Ninghui Li
Department of Computer Science
Purdue University
West Lafayette, IN USA
ninghui@cs.purdue.edu
ABSTRACT
In this paper, we present DPSense, an approach to publish statis-
tical information from datasets under differential privacy via sensi-
tivity control. More speciﬁcally, we consider the problem of pub-
lishing column counts for high-dimensional datasets, such as query
logs or the Netﬂix dataset. The key challenge is that as the sen-
sitivity is high, high-magnitude noises need to be added to satisfy
differential privacy. We explore how to effectively performs sen-
sitivity control, i.e., limiting the contribution of each tuple in the
dataset. We introduce a novel low-sensitivity quality function that
enables one to effectively choose a contribution limit while satis-
fying differential privacy. Based on DPSense, we further pro-
pose an extension to correct the under-estimation bias, which we
call DPSense-S. Experimental results show that our proposed ap-
proaches advance the state of the art for publishing noisy column
counts and for ﬁnding the columns with the highest counts. Finally,
we give the analysis and discussion for the stability of DPSense
and DPSense-S, which beneﬁts from the high correlation between
quality function and error, as well as other insights of DPSense,
DPSense-S, and existing approaches.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Privacy
General Terms
Algorithms
Keywords
Differential privacy; Private data publishing; High-dimensional data
1.
INTRODUCTION
Private data publishing has enabled researchers to utilize the data
without personal privacy breach. The statistics from dataset of-
ten contain useful ...

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


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

Output:
安全论文分析：

title:Graphics Peeping Unit: Exploiting EM Side-Channel Information of
GPUs to Eavesdrop on Your Neighbors
author:Zihao Zhan and
Zhenkai Zhang and
Sisheng Liang and
Fan Yao and
Xenofon D. Koutsoukos
3
7
7
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
Graphics Peeping Unit: Exploiting EM Side-Channel
Information of GPUs to Eavesdrop on Your Neighbors
Zihao Zhan¶∗§, Zhenkai Zhang¶†, Sisheng Liang†, Fan Yao‡, Xenofon Koutsoukos§
∗University of Florida, †Clemson University, ‡University of Central Florida, §Vanderbilt University
¶(Co-First Authors with Equal Contribution)
Abstract—As the popularity of graphics processing units
(GPUs) grows rapidly in recent years, it becomes very critical
to study and understand the security implications imposed by
them. In this paper, we show that modern GPUs can “broadcast”
sensitive information over the air to make a number of attacks
practical. Speciﬁcally, we present a new electromagnetic (EM)
side-channel vulnerability that we have discovered in many GPUs
of both NVIDIA and AMD. We show that this vulnerability can
be exploited to mount realistic attacks through two case studies,
which are website ﬁngerprinting and keystroke timing inference
attacks. Our investigation recognizes the commonly used dynamic
voltage and frequency scaling (DVFS) feature in GPU as the
root cause of this vulnerability. Nevertheless, we also show that
simply disabling DVFS may not be an effective countermeasure
since it will introduce another highly exploitable EM side-channel
vulnerability. To the best of our knowledge, this is the ﬁrst work
that studies realistic physical side-channel attacks on non-shared
GPUs at a distance.
I. INTRODUCTION
Over the past few years, graphics processing units (GPUs)
have become an integral part of modern com...


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

Input:
title:Graphics Peeping Unit: Exploiting EM Side-Channel Information of
GPUs to Eavesdrop on Your Neighbors
author:Zihao Zhan and
Zhenkai Zhang and
Sisheng Liang and
Fan Yao and
Xenofon D. Koutsoukos
3
7
7
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
Graphics Peeping Unit: Exploiting EM Side-Channel
Information of GPUs to Eavesdrop on Your Neighbors
Zihao Zhan¶∗§, Zhenkai Zhang¶†, Sisheng Liang†, Fan Yao‡, Xenofon Koutsoukos§
∗University of Florida, †Clemson University, ‡University of Central Florida, §Vanderbilt University
¶(Co-First Authors with Equal Contribution)
Abstract—As the popularity of graphics processing units
(GPUs) grows rapidly in recent years, it becomes very critical
to study and understand the security implications imposed by
them. In this paper, we show that modern GPUs can “broadcast”
sensitive information over the air to make a number of attacks
practical. Speciﬁcally, we present a new electromagnetic (EM)
side-channel vulnerability that we have discovered in many GPUs
of both NVIDIA and AMD. We show that this vulnerability can
be exploited to mount realistic attacks through two case studies,
which are website ﬁngerprinting and keystroke timing inference
attacks. Our investigation recognizes the commonly used dynamic
voltage and frequency scaling (DVFS) feature in GPU as the
root cause of this vulnerability. Nevertheless, we also show that
simply disabling DVFS may not be an effective countermeasure
since it will introduce another highly exploitable EM side-channel
vulnerability. To the best of our knowledge, this is the ﬁrst work
that studies realistic physical side-channel attacks on non-shared
GPUs at a distance.
I. INTRODUCTION
Over the past few years, graphics processing units (GPUs)
have become an integral part of modern com...

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


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

Output:
安全论文分析：

title:Turbocharging ambient backscatter communication
author:Aaron N. Parks and
Angli Liu and
Shyamnath Gollakota and
Joshua R. Smith
Turbocharging Ambient Backscatter Communication
Aaron N. Parks†, Angli Liu†, Shyamnath Gollakota, Joshua R. Smith
University of Washington
{anparks, anglil, gshyam, jrsjrs}@uw.edu
†
Co-primary Student Authors
ABSTRACT
Communication primitives such as coding and multiple antenna
processing have provided signiﬁcant beneﬁts for traditional wire-
less systems. Existing designs, however, consume signiﬁcant power
and computational resources, and hence cannot be run on low com-
plexity, power constrained backscatter devices. This paper makes
two main contributions: (1) we introduce the ﬁrst multi-antenna
cancellation design that operates on backscatter devices while re-
taining a small form factor and power footprint, (2) we introduce a
novel coding mechanism that enables long range communication as
well as concurrent transmissions and can be decoded on backscat-
ter devices. We build hardware prototypes of the above designs that
can be powered solely using harvested energy from TV and solar
sources. The results show that our designs provide beneﬁts for both
RFID and ambient backscatter systems: they enable RFID tags to
communicate directly with each other at distances of tens of meters
and through multiple walls. They also increase the communication
rate and range achieved by ambient backscatter systems by 100X
and 40X respectively. We believe that this paper represents a sub-
stantial leap in the capabilities of backscatter communication.
CATEGORIES AND SUBJECT DESCRIPTORS
C.2.1 [Network Architecture and Design]: Wireless communi-
cation
KEYWORDS
Backscatter; Internet of Things; Energy harvesting; Wireless
1.
INTRODUCTION
The last decade has seen signiﬁcant advances in wireless com-
munication — Wi-Fi systems today can achieve bit rates as high
as 300 Mbps [2] and cellular networks can operate at ranges of
tens of kilometers [3]. These imp...


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

Input:
title:Turbocharging ambient backscatter communication
author:Aaron N. Parks and
Angli Liu and
Shyamnath Gollakota and
Joshua R. Smith
Turbocharging Ambient Backscatter Communication
Aaron N. Parks†, Angli Liu†, Shyamnath Gollakota, Joshua R. Smith
University of Washington
{anparks, anglil, gshyam, jrsjrs}@uw.edu
†
Co-primary Student Authors
ABSTRACT
Communication primitives such as coding and multiple antenna
processing have provided signiﬁcant beneﬁts for traditional wire-
less systems. Existing designs, however, consume signiﬁcant power
and computational resources, and hence cannot be run on low com-
plexity, power constrained backscatter devices. This paper makes
two main contributions: (1) we introduce the ﬁrst multi-antenna
cancellation design that operates on backscatter devices while re-
taining a small form factor and power footprint, (2) we introduce a
novel coding mechanism that enables long range communication as
well as concurrent transmissions and can be decoded on backscat-
ter devices. We build hardware prototypes of the above designs that
can be powered solely using harvested energy from TV and solar
sources. The results show that our designs provide beneﬁts for both
RFID and ambient backscatter systems: they enable RFID tags to
communicate directly with each other at distances of tens of meters
and through multiple walls. They also increase the communication
rate and range achieved by ambient backscatter systems by 100X
and 40X respectively. We believe that this paper represents a sub-
stantial leap in the capabilities of backscatter communication.
CATEGORIES AND SUBJECT DESCRIPTORS
C.2.1 [Network Architecture and Design]: Wireless communi-
cation
KEYWORDS
Backscatter; Internet of Things; Energy harvesting; Wireless
1.
INTRODUCTION
The last decade has seen signiﬁcant advances in wireless com-
munication — Wi-Fi systems today can achieve bit rates as high
as 300 Mbps [2] and cellular networks can operate at ranges of
tens of kilometers [3]. These imp...

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


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

Output:
安全论文分析：

title:Guarder: A Tunable Secure Allocator
author:Sam Silvestro and
Hongyu Liu and
Tianyi Liu and
Zhiqiang Lin and
Tongping Liu
Guarder: A Tunable Secure Allocator
Sam Silvestro, Hongyu Liu, and Tianyi Liu, University of Texas at San Antonio;
Zhiqiang Lin, Ohio State University; Tongping Liu, University of Texas at San Antonio
https://www.usenix.org/conference/usenixsecurity18/presentation/silvestro
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
ISBN 978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.GUARDER: A Tunable Secure Allocator
Sam Silvestro∗ Hongyu Liu∗
Tianyi Liu∗
∗University of Texas at San Antonio
†The Ohio State University
Zhiqiang Lin†
Tongping Liu∗
Abstract
Due to the on-going threats posed by heap vulnerabili-
ties, we design a novel secure allocator — GUARDER—
to defeat these vulnerabilities. GUARDER is different
from existing secure allocators in the following aspects.
Existing allocators either have low/zero randomization
entropy, or cannot provide stable security guarantees,
where their entropies vary by object size classes, exe-
cution phases, inputs, or applications. GUARDER en-
sures the desired randomization entropy, and provides an
unprecedented level of security guarantee by combining
all security features of existing allocators, with overhead
that is comparable to performance-oriented allocators.
Compared to the default Linux allocator, GUARDER’s
performance overhead is less than 3% on average. This
overhead is similar to the previous state-of-the-art, Free-
Guard, but comes with a much stronger security guaran-
tee. GUARDER also provides an additional feature that
allows users to customize security based on their perfor-
mance budget, without changing code or even recompil-
ing. The combination of high security and low overhead
makes GUARDER a practical solution for the deployed
environment.
1
Introductio...


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

Input:
title:Guarder: A Tunable Secure Allocator
author:Sam Silvestro and
Hongyu Liu and
Tianyi Liu and
Zhiqiang Lin and
Tongping Liu
Guarder: A Tunable Secure Allocator
Sam Silvestro, Hongyu Liu, and Tianyi Liu, University of Texas at San Antonio;
Zhiqiang Lin, Ohio State University; Tongping Liu, University of Texas at San Antonio
https://www.usenix.org/conference/usenixsecurity18/presentation/silvestro
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
ISBN 978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.GUARDER: A Tunable Secure Allocator
Sam Silvestro∗ Hongyu Liu∗
Tianyi Liu∗
∗University of Texas at San Antonio
†The Ohio State University
Zhiqiang Lin†
Tongping Liu∗
Abstract
Due to the on-going threats posed by heap vulnerabili-
ties, we design a novel secure allocator — GUARDER—
to defeat these vulnerabilities. GUARDER is different
from existing secure allocators in the following aspects.
Existing allocators either have low/zero randomization
entropy, or cannot provide stable security guarantees,
where their entropies vary by object size classes, exe-
cution phases, inputs, or applications. GUARDER en-
sures the desired randomization entropy, and provides an
unprecedented level of security guarantee by combining
all security features of existing allocators, with overhead
that is comparable to performance-oriented allocators.
Compared to the default Linux allocator, GUARDER’s
performance overhead is less than 3% on average. This
overhead is similar to the previous state-of-the-art, Free-
Guard, but comes with a much stronger security guaran-
tee. GUARDER also provides an additional feature that
allows users to customize security based on their perfor-
mance budget, without changing code or even recompil-
ing. The combination of high security and low overhead
makes GUARDER a practical solution for the deployed
environment.
1
Introductio...

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


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

Output:
安全论文分析：

title:MOPS: an infrastructure for examining security properties of software
author:Hao Chen and
David A. Wagner
MOPS∗: an Infrastructure for Examining Security Properties
of Software†
Hao Chen
University of California at Berkeley
hchen@cs.berkeley.edu
David Wagner
University of California at Berkeley
daw@cs.berkeley.edu
ABSTRACT
We describe a formal approach for ﬁnding bugs in security-
relevant software and verifying their absence. The idea is as
follows: we identify rules of safe programming practice, en-
code them as safety properties, and verify whether these
properties are obeyed. Because manual veriﬁcation is too
expensive, we have built a program analysis tool to auto-
mate this process. Our program analysis models the pro-
gram to be veriﬁed as a pushdown automaton, represents
the security property as a ﬁnite state automaton, and uses
model checking techniques to identify whether any state vi-
olating the desired security goal is reachable in the program.
The major advantages of this approach are that it is sound
in verifying the absence of certain classes of vulnerabilities,
that it is fully interprocedural, and that it is eﬃcient and
scalable. Experience suggests that this approach will be use-
ful in ﬁnding a wide range of security vulnerabilities in large
programs eﬃciently.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—
veriﬁcation; D.2.4 [Software Engineering]: Software/ Pro-
gram Veriﬁcation—formal methods, model checking
General Terms
Security, Languages, Veriﬁcation
Keywords
security, model checking, veriﬁcation, static analysis
INTRODUCTION
1.
∗MOPS: MOdel Checking Programs for Security properties
†This research was supported in part by DARPA contract
N66001-01-C-8040 and by an equipment grant from Intel.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for proﬁt or commercial advantage a...


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

Input:
title:MOPS: an infrastructure for examining security properties of software
author:Hao Chen and
David A. Wagner
MOPS∗: an Infrastructure for Examining Security Properties
of Software†
Hao Chen
University of California at Berkeley
hchen@cs.berkeley.edu
David Wagner
University of California at Berkeley
daw@cs.berkeley.edu
ABSTRACT
We describe a formal approach for ﬁnding bugs in security-
relevant software and verifying their absence. The idea is as
follows: we identify rules of safe programming practice, en-
code them as safety properties, and verify whether these
properties are obeyed. Because manual veriﬁcation is too
expensive, we have built a program analysis tool to auto-
mate this process. Our program analysis models the pro-
gram to be veriﬁed as a pushdown automaton, represents
the security property as a ﬁnite state automaton, and uses
model checking techniques to identify whether any state vi-
olating the desired security goal is reachable in the program.
The major advantages of this approach are that it is sound
in verifying the absence of certain classes of vulnerabilities,
that it is fully interprocedural, and that it is eﬃcient and
scalable. Experience suggests that this approach will be use-
ful in ﬁnding a wide range of security vulnerabilities in large
programs eﬃciently.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—
veriﬁcation; D.2.4 [Software Engineering]: Software/ Pro-
gram Veriﬁcation—formal methods, model checking
General Terms
Security, Languages, Veriﬁcation
Keywords
security, model checking, veriﬁcation, static analysis
INTRODUCTION
1.
∗MOPS: MOdel Checking Programs for Security properties
†This research was supported in part by DARPA contract
N66001-01-C-8040 and by an equipment grant from Intel.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for proﬁt or commercial advantage a...

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


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

Output:
安全论文分析：

title:A model and architecture for pseudo-random generation with applications
to /dev/random
author:Boaz Barak and
Shai Halevi
A Model and Architecture for Pseudo-Random Generation
and Applications to /dev/random
∗
Boaz Barak
Department of Computer Science
Princeton University
boaz@cs.princeton.edu
ABSTRACT
We present a formal model and a simple architecture for
robust pseudorandom generation that ensures resilience in
the face of an observer with partial knowledge/control of
the generator’s entropy source. Our model and architecture
have the following properties:
• Resilience. The generator’s output looks random to
an observer with no knowledge of the internal state.
This holds even if that observer has complete control
over data that is used to refresh the internal state.
• Forward security. Past output of the generator looks
random to an observer, even if the observer learns the
internal state at a later time.
• Backward security/Break-in recovery. Future output
of the generator looks random, even to an observer
with knowledge of the current state, provided that the
generator is refreshed with data of suﬃcient entropy.
Architectures such as above were suggested before. This
work diﬀers from previous attempts in that we present a
formal model for robust pseudo-random generation, and pro-
vide a formal proof within this model for the security of our
architecture. To our knowledge, this is the ﬁrst attempt at
a rigorous model for this problem.
Our formal modeling advocates the separation of the en-
tropy extraction phase from the output generation phase.
We argue that the former is information-theoretic in na-
ture, and could therefore rely on combinatorial and statisti-
cal tools rather than on cryptography. On the other hand,
we show that the latter can be implemented using any stan-
dard (non-robust) cryptographic PRG.
We also discuss the applicability of our architecture for
applications such as /dev/(u)random in Linux and pseudo-
random generation on smartcards...


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

Output:
安全论文分析：

title:Characterizing Application Memory Error Vulnerability to Optimize
Datacenter Cost via Heterogeneous-Reliability Memory
author:Yixin Luo and
Sriram Govindan and
Bikash Sharma and
Mark Santaniello and
Justin Meza and
Aman Kansal and
Jie Liu and
Badriddine Khessib and
Kushagra Vaid and
Onur Mutlu
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Characterizing Application Memory Error Vulnerability to
Optimize Datacenter Cost via Heterogeneous-Reliability Memory
Yixin Luo
Justin Meza
Bikash Sharma* Mark Santaniello*
Sriram Govindan*
Aman Kansal*
Carnegie Mellon University, yixinluo@cs.cmu.edu, {meza, onur}@cmu.edu
*Microsoft Corporation, {srgovin, bsharma, marksan, kansal, jie.liu, bkhessib, kvaid}@microsoft.com
Badriddine Khessib* Kushagra Vaid* Onur Mutlu
Jie Liu*
Abstract—Memory devices represent a key component of
datacenter total cost of ownership (TCO), and techniques used
to reduce errors that occur on these devices increase this
cost. Existing approaches to providing reliability for memory
devices pessimistically treat all data as equally vulnerable
to memory errors. Our key insight is that there exists a
diverse spectrum of
tolerance to memory errors in new
data-intensive applications, and that traditional one-size-ﬁts-all
memory reliability techniques are ineﬃcient in terms of cost.
For example, we found that while traditional error protection
increases memory system cost by 12.5%, some applications
can achieve 99.00% availability on a single server with a large
number of memory errors without any error protection. This
presents an opportunity to greatly reduce server hardware cost
by provisioning the right amount of memory reliability for
diﬀerent applications.
Toward this end, in this paper, we make three main con-
tributions to enable highly-reliable servers at low datacenter
cost. First, we develop a new methodology to quantify the
tolerance of applications to memory errors. Second, using our
methodology, we perf...


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

Input:
title:Characterizing Application Memory Error Vulnerability to Optimize
Datacenter Cost via Heterogeneous-Reliability Memory
author:Yixin Luo and
Sriram Govindan and
Bikash Sharma and
Mark Santaniello and
Justin Meza and
Aman Kansal and
Jie Liu and
Badriddine Khessib and
Kushagra Vaid and
Onur Mutlu
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Characterizing Application Memory Error Vulnerability to
Optimize Datacenter Cost via Heterogeneous-Reliability Memory
Yixin Luo
Justin Meza
Bikash Sharma* Mark Santaniello*
Sriram Govindan*
Aman Kansal*
Carnegie Mellon University, yixinluo@cs.cmu.edu, {meza, onur}@cmu.edu
*Microsoft Corporation, {srgovin, bsharma, marksan, kansal, jie.liu, bkhessib, kvaid}@microsoft.com
Badriddine Khessib* Kushagra Vaid* Onur Mutlu
Jie Liu*
Abstract—Memory devices represent a key component of
datacenter total cost of ownership (TCO), and techniques used
to reduce errors that occur on these devices increase this
cost. Existing approaches to providing reliability for memory
devices pessimistically treat all data as equally vulnerable
to memory errors. Our key insight is that there exists a
diverse spectrum of
tolerance to memory errors in new
data-intensive applications, and that traditional one-size-ﬁts-all
memory reliability techniques are ineﬃcient in terms of cost.
For example, we found that while traditional error protection
increases memory system cost by 12.5%, some applications
can achieve 99.00% availability on a single server with a large
number of memory errors without any error protection. This
presents an opportunity to greatly reduce server hardware cost
by provisioning the right amount of memory reliability for
diﬀerent applications.
Toward this end, in this paper, we make three main con-
tributions to enable highly-reliable servers at low datacenter
cost. First, we develop a new methodology to quantify the
tolerance of applications to memory errors. Second, using our
methodology, we perf...

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


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

Output:
安全论文分析：

title:Detecting organized eCommerce fraud using scalable categorical clustering
author:Samuel Marchal and
Sebastian Szyller
Detecting organized eCommerce fraud
using scalable categorical clustering
Samuel Marchal
Aalto University
samuel.marchal@aalto.fi
Sebastian Szyller
Aalto University
sebastian.szyller@aalto.fi
9
1
0
2
t
c
O
0
1
]
L
M
.
t
a
t
s
[
1
v
4
1
5
4
0
.
0
1
9
1
:
v
i
X
r
a
ABSTRACT
Online retail, eCommerce, frequently falls victim to fraud conducted
by malicious customers (fraudsters) who obtain goods or services
through deception. Fraud coordinated by groups of professional
fraudsters that place several fraudulent orders to maximize their
gain is referred to as organized fraud. Existing approaches to fraud
detection typically analyze orders in isolation and they are not
effective at identifying groups of fraudulent orders linked to orga-
nized fraud. These also wrongly identify many legitimate orders as
fraud, which hinders their usage for automated fraud cancellation.
We introduce a novel solution to detect organized fraud by analyz-
ing orders in bulk. Our approach is based on clustering and aims
to group together fraudulent orders placed by the same group of
fraudsters. It selectively uses two existing techniques, agglomera-
tive clustering and sampling to recursively group orders into small
clusters in a reasonable amount of time. We assess our clustering
technique on real-world orders placed on the Zalando website, the
largest online apparel retailer in Europe1. Our clustering processes
100,000s of orders in a few hours and groups 35-45% of fraudulent
orders together. We propose a simple technique built on top of our
clustering that detects 26.2% of fraud while raising false alarms for
only 0.1% of legitimate orders.
KEYWORDS
online fraud; fraud detection; eCommerce; categorical clustering
1 INTRODUCTION
Online retail, also known as eCommerce, represents an important
share of the retail business. About 17.5% of all sales made in the
United States c...


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

Input:
title:Detecting organized eCommerce fraud using scalable categorical clustering
author:Samuel Marchal and
Sebastian Szyller
Detecting organized eCommerce fraud
using scalable categorical clustering
Samuel Marchal
Aalto University
samuel.marchal@aalto.fi
Sebastian Szyller
Aalto University
sebastian.szyller@aalto.fi
9
1
0
2
t
c
O
0
1
]
L
M
.
t
a
t
s
[
1
v
4
1
5
4
0
.
0
1
9
1
:
v
i
X
r
a
ABSTRACT
Online retail, eCommerce, frequently falls victim to fraud conducted
by malicious customers (fraudsters) who obtain goods or services
through deception. Fraud coordinated by groups of professional
fraudsters that place several fraudulent orders to maximize their
gain is referred to as organized fraud. Existing approaches to fraud
detection typically analyze orders in isolation and they are not
effective at identifying groups of fraudulent orders linked to orga-
nized fraud. These also wrongly identify many legitimate orders as
fraud, which hinders their usage for automated fraud cancellation.
We introduce a novel solution to detect organized fraud by analyz-
ing orders in bulk. Our approach is based on clustering and aims
to group together fraudulent orders placed by the same group of
fraudsters. It selectively uses two existing techniques, agglomera-
tive clustering and sampling to recursively group orders into small
clusters in a reasonable amount of time. We assess our clustering
technique on real-world orders placed on the Zalando website, the
largest online apparel retailer in Europe1. Our clustering processes
100,000s of orders in a few hours and groups 35-45% of fraudulent
orders together. We propose a simple technique built on top of our
clustering that detects 26.2% of fraud while raising false alarms for
only 0.1% of legitimate orders.
KEYWORDS
online fraud; fraud detection; eCommerce; categorical clustering
1 INTRODUCTION
Online retail, also known as eCommerce, represents an important
share of the retail business. About 17.5% of all sales made in the
United States c...

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


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

Output:
安全论文分析：

title:LZR: Identifying Unexpected Internet Services
author:Liz Izhikevich and
Renata Teixeira and
Zakir Durumeric
LZR: Identifying Unexpected Internet Services
Liz Izhikevich, Stanford University; Renata Teixeira, Inria;
Zakir Durumeric, Stanford University
https://www.usenix.org/conference/usenixsecurity21/presentation/izhikevich
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.LZR: Identifying Unexpected Internet Services
Liz Izhikevich
Stanford University
Renata Teixeira
Inria, Paris∗
Zakir Durumeric
Stanford University
Abstract
Internet-wide scanning is a commonly used research tech-
nique that has helped uncover real-world attacks, ﬁnd crypto-
graphic weaknesses, and understand both operator and mis-
creant behavior. Studies that employ scanning have largely
assumed that services are hosted on their IANA-assigned
ports, overlooking the study of services on unusual ports. In
this work, we investigate where Internet services are deployed
in practice and evaluate the security posture of services on
unexpected ports. We show protocol deployment is more dif-
fuse than previously believed and that protocols run on many
additional ports beyond their primary IANA-assigned port.
For example, only 3% of HTTP and 6% of TLS services run
on ports 80 and 443, respectively. Services on non-standard
ports are more likely to be insecure, which results in studies
dramatically underestimating the security posture of Inter-
net hosts. Building on our observations, we introduce LZR
(“Laser”), a system that identiﬁes 99% of identiﬁable unex-
pected services in ﬁve handshakes and dramatically reduces
the time needed to perform application-layer scans on ports
with few responsive expected services (e.g., 5500% speedup
on 27017/MongoDB). We conclude with recommendations
for future studies.
1 Introduction
Internet-wide scanning—t...


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

Input:
title:LZR: Identifying Unexpected Internet Services
author:Liz Izhikevich and
Renata Teixeira and
Zakir Durumeric
LZR: Identifying Unexpected Internet Services
Liz Izhikevich, Stanford University; Renata Teixeira, Inria;
Zakir Durumeric, Stanford University
https://www.usenix.org/conference/usenixsecurity21/presentation/izhikevich
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.LZR: Identifying Unexpected Internet Services
Liz Izhikevich
Stanford University
Renata Teixeira
Inria, Paris∗
Zakir Durumeric
Stanford University
Abstract
Internet-wide scanning is a commonly used research tech-
nique that has helped uncover real-world attacks, ﬁnd crypto-
graphic weaknesses, and understand both operator and mis-
creant behavior. Studies that employ scanning have largely
assumed that services are hosted on their IANA-assigned
ports, overlooking the study of services on unusual ports. In
this work, we investigate where Internet services are deployed
in practice and evaluate the security posture of services on
unexpected ports. We show protocol deployment is more dif-
fuse than previously believed and that protocols run on many
additional ports beyond their primary IANA-assigned port.
For example, only 3% of HTTP and 6% of TLS services run
on ports 80 and 443, respectively. Services on non-standard
ports are more likely to be insecure, which results in studies
dramatically underestimating the security posture of Inter-
net hosts. Building on our observations, we introduce LZR
(“Laser”), a system that identiﬁes 99% of identiﬁable unex-
pected services in ﬁve handshakes and dramatically reduces
the time needed to perform application-layer scans on ports
with few responsive expected services (e.g., 5500% speedup
on 27017/MongoDB). We conclude with recommendations
for future studies.
1 Introduction
Internet-wide scanning—t...

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