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

Output:
安全论文分析：

title:Sedic: privacy-aware data intensive computing on hybrid clouds
author:Kehuan Zhang and
Xiao-yong Zhou and
Yangyi Chen and
XiaoFeng Wang and
Yaoping Ruan
Sedic: Privacy-Aware Data Intensive Computing
on Hybrid Clouds
Kehuan Zhang, Xiaoyong Zhou,
Yangyi Chen and XiaoFeng Wang
School of Informatics and Computing
Indiana University, Bloomington, IN, USA
{kehzhang, zhou, yangchen,
xw7}@indiana.edu
ABSTRACT
The emergence of cost-effective cloud services offers organizations great
opportunity to reduce their cost and increase productivity. This develop-
ment, however, is hampered by privacy concerns: a signiﬁcant amount of
organizational computing workload at least partially involves sensitive data
and therefore cannot be directly outsourced to the public cloud. The scale of
these computing tasks also renders existing secure outsourcing techniques
less applicable. A natural solution is to split a task, keeping the computation
on the private data within an organization’s private cloud while moving the
rest to the public commercial cloud. However, this hybrid cloud computing
is not supported by today’s data-intensive computing frameworks, MapRe-
duce in particular, which forces the users to manually split their computing
tasks. In this paper, we present a suite of new techniques that make such
privacy-aware data-intensive computing possible. Our system, called Sedic,
leverages the special features of MapReduce to automatically partition a
computing job according to the security levels of the data it works on, and
arrange the computation across a hybrid cloud. Speciﬁcally, we modiﬁed
MapReduce’s distributed ﬁle system to strategically replicate data, moving
sanitized data blocks to the public cloud. Over this data placement, map
tasks are carefully scheduled to outsource as much workload to the public
cloud as possible, given sensitive data always stay on the private cloud. To
minimize inter-cloud communication, our approach also automatically ana-
lyzes and transforms ...


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

Input:
title:Sedic: privacy-aware data intensive computing on hybrid clouds
author:Kehuan Zhang and
Xiao-yong Zhou and
Yangyi Chen and
XiaoFeng Wang and
Yaoping Ruan
Sedic: Privacy-Aware Data Intensive Computing
on Hybrid Clouds
Kehuan Zhang, Xiaoyong Zhou,
Yangyi Chen and XiaoFeng Wang
School of Informatics and Computing
Indiana University, Bloomington, IN, USA
{kehzhang, zhou, yangchen,
xw7}@indiana.edu
ABSTRACT
The emergence of cost-effective cloud services offers organizations great
opportunity to reduce their cost and increase productivity. This develop-
ment, however, is hampered by privacy concerns: a signiﬁcant amount of
organizational computing workload at least partially involves sensitive data
and therefore cannot be directly outsourced to the public cloud. The scale of
these computing tasks also renders existing secure outsourcing techniques
less applicable. A natural solution is to split a task, keeping the computation
on the private data within an organization’s private cloud while moving the
rest to the public commercial cloud. However, this hybrid cloud computing
is not supported by today’s data-intensive computing frameworks, MapRe-
duce in particular, which forces the users to manually split their computing
tasks. In this paper, we present a suite of new techniques that make such
privacy-aware data-intensive computing possible. Our system, called Sedic,
leverages the special features of MapReduce to automatically partition a
computing job according to the security levels of the data it works on, and
arrange the computation across a hybrid cloud. Speciﬁcally, we modiﬁed
MapReduce’s distributed ﬁle system to strategically replicate data, moving
sanitized data blocks to the public cloud. Over this data placement, map
tasks are carefully scheduled to outsource as much workload to the public
cloud as possible, given sensitive data always stay on the private cloud. To
minimize inter-cloud communication, our approach also automatically ana-
lyzes and transforms ...

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


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

Output:
安全论文分析：

title:Rupair: Towards Automatic Buffer Overflow Detection and Rectification
for Rust
author:Baojian Hua and
Wanrong Ouyang and
Chengman Jiang and
Qiliang Fan and
Zhizhong Pan
Rupair: Towards Automatic Buffer Overflow Detection and
Rectification for Rust
Baojian Hua, Wanrong Ouyang, Chengman Jiang, Qiliang Fan, and Zhizhong Pan
School of Software Engineering, University of Science and Technology of China, China
ABSTRACT
Rust is an emerging programming language which aims to provide
both safety guarantee and runtime efficiency, and has been used
extensively in system programming scenarios. However, as Rust
consists of an unsafe language subset unsafe, Rust programs are
still vulnerable to severe security attacks which may defeat its safety
guarantees. Existing studies on Rust security focus on the detection
of vulnerabilities but seldom consider the bug fix issues. Meanwhile,
it is often time-consuming and error-prone for Rust developers to
understand and fix bugs manually, due to Rust’s advanced language
features. In this paper, we present Rupair, an automated rectifi-
cation system, to detect and fix one sort of the most severe Rust
vulnerabilities—buffer overflows, and to help developers release
secure Rust projects. The key technical component of Rupair is a
novel security oriented lightweight data-flow analysis algorithm,
which makes use of Rust’s two primary intermediate representa-
tions and works across the boundary of Rust’s safe and unsafe
sub-languages. To evaluate the effectiveness of Rupair, we first
apply it to all 4 reported buffer overflow-related CVEs and vulnera-
bilities (as of June 20, 2021). Experiment results demonstrated that
Rupair successfully detected and rectified all these CVEs. To testify
the scalability of Rupair, we collected 36 open-source Rust projects
from 8 different application domains, consisting of 5,108,432 lines of
Rust source code, and applied Rupair on these projects. Experiment
results showed that Rupair successfully identifi...


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

Input:
title:Rupair: Towards Automatic Buffer Overflow Detection and Rectification
for Rust
author:Baojian Hua and
Wanrong Ouyang and
Chengman Jiang and
Qiliang Fan and
Zhizhong Pan
Rupair: Towards Automatic Buffer Overflow Detection and
Rectification for Rust
Baojian Hua, Wanrong Ouyang, Chengman Jiang, Qiliang Fan, and Zhizhong Pan
School of Software Engineering, University of Science and Technology of China, China
ABSTRACT
Rust is an emerging programming language which aims to provide
both safety guarantee and runtime efficiency, and has been used
extensively in system programming scenarios. However, as Rust
consists of an unsafe language subset unsafe, Rust programs are
still vulnerable to severe security attacks which may defeat its safety
guarantees. Existing studies on Rust security focus on the detection
of vulnerabilities but seldom consider the bug fix issues. Meanwhile,
it is often time-consuming and error-prone for Rust developers to
understand and fix bugs manually, due to Rust’s advanced language
features. In this paper, we present Rupair, an automated rectifi-
cation system, to detect and fix one sort of the most severe Rust
vulnerabilities—buffer overflows, and to help developers release
secure Rust projects. The key technical component of Rupair is a
novel security oriented lightweight data-flow analysis algorithm,
which makes use of Rust’s two primary intermediate representa-
tions and works across the boundary of Rust’s safe and unsafe
sub-languages. To evaluate the effectiveness of Rupair, we first
apply it to all 4 reported buffer overflow-related CVEs and vulnera-
bilities (as of June 20, 2021). Experiment results demonstrated that
Rupair successfully detected and rectified all these CVEs. To testify
the scalability of Rupair, we collected 36 open-source Rust projects
from 8 different application domains, consisting of 5,108,432 lines of
Rust source code, and applied Rupair on these projects. Experiment
results showed that Rupair successfully identifi...

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


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

Output:
安全论文分析：

title:XACML policy performance evaluation using a flexible load testing
framework
author:Bernard Butler and
Brendan Jennings and
Dmitri Botvich
XACML Policy Performance Evaluation Using a Flexible
Load Testing Framework
Bernard Butler, Brendan Jennings, Dmitri Botvich
FAME
Ireland
Telecommunications Software & Systems Group
Waterford Institute of Technology
{bbutler,bjennings,dbotvich}@tssg.org
ABSTRACT
The performance and scalability of access control systems is
growing more important as organisations deploy ever more
complex communications and content management systems.
Fine-grained access control is becoming more pervasive, so
decisions are more frequent and policy sets are larger. We
outline a ﬂexible performance testing framework that ac-
cepts XACML PDP implementations (in the server com-
ponent) and submits representative access control requests
(from the client component) in a representative temporal or-
dering. The framework includes instrumentation and anal-
ysis modules to support performance experiments. We de-
scribe an initial realization of the framework and report on
initial experiments comparing the performance of the SunX-
ACML and Enterprise XACML PDPs.
Categories and Subject Descriptors
D.2.8 [SOFTWARE ENGINEERING]: Metrics—Per-
formance measures; D.4.6 [OPERATING SYSTEMS]:
Security and protection—Access controls, Information ﬂow
controls
General Terms
Security, Performance, Measurement
Keywords
Access control policies, performance evaluation, measure-
ment testbed
1.
INTRODUCTION
Policy Decision Point (PDP) performance is an important
access control system requirement. In larger organisations,
access decisions depend on the context of an access request,
so ﬁne-grained access control is needed to implement se-
curity policies with complex boundaries between permitted
and denied behaviour. There are more access requests, hence
policy evaluations and each policy evaluation takes longer as
policy sets grow larger.
As an example, policy control of i...


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

Input:
title:XACML policy performance evaluation using a flexible load testing
framework
author:Bernard Butler and
Brendan Jennings and
Dmitri Botvich
XACML Policy Performance Evaluation Using a Flexible
Load Testing Framework
Bernard Butler, Brendan Jennings, Dmitri Botvich
FAME
Ireland
Telecommunications Software & Systems Group
Waterford Institute of Technology
{bbutler,bjennings,dbotvich}@tssg.org
ABSTRACT
The performance and scalability of access control systems is
growing more important as organisations deploy ever more
complex communications and content management systems.
Fine-grained access control is becoming more pervasive, so
decisions are more frequent and policy sets are larger. We
outline a ﬂexible performance testing framework that ac-
cepts XACML PDP implementations (in the server com-
ponent) and submits representative access control requests
(from the client component) in a representative temporal or-
dering. The framework includes instrumentation and anal-
ysis modules to support performance experiments. We de-
scribe an initial realization of the framework and report on
initial experiments comparing the performance of the SunX-
ACML and Enterprise XACML PDPs.
Categories and Subject Descriptors
D.2.8 [SOFTWARE ENGINEERING]: Metrics—Per-
formance measures; D.4.6 [OPERATING SYSTEMS]:
Security and protection—Access controls, Information ﬂow
controls
General Terms
Security, Performance, Measurement
Keywords
Access control policies, performance evaluation, measure-
ment testbed
1.
INTRODUCTION
Policy Decision Point (PDP) performance is an important
access control system requirement. In larger organisations,
access decisions depend on the context of an access request,
so ﬁne-grained access control is needed to implement se-
curity policies with complex boundaries between permitted
and denied behaviour. There are more access requests, hence
policy evaluations and each policy evaluation takes longer as
policy sets grow larger.
As an example, policy control of i...

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


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

Output:
安全论文分析：

title:Banksafe Information Stealer Detection Inside the Web Browser
author:Armin Buescher and
Felix Leder and
Thomas Siebert
Banksafe
Information Stealer Detection Inside the
Web Browser
Armin Buescher1, Felix Leder2, and Thomas Siebert1
1 G Data Security Labs, Bochum, Germany
2 Institute of Computer Science 4, University of Bonn, Germany
Abstract. Information stealing and banking trojans have become the
tool of choice for cyber criminals for various kinds of cyber fraud. Tradi-
tional security measures like common antivirus solutions currently do not
provide suﬃcient reactive nor proactive detection for this type of mal-
ware. In this paper, we propose a new approach on detecting banking
trojan infections from inside the web browser called Banksafe. Banksafe
detects the attempts of illegitimate software to manipulate the browsers‘
networking libraries, a common technique used in widespread informa-
tion stealer trojans. We demonstrate the eﬀectiveness of our solution with
evaluations of the detection and classiﬁcation of samplesets consisting of
several malware families targetting the Microsoft Windows operating
system. Furthermore we show the eﬀective prevention of possible false
positives of the approach.
1 Introduction
Information stealers, and especially banking trojans, are a species of crimeware
that is specialized in stealing login credentials and manipulating online banking
transactions during the communication between an infected computer and the
banks servers. The majority of these types of trojans focuses on stealing money
from a victims bank account, even though the functionality can more generally
be described as versatile information stealers with backdoor functionalities to
create botnets. These are also capable of sending e-mail and instant-messaging
spam, installing additional malware on the victims system and executing dis-
tributed denial-of-service attacks. The technologies used by recent variants to
hijack the system enable cybercriminals to ex...


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

Input:
title:Banksafe Information Stealer Detection Inside the Web Browser
author:Armin Buescher and
Felix Leder and
Thomas Siebert
Banksafe
Information Stealer Detection Inside the
Web Browser
Armin Buescher1, Felix Leder2, and Thomas Siebert1
1 G Data Security Labs, Bochum, Germany
2 Institute of Computer Science 4, University of Bonn, Germany
Abstract. Information stealing and banking trojans have become the
tool of choice for cyber criminals for various kinds of cyber fraud. Tradi-
tional security measures like common antivirus solutions currently do not
provide suﬃcient reactive nor proactive detection for this type of mal-
ware. In this paper, we propose a new approach on detecting banking
trojan infections from inside the web browser called Banksafe. Banksafe
detects the attempts of illegitimate software to manipulate the browsers‘
networking libraries, a common technique used in widespread informa-
tion stealer trojans. We demonstrate the eﬀectiveness of our solution with
evaluations of the detection and classiﬁcation of samplesets consisting of
several malware families targetting the Microsoft Windows operating
system. Furthermore we show the eﬀective prevention of possible false
positives of the approach.
1 Introduction
Information stealers, and especially banking trojans, are a species of crimeware
that is specialized in stealing login credentials and manipulating online banking
transactions during the communication between an infected computer and the
banks servers. The majority of these types of trojans focuses on stealing money
from a victims bank account, even though the functionality can more generally
be described as versatile information stealers with backdoor functionalities to
create botnets. These are also capable of sending e-mail and instant-messaging
spam, installing additional malware on the victims system and executing dis-
tributed denial-of-service attacks. The technologies used by recent variants to
hijack the system enable cybercriminals to ex...

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


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

Output:
安全论文分析：

title:Feature-Indistinguishable Attack to Circumvent Trapdoor-Enabled Defense
author:Chaoxiang He and
Bin Benjamin Zhu and
Xiaojing Ma and
Hai Jin and
Shengshan Hu
Feature-Indistinguishable Aack to Circumvent
Trapdoor-Enabled Defense
Chaoxiang He∗
Huazhong Univ. of Science and Tech.
hechaoxiang@hust.edu.cn
Bin Benjamin Zhu
Microsoft Research Asia
binzhu@microsoft.com
Xiaojing Ma†∗
Huazhong Univ. of Science and Tech.
lindahust@hust.edu.cn
Hai Jin∗
Shengshan Hu∗
Huazhong Univ. of Science and Tech.
Huazhong Univ. of Science and Tech.
hjin@hust.edu.cn
hushengshan@hust.edu.cn
ABSTRACT
Deep neural networks (DNNs) are vulnerable to adversarial attacks.
A great eort has been directed to developing eective defenses
against adversarial attacks and nding vulnerabilities of proposed
defenses. A recently proposed defense called Trapdoor-enabled De-
tection (TeD) [51] deliberately injects trapdoors into DNN models
to trap and detect adversarial examples targeting categories pro-
tected by TeD. TeD can eectively detect existing state-of-the-art
adversarial attacks. In this paper, we propose a novel black-box
adversarial attack on TeD, called Feature-Indistinguishable Attack
(FIA). It circumvents TeD by crafting adversarial examples indistin-
guishable in the feature (i.e., neuron-activation) space from benign
examples in the target category. To achieve this goal, FIA jointly
minimizes the distance to the expectation of feature representa-
tions of benign samples in the target category and maximizes the
distances to positive adversarial examples generated to query TeD
in the preparation phase. A constraint is used to ensure that the
feature vector of a generated adversarial example is within the
distribution of feature vectors of benign examples in the target
category. Our extensive empirical evaluation with dierent cong-
urations and variants of TeD indicates that our proposed FIA can
eectively circumvent TeD. FIA opens a door for developing much
more powerful adversarial attacks....


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

Input:
title:Feature-Indistinguishable Attack to Circumvent Trapdoor-Enabled Defense
author:Chaoxiang He and
Bin Benjamin Zhu and
Xiaojing Ma and
Hai Jin and
Shengshan Hu
Feature-Indistinguishable Aack to Circumvent
Trapdoor-Enabled Defense
Chaoxiang He∗
Huazhong Univ. of Science and Tech.
hechaoxiang@hust.edu.cn
Bin Benjamin Zhu
Microsoft Research Asia
binzhu@microsoft.com
Xiaojing Ma†∗
Huazhong Univ. of Science and Tech.
lindahust@hust.edu.cn
Hai Jin∗
Shengshan Hu∗
Huazhong Univ. of Science and Tech.
Huazhong Univ. of Science and Tech.
hjin@hust.edu.cn
hushengshan@hust.edu.cn
ABSTRACT
Deep neural networks (DNNs) are vulnerable to adversarial attacks.
A great eort has been directed to developing eective defenses
against adversarial attacks and nding vulnerabilities of proposed
defenses. A recently proposed defense called Trapdoor-enabled De-
tection (TeD) [51] deliberately injects trapdoors into DNN models
to trap and detect adversarial examples targeting categories pro-
tected by TeD. TeD can eectively detect existing state-of-the-art
adversarial attacks. In this paper, we propose a novel black-box
adversarial attack on TeD, called Feature-Indistinguishable Attack
(FIA). It circumvents TeD by crafting adversarial examples indistin-
guishable in the feature (i.e., neuron-activation) space from benign
examples in the target category. To achieve this goal, FIA jointly
minimizes the distance to the expectation of feature representa-
tions of benign samples in the target category and maximizes the
distances to positive adversarial examples generated to query TeD
in the preparation phase. A constraint is used to ensure that the
feature vector of a generated adversarial example is within the
distribution of feature vectors of benign examples in the target
category. Our extensive empirical evaluation with dierent cong-
urations and variants of TeD indicates that our proposed FIA can
eectively circumvent TeD. FIA opens a door for developing much
more powerful adversarial attacks....

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


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

Output:
安全论文分析：

title:Estimating flow distributions from sampled flow statistics
author:Nick G. Duffield and
Carsten Lund and
Mikkel Thorup
Estimating Flow Distributions from Sampled Flow
Statistics
Nick Dufﬁeld
AT&T Labs—Research
180 Park Avenue
Florham Park, NJ 07932, USA
dufﬁeld@research.att.com
Florham Park, NJ 07932, USA
lund@research.att.com
Carsten Lund
AT&T Labs—Research
180 Park Avenue
Mikkel Thorup
AT&T Labs—Research
180 Park Avenue
Florham Park, NJ 07932, USA
mthorup@research.att.com
ABSTRACT
Passive trafﬁc measurement increasingly employs sampling at the
packet level. Many high-end routers form ﬂow statistics from a
sampled substream of packets. Sampling is necessary in order to
control the consumption of resources by the measurement opera-
tions. However, knowledge of the statistics of ﬂows in the unsam-
pled stream remains useful, for understanding both characteristics
of source trafﬁc, and consumption of resources in the network.
This paper provide methods that use ﬂow statistics formed from
sampled packet stream to infer the absolute frequencies of lengths
of ﬂows in the unsampled stream. A key part of our work is infer-
ring the numbers and lengths of ﬂows of original trafﬁc that evaded
sampling altogether. We achieve this through statistical inference,
and by exploiting protocol level detail reported in ﬂow records. The
method has applications to detection and characterization of net-
work attacks: we show how to estimate, from sampled ﬂow statis-
tics, the number of compromised hosts that are sending attack traf-
ﬁc past the measurement point. We also investigate the impact on
our results of different implementations of packet sampling.
Categories and Subject Descriptors
C.2.3 [Computer–Communications Networks]: Network Opera-
tions—Network monitoring; G.3 [Probability and Statistics]
General Terms
Measurement, Theory
Keywords
Packet Sampling, IP Flows, Maximum Likelihood Estimation
INTRODUCTION
1.
1.1 Motivation and Challenges
Passive trafﬁc measurement increasi...


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

Input:
title:Estimating flow distributions from sampled flow statistics
author:Nick G. Duffield and
Carsten Lund and
Mikkel Thorup
Estimating Flow Distributions from Sampled Flow
Statistics
Nick Dufﬁeld
AT&T Labs—Research
180 Park Avenue
Florham Park, NJ 07932, USA
dufﬁeld@research.att.com
Florham Park, NJ 07932, USA
lund@research.att.com
Carsten Lund
AT&T Labs—Research
180 Park Avenue
Mikkel Thorup
AT&T Labs—Research
180 Park Avenue
Florham Park, NJ 07932, USA
mthorup@research.att.com
ABSTRACT
Passive trafﬁc measurement increasingly employs sampling at the
packet level. Many high-end routers form ﬂow statistics from a
sampled substream of packets. Sampling is necessary in order to
control the consumption of resources by the measurement opera-
tions. However, knowledge of the statistics of ﬂows in the unsam-
pled stream remains useful, for understanding both characteristics
of source trafﬁc, and consumption of resources in the network.
This paper provide methods that use ﬂow statistics formed from
sampled packet stream to infer the absolute frequencies of lengths
of ﬂows in the unsampled stream. A key part of our work is infer-
ring the numbers and lengths of ﬂows of original trafﬁc that evaded
sampling altogether. We achieve this through statistical inference,
and by exploiting protocol level detail reported in ﬂow records. The
method has applications to detection and characterization of net-
work attacks: we show how to estimate, from sampled ﬂow statis-
tics, the number of compromised hosts that are sending attack traf-
ﬁc past the measurement point. We also investigate the impact on
our results of different implementations of packet sampling.
Categories and Subject Descriptors
C.2.3 [Computer–Communications Networks]: Network Opera-
tions—Network monitoring; G.3 [Probability and Statistics]
General Terms
Measurement, Theory
Keywords
Packet Sampling, IP Flows, Maximum Likelihood Estimation
INTRODUCTION
1.
1.1 Motivation and Challenges
Passive trafﬁc measurement increasi...

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


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

Output:
安全论文分析：

title:Hardware enhanced security
author:Ruby B. Lee and
Simha Sethumadhavan and
G. Edward Suh
Ruby Lee
Princeton, NJ
Princeton University
rblee@princeton.edu
Simha Sethumadhavan
Columbia University
New York NY
simha@cs.columbia.edu
Hardware Enhanced Security
G. Edward Suh
Cornell University
Ithaca, NY
suh@csl.cornell.edu
system
secure  computing
ABSTRACT
Building  a
requires  careful
coordination  among  all  layers  in  the  system  from  hardware  to
software.  Even  if  secure  by  itself,  a  higher  layer  protection
mechanism  may  be  bypassed  if  lower  layer  software  or
hardware  is  vulnerable.  Additionally,  hardware  complements
software  through  its  efficiency,  tamper  resistance,  etc.  There
have been significant efforts recently in hardware communities
that  aim  to  leverage  hardware  strengths  to  secure  software
layers, and also to secure hardware itself. This tutorial presents
some  of  these  hardware-enhanced  security  techniques  to  the
security community.
Categories and Subject Descriptors
C.0  [General]:  System  Architectures;  K.6.5  [Management  of
Computing  and
Information  Systems]:  Security  and
Protection
General Terms
Security, Design
Keywords
Hardware  security,  Hardware  Trojan,  Side  channel  attacks,
Secure processors, PUF, Secure cloud computing.
1.  INTRODUCTION
Current security research is largely oriented to top-down design
where
the
network/application  layers,  are  first  studied  assuming  that  the
lower  layers  are  secure,  even  when  they  are  not.  The  lower
layers are studied only when new threats appear at those layers.
Security has thus become, as the cliché goes, an arms race to the
bottom.    There  are  many  examples  in  the  literature  of  lower-
layer  attacks  including  those  that  target  anti-virus  scanners,
libraries, OS, hypervisors, and even code stored in non-volatile
ROM. For every software mitigation strategy, vulnerabilities a...


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

Input:
title:Hardware enhanced security
author:Ruby B. Lee and
Simha Sethumadhavan and
G. Edward Suh
Ruby Lee
Princeton, NJ
Princeton University
rblee@princeton.edu
Simha Sethumadhavan
Columbia University
New York NY
simha@cs.columbia.edu
Hardware Enhanced Security
G. Edward Suh
Cornell University
Ithaca, NY
suh@csl.cornell.edu
system
secure  computing
ABSTRACT
Building  a
requires  careful
coordination  among  all  layers  in  the  system  from  hardware  to
software.  Even  if  secure  by  itself,  a  higher  layer  protection
mechanism  may  be  bypassed  if  lower  layer  software  or
hardware  is  vulnerable.  Additionally,  hardware  complements
software  through  its  efficiency,  tamper  resistance,  etc.  There
have been significant efforts recently in hardware communities
that  aim  to  leverage  hardware  strengths  to  secure  software
layers, and also to secure hardware itself. This tutorial presents
some  of  these  hardware-enhanced  security  techniques  to  the
security community.
Categories and Subject Descriptors
C.0  [General]:  System  Architectures;  K.6.5  [Management  of
Computing  and
Information  Systems]:  Security  and
Protection
General Terms
Security, Design
Keywords
Hardware  security,  Hardware  Trojan,  Side  channel  attacks,
Secure processors, PUF, Secure cloud computing.
1.  INTRODUCTION
Current security research is largely oriented to top-down design
where
the
network/application  layers,  are  first  studied  assuming  that  the
lower  layers  are  secure,  even  when  they  are  not.  The  lower
layers are studied only when new threats appear at those layers.
Security has thus become, as the cliché goes, an arms race to the
bottom.    There  are  many  examples  in  the  literature  of  lower-
layer  attacks  including  those  that  target  anti-virus  scanners,
libraries, OS, hypervisors, and even code stored in non-volatile
ROM. For every software mitigation strategy, vulnerabilities a...

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


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

Output:
安全论文分析：

title:Run-time Monitoring and Formal Analysis of Information Flows in Chromium
author:Lujo Bauer and
Shaoying Cai and
Limin Jia and
Timothy Passaro and
Michael Stroucken and
Yuan Tian
Run-time Monitoring and Formal Analysis
of Information Flows in Chromium
Lujo Bauer
Limin Jia
Timothy Passaro Michael Stroucken Yuan Tian
Shaoying Cai(cid:63)
{lbauer,liminjia,tpassaro,mxs,yt}@cmu.edu
Carnegie Mellon University
(cid:63)Institute for Infocomm Research
(cid:63)cais@i2r.a-star.edu.sg
Abstract—Web browsers are a key enabler of a wide range
of online services, from shopping and email to banking and
health services. Because these services frequently involve handling
sensitive data, a wide range of web browser security policies and
mechanisms has been implemented or proposed to mitigate the
dangers posed by malicious code and sites.
This paper describes an approach for specifying and en-
forcing ﬂexible information-ﬂow policies on the Chromium web
browser. Complementing efforts that focus on information-ﬂow
enforcement on JavaScript, our approach focuses on an existing
browser and encompasses a broad range of browser features,
from pages and scripts to DOM elements, events, persistent state,
and extensions. In our approach, which is a coarse-grained,
light-weight implementation of taint tracking, entities in the
browser are annotated with information-ﬂow labels that specify
policy and track information ﬂows. We develop a detailed formal
model of our approach, for which we prove noninterference. We
also develop a corresponding prototype system built on top of
Chromium. We demonstrate, and experimentally conﬁrm, that
the system can enforce many existing browser policies, as well as
practically useful policies beyond those enforceable in standard
web browsers.
I.
INTRODUCTION
Web browsers are used to access a wide range of services—
from shopping and email to banking, health services, and
document editing. While bringing about increased convenience
and productivity,
the continui...


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

Input:
title:Run-time Monitoring and Formal Analysis of Information Flows in Chromium
author:Lujo Bauer and
Shaoying Cai and
Limin Jia and
Timothy Passaro and
Michael Stroucken and
Yuan Tian
Run-time Monitoring and Formal Analysis
of Information Flows in Chromium
Lujo Bauer
Limin Jia
Timothy Passaro Michael Stroucken Yuan Tian
Shaoying Cai(cid:63)
{lbauer,liminjia,tpassaro,mxs,yt}@cmu.edu
Carnegie Mellon University
(cid:63)Institute for Infocomm Research
(cid:63)cais@i2r.a-star.edu.sg
Abstract—Web browsers are a key enabler of a wide range
of online services, from shopping and email to banking and
health services. Because these services frequently involve handling
sensitive data, a wide range of web browser security policies and
mechanisms has been implemented or proposed to mitigate the
dangers posed by malicious code and sites.
This paper describes an approach for specifying and en-
forcing ﬂexible information-ﬂow policies on the Chromium web
browser. Complementing efforts that focus on information-ﬂow
enforcement on JavaScript, our approach focuses on an existing
browser and encompasses a broad range of browser features,
from pages and scripts to DOM elements, events, persistent state,
and extensions. In our approach, which is a coarse-grained,
light-weight implementation of taint tracking, entities in the
browser are annotated with information-ﬂow labels that specify
policy and track information ﬂows. We develop a detailed formal
model of our approach, for which we prove noninterference. We
also develop a corresponding prototype system built on top of
Chromium. We demonstrate, and experimentally conﬁrm, that
the system can enforce many existing browser policies, as well as
practically useful policies beyond those enforceable in standard
web browsers.
I.
INTRODUCTION
Web browsers are used to access a wide range of services—
from shopping and email to banking, health services, and
document editing. While bringing about increased convenience
and productivity,
the continui...

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


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

Output:
安全论文分析：

title:TopoShot: uncovering Ethereum's network topology leveraging replacement
transactions
author:Kai Li and
Yuzhe Tang and
Jiaqi Chen and
Yibo Wang and
Xianghong Liu
TopoShot: Uncovering Ethereum’s Network Topology
Leveraging Replacement Transactions
Kai Li
kli111@syr.edu
Syracuse University
Syracuse, NY, USA
Yuzhe Tang
ytang100@syr.edu
Syracuse University
Syracuse, NY, USA
Jiaqi Chen
jchen217@syr.edu
Syracuse University
Syracuse, NY, USA
Yibo Wang
ywang349@syr.edu
Syracuse University
Syracuse, NY, USA
Xianghong Liu
xliu317@syr.edu
Syracuse University
Syracuse, NY, USA
ABSTRACT
Ethereum relies on a peer-to-peer overlay network to propagate
information. The knowledge of Ethereum network topology holds
the key to understanding Ethereum’s security, availability, and user
anonymity. However, an Ethereum network’s topology is stored in
individual nodes’ internal routing tables, measuring which poses
challenges and remains an open research problem in the existing
literature.
This paper presents TopoShot, a new method uniquely repur-
posing Ethereum’s transaction replacement/eviction policies for
topology measurement. TopoShot can be configured to support
Geth, Parity and other major Ethereum clients. As validated on
local nodes, TopoShot achieves 100% measurement precision and
high recall (88% ∼ 97%). To efficiently measure the large Ethereum
networks in the wild, we propose a non-trivial schedule to run
pair-wise measurements in parallel. To enable ethical measurement
on Ethereum mainnet, we propose workload-adaptive configura-
tions of TopoShot to minimize the service interruption to target
nodes/network.
We systematically measure a variety of Ethereum networks and
obtain new knowledge including the full-network topology in ma-
jor testnets (Ropsten, Rinkeby and Goerli) and critical sub-network
topology in the mainnet. The results on testnets show interest-
ing graph-theoretic properties, such as all testnets exhibit graph
modularity significantly lower than random g...


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

Input:
title:TopoShot: uncovering Ethereum's network topology leveraging replacement
transactions
author:Kai Li and
Yuzhe Tang and
Jiaqi Chen and
Yibo Wang and
Xianghong Liu
TopoShot: Uncovering Ethereum’s Network Topology
Leveraging Replacement Transactions
Kai Li
kli111@syr.edu
Syracuse University
Syracuse, NY, USA
Yuzhe Tang
ytang100@syr.edu
Syracuse University
Syracuse, NY, USA
Jiaqi Chen
jchen217@syr.edu
Syracuse University
Syracuse, NY, USA
Yibo Wang
ywang349@syr.edu
Syracuse University
Syracuse, NY, USA
Xianghong Liu
xliu317@syr.edu
Syracuse University
Syracuse, NY, USA
ABSTRACT
Ethereum relies on a peer-to-peer overlay network to propagate
information. The knowledge of Ethereum network topology holds
the key to understanding Ethereum’s security, availability, and user
anonymity. However, an Ethereum network’s topology is stored in
individual nodes’ internal routing tables, measuring which poses
challenges and remains an open research problem in the existing
literature.
This paper presents TopoShot, a new method uniquely repur-
posing Ethereum’s transaction replacement/eviction policies for
topology measurement. TopoShot can be configured to support
Geth, Parity and other major Ethereum clients. As validated on
local nodes, TopoShot achieves 100% measurement precision and
high recall (88% ∼ 97%). To efficiently measure the large Ethereum
networks in the wild, we propose a non-trivial schedule to run
pair-wise measurements in parallel. To enable ethical measurement
on Ethereum mainnet, we propose workload-adaptive configura-
tions of TopoShot to minimize the service interruption to target
nodes/network.
We systematically measure a variety of Ethereum networks and
obtain new knowledge including the full-network topology in ma-
jor testnets (Ropsten, Rinkeby and Goerli) and critical sub-network
topology in the mainnet. The results on testnets show interest-
ing graph-theoretic properties, such as all testnets exhibit graph
modularity significantly lower than random g...

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


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

Output:
安全论文分析：

title:Demonstrating a Tool for Injection Attack Prevention in MySQL
author:Iberia Medeiros and
Miguel Beatriz and
Nuno Ferreira Neves and
Miguel Correia
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Demonstrating a Tool for Injection Attack
Prevention in MySQL
Ib´eria Medeiros1
Miguel Beatriz2
1LaSIGE, Faculdade de Ciˆencias, Universidade de Lisboa, Portugal
2INESC-ID, Instituto Superior T´ecnico, Universidade de Lisboa, Portugal
Nuno Neves1
Miguel Correia2
imedeiros@di.fc.ul.pt, miguel.beatriz@tecnico.ulisboa.pt, nuno@di.fc.ul.pt, miguel.p.correia@tecnico.ulisboa.pt
Abstract—Despite the signiﬁcant efforts put in building more
secure web applications, cases of high impact breaches continue
to appear. Vulnerabilities in web applications are often created
due to inconsistencies in the way SQL queries are believed to be
run and the way they are actually executed by a Database Man-
agement System (DBMS). This paper presents a demonstration of
SEPTIC, a mechanism that detects and blocks injection attacks
inside the DBMS. The demonstration considers a scenario of a
non-trivial PHP web application, backed by a MySQL DBMS,
which was modiﬁed to include SEPTIC. It presents how SEPTIC
blocks injection attacks without compromising the application
correctness and performance. In addition, SEPTIC is compared
to alternative approaches, such as sanitizations carried out with
standard functions provided language and a web application
ﬁrewall.
Keywords—Web applications; injection attacks; DBMS; soft-
ware security; runtime protection; security.
I.
INTRODUCTION
Despite all effort put in building more secure web appli-
cations, cases of high impact breaches continue to appear. In
fact, the number of web application attacks increased by 26%
in the ﬁrst quarter of 2016 [21], 87% of which were SQL
injection attacks (SQLI). SQLI attacks are performed with
different aims, often for extracting information from databases.
For example, recently, they ma...


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

Input:
title:Demonstrating a Tool for Injection Attack Prevention in MySQL
author:Iberia Medeiros and
Miguel Beatriz and
Nuno Ferreira Neves and
Miguel Correia
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Demonstrating a Tool for Injection Attack
Prevention in MySQL
Ib´eria Medeiros1
Miguel Beatriz2
1LaSIGE, Faculdade de Ciˆencias, Universidade de Lisboa, Portugal
2INESC-ID, Instituto Superior T´ecnico, Universidade de Lisboa, Portugal
Nuno Neves1
Miguel Correia2
imedeiros@di.fc.ul.pt, miguel.beatriz@tecnico.ulisboa.pt, nuno@di.fc.ul.pt, miguel.p.correia@tecnico.ulisboa.pt
Abstract—Despite the signiﬁcant efforts put in building more
secure web applications, cases of high impact breaches continue
to appear. Vulnerabilities in web applications are often created
due to inconsistencies in the way SQL queries are believed to be
run and the way they are actually executed by a Database Man-
agement System (DBMS). This paper presents a demonstration of
SEPTIC, a mechanism that detects and blocks injection attacks
inside the DBMS. The demonstration considers a scenario of a
non-trivial PHP web application, backed by a MySQL DBMS,
which was modiﬁed to include SEPTIC. It presents how SEPTIC
blocks injection attacks without compromising the application
correctness and performance. In addition, SEPTIC is compared
to alternative approaches, such as sanitizations carried out with
standard functions provided language and a web application
ﬁrewall.
Keywords—Web applications; injection attacks; DBMS; soft-
ware security; runtime protection; security.
I.
INTRODUCTION
Despite all effort put in building more secure web appli-
cations, cases of high impact breaches continue to appear. In
fact, the number of web application attacks increased by 26%
in the ﬁrst quarter of 2016 [21], 87% of which were SQL
injection attacks (SQLI). SQLI attacks are performed with
different aims, often for extracting information from databases.
For example, recently, they ma...

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


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

Output:
安全论文分析：

title:Leveraging Hardware Transactional Memory for Cache Side-Channel Defenses
author:Sanchuan Chen and
Fangfei Liu and
Zeyu Mi and
Yinqian Zhang and
Ruby B. Lee and
Haibo Chen and
XiaoFeng Wang
Leveraging Hardware Transactional Memory for Cache
Side-Channel Defenses
Fangfei Liu
Zeyu Mi
Sanchuan Chen
The Ohio State University
chen.4825@osu.edu
Intel Corporation
fangfei.liu@intel.com
Shanghai Jiao Tong
University
yzmizeyu@gmail.com
Yinqian Zhang
The Ohio State University
yinqian@cse.ohio-state.
edu
Ruby B. Lee
Princeton University
rblee@princeton.edu
Haibo Chen
Shanghai Jiao Tong
University
haibochen@sjtu.edu.cn
XiaoFeng Wang
Indiana University at
Bloomington
xw7@indiana.edu
ABSTRACT
A program’s use of CPU caches may reveal its memory access
pattern and thus leak sensitive information when the program
performs secret-dependent memory accesses. In recent studies, it
has been demonstrated that cache side-channel attacks that ex-
tract secrets by observing the victim program’s cache uses can be
conducted under a variety of scenarios, among which the most con-
cerning are cross-VM attacks and those against SGX enclaves. In
this paper, we propose a mechanism that leverages hardware trans-
actional memory (HTM) to enable software programs to defend
themselves against various cache side-channel attacks. We observe
that when the HTM is implemented by retrofitting cache coherence
protocols, as is the case of Intel’s Transactional Synchronization
Extensions, the cache interference that is necessary in cache side-
channel attacks will inevitably terminate hardware transactions.
We provide a systematic analysis of the security requirements that
a software-only solution must meet to defeat cache attacks, propose
a software design that leverages HTM to satisfy these requirements
and devise several optimization techniques in our implementation
to reduce performance impact caused by transaction aborts. The em-
pirical evaluation suggests that the performance overhead caused
by the H...


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

Input:
title:Leveraging Hardware Transactional Memory for Cache Side-Channel Defenses
author:Sanchuan Chen and
Fangfei Liu and
Zeyu Mi and
Yinqian Zhang and
Ruby B. Lee and
Haibo Chen and
XiaoFeng Wang
Leveraging Hardware Transactional Memory for Cache
Side-Channel Defenses
Fangfei Liu
Zeyu Mi
Sanchuan Chen
The Ohio State University
chen.4825@osu.edu
Intel Corporation
fangfei.liu@intel.com
Shanghai Jiao Tong
University
yzmizeyu@gmail.com
Yinqian Zhang
The Ohio State University
yinqian@cse.ohio-state.
edu
Ruby B. Lee
Princeton University
rblee@princeton.edu
Haibo Chen
Shanghai Jiao Tong
University
haibochen@sjtu.edu.cn
XiaoFeng Wang
Indiana University at
Bloomington
xw7@indiana.edu
ABSTRACT
A program’s use of CPU caches may reveal its memory access
pattern and thus leak sensitive information when the program
performs secret-dependent memory accesses. In recent studies, it
has been demonstrated that cache side-channel attacks that ex-
tract secrets by observing the victim program’s cache uses can be
conducted under a variety of scenarios, among which the most con-
cerning are cross-VM attacks and those against SGX enclaves. In
this paper, we propose a mechanism that leverages hardware trans-
actional memory (HTM) to enable software programs to defend
themselves against various cache side-channel attacks. We observe
that when the HTM is implemented by retrofitting cache coherence
protocols, as is the case of Intel’s Transactional Synchronization
Extensions, the cache interference that is necessary in cache side-
channel attacks will inevitably terminate hardware transactions.
We provide a systematic analysis of the security requirements that
a software-only solution must meet to defeat cache attacks, propose
a software design that leverages HTM to satisfy these requirements
and devise several optimization techniques in our implementation
to reduce performance impact caused by transaction aborts. The em-
pirical evaluation suggests that the performance overhead caused
by the H...

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


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

Output:
安全论文分析：

title:Voiceprint: A Novel Sybil Attack Detection Method Based on RSSI
for VANETs
author:Yuan Yao and
Bin Xiao and
Gaofei Wu and
Xue Liu and
Zhiwen Yu and
Kailong Zhang and
Xingshe Zhou
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Voiceprint: A Novel Sybil Attack Detection Method
Based on RSSI for VANETs
Yuan Yao∗†, Bin Xiao†, Gaofei Wu∗, Xue Liu‡, Zhiwen Yu∗, Kailong Zhang∗ and Xingshe Zhou∗
∗School of Computer Science, Northwestern Polytechnical University, China
†Department of Computing, Hong Kong Polytechnic University, Hong Kong
‡School of Computer Science, McGill University, Canada
yuanyao8539@gmail.com;csbxiao@comp.polyu.edu.hk;gaofeiwu@nwpu.edu.cn;
xueliu@cs.mcgill.ca;{zhiwenyu, kl.zhang, xszhou}@nwpu.edu.cn
Abstract—Vehicular Ad Hoc Networks
(VANETs) enable
vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) com-
munications that bring many beneﬁts and conveniences to
improve the road safety and drive comfort in future trans-
portation systems. Sybil attack is considered one of the most
risky threats in VANETs since a Sybil attacker can generate
multiple fake identities with false messages to severely impair
the normal functions of safety-related applications. In this paper,
we propose a novel Sybil attack detection method based on
Received Signal Strength Indicator (RSSI), Voiceprint, to conduct
a widely applicable, lightweight and full-distributed detection for
VANETs. To avoid the inaccurate position estimation according
to predeﬁned radio propagation models in previous RSSI-based
detection methods, Voiceprint adopts the RSSI time series as
the vehicular speech and compares the similarity among all
received time series. Voiceprint does not rely on any predeﬁned
radio propagation model, and conducts independent detection
without the support of the centralized infrastructure. It has
more accurate detection rate in different dynamic environments.
Extensive simulations and real-world experiments demonstrate
t...


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

Input:
title:Voiceprint: A Novel Sybil Attack Detection Method Based on RSSI
for VANETs
author:Yuan Yao and
Bin Xiao and
Gaofei Wu and
Xue Liu and
Zhiwen Yu and
Kailong Zhang and
Xingshe Zhou
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Voiceprint: A Novel Sybil Attack Detection Method
Based on RSSI for VANETs
Yuan Yao∗†, Bin Xiao†, Gaofei Wu∗, Xue Liu‡, Zhiwen Yu∗, Kailong Zhang∗ and Xingshe Zhou∗
∗School of Computer Science, Northwestern Polytechnical University, China
†Department of Computing, Hong Kong Polytechnic University, Hong Kong
‡School of Computer Science, McGill University, Canada
yuanyao8539@gmail.com;csbxiao@comp.polyu.edu.hk;gaofeiwu@nwpu.edu.cn;
xueliu@cs.mcgill.ca;{zhiwenyu, kl.zhang, xszhou}@nwpu.edu.cn
Abstract—Vehicular Ad Hoc Networks
(VANETs) enable
vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) com-
munications that bring many beneﬁts and conveniences to
improve the road safety and drive comfort in future trans-
portation systems. Sybil attack is considered one of the most
risky threats in VANETs since a Sybil attacker can generate
multiple fake identities with false messages to severely impair
the normal functions of safety-related applications. In this paper,
we propose a novel Sybil attack detection method based on
Received Signal Strength Indicator (RSSI), Voiceprint, to conduct
a widely applicable, lightweight and full-distributed detection for
VANETs. To avoid the inaccurate position estimation according
to predeﬁned radio propagation models in previous RSSI-based
detection methods, Voiceprint adopts the RSSI time series as
the vehicular speech and compares the similarity among all
received time series. Voiceprint does not rely on any predeﬁned
radio propagation model, and conducts independent detection
without the support of the centralized infrastructure. It has
more accurate detection rate in different dynamic environments.
Extensive simulations and real-world experiments demonstrate
t...

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


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

Output:
安全论文分析：

title:Information Flow in the Peer-Reviewing Process
author:Michael Backes and
Markus D"urmuth and
Dominique Unruh
Information Flow in the Peer-Reviewing Process (Extended Abstract)
Michael Backes, Markus D¨urmuth, Dominique Unruh
Saarland University
{backes,duermuth,unruh}@cs.uni-sb.de
Abstract
1.1. The Electronic Publishing Process
We investigate a new type of information ﬂow in the
electronic publishing process. We show that the use of
PostScript in this process introduces serious conﬁdential-
ity issues.
In particular, we explain how the reviewer’s
anonymity in the peer-reviewing process can be compro-
mised by maliciously prepared PostScript documents. A
demonstration of this attack is available. We brieﬂy discuss
how this attack can be extended to other document formats
as well.
To elaborate on our attack, let us ﬁrst consider the infor-
mation ﬂow that naturally appears in the electronic publish-
ing process. Usually, the user Alice prepares a document
on computer A. Then this document is transferred, e.g., by
email, to the computer B of user Bob. Finally, Bob reads
the document as rendered by computer B (on screen or by
printing it). The information ﬂow of this process is depicted
by the solid arrows in Figure 1 (a).
1. Introduction
The PostScript language [12] and its successor PDF
(Portable Document Format) are the de-facto standards for
electronic publishing. Despite PostScript being the older
standard, its availability on virtually any platform and its
support on a number of printers makes it still widely de-
ployed, in particular in scientiﬁc publishing.
It is well-
known that PostScript is a Turing-complete programming
language, and it also comprises commands to access the ﬁle
system. Some enthusiasts have even implemented a web
server [14] or an HTML renderer [6] in PostScript.
In 1992 the community involved in developing the
GhostScript interpreter realized that this comprehensive
set of commands rises security issues when processing
PostScript ...


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

Input:
title:Information Flow in the Peer-Reviewing Process
author:Michael Backes and
Markus D"urmuth and
Dominique Unruh
Information Flow in the Peer-Reviewing Process (Extended Abstract)
Michael Backes, Markus D¨urmuth, Dominique Unruh
Saarland University
{backes,duermuth,unruh}@cs.uni-sb.de
Abstract
1.1. The Electronic Publishing Process
We investigate a new type of information ﬂow in the
electronic publishing process. We show that the use of
PostScript in this process introduces serious conﬁdential-
ity issues.
In particular, we explain how the reviewer’s
anonymity in the peer-reviewing process can be compro-
mised by maliciously prepared PostScript documents. A
demonstration of this attack is available. We brieﬂy discuss
how this attack can be extended to other document formats
as well.
To elaborate on our attack, let us ﬁrst consider the infor-
mation ﬂow that naturally appears in the electronic publish-
ing process. Usually, the user Alice prepares a document
on computer A. Then this document is transferred, e.g., by
email, to the computer B of user Bob. Finally, Bob reads
the document as rendered by computer B (on screen or by
printing it). The information ﬂow of this process is depicted
by the solid arrows in Figure 1 (a).
1. Introduction
The PostScript language [12] and its successor PDF
(Portable Document Format) are the de-facto standards for
electronic publishing. Despite PostScript being the older
standard, its availability on virtually any platform and its
support on a number of printers makes it still widely de-
ployed, in particular in scientiﬁc publishing.
It is well-
known that PostScript is a Turing-complete programming
language, and it also comprises commands to access the ﬁle
system. Some enthusiasts have even implemented a web
server [14] or an HTML renderer [6] in PostScript.
In 1992 the community involved in developing the
GhostScript interpreter realized that this comprehensive
set of commands rises security issues when processing
PostScript ...

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


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

Output:
安全论文分析：

title:Characterizing roles of front-end servers in end-to-end performance
of dynamic content distribution
author:Yingying Chen and
Sourabh Jain and
Vijay Kumar Adhikari and
Zhi-Li Zhang
Characterizing Roles of Front-end Servers in End-to-End
Performance of Dynamic Content Distribution
Yingying Chen, Sourabh Jain, Vijay Kumar Adhikari, Zhi-Li Zhang
Department of Computer Science & Engineering
University of Minnesota - Twin Cities
Minneapolis, MN 55414, USA
{yingying,sourj,viadhi,zhzhang}@cs.umn.edu
ABSTRACT
This paper investigates the roles of front-end (proxy) servers
in improving user-perceived performance of dynamic con-
tent distribution. Using Bing and Google search services
as two case studies, we perform extensive network measure-
ment and analysis to understand several key factors that
aﬀect the overall user-perceived performance.
In particu-
lar, we develop a simple model-based inference framework
to indirectly measure and quantify the (directly unobserv-
able) “frontend-to-backend fetching time” comprised of the
query processing time at back-end data centers and the de-
livery time between the back-end data centers and front-end
servers. We show that this fetching time plays a critical role
in the end-to-end performance of dynamic content delivery.
Categories and Subject Descriptors
C.4 [Performance of Systems]: Performance attributes
General Terms
Measurement, Performance
Keywords
Dynamic content distribution, Search service, TCP-splitting
1.
INTRODUCTION
More and more content on the Internet is now stored at
powerful, large-scale data centers in the cloud. A signiﬁ-
cant portion of this content is dynamic in that in response
to a user’s request for content, the content returned to her
is generated dynamically and sometimes personalized. Web
search is one common example of such dynamic content gen-
eration. With the emergence of cloud computing and cloud-
based services, we expect that more data will be stored in
the cloud, and more dynamic content will be...


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

Input:
title:Characterizing roles of front-end servers in end-to-end performance
of dynamic content distribution
author:Yingying Chen and
Sourabh Jain and
Vijay Kumar Adhikari and
Zhi-Li Zhang
Characterizing Roles of Front-end Servers in End-to-End
Performance of Dynamic Content Distribution
Yingying Chen, Sourabh Jain, Vijay Kumar Adhikari, Zhi-Li Zhang
Department of Computer Science & Engineering
University of Minnesota - Twin Cities
Minneapolis, MN 55414, USA
{yingying,sourj,viadhi,zhzhang}@cs.umn.edu
ABSTRACT
This paper investigates the roles of front-end (proxy) servers
in improving user-perceived performance of dynamic con-
tent distribution. Using Bing and Google search services
as two case studies, we perform extensive network measure-
ment and analysis to understand several key factors that
aﬀect the overall user-perceived performance.
In particu-
lar, we develop a simple model-based inference framework
to indirectly measure and quantify the (directly unobserv-
able) “frontend-to-backend fetching time” comprised of the
query processing time at back-end data centers and the de-
livery time between the back-end data centers and front-end
servers. We show that this fetching time plays a critical role
in the end-to-end performance of dynamic content delivery.
Categories and Subject Descriptors
C.4 [Performance of Systems]: Performance attributes
General Terms
Measurement, Performance
Keywords
Dynamic content distribution, Search service, TCP-splitting
1.
INTRODUCTION
More and more content on the Internet is now stored at
powerful, large-scale data centers in the cloud. A signiﬁ-
cant portion of this content is dynamic in that in response
to a user’s request for content, the content returned to her
is generated dynamically and sometimes personalized. Web
search is one common example of such dynamic content gen-
eration. With the emergence of cloud computing and cloud-
based services, we expect that more data will be stored in
the cloud, and more dynamic content will be...

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


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

Output:
安全论文分析：

title:Routing around decoys
author:Max Schuchard and
John Geddes and
Christopher Thompson and
Nicholas Hopper
Routing Around Decoys
Max Schuchard1
schuch@cs.umn.edu
John Geddes1
geddes@cs.umn.edu
Christopher Thompson2
cthompson@cs.berkeley.edu
Nicholas Hopper1
hopper@cs.umn.edu
1: Department of Computer Science and Engineering, University of Minnesota, Twin Cities
2: Department of Electrical Engineering and Computer Science, University of California, Berkeley
ABSTRACT
Decoy Routing is a new approach to Internet censorship circum-
vention that was recently and independently proposed at FOCI’11,
USENIX Security’11 and CCS’11. Decoy routing aims to ham-
per nation-state level Internet censorship by having routers, rather
than end hosts, relay trafﬁc to blocked destinations. We analyze
the security of these schemes against a routing capable adversary,
a censoring authority that is willing to make routing decisions in
response to decoy routing systems.
We explore China, Syria, Iran, and Egypt as routing capable ad-
versaries, and evaluate several attacks that defeat the security goals
of existing decoy routing proposals. In particular, we show that a
routing capable adversary can enumerate the participating routers
implementing these protocols; can successfully avoid sending traf-
ﬁc along routes containing these routers with little or no adverse
effects; can identify users of these schemes through active and pas-
sive attacks; and in some cases can probabilistically identify con-
nections to targeted destinations.
Categories and Subject Descriptors: C.2.0 COMPUTER COM-
MUNICATION NETWORKS: Security and protection
General Terms: Security
Keywords: Decoy Routing, BGP, Telex, Cirripede, Censorship
1.
INTRODUCTION
Decoy routing [19, 27, 18], as exempliﬁed by Telex and Cirri-
pede, is a new approach to building an anti-censorship tool. Instead
of the traditional end-to-end based proxy solution, decoy routing
instead places the proxies in the middle of paths, speciﬁcally at
r...


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

Input:
title:Routing around decoys
author:Max Schuchard and
John Geddes and
Christopher Thompson and
Nicholas Hopper
Routing Around Decoys
Max Schuchard1
schuch@cs.umn.edu
John Geddes1
geddes@cs.umn.edu
Christopher Thompson2
cthompson@cs.berkeley.edu
Nicholas Hopper1
hopper@cs.umn.edu
1: Department of Computer Science and Engineering, University of Minnesota, Twin Cities
2: Department of Electrical Engineering and Computer Science, University of California, Berkeley
ABSTRACT
Decoy Routing is a new approach to Internet censorship circum-
vention that was recently and independently proposed at FOCI’11,
USENIX Security’11 and CCS’11. Decoy routing aims to ham-
per nation-state level Internet censorship by having routers, rather
than end hosts, relay trafﬁc to blocked destinations. We analyze
the security of these schemes against a routing capable adversary,
a censoring authority that is willing to make routing decisions in
response to decoy routing systems.
We explore China, Syria, Iran, and Egypt as routing capable ad-
versaries, and evaluate several attacks that defeat the security goals
of existing decoy routing proposals. In particular, we show that a
routing capable adversary can enumerate the participating routers
implementing these protocols; can successfully avoid sending traf-
ﬁc along routes containing these routers with little or no adverse
effects; can identify users of these schemes through active and pas-
sive attacks; and in some cases can probabilistically identify con-
nections to targeted destinations.
Categories and Subject Descriptors: C.2.0 COMPUTER COM-
MUNICATION NETWORKS: Security and protection
General Terms: Security
Keywords: Decoy Routing, BGP, Telex, Cirripede, Censorship
1.
INTRODUCTION
Decoy routing [19, 27, 18], as exempliﬁed by Telex and Cirri-
pede, is a new approach to building an anti-censorship tool. Instead
of the traditional end-to-end based proxy solution, decoy routing
instead places the proxies in the middle of paths, speciﬁcally at
r...

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


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

Output:
安全论文分析：

title:Automating cross-layer diagnosis of enterprise wireless networks
author:Yuchung Cheng and
Mikhail Afanasyev and
Patrick Verkaik and
P'eter Benk"o and
Jennifer Chiang and
Alex C. Snoeren and
Stefan Savage and
Geoffrey M. Voelker
Automating Cross-Layer Diagnosis
of Enterprise Wireless Networks
Yu-Chung Cheng, Mikhail Afanasyev, Patrick Verkaik, Péter Benkö†,
Jennifer Chiang, Alex C. Snoeren, Stefan Savage, and Geoffrey M. Voelker
Department of Computer Science and Engineering
University of California, San Diego
†Trafﬁc Analysis and Network Performance Laboratory (TrafﬁcLab)
Ericsson Research, Budapest, Hungary
ABSTRACT
Modern enterprise networks are of sufﬁcient complexity that even
simple faults can be difﬁcult to diagnose — let alone transient out-
ages or service degradations. Nowhere is this problem more appar-
ent than in the 802.11-based wireless access networks now ubiq-
uitous in the enterprise. In addition to the myriad complexities of
the wired network, wireless networks face the additional challenges
of shared spectrum, user mobility and authentication management.
Not surprisingly, few organizations have the expertise, data or tools
to decompose the underlying problems and interactions responsible
for transient outages or performance degradations. In this paper, we
present a set of modeling techniques for automatically characteriz-
ing the source of such problems. In particular, we focus on data
transfer delays unique to 802.11 networks — media access dynam-
ics and mobility management latency. Through a combination of
measurement, inference and modeling we reconstruct sources of
delay — from the physical layer to the transport layer — as well as
the interactions among them. We demonstrate our approach using
comprehensive traces of wireless activity in the UCSD Computer
Science building.
Categories and Subject Descriptors
C.4 [Performance of Systems]: Modeling techniques
General Terms
Modeling, Measurement, Performance
Keywords
Wireless netw...


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

Input:
title:Automating cross-layer diagnosis of enterprise wireless networks
author:Yuchung Cheng and
Mikhail Afanasyev and
Patrick Verkaik and
P'eter Benk"o and
Jennifer Chiang and
Alex C. Snoeren and
Stefan Savage and
Geoffrey M. Voelker
Automating Cross-Layer Diagnosis
of Enterprise Wireless Networks
Yu-Chung Cheng, Mikhail Afanasyev, Patrick Verkaik, Péter Benkö†,
Jennifer Chiang, Alex C. Snoeren, Stefan Savage, and Geoffrey M. Voelker
Department of Computer Science and Engineering
University of California, San Diego
†Trafﬁc Analysis and Network Performance Laboratory (TrafﬁcLab)
Ericsson Research, Budapest, Hungary
ABSTRACT
Modern enterprise networks are of sufﬁcient complexity that even
simple faults can be difﬁcult to diagnose — let alone transient out-
ages or service degradations. Nowhere is this problem more appar-
ent than in the 802.11-based wireless access networks now ubiq-
uitous in the enterprise. In addition to the myriad complexities of
the wired network, wireless networks face the additional challenges
of shared spectrum, user mobility and authentication management.
Not surprisingly, few organizations have the expertise, data or tools
to decompose the underlying problems and interactions responsible
for transient outages or performance degradations. In this paper, we
present a set of modeling techniques for automatically characteriz-
ing the source of such problems. In particular, we focus on data
transfer delays unique to 802.11 networks — media access dynam-
ics and mobility management latency. Through a combination of
measurement, inference and modeling we reconstruct sources of
delay — from the physical layer to the transport layer — as well as
the interactions among them. We demonstrate our approach using
comprehensive traces of wireless activity in the UCSD Computer
Science building.
Categories and Subject Descriptors
C.4 [Performance of Systems]: Modeling techniques
General Terms
Modeling, Measurement, Performance
Keywords
Wireless netw...

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


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

Output:
安全论文分析：

title:Ally Friendly Jamming: How to Jam Your Enemy and Maintain Your Own
Wireless Connectivity at the Same Time
author:Wenbo Shen and
Peng Ning and
Xiaofan He and
Huaiyu Dai
2013 IEEE Symposium on Security and Privacy
Ally Friendly Jamming: How to Jam Your Enemy and Maintain Your Own Wireless
Connectivity at the Same Time
Wenbo Shen, Peng Ning
Department of Computer Science
North Carolina State University
Raleigh, NC 27695
{wshen3, pning}@ncsu.edu
Xiaofan He, Huaiyu Dai
Department of Electrical and Computer Engineering
North Carolina State University
Raleigh, NC 27695
{xhe6, hdai}@ncsu.edu
Abstract—This paper presents a novel mechanism, called
Ally Friendly Jamming, which aims at providing an intelligent
jamming capability that can disable unauthorized (enemy)
wireless communication but at
the same time still allow
authorized wireless devices to communicate, even if all these
devices operate at the same frequency. The basic idea is to
jam the wireless channel continuously but properly control the
jamming signals with secret keys, so that the jamming signals
are unpredictable interference to unauthorized devices, but are
recoverable by authorized ones equipped with the secret keys.
To achieve the ally friendly jamming capability, we develop
new techniques to generate ally jamming signals, to identify
and synchronize with multiple ally jammers. This paper
also reports the analysis, implementation, and experimental
evaluation of ally friendly jamming on a software deﬁned
radio platform. Both the analytical and experimental results
indicate that the proposed techniques can effectively disable
enemy wireless communication and at the same time maintain
wireless communication between authorized devices.
Keywords-Wireless; friendly jamming; interference cancella-
tion
I. INTRODUCTION
Wireless communication technology has been widely de-
ployed and increasingly adopted due to the ease of instal-
lation and reduced operational cost. The applications that
beneﬁt from wireless ...


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

Input:
title:Ally Friendly Jamming: How to Jam Your Enemy and Maintain Your Own
Wireless Connectivity at the Same Time
author:Wenbo Shen and
Peng Ning and
Xiaofan He and
Huaiyu Dai
2013 IEEE Symposium on Security and Privacy
Ally Friendly Jamming: How to Jam Your Enemy and Maintain Your Own Wireless
Connectivity at the Same Time
Wenbo Shen, Peng Ning
Department of Computer Science
North Carolina State University
Raleigh, NC 27695
{wshen3, pning}@ncsu.edu
Xiaofan He, Huaiyu Dai
Department of Electrical and Computer Engineering
North Carolina State University
Raleigh, NC 27695
{xhe6, hdai}@ncsu.edu
Abstract—This paper presents a novel mechanism, called
Ally Friendly Jamming, which aims at providing an intelligent
jamming capability that can disable unauthorized (enemy)
wireless communication but at
the same time still allow
authorized wireless devices to communicate, even if all these
devices operate at the same frequency. The basic idea is to
jam the wireless channel continuously but properly control the
jamming signals with secret keys, so that the jamming signals
are unpredictable interference to unauthorized devices, but are
recoverable by authorized ones equipped with the secret keys.
To achieve the ally friendly jamming capability, we develop
new techniques to generate ally jamming signals, to identify
and synchronize with multiple ally jammers. This paper
also reports the analysis, implementation, and experimental
evaluation of ally friendly jamming on a software deﬁned
radio platform. Both the analytical and experimental results
indicate that the proposed techniques can effectively disable
enemy wireless communication and at the same time maintain
wireless communication between authorized devices.
Keywords-Wireless; friendly jamming; interference cancella-
tion
I. INTRODUCTION
Wireless communication technology has been widely de-
ployed and increasingly adopted due to the ease of instal-
lation and reduced operational cost. The applications that
beneﬁt from wireless ...

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


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

Output:
安全论文分析：

title:Privacy Preserving Disease Treatment & Complication Prediction
System (PDTCPS)
author:Qinghan Xue and
Mooi Choo Chuah and
Yingying Chen
Privacy Preserving Disease Treatment & Complication
Prediction System (PDTCPS)
Qinghan Xue
Department of CSE
Lehigh University
Bethlehem, PA, USA
qix213@lehigh.edu
Mooi Choo Chuah
Department of CSE
Lehigh University
Bethlehem, PA, USA
mcc7@lehigh.edu
Yingying Chen
Department of ECE
Stevens Institute of
Technology
Hoboken, NJ, USA
yingying.chen@stevens.edu
ABSTRACT
Aﬀordable cloud computing technologies allow users to ef-
ﬁciently store, and manage their Personal Health Records
(PHRs) and share with their caregivers or physicians. This
in turn improves the quality of healthcare services, and lower
health care cost. However, serious security and privacy con-
cerns emerge because people upload their personal infor-
mation and PHRs to the public cloud. Data encryption
provides privacy protection of medical information but it
is challenging to utilize encrypted data. In this paper, we
present a privacy-preserving disease treatment, complica-
tion prediction scheme (P DT CP S), which allows autho-
rized users to conduct searches for disease diagnosis, per-
sonalized treatments, and prediction of potential complica-
tions. P DT CP S uses a tree-based structure to boost search
eﬃciency, a wildcard approach to support fuzzy keyword
search, and a Bloom-ﬁlter to improve search accuracy and
storage eﬃciency. In addition, our design also allows health
care providers and the public cloud to collectively gener-
ate aggregated training models for disease diagnosis, per-
sonalized treatments and complications prediction. More-
over, our design provides query unlinkability and hides both
search & access patterns. Finally, our evaluation results us-
ing two U CI datasets show that our scheme is more eﬃcient
and accurate than two existing schemes.
Keywords
Cloud Computing; PHR; Fuzzy Keyword; Query Privacy;
Data Mining
1.
INTRODUCTION
In rece...


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

Input:
title:Privacy Preserving Disease Treatment & Complication Prediction
System (PDTCPS)
author:Qinghan Xue and
Mooi Choo Chuah and
Yingying Chen
Privacy Preserving Disease Treatment & Complication
Prediction System (PDTCPS)
Qinghan Xue
Department of CSE
Lehigh University
Bethlehem, PA, USA
qix213@lehigh.edu
Mooi Choo Chuah
Department of CSE
Lehigh University
Bethlehem, PA, USA
mcc7@lehigh.edu
Yingying Chen
Department of ECE
Stevens Institute of
Technology
Hoboken, NJ, USA
yingying.chen@stevens.edu
ABSTRACT
Aﬀordable cloud computing technologies allow users to ef-
ﬁciently store, and manage their Personal Health Records
(PHRs) and share with their caregivers or physicians. This
in turn improves the quality of healthcare services, and lower
health care cost. However, serious security and privacy con-
cerns emerge because people upload their personal infor-
mation and PHRs to the public cloud. Data encryption
provides privacy protection of medical information but it
is challenging to utilize encrypted data. In this paper, we
present a privacy-preserving disease treatment, complica-
tion prediction scheme (P DT CP S), which allows autho-
rized users to conduct searches for disease diagnosis, per-
sonalized treatments, and prediction of potential complica-
tions. P DT CP S uses a tree-based structure to boost search
eﬃciency, a wildcard approach to support fuzzy keyword
search, and a Bloom-ﬁlter to improve search accuracy and
storage eﬃciency. In addition, our design also allows health
care providers and the public cloud to collectively gener-
ate aggregated training models for disease diagnosis, per-
sonalized treatments and complications prediction. More-
over, our design provides query unlinkability and hides both
search & access patterns. Finally, our evaluation results us-
ing two U CI datasets show that our scheme is more eﬃcient
and accurate than two existing schemes.
Keywords
Cloud Computing; PHR; Fuzzy Keyword; Query Privacy;
Data Mining
1.
INTRODUCTION
In rece...

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


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

Output:
安全论文分析：

title:Implementation and implications of a stealth hard-drive backdoor
author:Jonas Zaddach and
Anil Kurmus and
Davide Balzarotti and
Erik-Oliver Blass and
Aur'elien Francillon and
Travis Goodspeed and
Moitrayee Gupta and
Ioannis Koltsidas
Implementation and Implications of
a Stealth Hard-Drive Backdoor
Jonas Zaddach
†∗
Anil Kurmus
‡∗
¶
Travis Goodspeed
†
Davide Balzarotti
Erik-Oliver Blass
§
†
Aur´elien Francillon
‡
Moitrayee Gupta
(cid:3)
Ioannis Koltsidas
ABSTRACT
Modern workstations and servers implicitly trust hard disks
to act as well-behaved block devices. This paper analyzes
the catastrophic loss of security that occurs when hard disks
are not trustworthy. First, we show that it is possible to
compromise the ﬁrmware of a commercial oﬀ-the-shelf hard
drive, by resorting only to public information and reverse en-
gineering. Using such a compromised ﬁrmware, we present
a stealth rootkit that replaces arbitrary blocks from the disk
while they are written, providing a data replacement back-
door. The measured performance overhead of the compro-
mised disk drive is less than 1% compared with a normal,
non-malicious disk drive. We then demonstrate that a re-
mote attacker can even establish a communication channel
with a compromised disk to inﬁltrate commands and to ex-
ﬁltrate data.
In our example, this channel is established
over the Internet to an unmodiﬁed web server that relies
on the compromised drive for its storage, passing through
the original webserver, database server, database storage en-
gine, ﬁlesystem driver, and block device driver. Additional
experiments, performed in an emulated disk-drive environ-
ment, could automatically extract sensitive data such as
/etc/shadow (or a secret key ﬁle) in less than a minute. This
paper claims that the diﬃculty of implementing such an at-
tack is not limited to the area of government cyber-warfare;
rather, it is well within the reach of moderately funded crim-
inals, botnet herders and academic researchers.
...


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

Input:
title:Implementation and implications of a stealth hard-drive backdoor
author:Jonas Zaddach and
Anil Kurmus and
Davide Balzarotti and
Erik-Oliver Blass and
Aur'elien Francillon and
Travis Goodspeed and
Moitrayee Gupta and
Ioannis Koltsidas
Implementation and Implications of
a Stealth Hard-Drive Backdoor
Jonas Zaddach
†∗
Anil Kurmus
‡∗
¶
Travis Goodspeed
†
Davide Balzarotti
Erik-Oliver Blass
§
†
Aur´elien Francillon
‡
Moitrayee Gupta
(cid:3)
Ioannis Koltsidas
ABSTRACT
Modern workstations and servers implicitly trust hard disks
to act as well-behaved block devices. This paper analyzes
the catastrophic loss of security that occurs when hard disks
are not trustworthy. First, we show that it is possible to
compromise the ﬁrmware of a commercial oﬀ-the-shelf hard
drive, by resorting only to public information and reverse en-
gineering. Using such a compromised ﬁrmware, we present
a stealth rootkit that replaces arbitrary blocks from the disk
while they are written, providing a data replacement back-
door. The measured performance overhead of the compro-
mised disk drive is less than 1% compared with a normal,
non-malicious disk drive. We then demonstrate that a re-
mote attacker can even establish a communication channel
with a compromised disk to inﬁltrate commands and to ex-
ﬁltrate data.
In our example, this channel is established
over the Internet to an unmodiﬁed web server that relies
on the compromised drive for its storage, passing through
the original webserver, database server, database storage en-
gine, ﬁlesystem driver, and block device driver. Additional
experiments, performed in an emulated disk-drive environ-
ment, could automatically extract sensitive data such as
/etc/shadow (or a secret key ﬁle) in less than a minute. This
paper claims that the diﬃculty of implementing such an at-
tack is not limited to the area of government cyber-warfare;
rather, it is well within the reach of moderately funded crim-
inals, botnet herders and academic researchers.
...

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


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

Output:
安全论文分析：

title:POSTER: Positioning Attack on Proximity-Based People Discovery
author:Huan Feng and
Kang G. Shin
POSTER: Positioning Attack on Proximity-Based People
Discovery
Huan Feng
The University of Michigan
Michigan, USA
huanfeng@umich.edu
Kang G. Shin
The University of Michigan
Michigan, USA
kgshin@umich.edu
ABSTRACT
Over the past few years, Proximity-based People Discov-
ery (PBPD) services, typically known as Nearby Friends,
have been increasingly popular among geosocial apps. Un-
like many unsuccessful predecessors which directly pinpoint
users’ exact locations on the map, PBPD services provide
coarse-grained (discretized) proximity information, such as
“Jennifer is within 2 miles,” striking a useful balance between
privacy and functionality. Considering PBPD’s business po-
tential, many companies including Facebook have been try-
ing to promote this feature and instill the perception in mo-
bile users that coarse-grained proximity information is in-
nocuous to share. Here, we propose a novel positioning at-
tack which can locate end-users of PBPD services with high
precision using only coarse-grained (discretized) proximity
information. This attack requires neither specialized hard-
ware nor server-side collusion and can be easily automated.
Based on this attack, we design and implement Geosocial
Positioning System (GsPS) and show that GsPS can eﬀec-
tively locate users with high precision (10m) in a matter of
a few minutes under real-world settings, and is capable of
performing eﬀective city-scale scanning and long-term proﬁl-
ing at low costs. The public and the social network industry
should therefore be aware of the potential risk introduced by
this attack and consider use of PBPD services with caution.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General—
Security and protection; K.4.1 [Computers and Society]:
Public policy issues—privacy
Keywords
Geosocial network, location privacy, triangulation
1.
INTRODUCTION
Proximity-Based ...


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

Input:
title:POSTER: Positioning Attack on Proximity-Based People Discovery
author:Huan Feng and
Kang G. Shin
POSTER: Positioning Attack on Proximity-Based People
Discovery
Huan Feng
The University of Michigan
Michigan, USA
huanfeng@umich.edu
Kang G. Shin
The University of Michigan
Michigan, USA
kgshin@umich.edu
ABSTRACT
Over the past few years, Proximity-based People Discov-
ery (PBPD) services, typically known as Nearby Friends,
have been increasingly popular among geosocial apps. Un-
like many unsuccessful predecessors which directly pinpoint
users’ exact locations on the map, PBPD services provide
coarse-grained (discretized) proximity information, such as
“Jennifer is within 2 miles,” striking a useful balance between
privacy and functionality. Considering PBPD’s business po-
tential, many companies including Facebook have been try-
ing to promote this feature and instill the perception in mo-
bile users that coarse-grained proximity information is in-
nocuous to share. Here, we propose a novel positioning at-
tack which can locate end-users of PBPD services with high
precision using only coarse-grained (discretized) proximity
information. This attack requires neither specialized hard-
ware nor server-side collusion and can be easily automated.
Based on this attack, we design and implement Geosocial
Positioning System (GsPS) and show that GsPS can eﬀec-
tively locate users with high precision (10m) in a matter of
a few minutes under real-world settings, and is capable of
performing eﬀective city-scale scanning and long-term proﬁl-
ing at low costs. The public and the social network industry
should therefore be aware of the potential risk introduced by
this attack and consider use of PBPD services with caution.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General—
Security and protection; K.4.1 [Computers and Society]:
Public policy issues—privacy
Keywords
Geosocial network, location privacy, triangulation
1.
INTRODUCTION
Proximity-Based ...

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


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

Output:
安全论文分析：

title:Toward Whole-System Dynamic Analysis for ARM-Based Mobile Devices
author:Ryan Whelan and
David R. Kaeli
Toward Whole-System Dynamic Analysis for
ARM-Based Mobile Devices
Ryan Whelan and David Kaeli
Department of Electrical and Computer Engineering
Northeastern University
Boston, MA, USA
rwhelan@coe.neu.edu, kaeli@ece.neu.edu
Abstract. The ARM architecture is presently the chipset of choice for
today’s smartphones - this demand has spurred new advances in func-
tionality and services, and as the number of smartphones increases, so
has the number of applications being migrated to them. As a result, the
amount of malware targeting them will also increase. We present our pre-
liminary work on an ARM-based dynamic proﬁling platform that allows
analysts to study malware that targets ARM-based smartphone systems.
Mobile malware exploits have only begun to appear recently, but analysts expect
this trend to accelerate in future years as smartphones begin to dominate the
mobile communications market. Smartphones introduce additional attack vec-
tors unavailable on PCs, including Short Messaging Service (SMS), Multimedia
Messaging Service (MMS), and Bluetooth. While security experts (especially
white hat hackers) have begun to exploit and disclose these vulnerabilities so
they can be patched, a new group of embedded systems black hat hackers will
soon emerge given the personal and ﬁnancial data being managed from these
systems. As new mobile malware culture continues to mature, security analysts
will need a platform that will allow them to study exploits and intrusions. At
the moment, a complete ARM-based security analysis platform does not exist
that is appropriate for studying mobile malware.
In this paper we report on our implementation of such a platform that is
based on QEMU [1]. QEMU provides a whole-system emulator for many guest
architectures, including ARM. Since the open source development emulator for
the Android smartphone operating system is based on QEMU wi...


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

Input:
title:Toward Whole-System Dynamic Analysis for ARM-Based Mobile Devices
author:Ryan Whelan and
David R. Kaeli
Toward Whole-System Dynamic Analysis for
ARM-Based Mobile Devices
Ryan Whelan and David Kaeli
Department of Electrical and Computer Engineering
Northeastern University
Boston, MA, USA
rwhelan@coe.neu.edu, kaeli@ece.neu.edu
Abstract. The ARM architecture is presently the chipset of choice for
today’s smartphones - this demand has spurred new advances in func-
tionality and services, and as the number of smartphones increases, so
has the number of applications being migrated to them. As a result, the
amount of malware targeting them will also increase. We present our pre-
liminary work on an ARM-based dynamic proﬁling platform that allows
analysts to study malware that targets ARM-based smartphone systems.
Mobile malware exploits have only begun to appear recently, but analysts expect
this trend to accelerate in future years as smartphones begin to dominate the
mobile communications market. Smartphones introduce additional attack vec-
tors unavailable on PCs, including Short Messaging Service (SMS), Multimedia
Messaging Service (MMS), and Bluetooth. While security experts (especially
white hat hackers) have begun to exploit and disclose these vulnerabilities so
they can be patched, a new group of embedded systems black hat hackers will
soon emerge given the personal and ﬁnancial data being managed from these
systems. As new mobile malware culture continues to mature, security analysts
will need a platform that will allow them to study exploits and intrusions. At
the moment, a complete ARM-based security analysis platform does not exist
that is appropriate for studying mobile malware.
In this paper we report on our implementation of such a platform that is
based on QEMU [1]. QEMU provides a whole-system emulator for many guest
architectures, including ARM. Since the open source development emulator for
the Android smartphone operating system is based on QEMU wi...

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


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

Output:
安全论文分析：

title:An accurate flip-flop selection technique for reducing logic SER
author:Eric L. Hill and
Mikko H. Lipasti and
Kewal K. Saluja
International Conference on Dependable Systems &Networks: Anchorage, Alaska, June 24-27 2008
An Accurate Flip-flop Selection Technique for Reducing Logic SER
Eric L. Hill, Mikko H. Lipasti, Kewal K. Saluja
Department of Electrical and Computer Engineering
University of Wisconsin - Madison
{elhill, mikko, saluja}@ece.wisc.edu
Abstract
lent to that of storage structures [11].
The combination ofcontinued technology scaling and in(cid:173)
creased on-chip transistor densities has made vulnerability
to radiation induced so.ft errors a significant design con(cid:173)
cern. In particular, the effects ofthese errors on logic nodes
are predicted to play an increasingly large role in deter(cid:173)
mining the overall failure rate offuture VLSI chips. While
a myriad oftechniques have been proposed to mitigate the
effects ofsoft errors, system designers must ensure that the
application ofthese solutions does not come at the expense
ofother design goals. This work presents a heuristic to se(cid:173)
lectively apply temporal redundancy to .flip-.flops within a
pipelined logic unit, achieving significant reductions in fail(cid:173)
ures associated with soft errors with minimal overhead.
1. Introduction
As computing systems become increasingly ubiquitous,
architects strive to create robust systems capable of operat(cid:173)
ing in a wide variety of environments. In addition to meet(cid:173)
ing performance and power requirements, engineers now
have to spend a significant amount of time ensuring their
designs also meet reliability goals. The combination of
continued technology scaling and increased on-chip transis(cid:173)
tor densities have made vulnerability to radiation-induced
soft errors a significant design concern [8]. The majority
of work on soft errors has focused on understanding and
mitigating their effects on storage structures [3]. In terms...


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

Input:
title:An accurate flip-flop selection technique for reducing logic SER
author:Eric L. Hill and
Mikko H. Lipasti and
Kewal K. Saluja
International Conference on Dependable Systems &Networks: Anchorage, Alaska, June 24-27 2008
An Accurate Flip-flop Selection Technique for Reducing Logic SER
Eric L. Hill, Mikko H. Lipasti, Kewal K. Saluja
Department of Electrical and Computer Engineering
University of Wisconsin - Madison
{elhill, mikko, saluja}@ece.wisc.edu
Abstract
lent to that of storage structures [11].
The combination ofcontinued technology scaling and in(cid:173)
creased on-chip transistor densities has made vulnerability
to radiation induced so.ft errors a significant design con(cid:173)
cern. In particular, the effects ofthese errors on logic nodes
are predicted to play an increasingly large role in deter(cid:173)
mining the overall failure rate offuture VLSI chips. While
a myriad oftechniques have been proposed to mitigate the
effects ofsoft errors, system designers must ensure that the
application ofthese solutions does not come at the expense
ofother design goals. This work presents a heuristic to se(cid:173)
lectively apply temporal redundancy to .flip-.flops within a
pipelined logic unit, achieving significant reductions in fail(cid:173)
ures associated with soft errors with minimal overhead.
1. Introduction
As computing systems become increasingly ubiquitous,
architects strive to create robust systems capable of operat(cid:173)
ing in a wide variety of environments. In addition to meet(cid:173)
ing performance and power requirements, engineers now
have to spend a significant amount of time ensuring their
designs also meet reliability goals. The combination of
continued technology scaling and increased on-chip transis(cid:173)
tor densities have made vulnerability to radiation-induced
soft errors a significant design concern [8]. The majority
of work on soft errors has focused on understanding and
mitigating their effects on storage structures [3]. In terms...

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


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

Output:
安全论文分析：

title:MEDUSA: Mining Events to Detect Undesirable uSer Actions in SCADA
author:Dina Hadziosmanovic and
Damiano Bolzoni and
Pieter H. Hartel
MEDUSA:
Mining Events to Detect Undesirable uSer
Actions in SCADA
Dina Hadˇziosmanovi´c, Damiano Bolzoni and Pieter Hartel
Distributed and Embedded Security, University of Twente
{dina.hadziosmanovic,damiano.bolzoni,pieter.hartel}@utwente.nl
Abstract. Standard approaches for detecting malicious behaviors, e.g.
monitoring network traﬃc, cannot address process-related threats in
SCADA(Supervisory Control And Data Acquisition) systems. These
threats take place when an attacker gains user access rights and performs
actions which look legitimate, but which can disrupt the industrial pro-
cess. We believe that it is possible to detect such behavior by analysing
SCADA system logs. We present MEDUSA, an anomaly-based tool for
detecting user actions that may negatively impact the system.
1 Problem
There is a wide range of possible attacks that can be carried out against SCADA
environments [1,2]. We classify possible threats in two groups: system- and
process-related. System-related threats are typical of “regular” computer net-
works, e.g., malware or Denial of Service attacks. Attackers leverage vulnerabil-
ities in networked systems and programmable logic controllers (PLCs) to alter
or disrupt the industrial process. Process-related threats imply that an attacker
gains user access rights (e.g., through social engineering) and performs legiti-
mate SCADA commands which will negatively aﬀect the industrial processes.
Typical security countermeasures, e.g., antivirus or network IDSes, can hardly
detect process-related threats, as they lack process semantic.
In this work, we focus on the detection of process-related threats. Based on in-
terviews with stakeholders, we distinguish two types of threat scenarios, namely
1) an attacker impersonates a system user or 2) a legitimate system user makes
an operational mistake. A SCADA engineer mana...


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

Input:
title:MEDUSA: Mining Events to Detect Undesirable uSer Actions in SCADA
author:Dina Hadziosmanovic and
Damiano Bolzoni and
Pieter H. Hartel
MEDUSA:
Mining Events to Detect Undesirable uSer
Actions in SCADA
Dina Hadˇziosmanovi´c, Damiano Bolzoni and Pieter Hartel
Distributed and Embedded Security, University of Twente
{dina.hadziosmanovic,damiano.bolzoni,pieter.hartel}@utwente.nl
Abstract. Standard approaches for detecting malicious behaviors, e.g.
monitoring network traﬃc, cannot address process-related threats in
SCADA(Supervisory Control And Data Acquisition) systems. These
threats take place when an attacker gains user access rights and performs
actions which look legitimate, but which can disrupt the industrial pro-
cess. We believe that it is possible to detect such behavior by analysing
SCADA system logs. We present MEDUSA, an anomaly-based tool for
detecting user actions that may negatively impact the system.
1 Problem
There is a wide range of possible attacks that can be carried out against SCADA
environments [1,2]. We classify possible threats in two groups: system- and
process-related. System-related threats are typical of “regular” computer net-
works, e.g., malware or Denial of Service attacks. Attackers leverage vulnerabil-
ities in networked systems and programmable logic controllers (PLCs) to alter
or disrupt the industrial process. Process-related threats imply that an attacker
gains user access rights (e.g., through social engineering) and performs legiti-
mate SCADA commands which will negatively aﬀect the industrial processes.
Typical security countermeasures, e.g., antivirus or network IDSes, can hardly
detect process-related threats, as they lack process semantic.
In this work, we focus on the detection of process-related threats. Based on in-
terviews with stakeholders, we distinguish two types of threat scenarios, namely
1) an attacker impersonates a system user or 2) a legitimate system user makes
an operational mistake. A SCADA engineer mana...

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


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

Output:
安全论文分析：

title:Ghost in the Binder: Binder Transaction Redirection Attacks in Android
System Services
author:Xiaobo Xiang and
Ren Zhang and
Hanxiang Wen and
Xiaorui Gong and
Baoxu Liu
Ghost in the Binder: Binder Transaction Redirection Attacks in
Android System Services
Xiaobo Xiang
xiangxiaobo@iie.ac.cn
CAS-KLONAT§, IIE, CAS†
School of Cyber Security, UCAS¶
Alpha Lab∗, 360 GESG‡
Beijing, China
Ren Zhang
ren@nervos.org
Nervos
Beijing, China
Shandong Institute of Blockchain
Hanxiang Wen
arnow117@gmail.com
Ant Group
Hangzhou, China
Xiaorui Gong (cid:66)
gongxiaorui@iie.ac.cn
CAS-KLONAT§, IIE, CAS†
School of Cyber Security, UCAS¶
Beijing, China
Baoxu Liu
liubaoxu@iie.ac.cn
CAS-KLONAT§, IIE, CAS†
School of Cyber Security, UCAS¶
Beijing, China
ABSTRACT
Binder, the main mechanism for Android applications to access
system services, adopts a client-server role model in its design,
assuming the system service as the server and the application as
the client. However, a growing number of scenarios require the
system service to act as a Binder client and to send queries to a
Binder server possibly instantiated by the application. Departing
from this role-reversal possibility, this paper proposes the Binder
Transaction Redirection (BiTRe) attacks, where the attacker induces
the system service to transact with a customized Binder server and
then attacks from the Binder server—an often unprotected direction.
We demonstrate the scale of the attack surface by enumerating the
utilizable Binder interfaces in BiTRe, and discover that the attack
surface grows with the Android release version. In Android 11,
more than 70% of the Binder interfaces are affected by or can be
utilized in BiTRe. We prove the attacks’ feasibility by (1) construct-
ing a prototype system that can automatically generate executable
programs to reach a substantial part of the attack surface, and (2)
identifying a series of vulnerabilities, which are acknowledged by
Google and assigned ten CVEs.
CCS CONCEPTS
• Security and ...


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

Input:
title:Ghost in the Binder: Binder Transaction Redirection Attacks in Android
System Services
author:Xiaobo Xiang and
Ren Zhang and
Hanxiang Wen and
Xiaorui Gong and
Baoxu Liu
Ghost in the Binder: Binder Transaction Redirection Attacks in
Android System Services
Xiaobo Xiang
xiangxiaobo@iie.ac.cn
CAS-KLONAT§, IIE, CAS†
School of Cyber Security, UCAS¶
Alpha Lab∗, 360 GESG‡
Beijing, China
Ren Zhang
ren@nervos.org
Nervos
Beijing, China
Shandong Institute of Blockchain
Hanxiang Wen
arnow117@gmail.com
Ant Group
Hangzhou, China
Xiaorui Gong (cid:66)
gongxiaorui@iie.ac.cn
CAS-KLONAT§, IIE, CAS†
School of Cyber Security, UCAS¶
Beijing, China
Baoxu Liu
liubaoxu@iie.ac.cn
CAS-KLONAT§, IIE, CAS†
School of Cyber Security, UCAS¶
Beijing, China
ABSTRACT
Binder, the main mechanism for Android applications to access
system services, adopts a client-server role model in its design,
assuming the system service as the server and the application as
the client. However, a growing number of scenarios require the
system service to act as a Binder client and to send queries to a
Binder server possibly instantiated by the application. Departing
from this role-reversal possibility, this paper proposes the Binder
Transaction Redirection (BiTRe) attacks, where the attacker induces
the system service to transact with a customized Binder server and
then attacks from the Binder server—an often unprotected direction.
We demonstrate the scale of the attack surface by enumerating the
utilizable Binder interfaces in BiTRe, and discover that the attack
surface grows with the Android release version. In Android 11,
more than 70% of the Binder interfaces are affected by or can be
utilized in BiTRe. We prove the attacks’ feasibility by (1) construct-
ing a prototype system that can automatically generate executable
programs to reach a substantial part of the attack surface, and (2)
identifying a series of vulnerabilities, which are acknowledged by
Google and assigned ten CVEs.
CCS CONCEPTS
• Security and ...

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