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...


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

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

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


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

Output:
安全论文分析：

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


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

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

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


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

Output:
安全论文分析：

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


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

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

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


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

Output:
安全论文分析：

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


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

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

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


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

Output:
安全论文分析：

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


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

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

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


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

Output:
安全论文分析：

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


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

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

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


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

Output:
安全论文分析：

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


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

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

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


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

Output:
安全论文分析：

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


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

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

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