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

Output:
安全论文分析：

title:Cutting the electric bill for internet-scale systems
author:Asfandyar Qureshi and
Rick Weber and
Hari Balakrishnan and
John V. Guttag and
Bruce M. Maggs
Cutting the Electric Bill for Internet-Scale Systems
Asfandyar Qureshi
MIT CSAIL
asfandyar@mit.edu
Rick Weber
Akamai Technologies
riweber@akamai.com
Hari Balakrishnan
MIT CSAIL
hari@mit.edu
John Guttag
MIT CSAIL
guttag@mit.edu
Bruce Maggs
Carnegie Mellon University
bmm@cs.cmu.edu
ABSTRACT
Energy expenses are becoming an increasingly important
fraction of data center operating costs. At the same time,
the energy expense per unit of computation can vary sig-
niﬁcantly between two diﬀerent locations.
In this paper,
we characterize the variation due to ﬂuctuating electricity
prices and argue that existing distributed systems should be
able to exploit this variation for signiﬁcant economic gains.
Electricity prices exhibit both temporal and geographic vari-
ation, due to regional demand diﬀerences, transmission inef-
ﬁciencies, and generation diversity. Starting with historical
electricity prices, for twenty nine locations in the US, and
network traﬃc data collected on Akamai’s CDN, we use sim-
ulation to quantify the possible economic gains for a realistic
workload. Our results imply that existing systems may be
able to save millions of dollars a year in electricity costs, by
being cognizant of locational computation cost diﬀerences.
Categories and Subject Descriptors
C.2.4 [Computer-Communication Networks]: Distributed
Systems
General Terms
Economics, Management, Performance
1.
INTRODUCTION
With the rise of “Internet-scale” systems and “cloud com-
puting” services, there is an increasing trend toward massive,
geographically distributed systems. The largest of these are
made up of hundreds of thousands of servers and several data
centers. A large data center may require many megawatts
of electricity [1], enough to power thousands of homes.
Millions of dollars must be spent annually on the electric-
ity needed to p...


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

Input:
title:Cutting the electric bill for internet-scale systems
author:Asfandyar Qureshi and
Rick Weber and
Hari Balakrishnan and
John V. Guttag and
Bruce M. Maggs
Cutting the Electric Bill for Internet-Scale Systems
Asfandyar Qureshi
MIT CSAIL
asfandyar@mit.edu
Rick Weber
Akamai Technologies
riweber@akamai.com
Hari Balakrishnan
MIT CSAIL
hari@mit.edu
John Guttag
MIT CSAIL
guttag@mit.edu
Bruce Maggs
Carnegie Mellon University
bmm@cs.cmu.edu
ABSTRACT
Energy expenses are becoming an increasingly important
fraction of data center operating costs. At the same time,
the energy expense per unit of computation can vary sig-
niﬁcantly between two diﬀerent locations.
In this paper,
we characterize the variation due to ﬂuctuating electricity
prices and argue that existing distributed systems should be
able to exploit this variation for signiﬁcant economic gains.
Electricity prices exhibit both temporal and geographic vari-
ation, due to regional demand diﬀerences, transmission inef-
ﬁciencies, and generation diversity. Starting with historical
electricity prices, for twenty nine locations in the US, and
network traﬃc data collected on Akamai’s CDN, we use sim-
ulation to quantify the possible economic gains for a realistic
workload. Our results imply that existing systems may be
able to save millions of dollars a year in electricity costs, by
being cognizant of locational computation cost diﬀerences.
Categories and Subject Descriptors
C.2.4 [Computer-Communication Networks]: Distributed
Systems
General Terms
Economics, Management, Performance
1.
INTRODUCTION
With the rise of “Internet-scale” systems and “cloud com-
puting” services, there is an increasing trend toward massive,
geographically distributed systems. The largest of these are
made up of hundreds of thousands of servers and several data
centers. A large data center may require many megawatts
of electricity [1], enough to power thousands of homes.
Millions of dollars must be spent annually on the electric-
ity needed to p...

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


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

Output:
安全论文分析：

title:Identifying and Analyzing Pointer Misuses for Sophisticated Memory-corruption
Exploit Diagnosis
author:Mingwei Zhang and
Aravind Prakash and
Xiaolei Li and
Zhenkai Liang and
Heng Yin
Identifying and Analyzing Pointer Misuses
for Sophisticated
Memory-corruption Exploit Diagnosis
Mingwei Zhang (†)
Aravind Prakash (§)
Xiaolei Li (†)
Zhenkai Liang (†)
Heng Yin (§)
(†) School of Computing, National University of Singapore
(§) Department of Electrical Engineering and Computer
Science, Syracuse University
Simple Stack Buffer Overflow
  An attacker overwrites vulnerable function return
address, which points to shellcode on stack.
shellcode
return address
buffer
Only one step
  These single step attacks don’t work anymore thanks to:
  ASLR, DEP, NX, etc.
2
Exploiting SEH Mechanism
TIB
step 2
SEH Record
exception handler
prev
t
S
a
c
k
g
r
o
w
h
t
arguments prepared by OS
for exception handler
return address of exception
handler function
return address
security cookie
buffer
DispatcherContext
ContextRecord
EstablisherFrame
ExceptionRecord
return address
pop
pop
ret
step 1
step 3
3
Insights
  Recent attacks employ multiple steps.
  Pointer misuse is very prominent in
sophisticated attacks.
  Key steps constitute pointer misuses.
Our Goal:
Diagnosing pointer misuses in a multi-step attack.
4
Pointerscope – Attack
Diagnosis Engine
  Type System tailored to diagnose pointer
misuse.
  Eager type inference system to detect
pointer misuses.
  Provide big picture of the misuse through
key steps graph.
5
Overview
Guest
  OS
Vulnerable
Program
(Browser)
Exploit
(Malicious
Server)
Type
  Inference
Engine
Execu6on
  Monitor
(TEMU)
Execu6on
Trace
Diagnosis
  Engine
Diagnosis
Report
6
Variable And Variable Type
  A variable is a memory location or a register.
  Simple primitive variable types:
  Integer
  Control Pointer (or code pointer)
  Data Pointer
  Other. (The rest o...


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

Input:
title:Identifying and Analyzing Pointer Misuses for Sophisticated Memory-corruption
Exploit Diagnosis
author:Mingwei Zhang and
Aravind Prakash and
Xiaolei Li and
Zhenkai Liang and
Heng Yin
Identifying and Analyzing Pointer Misuses
for Sophisticated
Memory-corruption Exploit Diagnosis
Mingwei Zhang (†)
Aravind Prakash (§)
Xiaolei Li (†)
Zhenkai Liang (†)
Heng Yin (§)
(†) School of Computing, National University of Singapore
(§) Department of Electrical Engineering and Computer
Science, Syracuse University
Simple Stack Buffer Overflow
  An attacker overwrites vulnerable function return
address, which points to shellcode on stack.
shellcode
return address
buffer
Only one step
  These single step attacks don’t work anymore thanks to:
  ASLR, DEP, NX, etc.
2
Exploiting SEH Mechanism
TIB
step 2
SEH Record
exception handler
prev
t
S
a
c
k
g
r
o
w
h
t
arguments prepared by OS
for exception handler
return address of exception
handler function
return address
security cookie
buffer
DispatcherContext
ContextRecord
EstablisherFrame
ExceptionRecord
return address
pop
pop
ret
step 1
step 3
3
Insights
  Recent attacks employ multiple steps.
  Pointer misuse is very prominent in
sophisticated attacks.
  Key steps constitute pointer misuses.
Our Goal:
Diagnosing pointer misuses in a multi-step attack.
4
Pointerscope – Attack
Diagnosis Engine
  Type System tailored to diagnose pointer
misuse.
  Eager type inference system to detect
pointer misuses.
  Provide big picture of the misuse through
key steps graph.
5
Overview
Guest
  OS
Vulnerable
Program
(Browser)
Exploit
(Malicious
Server)
Type
  Inference
Engine
Execu6on
  Monitor
(TEMU)
Execu6on
Trace
Diagnosis
  Engine
Diagnosis
Report
6
Variable And Variable Type
  A variable is a memory location or a register.
  Simple primitive variable types:
  Integer
  Control Pointer (or code pointer)
  Data Pointer
  Other. (The rest o...

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


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

Output:
安全论文分析：

title:Breaking LTE on Layer Two
author:David Rupprecht and
Katharina Kohls and
Thorsten Holz and
Christina P"opper
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
Breaking LTE on Layer Two
David Rupprecht
Katharina Kohls
Thorsten Holz
Christina P¨opper
Ruhr-University Bochum
david.rupprecht@rub.de
Ruhr-University Bochum
katharina.kohls@rub.de
Ruhr-University Bochum
New York University Abu Dhabi
thorsten.holz@rub.de
christina.poepper@nyu.edu
Abstract—Long Term Evolution (LTE) is the latest mobile
communication standard and has a pivotal role in our infor-
mation society: LTE combines performance goals with modern
security mechanisms and serves casual use cases as well as critical
infrastructure and public safety communications. Both scenarios
are demanding towards a resilient and secure speciﬁcation and
implementation of LTE, as outages and open attack vectors
potentially lead to severe risks. Previous work on LTE protocol
security identiﬁed crucial attack vectors for both the physical
(layer one) and network (layer three) layers. Data link layer
(layer two) protocols, however, remain a blind spot in existing
LTE security research.
In this paper, we present a comprehensive layer two security
analysis and identify three attack vectors. These attacks impair
the conﬁdentiality and/or privacy of LTE communication. More
speciﬁcally, we ﬁrst present a passive identity mapping attack
that matches volatile radio identities to longer lasting network
identities, enabling us to identify users within a cell and serving
as a stepping stone for follow-up attacks. Second, we demonstrate
how a passive attacker can abuse the resource allocation as
a side channel to perform website ﬁngerprintin...


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

Input:
title:Breaking LTE on Layer Two
author:David Rupprecht and
Katharina Kohls and
Thorsten Holz and
Christina P"opper
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
Breaking LTE on Layer Two
David Rupprecht
Katharina Kohls
Thorsten Holz
Christina P¨opper
Ruhr-University Bochum
david.rupprecht@rub.de
Ruhr-University Bochum
katharina.kohls@rub.de
Ruhr-University Bochum
New York University Abu Dhabi
thorsten.holz@rub.de
christina.poepper@nyu.edu
Abstract—Long Term Evolution (LTE) is the latest mobile
communication standard and has a pivotal role in our infor-
mation society: LTE combines performance goals with modern
security mechanisms and serves casual use cases as well as critical
infrastructure and public safety communications. Both scenarios
are demanding towards a resilient and secure speciﬁcation and
implementation of LTE, as outages and open attack vectors
potentially lead to severe risks. Previous work on LTE protocol
security identiﬁed crucial attack vectors for both the physical
(layer one) and network (layer three) layers. Data link layer
(layer two) protocols, however, remain a blind spot in existing
LTE security research.
In this paper, we present a comprehensive layer two security
analysis and identify three attack vectors. These attacks impair
the conﬁdentiality and/or privacy of LTE communication. More
speciﬁcally, we ﬁrst present a passive identity mapping attack
that matches volatile radio identities to longer lasting network
identities, enabling us to identify users within a cell and serving
as a stepping stone for follow-up attacks. Second, we demonstrate
how a passive attacker can abuse the resource allocation as
a side channel to perform website ﬁngerprintin...

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


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

Output:
安全论文分析：

title:Processing Dangerous Paths - On Security and Privacy of the Portable
Document Format
author:Jens M"uller and
Dominik Noss and
Christian Mainka and
Vladislav Mladenov and
J"org Schwenk
Processing Dangerous Paths
– On Security and Privacy of the Portable Document Format
Jens Müller
Dominik Noss
Ruhr University Bochum
jens.a.mueller@rub.de
Ruhr University Bochum
dominik.noss@rub.de
Christian Mainka
Ruhr University Bochum
christian.mainka@rub.de
Vladislav Mladenov
Ruhr University Bochum
vladislav.mladenov@rub.de
Jörg Schwenk
Ruhr University Bochum
joerg.schwenk@rub.de
Abstract—PDF is the de-facto standard for document ex-
change. It is common to open PDF ﬁles from potentially untrusted
sources such as email attachments or downloaded from the
Internet. In this work, we perform an in-depth analysis of the
capabilities of malicious PDF documents. Instead of focusing on
implementation bugs, we abuse legitimate features of the PDF
standard itself by systematically identifying dangerous paths in
the PDF ﬁle structure. These dangerous paths lead to attacks
that we categorize into four generic classes:
(1) Denial-of-
Service attacks affecting the host that processes the document.
(2) Information disclosure attacks leaking personal data out of the
victim’s computer. (3) Data manipulation on the victim’s system.
(4) Code execution on the victim’s machine. An evaluation of 28
popular PDF processing applications shows that 26 of them are
vulnerable at least one attack. Finally, we propose a methodology
to protect against attacks based on PDF features systematically.
I.
INTRODUCTION
The Portable Document Format (PDF) is arguably the most
widely used data format for ofﬁce document exchange. While
the total number of PDF ﬁles is impossible to guess, Adobe
announced that 250 billion documents have been opened
by Adobe products in 2018 [59]. Being true or not, PDF
documents are heavily used in business to business as well
as consumer use cases. Exchanging, creating, and ...


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

Input:
title:Processing Dangerous Paths - On Security and Privacy of the Portable
Document Format
author:Jens M"uller and
Dominik Noss and
Christian Mainka and
Vladislav Mladenov and
J"org Schwenk
Processing Dangerous Paths
– On Security and Privacy of the Portable Document Format
Jens Müller
Dominik Noss
Ruhr University Bochum
jens.a.mueller@rub.de
Ruhr University Bochum
dominik.noss@rub.de
Christian Mainka
Ruhr University Bochum
christian.mainka@rub.de
Vladislav Mladenov
Ruhr University Bochum
vladislav.mladenov@rub.de
Jörg Schwenk
Ruhr University Bochum
joerg.schwenk@rub.de
Abstract—PDF is the de-facto standard for document ex-
change. It is common to open PDF ﬁles from potentially untrusted
sources such as email attachments or downloaded from the
Internet. In this work, we perform an in-depth analysis of the
capabilities of malicious PDF documents. Instead of focusing on
implementation bugs, we abuse legitimate features of the PDF
standard itself by systematically identifying dangerous paths in
the PDF ﬁle structure. These dangerous paths lead to attacks
that we categorize into four generic classes:
(1) Denial-of-
Service attacks affecting the host that processes the document.
(2) Information disclosure attacks leaking personal data out of the
victim’s computer. (3) Data manipulation on the victim’s system.
(4) Code execution on the victim’s machine. An evaluation of 28
popular PDF processing applications shows that 26 of them are
vulnerable at least one attack. Finally, we propose a methodology
to protect against attacks based on PDF features systematically.
I.
INTRODUCTION
The Portable Document Format (PDF) is arguably the most
widely used data format for ofﬁce document exchange. While
the total number of PDF ﬁles is impossible to guess, Adobe
announced that 250 billion documents have been opened
by Adobe products in 2018 [59]. Being true or not, PDF
documents are heavily used in business to business as well
as consumer use cases. Exchanging, creating, and ...

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


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

Output:
安全论文分析：

title:Tracking Probabilistic Correlation of Monitoring Data for Fault Detection
in Complex Systems
author:Zhen Guo and
Guofei Jiang and
Haifeng Chen and
Kenji Yoshihira
Tracking Probabilistic Correlation of
Monitoring Data for Fault Detection in Complex Systems
Zhen Guo*
Guofei Jiang, Haifeng Chen, Kenji Yoshihira
Robust and Secure System Group
NEC Laboratories America
 Princeton, NJ 08540
Email: {gfj,haifeng,kenji}@nec-labs.com
systems,  databases,  servers  and networking  devices,  a
single fault could cause the whole service down. While
building  a  fault-free  system  of  such  complexity  is
unrealistic,  it  is  very  desirable  to  have  effective  fault
detection and  isolation methods  in  operational  system
management.  Studies  [1]  have  shown  that  the  time
taken to detect and isolate faults is a major contributor
to  mean  time  to  repair  (MTTR),  defined  to  be  the
average amount of time required to resolve problems.
For  example,  on  November  1,  2005,  trading  on  the
Tokyo stock market was suspended for four hours after
its  IT  systems  failed.  Therefore,  effective  fault
detection  and  isolation  is  critical  for  improving  the
reliability and availability of mission critical systems.
is  often  scattered
Meanwhile, large amount of monitoring data can be
collected  from  distributed  systems  for  fault  analysis
such  as  software  log  files,  system  audit  events  and
network  traffic  statistics.  In  fact  this  monitoring  data
can be regarded as the observables of the internal states
of  dynamic  systems.  However,  given  the  distributed
nature  of  complex  information  systems,  evidence  of
fault  occurrence
in  various
monitoring  data  collected  across  distributed  systems
and observation time. Therefore, one challenge is how
to  correlate  the  monitoring  data  effectively  for  fault
analysis.  Internet  services  have  large  number  of  user
requests  everyday  and  much ...


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

Input:
title:Tracking Probabilistic Correlation of Monitoring Data for Fault Detection
in Complex Systems
author:Zhen Guo and
Guofei Jiang and
Haifeng Chen and
Kenji Yoshihira
Tracking Probabilistic Correlation of
Monitoring Data for Fault Detection in Complex Systems
Zhen Guo*
Guofei Jiang, Haifeng Chen, Kenji Yoshihira
Robust and Secure System Group
NEC Laboratories America
 Princeton, NJ 08540
Email: {gfj,haifeng,kenji}@nec-labs.com
systems,  databases,  servers  and networking  devices,  a
single fault could cause the whole service down. While
building  a  fault-free  system  of  such  complexity  is
unrealistic,  it  is  very  desirable  to  have  effective  fault
detection and  isolation methods  in  operational  system
management.  Studies  [1]  have  shown  that  the  time
taken to detect and isolate faults is a major contributor
to  mean  time  to  repair  (MTTR),  defined  to  be  the
average amount of time required to resolve problems.
For  example,  on  November  1,  2005,  trading  on  the
Tokyo stock market was suspended for four hours after
its  IT  systems  failed.  Therefore,  effective  fault
detection  and  isolation  is  critical  for  improving  the
reliability and availability of mission critical systems.
is  often  scattered
Meanwhile, large amount of monitoring data can be
collected  from  distributed  systems  for  fault  analysis
such  as  software  log  files,  system  audit  events  and
network  traffic  statistics.  In  fact  this  monitoring  data
can be regarded as the observables of the internal states
of  dynamic  systems.  However,  given  the  distributed
nature  of  complex  information  systems,  evidence  of
fault  occurrence
in  various
monitoring  data  collected  across  distributed  systems
and observation time. Therefore, one challenge is how
to  correlate  the  monitoring  data  effectively  for  fault
analysis.  Internet  services  have  large  number  of  user
requests  everyday  and  much ...

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


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

Output:
安全论文分析：

title:High-Fidelity Modeling of Computer Network Worms
author:Kalyan S. Perumalla and
Srikanth Sundaragopalan
High-Fidelity Modeling of Computer Network Worms
Kalyan S. Perumalla
kalyan@cc.gatech.edu
            Srikanth Sundaragopalan
                 srikanth@cc.gatech.edu
College of Computing, Georgia Institute of Technology, Atlanta, Georgia
Abstract
to  capture
the  general  method  of  choice
Abstract  modeling,  such as using  epidemic models,
has  been
for
understanding  and  analyzing  the  high-level  effects  of
worms.  However, high-fidelity models, such as packet-
level  models,  are  indispensable  for  moving  beyond
aggregate  effects,
finer  nuances  and
complexities  associated  with  known  and  future  worms
in  realistic  network  environments.    Here,  we  first
identify  the  spectrum  of  available  alternatives  for
worm  modeling,  and  classify  them  according  to  their
scalability  and  fidelity.    Among  them,  we  focus  on
three  high-fidelity  methods  for  modeling  worms,  and
study  their  effectiveness  with  respect  to  scalability.
Employing  these  methods,  we  are  then  able  to,
respectively,  achieve  some  of  the  largest  packet-level
simulations  of  worm  models  to  date;  implant  and
attack  actual  worm  monitoring/defense  installations
inside
identify  a
that
workaround
fundamentally  constrains  worm  modeling  at
the
highest fidelity levels.
large  simulated  networks;  and
requirement
real-time
for
1
Introduction
Abstract  models  such  as  epidemic  models  have  so
far  been  the  general  means  of  choice  for  modeling
worm  propagation.    However,  such  models  possess
limitations due to their many simplifying assumptions.
They  are  useful  for  certain  studies,  such  as  post
mortem  analysis,  but  otherwise  poor  in  versatility.
This
to
accommodate complex scenarios, such as sophisticated
worms,  elaborate  defense  mechanisms,  rich  netwo...


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

Input:
title:High-Fidelity Modeling of Computer Network Worms
author:Kalyan S. Perumalla and
Srikanth Sundaragopalan
High-Fidelity Modeling of Computer Network Worms
Kalyan S. Perumalla
kalyan@cc.gatech.edu
            Srikanth Sundaragopalan
                 srikanth@cc.gatech.edu
College of Computing, Georgia Institute of Technology, Atlanta, Georgia
Abstract
to  capture
the  general  method  of  choice
Abstract  modeling,  such as using  epidemic models,
has  been
for
understanding  and  analyzing  the  high-level  effects  of
worms.  However, high-fidelity models, such as packet-
level  models,  are  indispensable  for  moving  beyond
aggregate  effects,
finer  nuances  and
complexities  associated  with  known  and  future  worms
in  realistic  network  environments.    Here,  we  first
identify  the  spectrum  of  available  alternatives  for
worm  modeling,  and  classify  them  according  to  their
scalability  and  fidelity.    Among  them,  we  focus  on
three  high-fidelity  methods  for  modeling  worms,  and
study  their  effectiveness  with  respect  to  scalability.
Employing  these  methods,  we  are  then  able  to,
respectively,  achieve  some  of  the  largest  packet-level
simulations  of  worm  models  to  date;  implant  and
attack  actual  worm  monitoring/defense  installations
inside
identify  a
that
workaround
fundamentally  constrains  worm  modeling  at
the
highest fidelity levels.
large  simulated  networks;  and
requirement
real-time
for
1
Introduction
Abstract  models  such  as  epidemic  models  have  so
far  been  the  general  means  of  choice  for  modeling
worm  propagation.    However,  such  models  possess
limitations due to their many simplifying assumptions.
They  are  useful  for  certain  studies,  such  as  post
mortem  analysis,  but  otherwise  poor  in  versatility.
This
to
accommodate complex scenarios, such as sophisticated
worms,  elaborate  defense  mechanisms,  rich  netwo...

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


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

Output:
安全论文分析：

title:Inherent PUFs and secure PRNGs on commercial off-the-shelf microcontrollers
author:Anthony Van Herrewege and
Andr'e Schaller and
Stefan Katzenbeisser and
Ingrid Verbauwhede
Demo: Inherent PUFs and Secure PRNGs on
Commercial Off-the-Shelf Microcontrollers
Anthony Van Herrewege
KU Leuven
Heverlee, Belgium
anthony.vanherrewege@
esat.kuleuven.be
Stefan Katzenbeisser
TU Darmstadt
Darmstadt, Germany
katzenbeisser@seceng.
informatik.tu-
darmstadt.de
André Schaller
TU Darmstadt
Darmstadt, Germany
schaller@seceng.
informatik.tu-
darmstadt.de
Ingrid Verbauwhede
KU Leuven
Heverlee, Belgium
ingrid.verbauwhede@
esat.kuleuven.be
ABSTRACT
Research on Physically Unclonable Functions (PUFs) has
become very popular in recent years. However, all PUFs
researched so far require either ASICs, FPGAs or a micro-
controller with external components. Our research focuses
on identifying PUFs in commercial oﬀ-the-shelf devices, e.g.
microcontrollers. We show that PUFs exist in several oﬀ-the-
shelf products, which can be used for security applications.
We present measurement results on the PUF behavior
of ﬁve of the most popular microcontrollers today: ARM
Cortex-A, ARM Cortex-M, Atmel AVR, Microchip PIC16 and
Texas Instruments MSP430. Based on these measurements,
we can calculate whether these chips can be considered for
applications requiring strong cryptography.
As a result of these ﬁndings, we present a secure bootloader
for the ARM Cortex-A9 platform based on a PUF inherent to
the device, requiring no external components. Furthermore,
instead of discarding the randomness in PUF responses, we
utilize this to create strong seeds for pseudo-random number
generators (PRNGs). The existence of a secure RNG is at
the heart of virtually every cryptographic protocol, yet very
often overlooked. We present the implementation of a strongly
seeded PRNG for the ARM Cortex-M family, again requiring
no external components.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security ...


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

Input:
title:Inherent PUFs and secure PRNGs on commercial off-the-shelf microcontrollers
author:Anthony Van Herrewege and
Andr'e Schaller and
Stefan Katzenbeisser and
Ingrid Verbauwhede
Demo: Inherent PUFs and Secure PRNGs on
Commercial Off-the-Shelf Microcontrollers
Anthony Van Herrewege
KU Leuven
Heverlee, Belgium
anthony.vanherrewege@
esat.kuleuven.be
Stefan Katzenbeisser
TU Darmstadt
Darmstadt, Germany
katzenbeisser@seceng.
informatik.tu-
darmstadt.de
André Schaller
TU Darmstadt
Darmstadt, Germany
schaller@seceng.
informatik.tu-
darmstadt.de
Ingrid Verbauwhede
KU Leuven
Heverlee, Belgium
ingrid.verbauwhede@
esat.kuleuven.be
ABSTRACT
Research on Physically Unclonable Functions (PUFs) has
become very popular in recent years. However, all PUFs
researched so far require either ASICs, FPGAs or a micro-
controller with external components. Our research focuses
on identifying PUFs in commercial oﬀ-the-shelf devices, e.g.
microcontrollers. We show that PUFs exist in several oﬀ-the-
shelf products, which can be used for security applications.
We present measurement results on the PUF behavior
of ﬁve of the most popular microcontrollers today: ARM
Cortex-A, ARM Cortex-M, Atmel AVR, Microchip PIC16 and
Texas Instruments MSP430. Based on these measurements,
we can calculate whether these chips can be considered for
applications requiring strong cryptography.
As a result of these ﬁndings, we present a secure bootloader
for the ARM Cortex-A9 platform based on a PUF inherent to
the device, requiring no external components. Furthermore,
instead of discarding the randomness in PUF responses, we
utilize this to create strong seeds for pseudo-random number
generators (PRNGs). The existence of a secure RNG is at
the heart of virtually every cryptographic protocol, yet very
often overlooked. We present the implementation of a strongly
seeded PRNG for the ARM Cortex-M family, again requiring
no external components.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security ...

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


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

Output:
安全论文分析：

title:ROPMEMU: A Framework for the Analysis of Complex Code-Reuse Attacks
author:Mariano Graziano and
Davide Balzarotti and
Alain Zidouemba
ROPMEMU: A Framework for the
Analysis of Complex Code-Reuse Attacks
Mariano Graziano
Cisco Systems, Inc.
Davide Balzarotti
Eurecom
Alain Zidouemba
Cisco Systems, Inc.
ABSTRACT
Code reuse attacks based on return oriented programming
(ROP) are becoming more and more prevalent every year.
They started as a way to circumvent operating systems
protections against injected code, but they are now also
used as a technique to keep the malicious code hidden from
detection and analysis systems. This means that while in
the past ROP chains were short and simple (and therefore
did not require any dedicated tool for their analysis), we
recently started to observe very complex algorithms – such
as a complete rootkit – implemented entirely as a sequence
of ROP gadgets.
In this paper, we present a set of techniques to analyze
complex code reuse attacks. First, we identify and dis-
cuss the main challenges that complicate the reverse engi-
neer of code implemented using ROP. Second, we propose
an emulation-based framework to dissect, reconstruct, and
simplify ROP chains. Finally, we test our tool on the most
complex example available to date: a ROP rootkit contain-
ing four separate chains, two of them dynamically gener-
ated at runtime.
1.
INTRODUCTION
Memory analysis and memory forensics are active re-
search ﬁelds that have rapidly evolved over the past decade
and they are now a popular, complementary approach to
support modern malware analysis and inspect potentially
compromised machines. The main focus on memory foren-
sics (from a malicious code perspective) is to ﬁnd intrusion
evidences in the physical memory. Commonly, these evi-
dences involve artifacts that has been created or injected in
memory by malicious components. Volatility plugins like
psxview and malfind are good example of tools that per-
form this task. Unfortunately, the cur...


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

Input:
title:ROPMEMU: A Framework for the Analysis of Complex Code-Reuse Attacks
author:Mariano Graziano and
Davide Balzarotti and
Alain Zidouemba
ROPMEMU: A Framework for the
Analysis of Complex Code-Reuse Attacks
Mariano Graziano
Cisco Systems, Inc.
Davide Balzarotti
Eurecom
Alain Zidouemba
Cisco Systems, Inc.
ABSTRACT
Code reuse attacks based on return oriented programming
(ROP) are becoming more and more prevalent every year.
They started as a way to circumvent operating systems
protections against injected code, but they are now also
used as a technique to keep the malicious code hidden from
detection and analysis systems. This means that while in
the past ROP chains were short and simple (and therefore
did not require any dedicated tool for their analysis), we
recently started to observe very complex algorithms – such
as a complete rootkit – implemented entirely as a sequence
of ROP gadgets.
In this paper, we present a set of techniques to analyze
complex code reuse attacks. First, we identify and dis-
cuss the main challenges that complicate the reverse engi-
neer of code implemented using ROP. Second, we propose
an emulation-based framework to dissect, reconstruct, and
simplify ROP chains. Finally, we test our tool on the most
complex example available to date: a ROP rootkit contain-
ing four separate chains, two of them dynamically gener-
ated at runtime.
1.
INTRODUCTION
Memory analysis and memory forensics are active re-
search ﬁelds that have rapidly evolved over the past decade
and they are now a popular, complementary approach to
support modern malware analysis and inspect potentially
compromised machines. The main focus on memory foren-
sics (from a malicious code perspective) is to ﬁnd intrusion
evidences in the physical memory. Commonly, these evi-
dences involve artifacts that has been created or injected in
memory by malicious components. Volatility plugins like
psxview and malfind are good example of tools that per-
form this task. Unfortunately, the cur...

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


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

Output:
安全论文分析：

title:Dependable and Secure Data Storage and Retrieval in Mobile, Wireless
Networks
author:Stefano Chessa and
Piero Maestrini
Dependable and Secure Data Storage and Retrieval
in Mobile, Wireless Networks
S. Chessa and P. Maestrini
Dipartimento di Informatica, Università di Pisa,
via Buonarroti 2, 56127 Pisa, Italy
and
Istituto di Scienza e Tecnologie dell’Informazione “A. Faedo”,
Area della Ricerca CNR, via Moruzzi 1, 56124 Pisa, Italy.
e-mail: {chessa, maestrini}@iei.pi.cnr.it
Abstract.
This  paper  introduces  a  distributed  data  storage  for
mobile,  wireless  networks  based  on  a  peer-to-peer
paradigm.  The  distributed  storage  provides  support  to
create  and  share  files  under  a  write-once  model,  and
ensures  at  the  same  time  data  confidentiality  and
dependability  by  encoding  files  in  a  Redundant  Residue
Number  System.  More  specifically  files  are  partitioned
into  records  and  each  record  in  encoded  separately  as
(h+r)-tuples  of  data  residues  using  h+r  moduli.  In  turn,
the  residues  are  distributed  among  the  mobiles  in  the
network.  Dependability  is  ensured  since  data  can  be
reconstructed  in  the  presence  of  up  to  s≤r  residue
erasures, combined  with up to  (cid:172)
  corrupted residues,
and  data  confidentiality  is  ensured  since  recovering  the
original information requires knowledge of the entire set
of moduli.
sr−
(cid:188)2
1.
Introduction
Mobile,  wireless  ad  hoc  networks  [1]  are  best  suited
for application in environments where wired networks or
base stations to support mobile terminals are unavailable
or  unfeasible.  Examples  of  such  applications  are
communication
in  remote  or  hostile  environments,
management  of  emergencies,  disaster  recovery,  and  ad-
hoc  commercial  installations.  Ad  hoc  networks  are
generally an heterogeneous mix of different wireless and
mobile  devices,  ranging  from  little  hand-held  device...


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

Input:
title:Dependable and Secure Data Storage and Retrieval in Mobile, Wireless
Networks
author:Stefano Chessa and
Piero Maestrini
Dependable and Secure Data Storage and Retrieval
in Mobile, Wireless Networks
S. Chessa and P. Maestrini
Dipartimento di Informatica, Università di Pisa,
via Buonarroti 2, 56127 Pisa, Italy
and
Istituto di Scienza e Tecnologie dell’Informazione “A. Faedo”,
Area della Ricerca CNR, via Moruzzi 1, 56124 Pisa, Italy.
e-mail: {chessa, maestrini}@iei.pi.cnr.it
Abstract.
This  paper  introduces  a  distributed  data  storage  for
mobile,  wireless  networks  based  on  a  peer-to-peer
paradigm.  The  distributed  storage  provides  support  to
create  and  share  files  under  a  write-once  model,  and
ensures  at  the  same  time  data  confidentiality  and
dependability  by  encoding  files  in  a  Redundant  Residue
Number  System.  More  specifically  files  are  partitioned
into  records  and  each  record  in  encoded  separately  as
(h+r)-tuples  of  data  residues  using  h+r  moduli.  In  turn,
the  residues  are  distributed  among  the  mobiles  in  the
network.  Dependability  is  ensured  since  data  can  be
reconstructed  in  the  presence  of  up  to  s≤r  residue
erasures, combined  with up to  (cid:172)
  corrupted residues,
and  data  confidentiality  is  ensured  since  recovering  the
original information requires knowledge of the entire set
of moduli.
sr−
(cid:188)2
1.
Introduction
Mobile,  wireless  ad  hoc  networks  [1]  are  best  suited
for application in environments where wired networks or
base stations to support mobile terminals are unavailable
or  unfeasible.  Examples  of  such  applications  are
communication
in  remote  or  hostile  environments,
management  of  emergencies,  disaster  recovery,  and  ad-
hoc  commercial  installations.  Ad  hoc  networks  are
generally an heterogeneous mix of different wireless and
mobile  devices,  ranging  from  little  hand-held  device...

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


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

Output:
安全论文分析：

title:Protecting Privacy of BLE Device Users
author:Kassem Fawaz and
Kyu-Han Kim and
Kang G. Shin
Protecting Privacy of BLE Device Users
Kassem Fawaz, University of Michigan; Kyu-Han Kim, Hewlett Packard Labs;
Kang G. Shin, University of Michigan
 https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/fawaz
This paper is included in the Proceedings of the 25th USENIX Security SymposiumAugust 10–12, 2016 • Austin, TXISBN 978-1-931971-32-4Open access to the Proceedings of the 25th USENIX Security Symposium is sponsored by USENIX Protecting Privacy of BLE Device Users
Kassem Fawaz∗ Kyu-Han Kim† Kang G. Shin∗
†Hewlett Packard Labs
∗The University of Michigan
Abstract
Bluetooth Low Energy (BLE) has emerged as an attrac-
tive technology to enable Internet of Things (IoTs) to
interact with others in their vicinity. Our study of the
behavior of more than 200 types of BLE-equipped de-
vices has led to a surprising discovery: the BLE proto-
col, despite its privacy provisions, fails to address the
most basic threat of all—hiding the device’s presence
from curious adversaries. Revealing the device’s exis-
tence is the stepping stone toward more serious threats
that include user proﬁling/ﬁngerprinting, behavior track-
ing, inference of sensitive information, and exploitation
of known vulnerabilities on the device. With thousands
of manufacturers and developers around the world, it is
very challenging, if not impossible, to envision the vi-
ability of any privacy or security solution that requires
changes to the devices or the BLE protocol.
In this paper, we propose a new device-agnostic sys-
tem, called BLE-Guardian, that protects the privacy of
the users/environments equipped with BLE devices/IoTs.
It enables the users and administrators to control those
who discover, scan and connect to their devices. We have
implemented BLE-Guardian using Ubertooth One, an
off-the-shelf open Bluetooth development platform, fa-
cilitating its broad deployment. O...


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

Input:
title:Protecting Privacy of BLE Device Users
author:Kassem Fawaz and
Kyu-Han Kim and
Kang G. Shin
Protecting Privacy of BLE Device Users
Kassem Fawaz, University of Michigan; Kyu-Han Kim, Hewlett Packard Labs;
Kang G. Shin, University of Michigan
 https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/fawaz
This paper is included in the Proceedings of the 25th USENIX Security SymposiumAugust 10–12, 2016 • Austin, TXISBN 978-1-931971-32-4Open access to the Proceedings of the 25th USENIX Security Symposium is sponsored by USENIX Protecting Privacy of BLE Device Users
Kassem Fawaz∗ Kyu-Han Kim† Kang G. Shin∗
†Hewlett Packard Labs
∗The University of Michigan
Abstract
Bluetooth Low Energy (BLE) has emerged as an attrac-
tive technology to enable Internet of Things (IoTs) to
interact with others in their vicinity. Our study of the
behavior of more than 200 types of BLE-equipped de-
vices has led to a surprising discovery: the BLE proto-
col, despite its privacy provisions, fails to address the
most basic threat of all—hiding the device’s presence
from curious adversaries. Revealing the device’s exis-
tence is the stepping stone toward more serious threats
that include user proﬁling/ﬁngerprinting, behavior track-
ing, inference of sensitive information, and exploitation
of known vulnerabilities on the device. With thousands
of manufacturers and developers around the world, it is
very challenging, if not impossible, to envision the vi-
ability of any privacy or security solution that requires
changes to the devices or the BLE protocol.
In this paper, we propose a new device-agnostic sys-
tem, called BLE-Guardian, that protects the privacy of
the users/environments equipped with BLE devices/IoTs.
It enables the users and administrators to control those
who discover, scan and connect to their devices. We have
implemented BLE-Guardian using Ubertooth One, an
off-the-shelf open Bluetooth development platform, fa-
cilitating its broad deployment. O...

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


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

Output:
安全论文分析：

title:Dominance as a New Trusted Computing Primitive for the Internet of
Things
author:Meng Xu and
Manuel Huber and
Zhichuang Sun and
Paul England and
Marcus Peinado and
Sangho Lee and
Andrey Marochko and
Dennis Mattoon and
Rob Spiger and
Stefan Thom
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
Dominance as a New Trusted Computing Primitive
for the Internet of Things
∗†
, Manuel Huber
Meng Xu
¶
, Andrey Marochko
Sangho Lee
‡†
¶
, Zhichuang Sun
, Dennis Mattoon
§†
¶
¶
, Paul England
, Rob Spiger
¶
Northeastern University
¶
, Marcus Peinado
,
(cid:3)
(cid:3)
and Stefan Thom
∗
Georgia Institute of Technology
‡
Fraunhofer AISEC
§
Abstract—The Internet of Things (IoT) is rapidly emerging
as one of the dominant computing paradigms of this decade.
Applications range from in-home entertainment to large-scale
industrial deployments such as controlling assembly lines and
monitoring trafﬁc. While IoT devices are in many respects
similar to traditional computers, user expectations and deploy-
ment scenarios as well as cost and hardware constraints are
sufﬁciently different to create new security challenges as well
as new opportunities. This is especially true for large-scale IoT
deployments in which a central entity deploys and controls a
large number of IoT devices with minimal human interaction.
Like traditional computers, IoT devices are subject to attack
and compromise. Large IoT deployments consisting of many
nearly identical devices are especially attractive targets. At the
same time, recovery from root compromise by conventional
means becomes costly and slow, even more so if the devices
are dispersed over a large geographical area. In the worst case,
technicians have to travel to al...


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

Input:
title:Dominance as a New Trusted Computing Primitive for the Internet of
Things
author:Meng Xu and
Manuel Huber and
Zhichuang Sun and
Paul England and
Marcus Peinado and
Sangho Lee and
Andrey Marochko and
Dennis Mattoon and
Rob Spiger and
Stefan Thom
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
Dominance as a New Trusted Computing Primitive
for the Internet of Things
∗†
, Manuel Huber
Meng Xu
¶
, Andrey Marochko
Sangho Lee
‡†
¶
, Zhichuang Sun
, Dennis Mattoon
§†
¶
¶
, Paul England
, Rob Spiger
¶
Northeastern University
¶
, Marcus Peinado
,
(cid:3)
(cid:3)
and Stefan Thom
∗
Georgia Institute of Technology
‡
Fraunhofer AISEC
§
Abstract—The Internet of Things (IoT) is rapidly emerging
as one of the dominant computing paradigms of this decade.
Applications range from in-home entertainment to large-scale
industrial deployments such as controlling assembly lines and
monitoring trafﬁc. While IoT devices are in many respects
similar to traditional computers, user expectations and deploy-
ment scenarios as well as cost and hardware constraints are
sufﬁciently different to create new security challenges as well
as new opportunities. This is especially true for large-scale IoT
deployments in which a central entity deploys and controls a
large number of IoT devices with minimal human interaction.
Like traditional computers, IoT devices are subject to attack
and compromise. Large IoT deployments consisting of many
nearly identical devices are especially attractive targets. At the
same time, recovery from root compromise by conventional
means becomes costly and slow, even more so if the devices
are dispersed over a large geographical area. In the worst case,
technicians have to travel to al...

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


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

Output:
安全论文分析：

title:A Dependable System Architecture for Safety-Critical Respiratory-Gated
Radiation Therapy
author:Gregory C. Sharp and
Nagarajan Kandasamy
A Dependable System Architecture for Safety-Critical
Respiratory-Gated Radiation Therapy
Gregory Sharp
Nagarajan Kandasamy
Department of Radiation Oncology
Electrical and Computer Eng. Department
Massachusetts General Hospital
Boston, MA 02114, USA
Drexel University
Philadelphia PA 19104, USA
Abstract
This experience report describes the design and im-
plementation of safety-critical software and hardware
for respiratory gating of a medical linear accelerator.
Respiratory gating refers to a radiotherapy technique
for treating cancer in the lung, liver, and abdomen,
where tumors move while a patient breathes. A com-
puter software program tracks the position of the tumor
within the human body using x-ray ﬂuoroscopy. When
the tumor is in the correct position, the linear acceler-
ator is triggered, delivering a beam of radiation toward
the target. As part of the gating system, a comprehen-
sive strategy for safety has been developed. This paper
describes these safety features, focusing on the online
monitoring techniques used to conﬁrm the proper oper-
ation of the ﬂuoroscopic imaging panels and the pattern
recognition algorithms used for tumor identiﬁcation.
1 Introduction
Radiation therapy plays an important role in the
management and treatment of cancer. The primary
treatment goal is to deliver a lethal dose of radiation
to the tumor cells, while minimizing the radiation dose
to surrounding healthy tissues and critical structures.
Modern radiation therapy equipment and procedures
can deliver radiation to regions deep within the human
body with high precision. However, radiation treat-
ment quality is degraded for tumors in the lungs and
abdomen that move during treatment. As a patient
inhales and exhales, the position of a tumor can move
up to 3 or 4 cm [5]. This motion causes a problem
for treatments because the tumor must b...


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

Input:
title:A Dependable System Architecture for Safety-Critical Respiratory-Gated
Radiation Therapy
author:Gregory C. Sharp and
Nagarajan Kandasamy
A Dependable System Architecture for Safety-Critical
Respiratory-Gated Radiation Therapy
Gregory Sharp
Nagarajan Kandasamy
Department of Radiation Oncology
Electrical and Computer Eng. Department
Massachusetts General Hospital
Boston, MA 02114, USA
Drexel University
Philadelphia PA 19104, USA
Abstract
This experience report describes the design and im-
plementation of safety-critical software and hardware
for respiratory gating of a medical linear accelerator.
Respiratory gating refers to a radiotherapy technique
for treating cancer in the lung, liver, and abdomen,
where tumors move while a patient breathes. A com-
puter software program tracks the position of the tumor
within the human body using x-ray ﬂuoroscopy. When
the tumor is in the correct position, the linear acceler-
ator is triggered, delivering a beam of radiation toward
the target. As part of the gating system, a comprehen-
sive strategy for safety has been developed. This paper
describes these safety features, focusing on the online
monitoring techniques used to conﬁrm the proper oper-
ation of the ﬂuoroscopic imaging panels and the pattern
recognition algorithms used for tumor identiﬁcation.
1 Introduction
Radiation therapy plays an important role in the
management and treatment of cancer. The primary
treatment goal is to deliver a lethal dose of radiation
to the tumor cells, while minimizing the radiation dose
to surrounding healthy tissues and critical structures.
Modern radiation therapy equipment and procedures
can deliver radiation to regions deep within the human
body with high precision. However, radiation treat-
ment quality is degraded for tumors in the lungs and
abdomen that move during treatment. As a patient
inhales and exhales, the position of a tumor can move
up to 3 or 4 cm [5]. This motion causes a problem
for treatments because the tumor must b...

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


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

Output:
安全论文分析：

title:Bridging the data charging gap in the cellular edge
author:Yuanjie Li and
Kyu-Han Kim and
Christina Vlachou and
Junqing Xie
Bridging the Data Charging Gap in the Cellular Edge
Yuanjie Li, Kyu-Han Kim, Christina Vlachou, Junqing Xie
Hewlett Packard Labs
Intelligent cellular edge
Ø Low-latency service anywhere, anytime
Ø Powered by 4G/5G cellular networks
Ø Active standardization and early adoption
Edge
devices
Base
stations
Core
network
Edge
servers
4G gateways
Charging data records
Charging function
Charging data records
5G gateways
Cellular edge infrastructure
Charging gap: what & why
The cellular traffic is not free!
Ø Edge app pays 4G/5G operator by data usage
Data charging gap (thus over-/under-billing):
The operator and edge app vendor may not
agree on how much data should be paid
Causes of the gap
Ø Data loss by intermittent wireless, mobility,
congestions, SLA violation, and many more.
)
s
p
b
M
(
e
t
a
R
)
B
M
(
p
a
G
)
m
B
d
(
S
S
R
 5
 2.5
 0
 10
 5
 0
-95
-110
-125
Our solution: TLC
Trusted, Loss-tolerant Charging
Let the edge app vendor and 4G/5G operator
negotiate the charging data volume
Ø Rather than today’s operator-centric charging
Ø Loss-selfishness cancellation: Game-
theoretical approach to let selfishness and
loss-induced gaps cancel out each other
Ø Proof-of-Charging (PoC) is constructed and
digitally signed for mutual trust
Three provable properties
ü Correctness: Always-bounded charging gap,
and no gap if edge and operator are rational
ü Latency friendliness: No blocking of delay-
sensitive edge traffic
ü Public verifiability: Any independent 3rd party
Bridging the Data Charging Gap in the Cellular Edge
(e.g., FCC or court) can verify the charging
Public Veriﬁers
(5) Veriﬁcation
(5) Veriﬁcation
Edge app
vendor
Cellular
operator
 (1) Data transfer
Edge Vendor
(Report sent data)
ˆxe<latexit sha1_base64="H7dFyMETwOPEYwPrXynhgagF6RU=">AAAB8HicbVDLSgNBEOyNrxhfUY9eBoPgKeyKoMeAF48RzEOSJcxOJsmQmdllplcMS77CiwdFvPo53vwbJ8keNLGgoajqprsrS...


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

Input:
title:Bridging the data charging gap in the cellular edge
author:Yuanjie Li and
Kyu-Han Kim and
Christina Vlachou and
Junqing Xie
Bridging the Data Charging Gap in the Cellular Edge
Yuanjie Li, Kyu-Han Kim, Christina Vlachou, Junqing Xie
Hewlett Packard Labs
Intelligent cellular edge
Ø Low-latency service anywhere, anytime
Ø Powered by 4G/5G cellular networks
Ø Active standardization and early adoption
Edge
devices
Base
stations
Core
network
Edge
servers
4G gateways
Charging data records
Charging function
Charging data records
5G gateways
Cellular edge infrastructure
Charging gap: what & why
The cellular traffic is not free!
Ø Edge app pays 4G/5G operator by data usage
Data charging gap (thus over-/under-billing):
The operator and edge app vendor may not
agree on how much data should be paid
Causes of the gap
Ø Data loss by intermittent wireless, mobility,
congestions, SLA violation, and many more.
)
s
p
b
M
(
e
t
a
R
)
B
M
(
p
a
G
)
m
B
d
(
S
S
R
 5
 2.5
 0
 10
 5
 0
-95
-110
-125
Our solution: TLC
Trusted, Loss-tolerant Charging
Let the edge app vendor and 4G/5G operator
negotiate the charging data volume
Ø Rather than today’s operator-centric charging
Ø Loss-selfishness cancellation: Game-
theoretical approach to let selfishness and
loss-induced gaps cancel out each other
Ø Proof-of-Charging (PoC) is constructed and
digitally signed for mutual trust
Three provable properties
ü Correctness: Always-bounded charging gap,
and no gap if edge and operator are rational
ü Latency friendliness: No blocking of delay-
sensitive edge traffic
ü Public verifiability: Any independent 3rd party
Bridging the Data Charging Gap in the Cellular Edge
(e.g., FCC or court) can verify the charging
Public Veriﬁers
(5) Veriﬁcation
(5) Veriﬁcation
Edge app
vendor
Cellular
operator
 (1) Data transfer
Edge Vendor
(Report sent data)
ˆxe<latexit sha1_base64="H7dFyMETwOPEYwPrXynhgagF6RU=">AAAB8HicbVDLSgNBEOyNrxhfUY9eBoPgKeyKoMeAF48RzEOSJcxOJsmQmdllplcMS77CiwdFvPo53vwbJ8keNLGgoajqprsrS...

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


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

Output:
安全论文分析：

title:COUNTERFOIL: Verifying Provenance of Integrated Circuits using Intrinsic
Package Fingerprints and Inexpensive Cameras
author:Siva Nishok Dhanuskodi and
Xiang Li and
Daniel E. Holcomb
CounterFoil: Verifying Provenance of Integrated
Circuits using Intrinsic Package Fingerprints and
Inexpensive Cameras
Siva Nishok Dhanuskodi, Xiang Li, and Daniel Holcomb,
University of Massachusetts Amherst
https://www.usenix.org/conference/usenixsecurity20/presentation/dhanuskodi
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.COUNTERFOIL: Verifying Provenance of Integrated Circuits using Intrinsic
Package Fingerprints and Inexpensive Cameras
Siva Nishok Dhanuskodi
University of Massachusetts, Amherst
Xiang Li
University of Massachusetts, Amherst
Daniel E. Holcomb
University of Massachusetts, Amherst
Abstract
Counterfeit integrated circuits are responsible for billions of
dollars in losses to the semiconductor industry each year,
and jeopardize the reliability of critical systems that unwit-
tingly rely on them. Counterfeit parts, which are primarily
recycled, test rejects, or legitimate but regraded, have to date
been found in a number of systems, including critical de-
fense systems. In this work, we present COUNTERFOIL – an
anti-counterfeiting system based on enrolling and authenticat-
ing intrinsic features of the molded packages that enclose a
majority of semiconductor chips sold on the market. Our sys-
tem relies on computer-readable labels, inexpensive cameras,
imaging processing using OpenCV, and digital signatures, to
enroll and verify chip packages. We demonstrate our approach
on a dataset from over 100 chips. Our method is able to au-
thenticate chips within 150ms, which makes it suitable for
real-time use in pick-and-place machines. We show that our
technique is effective and reliable for verifying provenan...


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

Input:
title:COUNTERFOIL: Verifying Provenance of Integrated Circuits using Intrinsic
Package Fingerprints and Inexpensive Cameras
author:Siva Nishok Dhanuskodi and
Xiang Li and
Daniel E. Holcomb
CounterFoil: Verifying Provenance of Integrated
Circuits using Intrinsic Package Fingerprints and
Inexpensive Cameras
Siva Nishok Dhanuskodi, Xiang Li, and Daniel Holcomb,
University of Massachusetts Amherst
https://www.usenix.org/conference/usenixsecurity20/presentation/dhanuskodi
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.COUNTERFOIL: Verifying Provenance of Integrated Circuits using Intrinsic
Package Fingerprints and Inexpensive Cameras
Siva Nishok Dhanuskodi
University of Massachusetts, Amherst
Xiang Li
University of Massachusetts, Amherst
Daniel E. Holcomb
University of Massachusetts, Amherst
Abstract
Counterfeit integrated circuits are responsible for billions of
dollars in losses to the semiconductor industry each year,
and jeopardize the reliability of critical systems that unwit-
tingly rely on them. Counterfeit parts, which are primarily
recycled, test rejects, or legitimate but regraded, have to date
been found in a number of systems, including critical de-
fense systems. In this work, we present COUNTERFOIL – an
anti-counterfeiting system based on enrolling and authenticat-
ing intrinsic features of the molded packages that enclose a
majority of semiconductor chips sold on the market. Our sys-
tem relies on computer-readable labels, inexpensive cameras,
imaging processing using OpenCV, and digital signatures, to
enroll and verify chip packages. We demonstrate our approach
on a dataset from over 100 chips. Our method is able to au-
thenticate chips within 150ms, which makes it suitable for
real-time use in pick-and-place machines. We show that our
technique is effective and reliable for verifying provenan...

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


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

Output:
安全论文分析：

title:Merging Network Measurement with Data Transport
author:Pavlos Papageorgiou and
Michael Hicks
Merging Network Measurement with
Data Transport
Pavlos Papageorgiou and Michael Hicks
University of Maryland
pavlos@eng.umd.edu
mwh@cs.umd.edu
Abstract. The tasks of measurement and data transport are often
treated independently, but we believe there are beneﬁts to bringing them
together. This paper proposes the simple idea of a transport agent to en-
capsulate useful data within probe packets in place of useless padding.
1
Introduction
Overlay networks have become a popular vehicle for introducing network ser-
vices. Oftentimes, to drive its services, an overlay network infers characteristics
of the network via application-layer probes. For example, nodes in RON [1],
Detour [2], and Pastry [3] regularly ping their neighbors to check availability
and/or measure latency. MediaNet [4] uses available bandwidth [5] estimations
to determine along which paths to forward media streams.
For the most part, the measurement and transport aspects of overlay networks
are treated independently. The measurement service is a black box used by the over-
lay to make decisions. But the fact that measurement traﬃc is in addition to trans-
port traﬃc imposes an extra burden on the network. While not a problem for a sin-
gle overlay under normal conditions, as congestion and/or the number of overlay
networks in use increases, measurement traﬃc begins to inﬂuence the total traﬃc.
To reduce the overhead of measurement traﬃc, we propose the following sim-
ple idea: merge the task of network measurement with the task of data transport.
In many cases, measurement traﬃc consists largely of null padding just meant to
consume bandwidth for timing purposes. This is the case when measuring avail-
able bandwidth, for example [5]. To avoid this wasted bandwidth, the transport
layer can replace null padding with user payloads available from other streams.
While others have proposed cooperative measureme...


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

Input:
title:Merging Network Measurement with Data Transport
author:Pavlos Papageorgiou and
Michael Hicks
Merging Network Measurement with
Data Transport
Pavlos Papageorgiou and Michael Hicks
University of Maryland
pavlos@eng.umd.edu
mwh@cs.umd.edu
Abstract. The tasks of measurement and data transport are often
treated independently, but we believe there are beneﬁts to bringing them
together. This paper proposes the simple idea of a transport agent to en-
capsulate useful data within probe packets in place of useless padding.
1
Introduction
Overlay networks have become a popular vehicle for introducing network ser-
vices. Oftentimes, to drive its services, an overlay network infers characteristics
of the network via application-layer probes. For example, nodes in RON [1],
Detour [2], and Pastry [3] regularly ping their neighbors to check availability
and/or measure latency. MediaNet [4] uses available bandwidth [5] estimations
to determine along which paths to forward media streams.
For the most part, the measurement and transport aspects of overlay networks
are treated independently. The measurement service is a black box used by the over-
lay to make decisions. But the fact that measurement traﬃc is in addition to trans-
port traﬃc imposes an extra burden on the network. While not a problem for a sin-
gle overlay under normal conditions, as congestion and/or the number of overlay
networks in use increases, measurement traﬃc begins to inﬂuence the total traﬃc.
To reduce the overhead of measurement traﬃc, we propose the following sim-
ple idea: merge the task of network measurement with the task of data transport.
In many cases, measurement traﬃc consists largely of null padding just meant to
consume bandwidth for timing purposes. This is the case when measuring avail-
able bandwidth, for example [5]. To avoid this wasted bandwidth, the transport
layer can replace null padding with user payloads available from other streams.
While others have proposed cooperative measureme...

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


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

Output:
安全论文分析：

title:Precisely Characterizing Security Impact in a Flood of Patches via
Symbolic Rule Comparison
author:Qiushi Wu and
Yang He and
Stephen McCamant and
Kangjie Lu
Precisely Characterizing Security Impact in a Flood
of Patches via Symbolic Rule Comparison
Qiushi Wu, Yang He, Stephen McCamant, and Kangjie Lu
University of Minnesota, Twin Cities
{wu000273, he000242}@umn.edu, mccamant@cs.umn.edu, kjlu@umn.edu
Abstract—A bug is a vulnerability if it has security impacts
when triggered. Determining the security impacts of a bug is
important to both defenders and attackers. Maintainers of large
software systems are bombarded with numerous bug reports and
proposed patches, with missing or unreliable information about
their impact. Determining which few bugs are vulnerabilities is
difficult, and bugs that a maintainer believes do not have security
impact will be de-prioritized or even ignored. On the other hand,
a public report of a bug with a security impact is a powerful first
step towards exploitation. Adversaries may exploit such bugs to
launch devastating attacks if defenders do not fix them promptly.
Common practice is for maintainers to assess the security impacts
of bugs manually, but the scaling and reliability challenges of
manual analysis lead to missed vulnerabilities.
We propose an automated approach, SID, to determine the
security impacts for a bug given its patch, so that maintainers
can effectively prioritize applying the patch to the affected
programs. The insight behind SID is that both the effect of a
patch (either submitted or applied) and security-rule violations
(e.g., out-of-bound access) can be modeled as constraints that can
be automatically solved. SID incorporates rule comparison, using
under-constrained symbolic execution of a patch to determine
the security impacts of an un-applied patch. SID can further
automatically classify vulnerabilities based on their security
impacts. We have implemented SID and applied it to bug patches
of the Linux kerne...


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

Input:
title:Precisely Characterizing Security Impact in a Flood of Patches via
Symbolic Rule Comparison
author:Qiushi Wu and
Yang He and
Stephen McCamant and
Kangjie Lu
Precisely Characterizing Security Impact in a Flood
of Patches via Symbolic Rule Comparison
Qiushi Wu, Yang He, Stephen McCamant, and Kangjie Lu
University of Minnesota, Twin Cities
{wu000273, he000242}@umn.edu, mccamant@cs.umn.edu, kjlu@umn.edu
Abstract—A bug is a vulnerability if it has security impacts
when triggered. Determining the security impacts of a bug is
important to both defenders and attackers. Maintainers of large
software systems are bombarded with numerous bug reports and
proposed patches, with missing or unreliable information about
their impact. Determining which few bugs are vulnerabilities is
difficult, and bugs that a maintainer believes do not have security
impact will be de-prioritized or even ignored. On the other hand,
a public report of a bug with a security impact is a powerful first
step towards exploitation. Adversaries may exploit such bugs to
launch devastating attacks if defenders do not fix them promptly.
Common practice is for maintainers to assess the security impacts
of bugs manually, but the scaling and reliability challenges of
manual analysis lead to missed vulnerabilities.
We propose an automated approach, SID, to determine the
security impacts for a bug given its patch, so that maintainers
can effectively prioritize applying the patch to the affected
programs. The insight behind SID is that both the effect of a
patch (either submitted or applied) and security-rule violations
(e.g., out-of-bound access) can be modeled as constraints that can
be automatically solved. SID incorporates rule comparison, using
under-constrained symbolic execution of a patch to determine
the security impacts of an un-applied patch. SID can further
automatically classify vulnerabilities based on their security
impacts. We have implemented SID and applied it to bug patches
of the Linux kerne...

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


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

Output:
安全论文分析：

title:Practical Fault Attack on Deep Neural Networks
author:Jakub Breier and
Xiaolu Hou and
Dirmanto Jap and
Lei Ma and
Shivam Bhasin and
Yang Liu
Practical Fault Attack on Deep Neural Networks
Jakub Breier
Dirmanto Jap
Xiaolu Hou
Nanyang Technological University
Nanyang Technological University
Nanyang Technological University
jbreier@ntu.edu.sg
ho0001lu@e.ntu.edu.sg
djap@ntu.edu.sg
Yang Liu
yangliu@ntu.edu.sg
Harbin Institute of Technology
Nanyang Technological University
Nanyang Technological University
Lei Ma
malei@hit.edu.cn
Shivam Bhasin
sbhasin@ntu.edu.sg
ABSTRACT
As deep learning systems are widely adopted in safety- and security-
critical applications, such as autonomous vehicles, banking systems,
etc., malicious faults and attacks become a tremendous concern,
which potentially could lead to catastrophic consequences. In this
paper, we initiate the first study of leveraging physical fault in-
jection attacks on Deep Neural Networks (DNNs), by using laser
injection technique on embedded systems. In particular, our ex-
ploratory study targets four widely used activation functions in
DNNs development, that are the general main building block of
DNNs that creates non-linear behaviors – ReLu, softmax, sigmoid,
and tanh. Our results show that by targeting these functions, it is
possible to achieve a misclassification by injecting faults into the
hidden layer of the network. Such result can have practical impli-
cations for real-world applications, where faults can be introduced
by simpler means (such as altering the supply voltage).
KEYWORDS
deep learning security, fault attacks, adversarial attacks
1 INTRODUCTION
Internet of things (IoT) and artificial intelligence (AI) are the two
integral components of modern paradigms like smart city, self-
driving cars etc. The most efficient AI is known in the form of deep
learning which has achieved great leaps of progress in many appli-
cation domains.In parallel, IoT has pushed the computing elements
(and sensors) outsid...


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

Input:
title:Practical Fault Attack on Deep Neural Networks
author:Jakub Breier and
Xiaolu Hou and
Dirmanto Jap and
Lei Ma and
Shivam Bhasin and
Yang Liu
Practical Fault Attack on Deep Neural Networks
Jakub Breier
Dirmanto Jap
Xiaolu Hou
Nanyang Technological University
Nanyang Technological University
Nanyang Technological University
jbreier@ntu.edu.sg
ho0001lu@e.ntu.edu.sg
djap@ntu.edu.sg
Yang Liu
yangliu@ntu.edu.sg
Harbin Institute of Technology
Nanyang Technological University
Nanyang Technological University
Lei Ma
malei@hit.edu.cn
Shivam Bhasin
sbhasin@ntu.edu.sg
ABSTRACT
As deep learning systems are widely adopted in safety- and security-
critical applications, such as autonomous vehicles, banking systems,
etc., malicious faults and attacks become a tremendous concern,
which potentially could lead to catastrophic consequences. In this
paper, we initiate the first study of leveraging physical fault in-
jection attacks on Deep Neural Networks (DNNs), by using laser
injection technique on embedded systems. In particular, our ex-
ploratory study targets four widely used activation functions in
DNNs development, that are the general main building block of
DNNs that creates non-linear behaviors – ReLu, softmax, sigmoid,
and tanh. Our results show that by targeting these functions, it is
possible to achieve a misclassification by injecting faults into the
hidden layer of the network. Such result can have practical impli-
cations for real-world applications, where faults can be introduced
by simpler means (such as altering the supply voltage).
KEYWORDS
deep learning security, fault attacks, adversarial attacks
1 INTRODUCTION
Internet of things (IoT) and artificial intelligence (AI) are the two
integral components of modern paradigms like smart city, self-
driving cars etc. The most efficient AI is known in the form of deep
learning which has achieved great leaps of progress in many appli-
cation domains.In parallel, IoT has pushed the computing elements
(and sensors) outsid...

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


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

Output:
安全论文分析：

title:Condensed Cryptographic Currencies Crash Course (C5)
author:Aljosha Judmayer and
Edgar R. Weippl
Condensed Cryptographic Currencies Crash Course (C5)
Aljosha Judmayer
SBA Research
ajudmayer@sba-research.org
Edgar Weippl
SBA Research
eweippl@sba-research.org
ABSTRACT
”Bitcoin is a rare case where practice seems to be ahead of
theory.” Joseph Bonneau et al. [3]
This tutorial aims to further close the gap between IT se-
curity research and the area of cryptographic currencies and
block chains. We will describe and refer to Bitcoin as an ex-
ample throughout the tutorial, as it is the most prominent
representative of such a system. It also is a good reference to
discuss the underlying block chain mechanics which are the
foundation of various altcoins and other derived systems. In
this tutorial, the topic of cryptographic currencies is solely
addressed from a technical IT security point-of-view. There-
fore we do not cover any legal, sociological, ﬁnancial or eco-
nomical aspects.
The tutorial is designed for participants with a solid IT se-
curity background but will not assume any prior knowledge
on cryptographic currencies. Thus, we will quickly advance
our discussion into core aspects of this ﬁeld.
This tutorial is a modiﬁed version of the tutorial held
It incorporates received feedback and
at WWW2016 [9].
customized content.
Keywords
Cryptographic currencies; block chain; blockchain; Bitcoin
1.
INTRODUCTION
With a current market capitalization of approximately 9
billion dollars, Bitcoin has demonstrated that a decentral-
ized cryptographic currency which currently handles roughly
200.000 transactions per day [2] is technically possible. Since
its launch in 2009, by an entity referred to as Satoshi Nakamoto
[11], the topic of cryptographic currencies has attained wide-
spread recognition.
The new ﬁeld of cryptographic currencies and consensus
ledgers, commonly referred to as block chains (or blockchains),
is receiving increasing interest from various diﬀerent c...


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

Input:
title:Condensed Cryptographic Currencies Crash Course (C5)
author:Aljosha Judmayer and
Edgar R. Weippl
Condensed Cryptographic Currencies Crash Course (C5)
Aljosha Judmayer
SBA Research
ajudmayer@sba-research.org
Edgar Weippl
SBA Research
eweippl@sba-research.org
ABSTRACT
”Bitcoin is a rare case where practice seems to be ahead of
theory.” Joseph Bonneau et al. [3]
This tutorial aims to further close the gap between IT se-
curity research and the area of cryptographic currencies and
block chains. We will describe and refer to Bitcoin as an ex-
ample throughout the tutorial, as it is the most prominent
representative of such a system. It also is a good reference to
discuss the underlying block chain mechanics which are the
foundation of various altcoins and other derived systems. In
this tutorial, the topic of cryptographic currencies is solely
addressed from a technical IT security point-of-view. There-
fore we do not cover any legal, sociological, ﬁnancial or eco-
nomical aspects.
The tutorial is designed for participants with a solid IT se-
curity background but will not assume any prior knowledge
on cryptographic currencies. Thus, we will quickly advance
our discussion into core aspects of this ﬁeld.
This tutorial is a modiﬁed version of the tutorial held
It incorporates received feedback and
at WWW2016 [9].
customized content.
Keywords
Cryptographic currencies; block chain; blockchain; Bitcoin
1.
INTRODUCTION
With a current market capitalization of approximately 9
billion dollars, Bitcoin has demonstrated that a decentral-
ized cryptographic currency which currently handles roughly
200.000 transactions per day [2] is technically possible. Since
its launch in 2009, by an entity referred to as Satoshi Nakamoto
[11], the topic of cryptographic currencies has attained wide-
spread recognition.
The new ﬁeld of cryptographic currencies and consensus
ledgers, commonly referred to as block chains (or blockchains),
is receiving increasing interest from various diﬀerent c...

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


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

Output:
安全论文分析：

title:Reproducible and Adaptable Log Data Generation for Sound Cybersecurity
Experiments
author:Rafael Uetz and
Christian Hemminghaus and
Louis Hackl"ander and
Philipp Schlipper and
Martin Henze
Reproducible and Adaptable
Log Data Generation for
Sound Cybersecurity Experiments
Christian Hemminghaus
Fraunhofer FKIE
Bonn, Germany
Louis Hackländer
Fraunhofer FKIE
Bonn, Germany
Rafael Uetz
Fraunhofer FKIE
Bonn, Germany
rafael.uetz@fkie.fraunhofer.de
c.hemminghaus@fkie.fraunhofer.de
louis.hacklaender@fkie.fraunhofer.de
Philipp Schlipper
Fraunhofer FKIE
Bonn, Germany
philipp.schlipper@fkie.fraunhofer.de
Martin Henze
RWTH Aachen University
Aachen, Germany
Fraunhofer FKIE
Bonn, Germany
henze@cs.rwth-aachen.de
ABSTRACT
Artifacts such as log data and network traffic are fundamental for
cybersecurity research, e.g., in the area of intrusion detection. Yet,
most research is based on artifacts that are not available to others
or cannot be adapted to own purposes, thus making it difficult to
reproduce and build on existing work. In this paper, we identify the
challenges of artifact generation with the goal of conducting sound
experiments that are valid, controlled, and reproducible. We argue
that testbeds for artifact generation have to be designed specifically
with reproducibility and adaptability in mind. To achieve this goal,
we present SOCBED, our proof-of-concept implementation and
the first testbed with a focus on generating realistic log data for
cybersecurity experiments in a reproducible and adaptable manner.
SOCBED enables researchers to reproduce testbed instances on
commodity computers, adapt them according to own requirements,
and verify their correct functionality. We evaluate SOCBED with an
exemplary, practical experiment on detecting a multi-step intrusion
of an enterprise network and show that the resulting experiment is
indeed valid, controlled, and reproducible. Both SOCBED and the
log dataset underlying our evaluation are freely available.
CCS CONCEPTS
• ...


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

Input:
title:Reproducible and Adaptable Log Data Generation for Sound Cybersecurity
Experiments
author:Rafael Uetz and
Christian Hemminghaus and
Louis Hackl"ander and
Philipp Schlipper and
Martin Henze
Reproducible and Adaptable
Log Data Generation for
Sound Cybersecurity Experiments
Christian Hemminghaus
Fraunhofer FKIE
Bonn, Germany
Louis Hackländer
Fraunhofer FKIE
Bonn, Germany
Rafael Uetz
Fraunhofer FKIE
Bonn, Germany
rafael.uetz@fkie.fraunhofer.de
c.hemminghaus@fkie.fraunhofer.de
louis.hacklaender@fkie.fraunhofer.de
Philipp Schlipper
Fraunhofer FKIE
Bonn, Germany
philipp.schlipper@fkie.fraunhofer.de
Martin Henze
RWTH Aachen University
Aachen, Germany
Fraunhofer FKIE
Bonn, Germany
henze@cs.rwth-aachen.de
ABSTRACT
Artifacts such as log data and network traffic are fundamental for
cybersecurity research, e.g., in the area of intrusion detection. Yet,
most research is based on artifacts that are not available to others
or cannot be adapted to own purposes, thus making it difficult to
reproduce and build on existing work. In this paper, we identify the
challenges of artifact generation with the goal of conducting sound
experiments that are valid, controlled, and reproducible. We argue
that testbeds for artifact generation have to be designed specifically
with reproducibility and adaptability in mind. To achieve this goal,
we present SOCBED, our proof-of-concept implementation and
the first testbed with a focus on generating realistic log data for
cybersecurity experiments in a reproducible and adaptable manner.
SOCBED enables researchers to reproduce testbed instances on
commodity computers, adapt them according to own requirements,
and verify their correct functionality. We evaluate SOCBED with an
exemplary, practical experiment on detecting a multi-step intrusion
of an enterprise network and show that the resulting experiment is
indeed valid, controlled, and reproducible. Both SOCBED and the
log dataset underlying our evaluation are freely available.
CCS CONCEPTS
• ...

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


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

Output:
安全论文分析：

title:A study of the short message service of a nationwide cellular network
author:Petros Zerfos and
Xiaoqiao Meng and
Starsky H. Y. Wong and
Vidyut Samanta and
Songwu Lu
A Study of the Short Message Service of a
Nationwide Cellular Network
Petros Zerfos
Deutsche Telekom Laboratories
10587 Berlin, Germany
petros.zerfos@telekom.de
In recent years, cellular networks have experienced an
astronomical increase in the use of Short Message Service
(SMS), making it a popular communication means for inter-
personal as well as content provider-to-person usage. Yet lit-
tle is known about the traﬃc and message user behavior in
real SMS systems. In this paper, we present a measurement
study of SMS based on traces collected from a nationwide
cellular carrier during a three-week period. We characterize
message traﬃc at both the message level and the conversa-
tion thread level. We also examine the “store-and-forward”
mechanism of SMS and present initial measurements on how
messages are actually delivered.
Categories and Subject Descriptors
C.2.3 [Computer-Communication Networks]: Network
Operations
General Terms
Measurement
Keywords
Short Message Service, Network Measurements, Traﬃc Char-
acterization
1.
INTRODUCTION
The Short Message Service (SMS) is arguably the most
popular data service over cellular networks nowadays. Though
it was originally conceived as a paging mechanism for voice
mails as part of the GSM speciﬁcation in 1992, SMS has
evolved into one of the most successful wireless data services
in recent years. According to [13], SMS accounts for about
80% of data revenue generated for Western European mo-
bile operators in 2005. In the largest twenty European coun-
tries, over 200 billion messages are exchanged in each month
[19]. In Asia, the two major cellular carriers, China Mobile
and China Unicom, report 304.14 billion message volume
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided t...


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

Input:
title:A study of the short message service of a nationwide cellular network
author:Petros Zerfos and
Xiaoqiao Meng and
Starsky H. Y. Wong and
Vidyut Samanta and
Songwu Lu
A Study of the Short Message Service of a
Nationwide Cellular Network
Petros Zerfos
Deutsche Telekom Laboratories
10587 Berlin, Germany
petros.zerfos@telekom.de
In recent years, cellular networks have experienced an
astronomical increase in the use of Short Message Service
(SMS), making it a popular communication means for inter-
personal as well as content provider-to-person usage. Yet lit-
tle is known about the traﬃc and message user behavior in
real SMS systems. In this paper, we present a measurement
study of SMS based on traces collected from a nationwide
cellular carrier during a three-week period. We characterize
message traﬃc at both the message level and the conversa-
tion thread level. We also examine the “store-and-forward”
mechanism of SMS and present initial measurements on how
messages are actually delivered.
Categories and Subject Descriptors
C.2.3 [Computer-Communication Networks]: Network
Operations
General Terms
Measurement
Keywords
Short Message Service, Network Measurements, Traﬃc Char-
acterization
1.
INTRODUCTION
The Short Message Service (SMS) is arguably the most
popular data service over cellular networks nowadays. Though
it was originally conceived as a paging mechanism for voice
mails as part of the GSM speciﬁcation in 1992, SMS has
evolved into one of the most successful wireless data services
in recent years. According to [13], SMS accounts for about
80% of data revenue generated for Western European mo-
bile operators in 2005. In the largest twenty European coun-
tries, over 200 billion messages are exchanged in each month
[19]. In Asia, the two major cellular carriers, China Mobile
and China Unicom, report 304.14 billion message volume
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided t...

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


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

Output:
安全论文分析：

title:Adaptive Android Kernel Live Patching
author:Yue Chen and
Yulong Zhang and
Zhi Wang and
Liangzhao Xia and
Chenfu Bao and
Tao Wei
Adaptive Android Kernel Live Patching
Yue Chen, Florida State University; Yulong Zhang, Baidu X-Lab; Zhi Wang, Florida State
University; Liangzhao Xia, Chenfu Bao, and Tao Wei, Baidu X-Lab
https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/chen
This paper is included in the Proceedings of the 26th USENIX Security SymposiumAugust 16–18, 2017 • Vancouver, BC, CanadaISBN 978-1-931971-40-9Open access to the Proceedings of the 26th USENIX Security Symposium is sponsored by USENIXAdaptive Android Kernel Live Patching
Yue Chen
Florida State University
Yulong Zhang
Baidu X-Lab
Chenfu Bao
Baidu X-Lab
Zhi Wang
Florida State University
Liangzhao Xia
Baidu X-Lab
Tao Wei
Baidu X-Lab
Abstract
Android kernel vulnerabilities pose a serious threat to
user security and privacy. They allow attackers to take
full control over victim devices, install malicious and un-
wanted apps, and maintain persistent control. Unfortu-
nately, most Android devices are never timely updated
to protect their users from kernel exploits. Recent An-
droid malware even has built-in kernel exploits to take
advantage of this large window of vulnerability. An ef-
fective solution to this problem must be adaptable to lots
of (out-of-date) devices, quickly deployable, and secure
from misuse. However, the fragmented Android ecosys-
tem makes this a complex and challenging task.
To address that, we systematically studied 1,139 An-
droid kernels and all the recent critical Android ker-
nel vulnerabilities. We accordingly propose KARMA,
an adaptive live patching system for Android kernels.
KARMA features a multi-level adaptive patching model
to protect kernel vulnerabilities from exploits. Speciﬁ-
cally, patches in KARMA can be placed at multiple lev-
els in the kernel to ﬁlter malicious inputs, and they can
be automatically adapted to thousands of A...


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

Input:
title:Adaptive Android Kernel Live Patching
author:Yue Chen and
Yulong Zhang and
Zhi Wang and
Liangzhao Xia and
Chenfu Bao and
Tao Wei
Adaptive Android Kernel Live Patching
Yue Chen, Florida State University; Yulong Zhang, Baidu X-Lab; Zhi Wang, Florida State
University; Liangzhao Xia, Chenfu Bao, and Tao Wei, Baidu X-Lab
https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/chen
This paper is included in the Proceedings of the 26th USENIX Security SymposiumAugust 16–18, 2017 • Vancouver, BC, CanadaISBN 978-1-931971-40-9Open access to the Proceedings of the 26th USENIX Security Symposium is sponsored by USENIXAdaptive Android Kernel Live Patching
Yue Chen
Florida State University
Yulong Zhang
Baidu X-Lab
Chenfu Bao
Baidu X-Lab
Zhi Wang
Florida State University
Liangzhao Xia
Baidu X-Lab
Tao Wei
Baidu X-Lab
Abstract
Android kernel vulnerabilities pose a serious threat to
user security and privacy. They allow attackers to take
full control over victim devices, install malicious and un-
wanted apps, and maintain persistent control. Unfortu-
nately, most Android devices are never timely updated
to protect their users from kernel exploits. Recent An-
droid malware even has built-in kernel exploits to take
advantage of this large window of vulnerability. An ef-
fective solution to this problem must be adaptable to lots
of (out-of-date) devices, quickly deployable, and secure
from misuse. However, the fragmented Android ecosys-
tem makes this a complex and challenging task.
To address that, we systematically studied 1,139 An-
droid kernels and all the recent critical Android ker-
nel vulnerabilities. We accordingly propose KARMA,
an adaptive live patching system for Android kernels.
KARMA features a multi-level adaptive patching model
to protect kernel vulnerabilities from exploits. Speciﬁ-
cally, patches in KARMA can be placed at multiple lev-
els in the kernel to ﬁlter malicious inputs, and they can
be automatically adapted to thousands of A...

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


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

Output:
安全论文分析：

title:R2Q: A Risk Quantification Framework to Authorize Requests in
Web-based Collaborations
author:Nirnay Ghosh and
Rishabh Singhal and
Sajal K. Das
Chapter 4
Risk Quantiﬁcation Framework
In this chapter about the risk quantiﬁcation framework1, ﬁrst, the model – includ-
ing its parameters as well as related equations and algorithms – is introduced. The
model supports risk management by efﬁciently aggregating the individual risks for
the decomposed parts of an IT scenario back to an overall risk. The second section
describes simulation results regarding sensitivity analysis, identiﬁcation of cost
drivers, and the introduction of inaccuracy. Third, the application of the proposed
risk quantiﬁcation framework using a real-life business process and a prototype of
a SaaS-based implementation are presented.
4.1 Model Description
The framework is build around the thought that – especially for larger IT architec-
tures – it is hard to manage all involved risks using only a high level perspective.
As the complexity of large-scale systems is too high, the model facilitates decom-
position of scenarios into smaller parts, i. e., smaller scenarios for which the IT risk
management process can be carried out more easily. Especially during the phases
of risk identiﬁcation and quantiﬁcation, decision makers can, thus, better analyze
and estimate potential risks. The risk quantiﬁcation framework supports risk quan-
tiﬁcation by efﬁciently aggregating the individual risks for the decomposed parts
back to an overall risk distribution.
Each scenario is assumed to consist of various components of different types.
Expert interviews with IT risk management consultants showed that scenarios in-
volving IT outsourcing are usually composed of services and data transfers. Using
1 Compare, in the following, Ackermann and Buxmann (2010); Ackermann et al. (2013).
T. Ackermann, IT Security Risk Management, DOI 10.1007/978-3-658-01115-4_4,
© Springer Fachmedien Wiesbaden 2013
86
4 Risk Quantiﬁc...


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

Input:
title:R2Q: A Risk Quantification Framework to Authorize Requests in
Web-based Collaborations
author:Nirnay Ghosh and
Rishabh Singhal and
Sajal K. Das
Chapter 4
Risk Quantiﬁcation Framework
In this chapter about the risk quantiﬁcation framework1, ﬁrst, the model – includ-
ing its parameters as well as related equations and algorithms – is introduced. The
model supports risk management by efﬁciently aggregating the individual risks for
the decomposed parts of an IT scenario back to an overall risk. The second section
describes simulation results regarding sensitivity analysis, identiﬁcation of cost
drivers, and the introduction of inaccuracy. Third, the application of the proposed
risk quantiﬁcation framework using a real-life business process and a prototype of
a SaaS-based implementation are presented.
4.1 Model Description
The framework is build around the thought that – especially for larger IT architec-
tures – it is hard to manage all involved risks using only a high level perspective.
As the complexity of large-scale systems is too high, the model facilitates decom-
position of scenarios into smaller parts, i. e., smaller scenarios for which the IT risk
management process can be carried out more easily. Especially during the phases
of risk identiﬁcation and quantiﬁcation, decision makers can, thus, better analyze
and estimate potential risks. The risk quantiﬁcation framework supports risk quan-
tiﬁcation by efﬁciently aggregating the individual risks for the decomposed parts
back to an overall risk distribution.
Each scenario is assumed to consist of various components of different types.
Expert interviews with IT risk management consultants showed that scenarios in-
volving IT outsourcing are usually composed of services and data transfers. Using
1 Compare, in the following, Ackermann and Buxmann (2010); Ackermann et al. (2013).
T. Ackermann, IT Security Risk Management, DOI 10.1007/978-3-658-01115-4_4,
© Springer Fachmedien Wiesbaden 2013
86
4 Risk Quantiﬁc...

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


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

Output:
安全论文分析：

title:Graphene: efficient interactive set reconciliation applied to blockchain
propagation
author:A. Pinar Ozisik and
Gavin Andresen and
Brian Neil Levine and
Darren Tapp and
George Bissias and
Sunny Katkuri
Graphene: Efficient Interactive Set Reconciliation
Applied to Blockchain Propagation
A. Pinar Ozisik
Univ. of Massachusetts, Amherst
Brian Levine
Univ. of Massachusetts, Amherst
Gavin Andresen
Darren Tapp
Dash.org
George Bissias
Univ. of Massachusetts, Amherst
Sunny Katkuri
Univ. of Massachusetts, Amherst
ABSTRACT
We introduce Graphene, a method and protocol for interactive
set reconciliation among peers in blockchains and related dis-
tributed systems. Through the novel combination of a Bloom
filter and an Invertible Bloom Lookup Table (IBLT), Graphene
uses a fraction of the network bandwidth used by deployed
work for one- and two-way synchronization. We show that, for
this specific problem, Graphene is Ω(n log n) more efficient at
reconciling n items than using a Bloom filter at the informa-
tion theoretic bound. We contribute a fast and implementation-
independent algorithm for parameterizing an IBLT so that
it is optimally small in size and meets a desired decode rate
with arbitrarily high probability. We characterize our perfor-
mance improvements through analysis, detailed simulation,
and deployment results for Bitcoin Cash, a prominent cryp-
tocurrency. Our implementations of Graphene, IBLTs, and our
IBLT optimization algorithm are all open-source code.
1 INTRODUCTION
Minimizing the network bandwidth required for synchro-
nization among replicas of widely propagated information is
a classic need of many distributed systems. Blockchains [41,
50] and protocols for distributed consensus [18, 31] are the
most recent examples of systems where the performance of
network-based synchronization is a critical factor in over-
all performance. Whether based on proof-of-work [30, 41],
proof-of-stake [15, 26], or a directed acyclic graph (DAG) [33],
guarantees that the...


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

Input:
title:Graphene: efficient interactive set reconciliation applied to blockchain
propagation
author:A. Pinar Ozisik and
Gavin Andresen and
Brian Neil Levine and
Darren Tapp and
George Bissias and
Sunny Katkuri
Graphene: Efficient Interactive Set Reconciliation
Applied to Blockchain Propagation
A. Pinar Ozisik
Univ. of Massachusetts, Amherst
Brian Levine
Univ. of Massachusetts, Amherst
Gavin Andresen
Darren Tapp
Dash.org
George Bissias
Univ. of Massachusetts, Amherst
Sunny Katkuri
Univ. of Massachusetts, Amherst
ABSTRACT
We introduce Graphene, a method and protocol for interactive
set reconciliation among peers in blockchains and related dis-
tributed systems. Through the novel combination of a Bloom
filter and an Invertible Bloom Lookup Table (IBLT), Graphene
uses a fraction of the network bandwidth used by deployed
work for one- and two-way synchronization. We show that, for
this specific problem, Graphene is Ω(n log n) more efficient at
reconciling n items than using a Bloom filter at the informa-
tion theoretic bound. We contribute a fast and implementation-
independent algorithm for parameterizing an IBLT so that
it is optimally small in size and meets a desired decode rate
with arbitrarily high probability. We characterize our perfor-
mance improvements through analysis, detailed simulation,
and deployment results for Bitcoin Cash, a prominent cryp-
tocurrency. Our implementations of Graphene, IBLTs, and our
IBLT optimization algorithm are all open-source code.
1 INTRODUCTION
Minimizing the network bandwidth required for synchro-
nization among replicas of widely propagated information is
a classic need of many distributed systems. Blockchains [41,
50] and protocols for distributed consensus [18, 31] are the
most recent examples of systems where the performance of
network-based synchronization is a critical factor in over-
all performance. Whether based on proof-of-work [30, 41],
proof-of-stake [15, 26], or a directed acyclic graph (DAG) [33],
guarantees that the...

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


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

Output:
安全论文分析：

title:Precise and Scalable Detection of Double-Fetch Bugs in OS Kernels
author:Meng Xu and
Chenxiong Qian and
Kangjie Lu and
Michael Backes and
Taesoo Kim
2018 IEEE Symposium on Security and Privacy
Precise and Scalable Detection of
Double-Fetch Bugs in OS Kernels
Meng Xu∗, Chenxiong Qian∗, Kangjie Lu†, Michael Backes‡, Taesoo Kim∗,
∗
‡
†
Georgia Institute of Technology
University of Minnesota
CISPA Helmholtz Center i.G.
Abstract—During system call execution,
it is common for
operating system kernels to read userspace memory multiple
times (multi-reads). A critical bug may exist if the fetched
userspace memory is subject to change across these reads, i.e.,
a race condition, which is known as a double-fetch bug. Prior
works have attempted to detect these bugs both statically and
dynamically. However, due to their improper assumptions and
imprecise deﬁnitions regarding double-fetch bugs, their multi-
read detection is inherently limited and suffers from signiﬁcant
false positives and false negatives. For example, their approach
is unable to support device emulation, inter-procedural analysis,
loop handling, etc. More importantly, they completely leave the
task of ﬁnding real double-fetch bugs from the haystack of multi-
reads to manual veriﬁcation, which is expensive if possible at all.
In this paper, we ﬁrst present a formal and precise deﬁnition of
double-fetch bugs and then implement a static analysis system—
DEADLINE—to automatically detect double-fetch bugs in OS
kernels. DEADLINE uses static program analysis techniques
to systematically ﬁnd multi-reads throughout the kernel and
employs specialized symbolic checking to vet each multi-read for
double-fetch bugs. We apply DEADLINE to Linux and FreeBSD
kernels and ﬁnd 23 new bugs in Linux and one new bug in
FreeBSD. We further propose four generic strategies to patch and
prevent double-fetch bugs based on our study and the discussion
with kernel maintainers.
I. INTRODUCTION
Bugs in operating system kernels can be pa...


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

Input:
title:Precise and Scalable Detection of Double-Fetch Bugs in OS Kernels
author:Meng Xu and
Chenxiong Qian and
Kangjie Lu and
Michael Backes and
Taesoo Kim
2018 IEEE Symposium on Security and Privacy
Precise and Scalable Detection of
Double-Fetch Bugs in OS Kernels
Meng Xu∗, Chenxiong Qian∗, Kangjie Lu†, Michael Backes‡, Taesoo Kim∗,
∗
‡
†
Georgia Institute of Technology
University of Minnesota
CISPA Helmholtz Center i.G.
Abstract—During system call execution,
it is common for
operating system kernels to read userspace memory multiple
times (multi-reads). A critical bug may exist if the fetched
userspace memory is subject to change across these reads, i.e.,
a race condition, which is known as a double-fetch bug. Prior
works have attempted to detect these bugs both statically and
dynamically. However, due to their improper assumptions and
imprecise deﬁnitions regarding double-fetch bugs, their multi-
read detection is inherently limited and suffers from signiﬁcant
false positives and false negatives. For example, their approach
is unable to support device emulation, inter-procedural analysis,
loop handling, etc. More importantly, they completely leave the
task of ﬁnding real double-fetch bugs from the haystack of multi-
reads to manual veriﬁcation, which is expensive if possible at all.
In this paper, we ﬁrst present a formal and precise deﬁnition of
double-fetch bugs and then implement a static analysis system—
DEADLINE—to automatically detect double-fetch bugs in OS
kernels. DEADLINE uses static program analysis techniques
to systematically ﬁnd multi-reads throughout the kernel and
employs specialized symbolic checking to vet each multi-read for
double-fetch bugs. We apply DEADLINE to Linux and FreeBSD
kernels and ﬁnd 23 new bugs in Linux and one new bug in
FreeBSD. We further propose four generic strategies to patch and
prevent double-fetch bugs based on our study and the discussion
with kernel maintainers.
I. INTRODUCTION
Bugs in operating system kernels can be pa...

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