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

Input:
title:Exploiting social networking sites for spam
author:Markus Huber and
Martin Mulazzani and
Edgar R. Weippl and
Gerhard Kitzler and
Sigrun Goluch
Exploiting Social Networking Sites for Spam
Markus Huber, Martin Mulazzani, Edgar Weippl, Gerhard Kitzler, Sigrun Goluch
SBA Research
{mhuber,mmulazzani,eweippl,gkitzler,sgoluch}@sba-research.org
Favoritenstrasse 16
AT-1040 Vienna, Austria
ABSTRACT
In the ongoing arms race between spammers and the multi-
million dollar anti-spam industry, the number of unsolicited
e-mail messages (better known as “spam”) and phishing has
increased heavily in the last decade. In this paper, we show
that our friend-in-the-middle attacks on social networking
sites (SNSs) can be used to harvest social data in an auto-
mated fashion. This social data can then be exploited for
large-scale attacks such as context-aware spam and social-
phishing. We prove the feasibility of our attack exemplarily
on Facebook and identify possible consequences based on a
mathematical model and simulations. Alarmingly, all major
SNSs are vulnerable to our attack as they fail to secure the
network layer appropriately.
Categories and Subject Descriptors
K.6.5 [Management of Computing and Information
Systems]: Security and Protection; E.1 [Data Structures]:
Graphs and networks
General Terms
Security, experimentation, theory
Keywords
Social network security, spam, phishing
1.
INTRODUCTION
Criminals, as well as direct marketers, continue to clog
mailboxes with unsolicited bulk e-mails (e.g., spam and phish-
ing) in the hope of ﬁnancial gain. So far, their strategy is
straightforward, namely to send out a vast numbers of unso-
licited e-mails in order to maximize proﬁt on the tiny frac-
tion that falls for their scams. Their pool of target e-mail
addresses is normally based upon data harvested with web
crawlers or trojans, sometimes even including plain dictionary-
based guessing of valid targets. Previous research indicates
that social networking sites (SNSs) might ch...

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


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

Output:
安全论文分析：

title:Could End System Caching and Cooperation Replace In-Network Caching
in CCN?
author:Haibo Wu and
Jun Li and
Jiang Zhi
Could End System Caching and Cooperation
Replace In-Network Caching in CCN?
Haibo Wu
Jun Li+
Jiang Zhi
wuhaibo@cstnet.cn
zhijiang@cstnet.cn
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China, 100190
lijun@cnic.cn
ABSTRACT
still
systems
resources  of  end
CCN  has  been  witnessed  as  a  promising  future  Internet
architecture.  In-network  caching  has  been  paid  much
attention, but there is still no consensus on its usage, due to
its  non-negligible  costs.  Meanwhile,  massive  storage  and
bandwidth
remain
underutilized.  To  this  end,  we  present  an  End  System
Caching and Cooperation scheme in CCN, called ESCC to
realize content distribution of CCN, without using costly in-
network  caching.  ESCC  enables  fast  content  distribution
through clients caching and sharing contents with each other.
Experiments
that  ESCC  can  achieve  better
performance  than  the  universal  caching.  It  is  also  quite
simple, efficient, robust and has low overhead. ESCC could
be  a  candidate  substitute  for  the  costly  and  unnecessary
universal caching.
Categories & Subject Descriptors: C.2.1
[Computer-Communication Networks]: Network
Architecture and Design
Keywords: CCN, end system, caching, cooperation
1.  INTRODUCTION
show
CCN (Content Centric Networking) [1] has been proposed
as  a  promising  alternative
to  current  host-to-host
communication paradigm. In-network caching is regarded as
its  key  feature.  Overall  in-network  routers  equipped  with
caches potentially store named contents, which can be used
for  subsequent  requests.  In-network  caching  can  reduce
bandwidth  consumption  and  content  retrieval  time  by
making  contents  closer  to  requesters.  However,  these
benefits  come  at  a  non-negligible  cost.  Such  universal
caching  introduc...


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

Input:
title:Could End System Caching and Cooperation Replace In-Network Caching
in CCN?
author:Haibo Wu and
Jun Li and
Jiang Zhi
Could End System Caching and Cooperation
Replace In-Network Caching in CCN?
Haibo Wu
Jun Li+
Jiang Zhi
wuhaibo@cstnet.cn
zhijiang@cstnet.cn
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China, 100190
lijun@cnic.cn
ABSTRACT
still
systems
resources  of  end
CCN  has  been  witnessed  as  a  promising  future  Internet
architecture.  In-network  caching  has  been  paid  much
attention, but there is still no consensus on its usage, due to
its  non-negligible  costs.  Meanwhile,  massive  storage  and
bandwidth
remain
underutilized.  To  this  end,  we  present  an  End  System
Caching and Cooperation scheme in CCN, called ESCC to
realize content distribution of CCN, without using costly in-
network  caching.  ESCC  enables  fast  content  distribution
through clients caching and sharing contents with each other.
Experiments
that  ESCC  can  achieve  better
performance  than  the  universal  caching.  It  is  also  quite
simple, efficient, robust and has low overhead. ESCC could
be  a  candidate  substitute  for  the  costly  and  unnecessary
universal caching.
Categories & Subject Descriptors: C.2.1
[Computer-Communication Networks]: Network
Architecture and Design
Keywords: CCN, end system, caching, cooperation
1.  INTRODUCTION
show
CCN (Content Centric Networking) [1] has been proposed
as  a  promising  alternative
to  current  host-to-host
communication paradigm. In-network caching is regarded as
its  key  feature.  Overall  in-network  routers  equipped  with
caches potentially store named contents, which can be used
for  subsequent  requests.  In-network  caching  can  reduce
bandwidth  consumption  and  content  retrieval  time  by
making  contents  closer  to  requesters.  However,  these
benefits  come  at  a  non-negligible  cost.  Such  universal
caching  introduc...

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


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

Output:
安全论文分析：

title:Performance Limitations of ADSL Users: A Case Study
author:Matti Siekkinen and
Denis Collange and
Guillaume Urvoy-Keller and
Ernst W. Biersack
Performance Limitations of ADSL Users:
A Case Study(cid:2)
Matti Siekkinen1,(cid:2)(cid:2), Denis Collange2, Guillaume Urvoy-Keller3,
and Ernst W. Biersack3
1 University of Oslo, Dept. of Informatics, Postbox 1080 Blindern, 0316 Oslo, Norway
2 France T´el´ecom R&D, 905, rue Albert Einstein, 06921 Sophia-Antipolis, France
siekkine@ifi.uio.no
3 Institut Eurecom, 2229, route des crˆetes, 06904 Sophia-Antipolis, France
denis.collange@orange-ftgroup.com
{urvoy,erbi}@eurecom.fr
Abstract. We report results from the analysis of a 24-hour packet trace
containing TCP traﬃc of approximately 1300 residential ADSL clients.
Some of our observations conﬁrm earlier studies: the major fraction of
the total traﬃc originates from P2P applications and small fractions of
connections and clients are responsible for the vast majority of the traﬃc.
However, our main contribution is a throughput performance analysis of
the clients. We observe suprisingly low utilizations of upload and down-
load capacity for most of the clients. Furthermore, by using our TCP root
cause analysis tool, we obtain a striking result: in over 90% of the cases,
the low utilization is mostly due to the (P2P) applications clients use,
which limit the transmission rate and not due to network congestion, for
instance. P2P applications typically impose upload rate limits to avoid
uplink saturation that hurt download performance. Our analysis shows
that these rate limits are very low and, as a consequence, the aggregate
download rates for these applications are low.
1 Introduction
We analyze a large packet trace of clients connected to the Internet via ADSL
to investigate the causes of throughput limitations experienced by the end users.
For this purpose we use a TCP root cause analysis tool that we apply to TCP
connections. We consider throughput as the performance metric....


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

Input:
title:Performance Limitations of ADSL Users: A Case Study
author:Matti Siekkinen and
Denis Collange and
Guillaume Urvoy-Keller and
Ernst W. Biersack
Performance Limitations of ADSL Users:
A Case Study(cid:2)
Matti Siekkinen1,(cid:2)(cid:2), Denis Collange2, Guillaume Urvoy-Keller3,
and Ernst W. Biersack3
1 University of Oslo, Dept. of Informatics, Postbox 1080 Blindern, 0316 Oslo, Norway
2 France T´el´ecom R&D, 905, rue Albert Einstein, 06921 Sophia-Antipolis, France
siekkine@ifi.uio.no
3 Institut Eurecom, 2229, route des crˆetes, 06904 Sophia-Antipolis, France
denis.collange@orange-ftgroup.com
{urvoy,erbi}@eurecom.fr
Abstract. We report results from the analysis of a 24-hour packet trace
containing TCP traﬃc of approximately 1300 residential ADSL clients.
Some of our observations conﬁrm earlier studies: the major fraction of
the total traﬃc originates from P2P applications and small fractions of
connections and clients are responsible for the vast majority of the traﬃc.
However, our main contribution is a throughput performance analysis of
the clients. We observe suprisingly low utilizations of upload and down-
load capacity for most of the clients. Furthermore, by using our TCP root
cause analysis tool, we obtain a striking result: in over 90% of the cases,
the low utilization is mostly due to the (P2P) applications clients use,
which limit the transmission rate and not due to network congestion, for
instance. P2P applications typically impose upload rate limits to avoid
uplink saturation that hurt download performance. Our analysis shows
that these rate limits are very low and, as a consequence, the aggregate
download rates for these applications are low.
1 Introduction
We analyze a large packet trace of clients connected to the Internet via ADSL
to investigate the causes of throughput limitations experienced by the end users.
For this purpose we use a TCP root cause analysis tool that we apply to TCP
connections. We consider throughput as the performance metric....

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


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

Output:
安全论文分析：

title:On the Free Bridge Across the Digital Divide: Assessing the Quality
of Facebook's Free Basics Service
author:Rijurekha Sen and
Hasnain Ali Pirzada and
Amreesh Phokeer and
Zaid Ahmed Farooq and
Satadal Sengupta and
David R. Choffnes and
Krishna P. Gummadi
On the Free Bridge Across the Digital Divide:
Assessing the Quality of Facebook’s
Free Basics Service
Rijurekha Sen†
(cid:72)
Hasnain Ali Pirzada
David Choffnes‡
†Max Planck Institute for Software Systems (MPI-SWS)
(cid:72)
(cid:5)University of Cape Town (cid:91)LUMS (cid:63)IIT Kharagpur
Satadal Sengupta(cid:63)
Amreesh Phokeer(cid:5)
Zaid Ahmed Farooq(cid:91)
Krishna P. Gummadi†
University of Wisconsin-Madison
‡Northeastern University
ABSTRACT
Free Basics is an initiative backed by Facebook to provide
users in developing countries free mobile Internet access to
selected services. Despite its wide-spread deployment and
its potential impact on bridging the digital divide, to date,
few studies have rigorously measured the quality of the free
Internet service offered by Free Basics. In this short paper,
we characterize the quality of the Free Basics service offered
in Pakistan and South Africa along three dimensions: (i) the
selection of accessible Web services, (ii) the functionality of
those services, and (iii) the network performance for those
services. While preliminary, our ﬁndings show that data-
driven studies are essential for having more informed public
debates on the pros and cons of the current design of the Free
Basics service.
1.
Internet.org [1] is a consortium founded and led by Face-
book since 2013 with the goal of bringing affordable In-
ternet access to everyone in the world. Free Basics is the
ﬂagship initiative by Internet.org, offering free access to se-
lect Web services in partnership with mobile (cellular) ser-
vice providers in developing and under-developed countries
around the world. As of May 12th 2016, Free Basics has
been deployed in over 40 countries in Africa, Asia, and Cen-
tral...


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

Input:
title:On the Free Bridge Across the Digital Divide: Assessing the Quality
of Facebook's Free Basics Service
author:Rijurekha Sen and
Hasnain Ali Pirzada and
Amreesh Phokeer and
Zaid Ahmed Farooq and
Satadal Sengupta and
David R. Choffnes and
Krishna P. Gummadi
On the Free Bridge Across the Digital Divide:
Assessing the Quality of Facebook’s
Free Basics Service
Rijurekha Sen†
(cid:72)
Hasnain Ali Pirzada
David Choffnes‡
†Max Planck Institute for Software Systems (MPI-SWS)
(cid:72)
(cid:5)University of Cape Town (cid:91)LUMS (cid:63)IIT Kharagpur
Satadal Sengupta(cid:63)
Amreesh Phokeer(cid:5)
Zaid Ahmed Farooq(cid:91)
Krishna P. Gummadi†
University of Wisconsin-Madison
‡Northeastern University
ABSTRACT
Free Basics is an initiative backed by Facebook to provide
users in developing countries free mobile Internet access to
selected services. Despite its wide-spread deployment and
its potential impact on bridging the digital divide, to date,
few studies have rigorously measured the quality of the free
Internet service offered by Free Basics. In this short paper,
we characterize the quality of the Free Basics service offered
in Pakistan and South Africa along three dimensions: (i) the
selection of accessible Web services, (ii) the functionality of
those services, and (iii) the network performance for those
services. While preliminary, our ﬁndings show that data-
driven studies are essential for having more informed public
debates on the pros and cons of the current design of the Free
Basics service.
1.
Internet.org [1] is a consortium founded and led by Face-
book since 2013 with the goal of bringing affordable In-
ternet access to everyone in the world. Free Basics is the
ﬂagship initiative by Internet.org, offering free access to se-
lect Web services in partnership with mobile (cellular) ser-
vice providers in developing and under-developed countries
around the world. As of May 12th 2016, Free Basics has
been deployed in over 40 countries in Africa, Asia, and Cen-
tral...

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


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

Output:
安全论文分析：

title:Breaking for commercials: characterizing mobile advertising
author:Narseo Vallina-Rodriguez and
Jay Shah and
Alessandro Finamore and
Yan Grunenberger and
Konstantina Papagiannaki and
Hamed Haddadi and
Jon Crowcroft
Breaking for Commercials:
Characterizing Mobile Advertising
Narseo Vallina-Rodriguez†, Jay Shah†, Alessandro Finamore‡
Yan Grunenberger⋄, Hamed Haddadi§, Konstantina Papagiannaki⋄, Jon Crowcroft†
University of Cambridge†, Politecnico di Torino‡, Telefonica Research⋄
Queen Mary University of London§
name.surname@cl.cam.ac.uk†, ﬁnamore@tlc.polito.it‡, {yan,dina}@tid.es⋄
hamed@eecs.qmul.ac.uk§
ABSTRACT
1.
INTRODUCTION
Mobile phones and tablets can be considered as the ﬁrst incarnation
of the post-PC era. Their explosive adoption rate has been driven
by a number of factors, with the most signifcant inﬂuence being
applications (apps) and app markets. Individuals and organizations
are able to develop and publish apps, and the most popular form of
monetization is mobile advertising.
The mobile advertisement (ad) ecosystem has been the target of
prior research, but these works typically focused on a small set of
apps or are from a user privacy perspective. In this work we make
use of a unique, anonymized data set corresponding to one day of
trafﬁc for a major European mobile carrier with more than 3 million
subscribers. We further take a principled approach to characterize
mobile ad trafﬁc along a number of dimensions, such as overall
trafﬁc, frequency, as well as possible implications in terms of en-
ergy on a mobile device.
Our analysis demonstrates a number of inefﬁciencies in today’s
ad delivery. We discuss the beneﬁts of well-known techniques,
such as pre-fetching and caching, to limit the energy and network
signalling overhead caused by current systems. A prototype im-
plementation on Android devices demonstrates an improvement of
50% in terms of energy consumption for ofﬂine ad-sponsored apps
while limiting the amount of ad related trafﬁc.
Keywords
E...


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

Input:
title:Breaking for commercials: characterizing mobile advertising
author:Narseo Vallina-Rodriguez and
Jay Shah and
Alessandro Finamore and
Yan Grunenberger and
Konstantina Papagiannaki and
Hamed Haddadi and
Jon Crowcroft
Breaking for Commercials:
Characterizing Mobile Advertising
Narseo Vallina-Rodriguez†, Jay Shah†, Alessandro Finamore‡
Yan Grunenberger⋄, Hamed Haddadi§, Konstantina Papagiannaki⋄, Jon Crowcroft†
University of Cambridge†, Politecnico di Torino‡, Telefonica Research⋄
Queen Mary University of London§
name.surname@cl.cam.ac.uk†, ﬁnamore@tlc.polito.it‡, {yan,dina}@tid.es⋄
hamed@eecs.qmul.ac.uk§
ABSTRACT
1.
INTRODUCTION
Mobile phones and tablets can be considered as the ﬁrst incarnation
of the post-PC era. Their explosive adoption rate has been driven
by a number of factors, with the most signifcant inﬂuence being
applications (apps) and app markets. Individuals and organizations
are able to develop and publish apps, and the most popular form of
monetization is mobile advertising.
The mobile advertisement (ad) ecosystem has been the target of
prior research, but these works typically focused on a small set of
apps or are from a user privacy perspective. In this work we make
use of a unique, anonymized data set corresponding to one day of
trafﬁc for a major European mobile carrier with more than 3 million
subscribers. We further take a principled approach to characterize
mobile ad trafﬁc along a number of dimensions, such as overall
trafﬁc, frequency, as well as possible implications in terms of en-
ergy on a mobile device.
Our analysis demonstrates a number of inefﬁciencies in today’s
ad delivery. We discuss the beneﬁts of well-known techniques,
such as pre-fetching and caching, to limit the energy and network
signalling overhead caused by current systems. A prototype im-
plementation on Android devices demonstrates an improvement of
50% in terms of energy consumption for ofﬂine ad-sponsored apps
while limiting the amount of ad related trafﬁc.
Keywords
E...

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


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

Output:
安全论文分析：

title:PDF Mirage: Content Masking Attack Against Information-Based Online
Services
author:Ian D. Markwood and
Dakun Shen and
Yao Liu and
Zhuo Lu
PDF Mirage: Content Masking Attack Against
Information-Based Online Services
Ian Markwood, Dakun Shen, Yao Liu, and Zhuo Lu, University of South Florida
https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/markwood
This paper is included in the Proceedings of the 26th USENIX Security SymposiumAugust 16–18, 2017 • Vancouver, BC, CanadaISBN 978-1-931971-40-9Open access to the Proceedings of the 26th USENIX Security Symposium is sponsored by USENIXPDF Mirage: Content Masking Attack
Against Information-Based Online Services
Ian Markwood∗†, Dakun Shen∗†, Yao Liu†, and Zhuo Lu†
†University of South Florida, Tampa, FL, U.S.A
*Co-First Authors
Abstract
We present a new class of content masking attacks
against the Adobe PDF standard, causing documents to
appear to humans dissimilar to the underlying content ex-
tracted by information-based services. We show three at-
tack variants with notable impact on real-world systems.
Our ﬁrst attack allows academic paper writers and re-
viewers to collude via subverting the automatic reviewer
assignment systems in current use by academic confer-
ences including INFOCOM, which we reproduced. Our
second attack renders ineffective plagiarism detection
software, particularly Turnitin, targeting speciﬁc small
plagiarism similarity scores to appear natural and evade
detection.
In our ﬁnal attack, we place masked con-
tent into the indexes for Bing, Yahoo!, and DuckDuckGo
which renders as information entirely different from the
keywords used to locate it, enabling spam, profane, or
possibly illegal content to go unnoticed by these search
engines but still returned in unrelated search results.
Lastly, as these systems eschew optical character recog-
nition (OCR) for its overhead, we offer a comprehensive
and lightweight alternative mitigation method.
1
Introduction
Desi...


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

Input:
title:PDF Mirage: Content Masking Attack Against Information-Based Online
Services
author:Ian D. Markwood and
Dakun Shen and
Yao Liu and
Zhuo Lu
PDF Mirage: Content Masking Attack Against
Information-Based Online Services
Ian Markwood, Dakun Shen, Yao Liu, and Zhuo Lu, University of South Florida
https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/markwood
This paper is included in the Proceedings of the 26th USENIX Security SymposiumAugust 16–18, 2017 • Vancouver, BC, CanadaISBN 978-1-931971-40-9Open access to the Proceedings of the 26th USENIX Security Symposium is sponsored by USENIXPDF Mirage: Content Masking Attack
Against Information-Based Online Services
Ian Markwood∗†, Dakun Shen∗†, Yao Liu†, and Zhuo Lu†
†University of South Florida, Tampa, FL, U.S.A
*Co-First Authors
Abstract
We present a new class of content masking attacks
against the Adobe PDF standard, causing documents to
appear to humans dissimilar to the underlying content ex-
tracted by information-based services. We show three at-
tack variants with notable impact on real-world systems.
Our ﬁrst attack allows academic paper writers and re-
viewers to collude via subverting the automatic reviewer
assignment systems in current use by academic confer-
ences including INFOCOM, which we reproduced. Our
second attack renders ineffective plagiarism detection
software, particularly Turnitin, targeting speciﬁc small
plagiarism similarity scores to appear natural and evade
detection.
In our ﬁnal attack, we place masked con-
tent into the indexes for Bing, Yahoo!, and DuckDuckGo
which renders as information entirely different from the
keywords used to locate it, enabling spam, profane, or
possibly illegal content to go unnoticed by these search
engines but still returned in unrelated search results.
Lastly, as these systems eschew optical character recog-
nition (OCR) for its overhead, we offer a comprehensive
and lightweight alternative mitigation method.
1
Introduction
Desi...

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


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

Output:
安全论文分析：

title:POSTER: Password Entering and Transmission Security
author:Gamze Canova and
Melanie Volkamer and
Simon Weiler
CORE
Provided by KITopen
Poster: Password Entering and Transmission Security
Metadata, citation and similar papers at core.ac.uk
Gamze Canova
Technische Universität
Darmstadt
gamze.canova@cased.de
Melanie Volkamer
Technische Universität
volkamer@cased.de
Darmstadt
Simon Weiler
Technische Universität
Darmstadt
simon.weiler@stud.tu-
darmstadt.de
ABSTRACT
The most popular form of user authentication on websites is
the use of passwords. When entering a password, it is cru-
cial that the website uses HTTPS (for the entire content).
However, this is often not the case. We propose PassSec -
a Firefox Add-On to support users to detect password ﬁelds
on which their password might be endangered. In addition,
PassSec displays a non-blocking warning next to the pass-
word ﬁeld, once users click into the password ﬁeld. The user
is provided with possible consequences of entering a pass-
word, recommendations and further information if wanted.
Categories and Subject Descriptors
H.5.2 [Information Interfaces and Presentation]: User
interfaces—user-centered design; K.6.5 [Management of
Computing and Information Systems]: Security and
Protection
General Terms
Security, Human Factors
Keywords
Usable security, user support, password security, security
interventions
1.
INTRODUCTION
The most popular form of user authentication on websites
is the use of passwords. This is mainly due to its convenience
and simplicity. Protecting a user’s password is crucial, espe-
cially because many users tend to reuse the same password
for diﬀerent services [5]. That is, once a password is, e.g.
eavesdropped, this password could be reused by the eaves-
dropper for other services of the victim.
Ideally, a password should be entered only if the server is
authentic and the website with the password ﬁeld is using
HTTPS, while all elements of this website are exchanged
Permission to make digital...


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

Input:
title:POSTER: Password Entering and Transmission Security
author:Gamze Canova and
Melanie Volkamer and
Simon Weiler
CORE
Provided by KITopen
Poster: Password Entering and Transmission Security
Metadata, citation and similar papers at core.ac.uk
Gamze Canova
Technische Universität
Darmstadt
gamze.canova@cased.de
Melanie Volkamer
Technische Universität
volkamer@cased.de
Darmstadt
Simon Weiler
Technische Universität
Darmstadt
simon.weiler@stud.tu-
darmstadt.de
ABSTRACT
The most popular form of user authentication on websites is
the use of passwords. When entering a password, it is cru-
cial that the website uses HTTPS (for the entire content).
However, this is often not the case. We propose PassSec -
a Firefox Add-On to support users to detect password ﬁelds
on which their password might be endangered. In addition,
PassSec displays a non-blocking warning next to the pass-
word ﬁeld, once users click into the password ﬁeld. The user
is provided with possible consequences of entering a pass-
word, recommendations and further information if wanted.
Categories and Subject Descriptors
H.5.2 [Information Interfaces and Presentation]: User
interfaces—user-centered design; K.6.5 [Management of
Computing and Information Systems]: Security and
Protection
General Terms
Security, Human Factors
Keywords
Usable security, user support, password security, security
interventions
1.
INTRODUCTION
The most popular form of user authentication on websites
is the use of passwords. This is mainly due to its convenience
and simplicity. Protecting a user’s password is crucial, espe-
cially because many users tend to reuse the same password
for diﬀerent services [5]. That is, once a password is, e.g.
eavesdropped, this password could be reused by the eaves-
dropper for other services of the victim.
Ideally, a password should be entered only if the server is
authentic and the website with the password ﬁeld is using
HTTPS, while all elements of this website are exchanged
Permission to make digital...

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


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

Output:
安全论文分析：

title:Privacy-preserving distance computation and proximity testing on earth,
done right
author:Jaroslav Sedenka and
Paolo Gasti
Privacy-Preserving Distance Computation
and Proximity Testing on Earth, Done Right
Jaroslav Šedˇenka∗
Dept. of Mathematics and Statistics
Masaryk University
Kotláˇrská 2, 61137 Brno, Czech Republic
sedenka@mail.muni.cz
Paolo Gasti
School of Engineering and Computing Sciences
New York Institute of Technology
1855 Broadway, New York, NY 10023, USA
pgasti@nyit.edu
ABSTRACT
In recent years, the availability of GPS-enabled smartphones
have made location-based services extremely popular. A
multitude of applications rely on location information to
provide a wide range of services. Location information is,
however, extremely sensitive and can be easily abused. In this
paper, we introduce the ﬁrst protocols for secure computation
of distance and for proximity testing over a sphere. Our
secure distance protocols allow two parties, Alice and Bob,
to determine their mutual distance without disclosing any
additional information about their location. Through our
secure proximity testing protocols, Alice only learns if Bob is
in close proximity, i.e., within some arbitrary distance.
Our techniques rely on three diﬀerent representations of
Earth, which provide diﬀerent trade-oﬀs between accuracy
and performance. We show, via experiments on a prototype
implementation, that our protocols are practical on resource-
constrained smartphone devices. Our distance computation
protocols runs, in fact, in 54 to 78 ms on a commodity
Android smartphone. Similarly, our proximity tests require
between 1.2 s and 2.8 s on the same platform. The imprecision
introduced by our protocols is very small, i.e., between 0.1%
and 3% on average, depending on the distance.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Public Policy
Issues—Privacy; E.3 [DATA ENCRYPTION]
1.
INTRODUCTION
Since the introduction of the ﬁrst popular GPS-enabled
smartphones, location-a...


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

Input:
title:Privacy-preserving distance computation and proximity testing on earth,
done right
author:Jaroslav Sedenka and
Paolo Gasti
Privacy-Preserving Distance Computation
and Proximity Testing on Earth, Done Right
Jaroslav Šedˇenka∗
Dept. of Mathematics and Statistics
Masaryk University
Kotláˇrská 2, 61137 Brno, Czech Republic
sedenka@mail.muni.cz
Paolo Gasti
School of Engineering and Computing Sciences
New York Institute of Technology
1855 Broadway, New York, NY 10023, USA
pgasti@nyit.edu
ABSTRACT
In recent years, the availability of GPS-enabled smartphones
have made location-based services extremely popular. A
multitude of applications rely on location information to
provide a wide range of services. Location information is,
however, extremely sensitive and can be easily abused. In this
paper, we introduce the ﬁrst protocols for secure computation
of distance and for proximity testing over a sphere. Our
secure distance protocols allow two parties, Alice and Bob,
to determine their mutual distance without disclosing any
additional information about their location. Through our
secure proximity testing protocols, Alice only learns if Bob is
in close proximity, i.e., within some arbitrary distance.
Our techniques rely on three diﬀerent representations of
Earth, which provide diﬀerent trade-oﬀs between accuracy
and performance. We show, via experiments on a prototype
implementation, that our protocols are practical on resource-
constrained smartphone devices. Our distance computation
protocols runs, in fact, in 54 to 78 ms on a commodity
Android smartphone. Similarly, our proximity tests require
between 1.2 s and 2.8 s on the same platform. The imprecision
introduced by our protocols is very small, i.e., between 0.1%
and 3% on average, depending on the distance.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Public Policy
Issues—Privacy; E.3 [DATA ENCRYPTION]
1.
INTRODUCTION
Since the introduction of the ﬁrst popular GPS-enabled
smartphones, location-a...

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


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

Output:
安全论文分析：

title:Programmable In-Network Security for Context-aware BYOD Policies
author:Qiao Kang and
Lei Xue and
Adam Morrison and
Yuxin Tang and
Ang Chen and
Xiapu Luo
Programmable In-Network Security for
Context-aware BYOD Policies
Qiao Kang, Rice University; Lei Xue, The Hong Kong Polytechnic University;
Adam Morrison, Yuxin Tang, and Ang Chen, Rice University; Xiapu Luo,
The Hong Kong Polytechnic University
https://www.usenix.org/conference/usenixsecurity20/presentation/kang
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Programmable In-Network Security for Context-aware BYOD Policies
Qiao Kang
Rice University
Yuxin Tang
Rice University
Lei Xue
The Hong Kong Polytechnic
Adam Morrison
Rice University
University
Ang Chen
Rice University
Xiapu Luo
The Hong Kong Polytechnic
University
Abstract
Bring Your Own Device (BYOD) has become the new norm
for enterprise networks, but BYOD security remains a top con-
cern. Context-aware security, which enforces access control
based on dynamic runtime context, is a promising approach.
Recent work has developed SDN solutions to collect device
contexts and enforce access control at a central controller.
However, the central controller could become a bottleneck
and attack target. Processing context signals at the remote
controller is also too slow for real-time decision change.
We present a new paradigm, programmable in-network
security (Poise), which is enabled by the emergence of pro-
grammable switches. At the heart of Poise is a novel security
primitive, which can be programmed to support a wide range
of context-aware policies in hardware. Users of Poise specify
concise policies, and Poise compiles them into different con-
ﬁgurations of the primitive in P4. Compared with traditional
SDN defenses, Poise is resilient to control plane saturation
attacks, and it dramatically inc...


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

Input:
title:Programmable In-Network Security for Context-aware BYOD Policies
author:Qiao Kang and
Lei Xue and
Adam Morrison and
Yuxin Tang and
Ang Chen and
Xiapu Luo
Programmable In-Network Security for
Context-aware BYOD Policies
Qiao Kang, Rice University; Lei Xue, The Hong Kong Polytechnic University;
Adam Morrison, Yuxin Tang, and Ang Chen, Rice University; Xiapu Luo,
The Hong Kong Polytechnic University
https://www.usenix.org/conference/usenixsecurity20/presentation/kang
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Programmable In-Network Security for Context-aware BYOD Policies
Qiao Kang
Rice University
Yuxin Tang
Rice University
Lei Xue
The Hong Kong Polytechnic
Adam Morrison
Rice University
University
Ang Chen
Rice University
Xiapu Luo
The Hong Kong Polytechnic
University
Abstract
Bring Your Own Device (BYOD) has become the new norm
for enterprise networks, but BYOD security remains a top con-
cern. Context-aware security, which enforces access control
based on dynamic runtime context, is a promising approach.
Recent work has developed SDN solutions to collect device
contexts and enforce access control at a central controller.
However, the central controller could become a bottleneck
and attack target. Processing context signals at the remote
controller is also too slow for real-time decision change.
We present a new paradigm, programmable in-network
security (Poise), which is enabled by the emergence of pro-
grammable switches. At the heart of Poise is a novel security
primitive, which can be programmed to support a wide range
of context-aware policies in hardware. Users of Poise specify
concise policies, and Poise compiles them into different con-
ﬁgurations of the primitive in P4. Compared with traditional
SDN defenses, Poise is resilient to control plane saturation
attacks, and it dramatically inc...

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


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

Output:
安全论文分析：

title:What Supercomputers Say: A Study of Five System Logs
author:Adam J. Oliner and
Jon Stearley
Authorized licensed use limited to: Tsinghua University. Downloaded on March 20,2021 at 12:48:03 UTC from IEEE Xplore.  Restrictions apply.
WhatSupercomputersSay:AStudyofFiveSystemLogsAdamOliner1StanfordUniversityDepartmentofComputerSciencePaloAlto,CA94305USAoliner@cs.stanford.eduJonStearley2SandiaNationalLaboratoriesAlbuquerque,NM87111USAjrstear@sandia.govAbstractIfwehopetoautomaticallydetectanddiagnosefail-uresinlarge-scalecomputersystems,wemuststudyrealdeployedsystemsandthedatatheygenerate.Progresshasbeenhamperedbytheinaccessibilityofempiricaldata.Thispaperaddressesthatdearthbyexaminingsystemlogsfromﬁvesupercomputers,withtheaimofprovidinguse-fulinsightanddirectionforfutureresearchintotheuseofsuchlogs.Wepresentdetailsaboutthesystems,methodsoflogcollection,andhowalertswereidentiﬁed;proposeasimplerandmoreeffectiveﬁlteringalgorithm;andde-ﬁneoperationalcontexttoencompassthecrucialinforma-tionthatwefoundtobecurrentlymissingfrommostlogs.Themachinesweconsider(andthenumberofprocessors)are:BlueGene/L(131072),RedStorm(10880),Thunder-bird(9024),Spirit(1028),andLiberty(512).Thisistheﬁrststudyofrawsystemlogsfrommultiplesupercomputers.1IntroductionThereliabilityandperformancechallengesofsupercom-putingsystemscannotbeadequatelyaddresseduntilthebe-haviorofthemachinesisbetterunderstood.Inthispaper,westudysystemlogsfromﬁveoftheworld’smostpow-erfulsupercomputers:BlueGene/L(BG/L),Thunderbird,RedStorm,Spirit,andLiberty.Theanalysisencompassesmorethan111.67GBofdatacontaining178,081,459alertmessagesin77categories.Thesystemlogsaretheﬁrstplacesystemadministratorsgowhentheyarealertedtoaproblem,andareoneofthefewmechanismsavailabletothemforgainingvisibilityintothebehaviorofthemachine.Particularlyassystemsgrowinsizeandcomplexity,there1WorkwasdoneatSandiaNationalLaboratories,fundedbytheU.S.DepartmentofEnergyHighPerformanceComputerScienceFellowship.2SandiaisamultiprogramlaboratoryoperatedbySandiaCo...


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

Input:
title:What Supercomputers Say: A Study of Five System Logs
author:Adam J. Oliner and
Jon Stearley
Authorized licensed use limited to: Tsinghua University. Downloaded on March 20,2021 at 12:48:03 UTC from IEEE Xplore.  Restrictions apply.
WhatSupercomputersSay:AStudyofFiveSystemLogsAdamOliner1StanfordUniversityDepartmentofComputerSciencePaloAlto,CA94305USAoliner@cs.stanford.eduJonStearley2SandiaNationalLaboratoriesAlbuquerque,NM87111USAjrstear@sandia.govAbstractIfwehopetoautomaticallydetectanddiagnosefail-uresinlarge-scalecomputersystems,wemuststudyrealdeployedsystemsandthedatatheygenerate.Progresshasbeenhamperedbytheinaccessibilityofempiricaldata.Thispaperaddressesthatdearthbyexaminingsystemlogsfromﬁvesupercomputers,withtheaimofprovidinguse-fulinsightanddirectionforfutureresearchintotheuseofsuchlogs.Wepresentdetailsaboutthesystems,methodsoflogcollection,andhowalertswereidentiﬁed;proposeasimplerandmoreeffectiveﬁlteringalgorithm;andde-ﬁneoperationalcontexttoencompassthecrucialinforma-tionthatwefoundtobecurrentlymissingfrommostlogs.Themachinesweconsider(andthenumberofprocessors)are:BlueGene/L(131072),RedStorm(10880),Thunder-bird(9024),Spirit(1028),andLiberty(512).Thisistheﬁrststudyofrawsystemlogsfrommultiplesupercomputers.1IntroductionThereliabilityandperformancechallengesofsupercom-putingsystemscannotbeadequatelyaddresseduntilthebe-haviorofthemachinesisbetterunderstood.Inthispaper,westudysystemlogsfromﬁveoftheworld’smostpow-erfulsupercomputers:BlueGene/L(BG/L),Thunderbird,RedStorm,Spirit,andLiberty.Theanalysisencompassesmorethan111.67GBofdatacontaining178,081,459alertmessagesin77categories.Thesystemlogsaretheﬁrstplacesystemadministratorsgowhentheyarealertedtoaproblem,andareoneofthefewmechanismsavailabletothemforgainingvisibilityintothebehaviorofthemachine.Particularlyassystemsgrowinsizeandcomplexity,there1WorkwasdoneatSandiaNationalLaboratories,fundedbytheU.S.DepartmentofEnergyHighPerformanceComputerScienceFellowship.2SandiaisamultiprogramlaboratoryoperatedbySandiaCo...

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


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

Output:
安全论文分析：

title:Revisiting SSL/TLS Implementations: New Bleichenbacher Side Channels
and Attacks
author:Christopher Meyer and
Juraj Somorovsky and
Eugen Weiss and
J"org Schwenk and
Sebastian Schinzel and
Erik Tews
SAVE THE DATE
23rd USENIX Security Symposium
AUGUST 20–22, 2014 • SAN DIEGO, CA
The USENIX Security Symposium brings together researchers, practitioners, system admin istrators,  system programmers,
and others interested in the latest advances in the security of computer  systems and networks. The Symposium will
include a 3-day technical program with refereed papers, invited talks, posters, panel discussions, and Birds-of-a-Feather
sessions. Featured speakers/sessions include:
Keynote Address by Phil Lapsley, author of Exploding the
Phone: The Untold Story of the Teenagers and Outlaws Who
Hacked Ma Bell
Panel: “The Future of Crypto: Getting from Here to
Guarantees” with Daniel J. Bernstein, Matt Blaze, and
Tanja Lange
Invited Talk: “Battling Human Trafficking with Big Data”
by Rolando R. Lopez, Orphan Secure
Invited Talk: “Insight into the NSA’s Weakening
of Crypto Standards” by Joseph Menn, Reuters
The following co-located events will precede the Symposium on August 18–19, 2014:
EVT/WOTE ’14: 2014 Electronic Voting Technology
Workshop/Workshop on Trustworthy Elections
USENIX Journal of Election Technology
and Systems (JETS)
Published in conjunction with EVT/WOTE
www.usenix.org/jets
CSET ’14: 7th Workshop on Cyber Security
Experimentation and Test
NEW! 3GSE ’14: 2014 USENIX Summit on Gaming,
Games, and Gamification in Security Education
FOCI ’14: 4th USENIX Workshop on Free and Open
Communications on the Internet
HotSec ’14: 2014 USENIX Summit on Hot Topics
in Security
HealthTech ’14: 2014 USENIX Summit on Health
Information Technologies
Safety, Security, Privacy, and Interoperability
of Health Information Technologies
WOOT ’14: 8th USENIX Workshop on Offensive
Technologies
www.usenix.org/sec14
Stay Connected...
twitter.com/USENIXSe...


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

Input:
title:Revisiting SSL/TLS Implementations: New Bleichenbacher Side Channels
and Attacks
author:Christopher Meyer and
Juraj Somorovsky and
Eugen Weiss and
J"org Schwenk and
Sebastian Schinzel and
Erik Tews
SAVE THE DATE
23rd USENIX Security Symposium
AUGUST 20–22, 2014 • SAN DIEGO, CA
The USENIX Security Symposium brings together researchers, practitioners, system admin istrators,  system programmers,
and others interested in the latest advances in the security of computer  systems and networks. The Symposium will
include a 3-day technical program with refereed papers, invited talks, posters, panel discussions, and Birds-of-a-Feather
sessions. Featured speakers/sessions include:
Keynote Address by Phil Lapsley, author of Exploding the
Phone: The Untold Story of the Teenagers and Outlaws Who
Hacked Ma Bell
Panel: “The Future of Crypto: Getting from Here to
Guarantees” with Daniel J. Bernstein, Matt Blaze, and
Tanja Lange
Invited Talk: “Battling Human Trafficking with Big Data”
by Rolando R. Lopez, Orphan Secure
Invited Talk: “Insight into the NSA’s Weakening
of Crypto Standards” by Joseph Menn, Reuters
The following co-located events will precede the Symposium on August 18–19, 2014:
EVT/WOTE ’14: 2014 Electronic Voting Technology
Workshop/Workshop on Trustworthy Elections
USENIX Journal of Election Technology
and Systems (JETS)
Published in conjunction with EVT/WOTE
www.usenix.org/jets
CSET ’14: 7th Workshop on Cyber Security
Experimentation and Test
NEW! 3GSE ’14: 2014 USENIX Summit on Gaming,
Games, and Gamification in Security Education
FOCI ’14: 4th USENIX Workshop on Free and Open
Communications on the Internet
HotSec ’14: 2014 USENIX Summit on Hot Topics
in Security
HealthTech ’14: 2014 USENIX Summit on Health
Information Technologies
Safety, Security, Privacy, and Interoperability
of Health Information Technologies
WOOT ’14: 8th USENIX Workshop on Offensive
Technologies
www.usenix.org/sec14
Stay Connected...
twitter.com/USENIXSe...

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


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

Output:
安全论文分析：

title:iOracle: Automated Evaluation of Access Control Policies in iOS
author:Luke Deshotels and
Razvan Deaconescu and
Costin Carabas and
Iulia Manda and
William Enck and
Mihai Chiroiu and
Ninghui Li and
Ahmad-Reza Sadeghi
iOracle: Automated Evaluation of Access Control Policies in iOS
Luke Deshotels
North Carolina State University
ladeshot@ncsu.edu
Răzvan Deaconescu
University POLITEHNICA
of Bucharest
Costin Carabas,
University POLITEHNICA
of Bucharest
razvan.deaconescu@cs.pub.ro
costin.carabas@stud.acs.upb.ro
Iulia Mandă
University POLITEHNICA
of Bucharest
iulia.manda@stud.acs.upb.ro
William Enck
North Carolina State University
whenck@ncsu.edu
Mihai Chiroiu
University POLITEHNICA
of Bucharest
mihai.chiroiu@cs.pub.ro
Ninghui Li
Purdue University
ninghui@cs.purdue.edu
Ahmad-Reza Sadeghi
Technische Universität Darmstadt
ahmad.sadeghi@
trust.tu-darmstadt.de
ABSTRACT
Modern operating systems, such as iOS, use multiple access con-
trol policies to define an overall protection system. However, the
complexity of these policies and their interactions can hide pol-
icy flaws that compromise the security of the protection system.
We propose iOracle, a framework that logically models the iOS
protection system such that queries can be made to automatically
detect policy flaws. iOracle models policies and runtime context
extracted from iOS firmware images, developer resources, and jail-
broken devices, and iOracle significantly reduces the complexity of
queries by modeling policy semantics. We evaluate iOracle by using
it to successfully triage executables likely to have policy flaws and
comparing our results to the executables exploited in four recent
jailbreaks. When applied to iOS 10, iOracle identifies previously
unknown policy flaws that allow attackers to modify or bypass
access control policies. For compromised system processes, conse-
quences of these policy flaws include sandbox escapes (with respect
to read/write file access) and changing the ownership of arbitrary
fil...


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

Input:
title:iOracle: Automated Evaluation of Access Control Policies in iOS
author:Luke Deshotels and
Razvan Deaconescu and
Costin Carabas and
Iulia Manda and
William Enck and
Mihai Chiroiu and
Ninghui Li and
Ahmad-Reza Sadeghi
iOracle: Automated Evaluation of Access Control Policies in iOS
Luke Deshotels
North Carolina State University
ladeshot@ncsu.edu
Răzvan Deaconescu
University POLITEHNICA
of Bucharest
Costin Carabas,
University POLITEHNICA
of Bucharest
razvan.deaconescu@cs.pub.ro
costin.carabas@stud.acs.upb.ro
Iulia Mandă
University POLITEHNICA
of Bucharest
iulia.manda@stud.acs.upb.ro
William Enck
North Carolina State University
whenck@ncsu.edu
Mihai Chiroiu
University POLITEHNICA
of Bucharest
mihai.chiroiu@cs.pub.ro
Ninghui Li
Purdue University
ninghui@cs.purdue.edu
Ahmad-Reza Sadeghi
Technische Universität Darmstadt
ahmad.sadeghi@
trust.tu-darmstadt.de
ABSTRACT
Modern operating systems, such as iOS, use multiple access con-
trol policies to define an overall protection system. However, the
complexity of these policies and their interactions can hide pol-
icy flaws that compromise the security of the protection system.
We propose iOracle, a framework that logically models the iOS
protection system such that queries can be made to automatically
detect policy flaws. iOracle models policies and runtime context
extracted from iOS firmware images, developer resources, and jail-
broken devices, and iOracle significantly reduces the complexity of
queries by modeling policy semantics. We evaluate iOracle by using
it to successfully triage executables likely to have policy flaws and
comparing our results to the executables exploited in four recent
jailbreaks. When applied to iOS 10, iOracle identifies previously
unknown policy flaws that allow attackers to modify or bypass
access control policies. For compromised system processes, conse-
quences of these policy flaws include sandbox escapes (with respect
to read/write file access) and changing the ownership of arbitrary
fil...

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


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

Output:
安全论文分析：

title:Unauthorized origin crossing on mobile platforms: threats and mitigation
author:Rui Wang and
Luyi Xing and
XiaoFeng Wang and
Shuo Chen
Unauthorized Origin Crossing on Mobile Platforms:
Threats and Mitigation
Rui Wang
Luyi Xing
Microsoft Research
ruiwan@microsoft.com
Indiana University
luyixing@indiana.edu
XiaoFeng Wang
Indiana University
xw7@indiana.edu
Shuo Chen
Microsoft Research
shuochen@microsoft.com
ABSTRACT
With  the  progress  in  mobile  computing,  web  services  are
increasingly delivered to their users through mobile apps, instead
of  web  browsers.  However,  unlike  the  browser,  which  enforces
origin-based security policies to mediate the interactions between
the web content from different sources,  today’s mobile OSes do
not have a comparable security mechanism to control the cross-
origin communications between apps, as well as those between an
app  and  the  web.  As  a  result,  a  mobile  user’s  sensitive  web
resources could be exposed to the harms from a malicious origin.
In this paper, we report the first systematic study on this mobile
cross-origin  risk.  Our  study  inspects  the  main  cross-origin
channels on Android and iOS, including intent, scheme and web-
accessing  utility  classes,  and  further  analyzes  the  ways  popular
web services (e.g., Facebook, Dropbox, etc.) and their apps utilize
those channels to serve other apps. The research shows that lack
of origin-based protection opens the door to a wide spectrum of
cross-origin attacks. These attacks are unique to mobile platforms,
and their consequences are serious: for example, using carefully
designed  techniques  for  mobile  cross-site  scripting  and  request
forgery,  an  unauthorized  party  can  obtain  a  mobile  user’s
Facebook/Dropbox authentication credentials and record her text
input. We report our findings to related software vendors, who all
acknowledged  their  importance.  To  address  this  threat,  we
designed...


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

Input:
title:Unauthorized origin crossing on mobile platforms: threats and mitigation
author:Rui Wang and
Luyi Xing and
XiaoFeng Wang and
Shuo Chen
Unauthorized Origin Crossing on Mobile Platforms:
Threats and Mitigation
Rui Wang
Luyi Xing
Microsoft Research
ruiwan@microsoft.com
Indiana University
luyixing@indiana.edu
XiaoFeng Wang
Indiana University
xw7@indiana.edu
Shuo Chen
Microsoft Research
shuochen@microsoft.com
ABSTRACT
With  the  progress  in  mobile  computing,  web  services  are
increasingly delivered to their users through mobile apps, instead
of  web  browsers.  However,  unlike  the  browser,  which  enforces
origin-based security policies to mediate the interactions between
the web content from different sources,  today’s mobile OSes do
not have a comparable security mechanism to control the cross-
origin communications between apps, as well as those between an
app  and  the  web.  As  a  result,  a  mobile  user’s  sensitive  web
resources could be exposed to the harms from a malicious origin.
In this paper, we report the first systematic study on this mobile
cross-origin  risk.  Our  study  inspects  the  main  cross-origin
channels on Android and iOS, including intent, scheme and web-
accessing  utility  classes,  and  further  analyzes  the  ways  popular
web services (e.g., Facebook, Dropbox, etc.) and their apps utilize
those channels to serve other apps. The research shows that lack
of origin-based protection opens the door to a wide spectrum of
cross-origin attacks. These attacks are unique to mobile platforms,
and their consequences are serious: for example, using carefully
designed  techniques  for  mobile  cross-site  scripting  and  request
forgery,  an  unauthorized  party  can  obtain  a  mobile  user’s
Facebook/Dropbox authentication credentials and record her text
input. We report our findings to related software vendors, who all
acknowledged  their  importance.  To  address  this  threat,  we
designed...

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


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

Output:
安全论文分析：

title:Robust De-anonymization of Large Sparse Datasets
author:Arvind Narayanan and
Vitaly Shmatikov
2008 IEEE Symposium on Security and Privacy
Robust De-anonymization of Large Sparse Datasets
Arvind Narayanan and Vitaly Shmatikov
The University of Texas at Austin
Abstract
We
present a
attacks
new class of
statistical de-
anonymization
high-dimensional
micro-data, such as individual preferences, recommen-
dations, transaction records and so on. Our techniques
are robust to perturbation in the data and tolerate some
mistakes in the adversary’s background knowledge.
against
We apply our de-anonymization methodology to the
Netﬂix Prize dataset, which contains anonymous movie
ratings of 500,000 subscribers of Netﬂix, the world’s
largest online movie rental service. We demonstrate
that an adversary who knows only a little bit about
an individual subscriber can easily identify this sub-
scriber’s record in the dataset. Using the Internet
Movie Database as the source of background knowl-
edge, we successfully identiﬁed the Netﬂix records of
known users, uncovering their apparent political pref-
erences and other potentially sensitive information.
1 Introduction
Datasets containing micro-data, that is, information
about speciﬁc individuals, are increasingly becoming
public in response to “open government” laws and to
support data mining research. Some datasets include
legally protected information such as health histories;
others contain individual preferences and transactions,
which many people may view as private or sensitive.
Privacy risks of publishing micro-data are well-
known. Even if identiﬁers such as names and Social
Security numbers have been removed, the adversary can
use background knowledge and cross-correlation with
other databases to re-identify individual data records.
Famous attacks include de-anonymization of a Mas-
sachusetts hospital discharge database by joining it with
a public voter database [25] and privacy breaches caused
by (ostensibly anonymized)...


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

Input:
title:Robust De-anonymization of Large Sparse Datasets
author:Arvind Narayanan and
Vitaly Shmatikov
2008 IEEE Symposium on Security and Privacy
Robust De-anonymization of Large Sparse Datasets
Arvind Narayanan and Vitaly Shmatikov
The University of Texas at Austin
Abstract
We
present a
attacks
new class of
statistical de-
anonymization
high-dimensional
micro-data, such as individual preferences, recommen-
dations, transaction records and so on. Our techniques
are robust to perturbation in the data and tolerate some
mistakes in the adversary’s background knowledge.
against
We apply our de-anonymization methodology to the
Netﬂix Prize dataset, which contains anonymous movie
ratings of 500,000 subscribers of Netﬂix, the world’s
largest online movie rental service. We demonstrate
that an adversary who knows only a little bit about
an individual subscriber can easily identify this sub-
scriber’s record in the dataset. Using the Internet
Movie Database as the source of background knowl-
edge, we successfully identiﬁed the Netﬂix records of
known users, uncovering their apparent political pref-
erences and other potentially sensitive information.
1 Introduction
Datasets containing micro-data, that is, information
about speciﬁc individuals, are increasingly becoming
public in response to “open government” laws and to
support data mining research. Some datasets include
legally protected information such as health histories;
others contain individual preferences and transactions,
which many people may view as private or sensitive.
Privacy risks of publishing micro-data are well-
known. Even if identiﬁers such as names and Social
Security numbers have been removed, the adversary can
use background knowledge and cross-correlation with
other databases to re-identify individual data records.
Famous attacks include de-anonymization of a Mas-
sachusetts hospital discharge database by joining it with
a public voter database [25] and privacy breaches caused
by (ostensibly anonymized)...

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


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

Output:
安全论文分析：

title:Trick or Heat?: Manipulating Critical Temperature-Based Control Systems
Using Rectification Attacks
author:Yazhou Tu and
Sara Rampazzi and
Bin Hao and
Angel Rodriguez and
Kevin Fu and
Xiali Hei
Trick or Heat? Manipulating Critical Temperature-Based
Control Systems Using Rectification Attacks
Yazhou Tu∗
University of Louisiana at Lafayette
yazhou.tu1@louisiana.edu
Angel Rodriguez
University of Michigan
angelrod@umich.edu
Sara Rampazzi∗
University of Michigan
srampazz@umich.edu
Kevin Fu
University of Michigan
kevinfu@umich.edu
Bin Hao
University of Louisiana at Lafayette
bin.hao@louisiana.edu
Xiali Hei
University of Louisiana at Lafayette
xiali.hei@louisiana.edu
ABSTRACT
Temperature sensing and control systems are widely used in the
closed-loop control of critical processes such as maintaining the
thermal stability of patients, or in alarm systems for detecting
temperature-related hazards. However, the security of these sys-
tems has yet to be completely explored, leaving potential attack
surfaces that can be exploited to take control over critical systems.
In this paper we investigate the reliability of temperature-based
control systems from a security and safety perspective. We show
how unexpected consequences and safety risks can be induced by
physical-level attacks on analog temperature sensing components.
For instance, we demonstrate that an adversary could remotely
manipulate the temperature sensor measurements of an infant in-
cubator to cause potential safety issues, without tampering with the
victim system or triggering automatic temperature alarms. This at-
tack exploits the unintended rectification effect that can be induced
in operational and instrumentation amplifiers to control the sensor
output, tricking the internal control loop of the victim system to
heat up or cool down. Furthermore, we show how the exploit of
this hardware-level vulnerability could affect different classes of
analog sensors that share similar signal conditioning processes.
Ou...


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

Input:
title:Trick or Heat?: Manipulating Critical Temperature-Based Control Systems
Using Rectification Attacks
author:Yazhou Tu and
Sara Rampazzi and
Bin Hao and
Angel Rodriguez and
Kevin Fu and
Xiali Hei
Trick or Heat? Manipulating Critical Temperature-Based
Control Systems Using Rectification Attacks
Yazhou Tu∗
University of Louisiana at Lafayette
yazhou.tu1@louisiana.edu
Angel Rodriguez
University of Michigan
angelrod@umich.edu
Sara Rampazzi∗
University of Michigan
srampazz@umich.edu
Kevin Fu
University of Michigan
kevinfu@umich.edu
Bin Hao
University of Louisiana at Lafayette
bin.hao@louisiana.edu
Xiali Hei
University of Louisiana at Lafayette
xiali.hei@louisiana.edu
ABSTRACT
Temperature sensing and control systems are widely used in the
closed-loop control of critical processes such as maintaining the
thermal stability of patients, or in alarm systems for detecting
temperature-related hazards. However, the security of these sys-
tems has yet to be completely explored, leaving potential attack
surfaces that can be exploited to take control over critical systems.
In this paper we investigate the reliability of temperature-based
control systems from a security and safety perspective. We show
how unexpected consequences and safety risks can be induced by
physical-level attacks on analog temperature sensing components.
For instance, we demonstrate that an adversary could remotely
manipulate the temperature sensor measurements of an infant in-
cubator to cause potential safety issues, without tampering with the
victim system or triggering automatic temperature alarms. This at-
tack exploits the unintended rectification effect that can be induced
in operational and instrumentation amplifiers to control the sensor
output, tricking the internal control loop of the victim system to
heat up or cool down. Furthermore, we show how the exploit of
this hardware-level vulnerability could affect different classes of
analog sensors that share similar signal conditioning processes.
Ou...

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


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

Output:
安全论文分析：

title:Vitamin C for your smartphone: the SKIMS approach for cooperativeand
lightweight security at mobiles
author:Matthias W"ahlisch and
Sebastian Trapp and
Jochen H. Schiller and
Benjamin Jochheim and
Theodor Nolte and
Thomas C. Schmidt and
Osman Ugus and
Dirk Westhoff and
Martin Kutscher and
Matthias K"uster and
Christian Keil and
Jochen Sch"onfelder
Vitamin C for your Smartphone: The SKIMS Approach for
Cooperative and Lightweight Security at Mobiles
Matthias Wählisch(cid:63), Sebastian Trapp(cid:63), Jochen Schiller(cid:63), Benjamin Jochheim†,
Theodor Nolte†, Thomas C. Schmidt†, Osman Ugus†, Dirk Westhoff†, Martin Kutscher‡,
Matthias Küster‡, Christian Keil(cid:5), Jochen Schönfelder(cid:5)
(cid:63)Institut für Informatik, Freie Universität Berlin, Berlin, Germany
†Dept. Informatik, Hamburg University of Applied Sciences, Hamburg, Germany
{ﬁrst.last}@fu-berlin.de, {ﬁrst.last}@haw-hamburg.de, {ﬁrst.last}@escrypt.com, {last}@dfn-cert.de
‡escrypt GmbH, Bochum, Germany
(cid:5)DFN-CERT Services GmbH, Hamburg, Germany
ABSTRACT
Smartphones are popular attack targets, but usually too
weak in applying common protection concepts. SKIMS de-
signs and implements a cooperative, cross-layer security sys-
tem for mobile devices. Detection mechanisms as well as a
proactive and reactive defense of attacks are core compo-
nents of this project.
In this demo, we show a compre-
hensive proof-of-concept of our approaches, which include
entropy-based malware detection, a mobile honeypot, and
spontaneous, socio-inspired trust establishment.
Categories and Subject Descriptors
C.2.0 [Computer-Comm. Networks]: General—Secu-
rity and protection (e.g., ﬁrewalls)
General Terms
Security
Keywords
Mobile security, malware detection, mobile honeypot, ad hoc
trust
1.
INTRODUCTION
Mobile, wireless-based end devices represent a signiﬁcant
part of our current networks, both with respect to the num-
ber of deployed equipment and their economic impact. Lim-
ited hardware resources and ...


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

Input:
title:Vitamin C for your smartphone: the SKIMS approach for cooperativeand
lightweight security at mobiles
author:Matthias W"ahlisch and
Sebastian Trapp and
Jochen H. Schiller and
Benjamin Jochheim and
Theodor Nolte and
Thomas C. Schmidt and
Osman Ugus and
Dirk Westhoff and
Martin Kutscher and
Matthias K"uster and
Christian Keil and
Jochen Sch"onfelder
Vitamin C for your Smartphone: The SKIMS Approach for
Cooperative and Lightweight Security at Mobiles
Matthias Wählisch(cid:63), Sebastian Trapp(cid:63), Jochen Schiller(cid:63), Benjamin Jochheim†,
Theodor Nolte†, Thomas C. Schmidt†, Osman Ugus†, Dirk Westhoff†, Martin Kutscher‡,
Matthias Küster‡, Christian Keil(cid:5), Jochen Schönfelder(cid:5)
(cid:63)Institut für Informatik, Freie Universität Berlin, Berlin, Germany
†Dept. Informatik, Hamburg University of Applied Sciences, Hamburg, Germany
{ﬁrst.last}@fu-berlin.de, {ﬁrst.last}@haw-hamburg.de, {ﬁrst.last}@escrypt.com, {last}@dfn-cert.de
‡escrypt GmbH, Bochum, Germany
(cid:5)DFN-CERT Services GmbH, Hamburg, Germany
ABSTRACT
Smartphones are popular attack targets, but usually too
weak in applying common protection concepts. SKIMS de-
signs and implements a cooperative, cross-layer security sys-
tem for mobile devices. Detection mechanisms as well as a
proactive and reactive defense of attacks are core compo-
nents of this project.
In this demo, we show a compre-
hensive proof-of-concept of our approaches, which include
entropy-based malware detection, a mobile honeypot, and
spontaneous, socio-inspired trust establishment.
Categories and Subject Descriptors
C.2.0 [Computer-Comm. Networks]: General—Secu-
rity and protection (e.g., ﬁrewalls)
General Terms
Security
Keywords
Mobile security, malware detection, mobile honeypot, ad hoc
trust
1.
INTRODUCTION
Mobile, wireless-based end devices represent a signiﬁcant
part of our current networks, both with respect to the num-
ber of deployed equipment and their economic impact. Lim-
ited hardware resources and ...

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


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

Output:
安全论文分析：

title:Node Failure Localization via Network Tomography
author:Liang Ma and
Ting He and
Ananthram Swami and
Don Towsley and
Kin K. Leung and
Jessica Lowe
Node Failure Localization via Network Tomography ∗
Liang Ma
Ting He
IBM T. J. Watson Research
Yorktown Heights, NY, USA
liang.ma@ieee.org
IBM T. J. Watson Research
Yorktown Heights, NY, USA
the@us.ibm.com
Ananthram Swami
Army Research Laboratory
Adelphi, MD, USA
a.swami@ieee.org
Don Towsley
University of Massachusetts
Amherst, MA, USA
Kin K. Leung
Imperial College
London, UK
Jessica Lowe
DSTL
Salisbury, UK
towsley@cs.umass.edu
kin.leung@imperial.ac.uk
jjlowe@dstl.gov.uk
Abstract
We investigate the problem of localizing node failures in
a communication network from end-to-end path measure-
ments, under the assumption that a path behaves normally if
and only if it does not contain any failed nodes. To uniquely
localize node failures, the measurement paths must show dif-
ferent symptoms under diﬀerent failure events, i.e., for any
two distinct sets of failed nodes, there must be a measure-
ment path traversing one and only one of them. This condi-
tion is, however, impractical to test for large networks. Our
ﬁrst contribution is a characterization of this condition in
terms of easily veriﬁable conditions on the network topol-
ogy with given monitor placements under three families of
probing mechanisms, which diﬀer in whether measurement
paths are (i) arbitrarily controllable, (ii) controllable but
cycle-free, or (iii) uncontrollable (i.e., determined by the de-
fault routing protocol). Our second contribution is a char-
acterization of the maximum identiﬁability of node failures,
measured by the maximum number of simultaneous failures
that can always be uniquely localized. Speciﬁcally, we bound
the maximal identiﬁability from both the upper and the
lower bounds which diﬀer by at most one, and show that
these bounds can be evaluated in polynomial time. Finally,
we quantify the impact of the probing mechanism on the
capa...


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

Input:
title:Node Failure Localization via Network Tomography
author:Liang Ma and
Ting He and
Ananthram Swami and
Don Towsley and
Kin K. Leung and
Jessica Lowe
Node Failure Localization via Network Tomography ∗
Liang Ma
Ting He
IBM T. J. Watson Research
Yorktown Heights, NY, USA
liang.ma@ieee.org
IBM T. J. Watson Research
Yorktown Heights, NY, USA
the@us.ibm.com
Ananthram Swami
Army Research Laboratory
Adelphi, MD, USA
a.swami@ieee.org
Don Towsley
University of Massachusetts
Amherst, MA, USA
Kin K. Leung
Imperial College
London, UK
Jessica Lowe
DSTL
Salisbury, UK
towsley@cs.umass.edu
kin.leung@imperial.ac.uk
jjlowe@dstl.gov.uk
Abstract
We investigate the problem of localizing node failures in
a communication network from end-to-end path measure-
ments, under the assumption that a path behaves normally if
and only if it does not contain any failed nodes. To uniquely
localize node failures, the measurement paths must show dif-
ferent symptoms under diﬀerent failure events, i.e., for any
two distinct sets of failed nodes, there must be a measure-
ment path traversing one and only one of them. This condi-
tion is, however, impractical to test for large networks. Our
ﬁrst contribution is a characterization of this condition in
terms of easily veriﬁable conditions on the network topol-
ogy with given monitor placements under three families of
probing mechanisms, which diﬀer in whether measurement
paths are (i) arbitrarily controllable, (ii) controllable but
cycle-free, or (iii) uncontrollable (i.e., determined by the de-
fault routing protocol). Our second contribution is a char-
acterization of the maximum identiﬁability of node failures,
measured by the maximum number of simultaneous failures
that can always be uniquely localized. Speciﬁcally, we bound
the maximal identiﬁability from both the upper and the
lower bounds which diﬀer by at most one, and show that
these bounds can be evaluated in polynomial time. Finally,
we quantify the impact of the probing mechanism on the
capa...

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


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

Output:
安全论文分析：

title:Network discovery from passive measurements
author:Brian Eriksson and
Paul Barford and
Robert D. Nowak
Network Discovery from Passive Measurements
Brian Eriksson
UW-Madison
bceriksson@wisc.edu
Paul Barford
UW-Madison
pb@cs.wisc.edu
Robert Nowak
UW-Madison
nowak@ece.wisc.edu
ABSTRACT
Understanding the Internet’s structure through empirical
measurements is important in the development of new topol-
ogy generators, new protocols, traﬃc engineering, and trou-
bleshooting, among other things. While prior studies of In-
ternet topology have been based on active (traceroute-like)
measurements, passive measurements of packet traﬃc oﬀer
the possibility of a greatly expanded perspective of Internet
structure with much lower impact and management over-
head. In this paper we describe a methodology for inferring
network structure from passive measurements of IP packet
traﬃc. We describe algorithms that enable 1) traﬃc sources
that share network paths to be clustered accurately without
relying on IP address or autonomous system information,
2) topological structure to be inferred accurately with only
a small number of active measurements, 3) missing infor-
mation to be recovered, which is a serious challenge in the
use of passive packet measurements. We demonstrate our
techniques using a series of simulated topologies and empir-
ical data sets. Our experiments show that the clusters es-
tablished by our method closely correspond to sources that
actually share paths. We also show the trade-oﬀs between
selectively applied active probes and the accuracy of the in-
ferred topology between sources. Finally, we characterize
the degree to which missing information can be recovered
from passive measurements, which further enhances the ac-
curacy of the inferred topologies.
Categories and Subject Descriptors
C.2.3 [Computer-Communication Networks]: Network
Operations—Network Monitoring
Keywords
Topology, Embedding, Measurement, Inference, Imputation
General Terms
Measurement, Algor...


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

Input:
title:Network discovery from passive measurements
author:Brian Eriksson and
Paul Barford and
Robert D. Nowak
Network Discovery from Passive Measurements
Brian Eriksson
UW-Madison
bceriksson@wisc.edu
Paul Barford
UW-Madison
pb@cs.wisc.edu
Robert Nowak
UW-Madison
nowak@ece.wisc.edu
ABSTRACT
Understanding the Internet’s structure through empirical
measurements is important in the development of new topol-
ogy generators, new protocols, traﬃc engineering, and trou-
bleshooting, among other things. While prior studies of In-
ternet topology have been based on active (traceroute-like)
measurements, passive measurements of packet traﬃc oﬀer
the possibility of a greatly expanded perspective of Internet
structure with much lower impact and management over-
head. In this paper we describe a methodology for inferring
network structure from passive measurements of IP packet
traﬃc. We describe algorithms that enable 1) traﬃc sources
that share network paths to be clustered accurately without
relying on IP address or autonomous system information,
2) topological structure to be inferred accurately with only
a small number of active measurements, 3) missing infor-
mation to be recovered, which is a serious challenge in the
use of passive packet measurements. We demonstrate our
techniques using a series of simulated topologies and empir-
ical data sets. Our experiments show that the clusters es-
tablished by our method closely correspond to sources that
actually share paths. We also show the trade-oﬀs between
selectively applied active probes and the accuracy of the in-
ferred topology between sources. Finally, we characterize
the degree to which missing information can be recovered
from passive measurements, which further enhances the ac-
curacy of the inferred topologies.
Categories and Subject Descriptors
C.2.3 [Computer-Communication Networks]: Network
Operations—Network Monitoring
Keywords
Topology, Embedding, Measurement, Inference, Imputation
General Terms
Measurement, Algor...

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


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

Output:
安全论文分析：

title:Real-Time Estimation of Event-Driven Traffic Latency Distributions
when Layered on Static Schedules
author:Pam Binns
Real-Time Estimation of Event-Driven Trafﬁc
Latency Distributions when Layered on Static Schedules
Pam Binns
Honeywell Laboratories
Minneapolis, MN 55418
∗
Pam.Binns@honeywell.com
Abstract
Safety-critical distributed control systems must support
periodic and aperiodic functions on common hardware (e.g.
sending messages on a common data bus). Scheduling tech-
niques that produce a timeline with predeﬁned blocks for
periodic functions are used to guarantee deadlines for criti-
cal closed loop periodic control functions (i.e. sensor read,
control, actuator write). Aperiodic processing occurs in pe-
riodic timeline gaps. We develop a technique for binning
aperiodic latency sample data using a novel data repre-
sentation called latency band graphs. A ﬂuid ﬂow analy-
sis produces a small, ﬁxed size set of automatically gener-
ated bins dependent only on the timeline deﬁned by periodic
trafﬁc. The compact number of bins yeilds a parameterized
latency representation suitable for real-time estimation and
goodness-of-ﬁt tests. Simulation results show good latency
estimates under a broad range of conditions.
1. Problem Description/Motivation
Distributed control systems must support both critical
time-triggered periodic functions and (non-critical) event-
triggered aperiodic functions on common hardware. Send-
ing messages on a common data bus, scheduling tasks on
a common processor, and scheduling applications on stat-
ically deﬁned time partitions are canonical examples. To
ensure guaranteed latencies (i.e. time in queue plus service)
for closed loop periodic control functions (i.e. sensor read,
control, actuator write), scheduling techniques that produce
a ﬁxed timeline with predeﬁned blocks of time reserved for
periodic functions are used. Aperiodic processing occurs in
the sequence of timeline gaps. See Figure 1. Avionics and
automotive systems exempli...


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

Input:
title:Real-Time Estimation of Event-Driven Traffic Latency Distributions
when Layered on Static Schedules
author:Pam Binns
Real-Time Estimation of Event-Driven Trafﬁc
Latency Distributions when Layered on Static Schedules
Pam Binns
Honeywell Laboratories
Minneapolis, MN 55418
∗
Pam.Binns@honeywell.com
Abstract
Safety-critical distributed control systems must support
periodic and aperiodic functions on common hardware (e.g.
sending messages on a common data bus). Scheduling tech-
niques that produce a timeline with predeﬁned blocks for
periodic functions are used to guarantee deadlines for criti-
cal closed loop periodic control functions (i.e. sensor read,
control, actuator write). Aperiodic processing occurs in pe-
riodic timeline gaps. We develop a technique for binning
aperiodic latency sample data using a novel data repre-
sentation called latency band graphs. A ﬂuid ﬂow analy-
sis produces a small, ﬁxed size set of automatically gener-
ated bins dependent only on the timeline deﬁned by periodic
trafﬁc. The compact number of bins yeilds a parameterized
latency representation suitable for real-time estimation and
goodness-of-ﬁt tests. Simulation results show good latency
estimates under a broad range of conditions.
1. Problem Description/Motivation
Distributed control systems must support both critical
time-triggered periodic functions and (non-critical) event-
triggered aperiodic functions on common hardware. Send-
ing messages on a common data bus, scheduling tasks on
a common processor, and scheduling applications on stat-
ically deﬁned time partitions are canonical examples. To
ensure guaranteed latencies (i.e. time in queue plus service)
for closed loop periodic control functions (i.e. sensor read,
control, actuator write), scheduling techniques that produce
a ﬁxed timeline with predeﬁned blocks of time reserved for
periodic functions are used. Aperiodic processing occurs in
the sequence of timeline gaps. See Figure 1. Avionics and
automotive systems exempli...

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


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

Output:
安全论文分析：

title:Application-Level Autonomic Hardware to Predict and Preempt Software
Attacks on Industrial Control Systems
author:Lee W. Lerner and
Zane R. Franklin and
William T. Baumann and
Cameron D. Patterson
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Application-level Autonomic Hardware to Predict and Preempt Software Attacks on
Industrial Control Systems
Lee W. Lerner, Zane R. Franklin, William T. Baumann, and Cameron D. Patterson
Bradley Department of Electrical and Computer Engineering
Virginia Tech
Blacksburg, VA 24061 U.S.A.
Email: {lwl, zanef, baumann, cdp}@vt.edu
Abstract—We mitigate malicious software threats to indus-
trial control systems, not by bolstering perimeter security, but
rather by using application-speciﬁc conﬁgurable hardware to
monitor and possibly override software operations in real time
at the lowest (I/O pin) level of a system-on-chip platform
containing a microcontroller augmented with conﬁgurable
logic. The process speciﬁcations, stability-preserving backup
controller, and switchover logic are speciﬁed and formally
veriﬁed as C code commonly used in control systems, but
synthesized into hardware to resist software reconﬁguration
attacks. In addition, a copy of the production controller task is
optionally implemented in an on-chip, isolated soft processor,
connected to a model of the physical process, and accelerated
to preview what the controller will attempt to do in the
near future. This prediction provides greater assurance that
the backup controller can be invoked before the physical
process becomes unstable. Adding trusted, application-tailored,
software-invisible, autonomic hardware is well-supported in a
commercial system-on-chip platform.
Keywords-industrial
control
threats; hardware root-of-trust; formal analysis
system security;
software
I. INTRODUCTION
The dark side to an increasingly automated physical world
is the potential for large scale disruption and destruction
caused by the malicio...


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

Input:
title:Application-Level Autonomic Hardware to Predict and Preempt Software
Attacks on Industrial Control Systems
author:Lee W. Lerner and
Zane R. Franklin and
William T. Baumann and
Cameron D. Patterson
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Application-level Autonomic Hardware to Predict and Preempt Software Attacks on
Industrial Control Systems
Lee W. Lerner, Zane R. Franklin, William T. Baumann, and Cameron D. Patterson
Bradley Department of Electrical and Computer Engineering
Virginia Tech
Blacksburg, VA 24061 U.S.A.
Email: {lwl, zanef, baumann, cdp}@vt.edu
Abstract—We mitigate malicious software threats to indus-
trial control systems, not by bolstering perimeter security, but
rather by using application-speciﬁc conﬁgurable hardware to
monitor and possibly override software operations in real time
at the lowest (I/O pin) level of a system-on-chip platform
containing a microcontroller augmented with conﬁgurable
logic. The process speciﬁcations, stability-preserving backup
controller, and switchover logic are speciﬁed and formally
veriﬁed as C code commonly used in control systems, but
synthesized into hardware to resist software reconﬁguration
attacks. In addition, a copy of the production controller task is
optionally implemented in an on-chip, isolated soft processor,
connected to a model of the physical process, and accelerated
to preview what the controller will attempt to do in the
near future. This prediction provides greater assurance that
the backup controller can be invoked before the physical
process becomes unstable. Adding trusted, application-tailored,
software-invisible, autonomic hardware is well-supported in a
commercial system-on-chip platform.
Keywords-industrial
control
threats; hardware root-of-trust; formal analysis
system security;
software
I. INTRODUCTION
The dark side to an increasingly automated physical world
is the potential for large scale disruption and destruction
caused by the malicio...

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


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

Output:
安全论文分析：

title:User Discrimination through Structured Writing on PDAs
author:Rachel R. M. Roberts and
Roy A. Maxion and
Kevin S. Killourhy and
Fahd Arshad
User Discrimination Through Structured Writing on PDAs
Rachel R. M. Roberts, Roy A. Maxion, Kevin S. Killourhy, and Fahd Arshad
{rroberts, maxion, ksk, fahd}@cs.cmu.edu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
This paper explores whether features of structured
writing can serve to discriminate users of handheld de-
vices such as Palm PDAs. Biometric authentication
would obviate the need to remember a password or to
keep it secret, requiring only that a user’s manner of writ-
ing conﬁrm his or her identity. Presumably, a user’s dy-
namic and invisible writing style would be difﬁcult for an
imposter to imitate.
We show how handwritten, multi-character strings
can serve as personalized, non-secret passwords. A pro-
totype system employing support vector machine classi-
ﬁers was built to discriminate 52 users in a closed-world
scenario. On high-quality data, strings as short as four
letters achieved a false-match rate of 0.04%, at a corre-
sponding false non-match rate of 0.64%. Strings of at
least 8 to 16 letters in length delivered perfect results—a
0% equal-error rate. Very similar results were obtained
upon decreasing the data quality or upon increasing the
data quantity.
1. Introduction
Passwords are standard in computer access control,
but they can be forgotten, compromised without detec-
tion, and denied as having been used (repudiation) [14].
A proposed alternative is biometrics, or measurements of
the human body. Biological biometrics are physical traits
such as the iris, ﬁngerprint, and face; behavioral biomet-
rics are activities such as handwriting, keystrokes, and
gait. Handwriting is an alterable biometric: it changes
in response to varying conditions, e.g., text. Alterable
biometrics are suitable for challenge-response prot...


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

Input:
title:User Discrimination through Structured Writing on PDAs
author:Rachel R. M. Roberts and
Roy A. Maxion and
Kevin S. Killourhy and
Fahd Arshad
User Discrimination Through Structured Writing on PDAs
Rachel R. M. Roberts, Roy A. Maxion, Kevin S. Killourhy, and Fahd Arshad
{rroberts, maxion, ksk, fahd}@cs.cmu.edu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
This paper explores whether features of structured
writing can serve to discriminate users of handheld de-
vices such as Palm PDAs. Biometric authentication
would obviate the need to remember a password or to
keep it secret, requiring only that a user’s manner of writ-
ing conﬁrm his or her identity. Presumably, a user’s dy-
namic and invisible writing style would be difﬁcult for an
imposter to imitate.
We show how handwritten, multi-character strings
can serve as personalized, non-secret passwords. A pro-
totype system employing support vector machine classi-
ﬁers was built to discriminate 52 users in a closed-world
scenario. On high-quality data, strings as short as four
letters achieved a false-match rate of 0.04%, at a corre-
sponding false non-match rate of 0.64%. Strings of at
least 8 to 16 letters in length delivered perfect results—a
0% equal-error rate. Very similar results were obtained
upon decreasing the data quality or upon increasing the
data quantity.
1. Introduction
Passwords are standard in computer access control,
but they can be forgotten, compromised without detec-
tion, and denied as having been used (repudiation) [14].
A proposed alternative is biometrics, or measurements of
the human body. Biological biometrics are physical traits
such as the iris, ﬁngerprint, and face; behavioral biomet-
rics are activities such as handwriting, keystrokes, and
gait. Handwriting is an alterable biometric: it changes
in response to varying conditions, e.g., text. Alterable
biometrics are suitable for challenge-response prot...

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


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

Output:
安全论文分析：

title:Scalable on-demand media streaming with packet loss recovery
author:Anirban Mahanti and
Derek L. Eager and
Mary K. Vernon and
David Sundaram-Stukel
Scalable On-Demand Media Streaming
with Packet Loss Recovery ∗
Anirban Mahanti
Derek L. Eager
Mary K. Vernon
David Sundaram-Stukel
Dept. of Computer Science
University of Saskatchewan
{mahanti, eager}@cs.usask.ca
Saskatoon, SK S7N 5A9 Canada
Computer Sciences Dept.
University of Wisconsin
Madison, WI 53706-1685 USA
{vernon, sundaram}@cs.wisc.edu
ABSTRACT
Inspired by recent techniques for reliable bulk data distri-
bution, this paper develops scalable protocols for reliable
on-demand delivery of streaming media. Models are devel-
oped that quantify the best possible scalability for given
client characteristics. The results of the models are used
to guide the design and assess the performance of the pro-
posed streaming techniques. The new protocols, RPB and
RBS, are relatively simple to implement and achieve nearly
the best possible scalability and eﬃciency for a given set of
client characteristics and desirable/feasible media quality.
1.
INTRODUCTION
An important problem for a number of existing and future
Internet applications is that of delivering streaming media
on-demand, in a scalable and reliable manner, to potentially
large numbers of concurrent clients that receive the data
over lossy and possibly heterogeneous channels. This prob-
lem has been addressed eﬀectively for bulk data distribu-
tion [28, 31, 5], such as large software updates. However,
adequate solutions do not currently exist for streaming me-
dia content, as would be required in applications such as
video-on-demand.
The digital fountain [5] approach [28, 31, 5] is designed to
deliver bulk data over channels that have signiﬁcant packet
loss, including IP multicast on the Internet, satellite trans-
mission, and wireless transmission channels. The approach
uses erasure codes to construct a stream of packets, such
that a receiver can reconstruct th...


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

Input:
title:Scalable on-demand media streaming with packet loss recovery
author:Anirban Mahanti and
Derek L. Eager and
Mary K. Vernon and
David Sundaram-Stukel
Scalable On-Demand Media Streaming
with Packet Loss Recovery ∗
Anirban Mahanti
Derek L. Eager
Mary K. Vernon
David Sundaram-Stukel
Dept. of Computer Science
University of Saskatchewan
{mahanti, eager}@cs.usask.ca
Saskatoon, SK S7N 5A9 Canada
Computer Sciences Dept.
University of Wisconsin
Madison, WI 53706-1685 USA
{vernon, sundaram}@cs.wisc.edu
ABSTRACT
Inspired by recent techniques for reliable bulk data distri-
bution, this paper develops scalable protocols for reliable
on-demand delivery of streaming media. Models are devel-
oped that quantify the best possible scalability for given
client characteristics. The results of the models are used
to guide the design and assess the performance of the pro-
posed streaming techniques. The new protocols, RPB and
RBS, are relatively simple to implement and achieve nearly
the best possible scalability and eﬃciency for a given set of
client characteristics and desirable/feasible media quality.
1.
INTRODUCTION
An important problem for a number of existing and future
Internet applications is that of delivering streaming media
on-demand, in a scalable and reliable manner, to potentially
large numbers of concurrent clients that receive the data
over lossy and possibly heterogeneous channels. This prob-
lem has been addressed eﬀectively for bulk data distribu-
tion [28, 31, 5], such as large software updates. However,
adequate solutions do not currently exist for streaming me-
dia content, as would be required in applications such as
video-on-demand.
The digital fountain [5] approach [28, 31, 5] is designed to
deliver bulk data over channels that have signiﬁcant packet
loss, including IP multicast on the Internet, satellite trans-
mission, and wireless transmission channels. The approach
uses erasure codes to construct a stream of packets, such
that a receiver can reconstruct th...

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


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

Output:
安全论文分析：

title:Data Mining Methods for Detection of New Malicious Executables
author:Matthew G. Schultz and
Eleazar Eskin and
Erez Zadok and
Salvatore J. Stolfo
Data Mining Methods for Detection of New Malicious Executables
Matthew G. Schultz and Eleazar Eskin
Department of Computer Science
Columbia University
Erez Zadok
Department of Computer Science
State University of New York at Stony Brook
{mgs,eeskin}@cs.columbia.edu
ezk@cs.sunysb.edu
Salvatore J. Stolfo
Department of Computer Science
Columbia University
sal@cs.columbia.edu
Abstract
A  serious security threat today is malicious executables,
especially  neH:  unseen malicious executables often arriv-
ing as eniail attachments.  These new malicious executables
are created at the rate of thousands e v e n  year and pose a
serious  security  threat.  Current anti-virus systems attempt
to detect these new malicious programs with heuristics gen-
erated by hand. This approach is costly and oftentimes inef-
fective.  In this papec  we present a data-mining framework
that detects new, previously  unseen malicious executables
accurately and automatically.  The data-mining framework
antoniaticall?~foitrid patterns in our data set and used these
patterns  to detect a  set  of  new malicious  binaries.  Coni-
paring our detection methods with a traditional signature-
based  method, our method more  than doubles the current
detection ratesfor new malicious executables.
1  Introduction
A malicious executable is defined to be a program that per-
forms a malicious function, such as compromising a sys-
tem’s  security,  damaging  a  system  or  obtaining  sensitive
information without the user’s permission. Using data min-
ing methods, our goal is to automatically design and build
a scanner that accurately detects malicious executables be-
fore they have been given a chance to run.
Data mining methods detect patterns in  large amounts of
data,  such  as  byte  code, and  use  these  patterns to  det...


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

Input:
title:Data Mining Methods for Detection of New Malicious Executables
author:Matthew G. Schultz and
Eleazar Eskin and
Erez Zadok and
Salvatore J. Stolfo
Data Mining Methods for Detection of New Malicious Executables
Matthew G. Schultz and Eleazar Eskin
Department of Computer Science
Columbia University
Erez Zadok
Department of Computer Science
State University of New York at Stony Brook
{mgs,eeskin}@cs.columbia.edu
ezk@cs.sunysb.edu
Salvatore J. Stolfo
Department of Computer Science
Columbia University
sal@cs.columbia.edu
Abstract
A  serious security threat today is malicious executables,
especially  neH:  unseen malicious executables often arriv-
ing as eniail attachments.  These new malicious executables
are created at the rate of thousands e v e n  year and pose a
serious  security  threat.  Current anti-virus systems attempt
to detect these new malicious programs with heuristics gen-
erated by hand. This approach is costly and oftentimes inef-
fective.  In this papec  we present a data-mining framework
that detects new, previously  unseen malicious executables
accurately and automatically.  The data-mining framework
antoniaticall?~foitrid patterns in our data set and used these
patterns  to detect a  set  of  new malicious  binaries.  Coni-
paring our detection methods with a traditional signature-
based  method, our method more  than doubles the current
detection ratesfor new malicious executables.
1  Introduction
A malicious executable is defined to be a program that per-
forms a malicious function, such as compromising a sys-
tem’s  security,  damaging  a  system  or  obtaining  sensitive
information without the user’s permission. Using data min-
ing methods, our goal is to automatically design and build
a scanner that accurately detects malicious executables be-
fore they have been given a chance to run.
Data mining methods detect patterns in  large amounts of
data,  such  as  byte  code, and  use  these  patterns to  det...

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


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

Output:
安全论文分析：

title:Provenance-based Integrity Protection for Windows
author:Wai-Kit Sze and
R. Sekar
Provenance-based Integrity Protection for Windows
Wai Kit Sze and R. Sekar
Stony Brook University
Stony Brook, NY, USA
{wsze,sekar}@cs.stonybrook.edu
ABSTRACT
Existing malware defenses are primarily reactive in nature,
with defenses eﬀective only on malware that has previously
been observed. Unfortunately, we are witnessing a genera-
tion of stealthy, highly targeted exploits and malware that
these defenses are unprepared for. Thwarting such malware
requires new defenses that are, by design, secure against
unknown malware. In this paper, we present Spif, an ap-
proach that defends against malware by tracking code and
data origin, and ensuring that any process that is inﬂuenced
by code or data from untrusted sources will be prevented
from modifying important system resources, and interacting
with benign processes. Spif is designed for Windows, the
most widely deployed desktop OS, and the primary platform
targeted by malware. Spif is compatible with all recent Win-
dows versions (Windows XP to Windows 10), and supports a
wide range of feature rich, unmodiﬁed applications, including
all popular browsers, oﬃce software and media players. Spif
imposes minimal performance overheads while being able
to stop a variety of malware attacks, including Stuxnet and
the recently reported Sandworm malware. An open-source
implementation of our system is available.
1.
INTRODUCTION
The scale and sophistication of malware continues to grow
exponentially. The reactive approach embodied in malware
scanners and security patches is no match for today’s stealthy,
targeted attacks. Recognizing this fact, researchers as well as
software vendors have been developing proactive techniques
that can protect against previously unseen exploits and/or
malware attacks. These techniques can be classiﬁed into
three main categories: sandboxing, privilege separation, and
information ﬂow control.
Sandboxing techniques [...


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

Input:
title:Provenance-based Integrity Protection for Windows
author:Wai-Kit Sze and
R. Sekar
Provenance-based Integrity Protection for Windows
Wai Kit Sze and R. Sekar
Stony Brook University
Stony Brook, NY, USA
{wsze,sekar}@cs.stonybrook.edu
ABSTRACT
Existing malware defenses are primarily reactive in nature,
with defenses eﬀective only on malware that has previously
been observed. Unfortunately, we are witnessing a genera-
tion of stealthy, highly targeted exploits and malware that
these defenses are unprepared for. Thwarting such malware
requires new defenses that are, by design, secure against
unknown malware. In this paper, we present Spif, an ap-
proach that defends against malware by tracking code and
data origin, and ensuring that any process that is inﬂuenced
by code or data from untrusted sources will be prevented
from modifying important system resources, and interacting
with benign processes. Spif is designed for Windows, the
most widely deployed desktop OS, and the primary platform
targeted by malware. Spif is compatible with all recent Win-
dows versions (Windows XP to Windows 10), and supports a
wide range of feature rich, unmodiﬁed applications, including
all popular browsers, oﬃce software and media players. Spif
imposes minimal performance overheads while being able
to stop a variety of malware attacks, including Stuxnet and
the recently reported Sandworm malware. An open-source
implementation of our system is available.
1.
INTRODUCTION
The scale and sophistication of malware continues to grow
exponentially. The reactive approach embodied in malware
scanners and security patches is no match for today’s stealthy,
targeted attacks. Recognizing this fact, researchers as well as
software vendors have been developing proactive techniques
that can protect against previously unseen exploits and/or
malware attacks. These techniques can be classiﬁed into
three main categories: sandboxing, privilege separation, and
information ﬂow control.
Sandboxing techniques [...

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


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

Output:
安全论文分析：

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