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

Input:
title:User Interface Dependability through Goal-Error Prevention
author:Robert W. Reeder and
Roy A. Maxion
User Interface Dependability through Goal-Error Prevention
Robert W. Reeder and Roy A. Maxion
reeder@cs.cmu.edu and maxion@cs.cmu.edu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
User interfaces form a critical coupling between humans
and computers. When the interface fails, the user fails, and
the mission is lost. For example, in computer security appli-
cations, human-made conﬁguration errors can expose en-
tire systems to various forms of attack.
To avoid interaction failures, a dependable user inter-
face must facilitate the speedy and accurate completion of
user tasks. Defects in the interface cause user errors (e.g.,
goal, plan, action and perception errors), which impinge on
speed and accuracy goals, and can lead to mission failure.
One source of user error is poor information represen-
tation in the interface. This can cause users to commit a
speciﬁc class of errors – goal errors. A design principle
(anchor-based subgoaling) for mitigating this cause was
formulated. The principle was evaluated in the domain of
setting Windows ﬁle permissions. The native Windows XP
ﬁle permissions interface, which did not support anchor-
based subgoaling, was compared to an alternative, called
Salmon, which did. In an experiment with 24 users, Salmon
achieved as much as a four-fold increase in accuracy for a
representative task and a 94% reduction in the number of
goal errors committed, compared to the XP interface.
1
Introduction
One locus of vulnerability in a computer system is the
user interface. Undependable interfaces are those that do
not meet their speciﬁcations in terms of the speed and ac-
curacy with which users should complete tasks. One rea-
son why some user interfaces fail to meet their speed and
accuracy speciﬁcations is human error. Researchers have
long recognized that...

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


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

Output:
安全论文分析：

title:A Chinese wall security model for decentralized workflow systems
author:Vijayalakshmi Atluri and
Soon Ae Chun and
Pietro Mazzoleni
A Chinese Wall Security Model for Decentralized Workﬂow
Systems †
Vijayalakshmi Atluri
Soon Ae Chun
MSIS Department and CIMIC
MSIS Department and CIMIC
Dipartimento Di Informatica
∗
Pietro Mazzoleni
Universita Di Milano
Milan, Italy
Rutgers University
Newark, NJ 07102, USA
Rutgers University
Newark, NJ 07102, USA
atluri@cimic.rutgers.edu
soon@cimic.rutgers.edu
mazzolen@cimic.rutgers.edu
ABSTRACT
Workﬂow systems are gaining importance as an infrastruc-
ture for automating inter-organizational interactions, such
as those in Electronic Commerce. Execution of inter-organiz-
ational workﬂows may raise a number of security issues in-
cluding those related to conﬂict-of-interest among compet-
ing organizations. Moreover,
in such an environment, a
centralized Workﬂow Management System is not desirable
because: (i) it can be a performance bottleneck, and (ii)
the systems are inherently distributed, heterogeneous and
autonomous in nature.
In this paper, we propose an ap-
proach to realize decentralized workﬂow execution, in which
the workﬂow is divided into partitions called self-describing
workﬂows, and handled by a light weight workﬂow manage-
ment component, called workﬂow stub, located at each orga-
nizational agent. We argue that placing the task execution
agents that belong to the same conﬂict-of-interest class in
one self-describing workﬂow may lead to unfair, and in some
cases, undesirable results, akin to being on the wrong side of
the Chinese wall. We propose a Chinese wall security model
for the decentralized workﬂow environment to resolve such
problems, and a restrictive partitioning solution to enforce
the proposed model.
Keywords
Decentralized Workﬂow Execution, Chinese Wall Security
Policy, Self-describing workﬂow
1.
INTRODUCTION
Since timely services are critical for any business, there
is a great need to automate or re-engin...


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

Input:
title:A Chinese wall security model for decentralized workflow systems
author:Vijayalakshmi Atluri and
Soon Ae Chun and
Pietro Mazzoleni
A Chinese Wall Security Model for Decentralized Workﬂow
Systems †
Vijayalakshmi Atluri
Soon Ae Chun
MSIS Department and CIMIC
MSIS Department and CIMIC
Dipartimento Di Informatica
∗
Pietro Mazzoleni
Universita Di Milano
Milan, Italy
Rutgers University
Newark, NJ 07102, USA
Rutgers University
Newark, NJ 07102, USA
atluri@cimic.rutgers.edu
soon@cimic.rutgers.edu
mazzolen@cimic.rutgers.edu
ABSTRACT
Workﬂow systems are gaining importance as an infrastruc-
ture for automating inter-organizational interactions, such
as those in Electronic Commerce. Execution of inter-organiz-
ational workﬂows may raise a number of security issues in-
cluding those related to conﬂict-of-interest among compet-
ing organizations. Moreover,
in such an environment, a
centralized Workﬂow Management System is not desirable
because: (i) it can be a performance bottleneck, and (ii)
the systems are inherently distributed, heterogeneous and
autonomous in nature.
In this paper, we propose an ap-
proach to realize decentralized workﬂow execution, in which
the workﬂow is divided into partitions called self-describing
workﬂows, and handled by a light weight workﬂow manage-
ment component, called workﬂow stub, located at each orga-
nizational agent. We argue that placing the task execution
agents that belong to the same conﬂict-of-interest class in
one self-describing workﬂow may lead to unfair, and in some
cases, undesirable results, akin to being on the wrong side of
the Chinese wall. We propose a Chinese wall security model
for the decentralized workﬂow environment to resolve such
problems, and a restrictive partitioning solution to enforce
the proposed model.
Keywords
Decentralized Workﬂow Execution, Chinese Wall Security
Policy, Self-describing workﬂow
1.
INTRODUCTION
Since timely services are critical for any business, there
is a great need to automate or re-engin...

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


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

Output:
安全论文分析：

title:Fig: Automatic Fingerprint Generation
author:Shobha Venkataraman and
Juan Caballero and
Pongsin Poosankam and
Min Gyung Kang and
Dawn Xiaodong Song
FiG: Automatic Fingerprint Generation
Juan Caballero
Shobha Venkataraman
Pongsin Poosankam
Carnegie Mellon University
Carnegie Mellon University
Carnegie Mellon University
jcaballero@cmu.edu
Min Gyung Kang
shobha@cs.cmu.edu
ppoosank@cmu.edu
Dawn Song
Avrim Blum
Carnegie Mellon University
Carnegie Mellon University
Carnegie Mellon University
mgkang@cmu.edu
dawnsong@cmu.edu
avrim@cs.cmu.edu
Abstract
Fingerprinting is a widely used technique among the net-
working and security communities for identifying different
implementations of the same piece of networking software
running on a remote host. A ﬁngerprint is essentially a set of
queries and a classiﬁcation function that can be applied on
the responses to the queries in order to classify the software
into classes. So far, identifying ﬁngerprints remains largely
an arduous and manual process. This paper proposes a
novel approach for automatic ﬁngerprint generation, that
automatically explores a set of candidate queries and ap-
plies machine learning techniques to identify the set of valid
queries and to learn an adequate classiﬁcation function.
Our results show that such an automatic process can gener-
ate accurate ﬁngerprints that classify each piece of software
into its proper class and that the search space for query ex-
ploration remains largely unexploited, with many new such
queries awaiting discovery. With a preliminary exploration,
we are able to identify new queries not previously used for
ﬁngerprinting.
1. Introduction
Fingerprinting is a technique for identifying the differ-
ences among implementations of the same networking soft-
ware speciﬁcation, be it applications, operating systems or
TCP/IP stacks. It is well-known that even when the func-
tionality of a piece of software is detailed in a speciﬁcation
or standard, different implementations of that sa...


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

Input:
title:Fig: Automatic Fingerprint Generation
author:Shobha Venkataraman and
Juan Caballero and
Pongsin Poosankam and
Min Gyung Kang and
Dawn Xiaodong Song
FiG: Automatic Fingerprint Generation
Juan Caballero
Shobha Venkataraman
Pongsin Poosankam
Carnegie Mellon University
Carnegie Mellon University
Carnegie Mellon University
jcaballero@cmu.edu
Min Gyung Kang
shobha@cs.cmu.edu
ppoosank@cmu.edu
Dawn Song
Avrim Blum
Carnegie Mellon University
Carnegie Mellon University
Carnegie Mellon University
mgkang@cmu.edu
dawnsong@cmu.edu
avrim@cs.cmu.edu
Abstract
Fingerprinting is a widely used technique among the net-
working and security communities for identifying different
implementations of the same piece of networking software
running on a remote host. A ﬁngerprint is essentially a set of
queries and a classiﬁcation function that can be applied on
the responses to the queries in order to classify the software
into classes. So far, identifying ﬁngerprints remains largely
an arduous and manual process. This paper proposes a
novel approach for automatic ﬁngerprint generation, that
automatically explores a set of candidate queries and ap-
plies machine learning techniques to identify the set of valid
queries and to learn an adequate classiﬁcation function.
Our results show that such an automatic process can gener-
ate accurate ﬁngerprints that classify each piece of software
into its proper class and that the search space for query ex-
ploration remains largely unexploited, with many new such
queries awaiting discovery. With a preliminary exploration,
we are able to identify new queries not previously used for
ﬁngerprinting.
1. Introduction
Fingerprinting is a technique for identifying the differ-
ences among implementations of the same networking soft-
ware speciﬁcation, be it applications, operating systems or
TCP/IP stacks. It is well-known that even when the func-
tionality of a piece of software is detailed in a speciﬁcation
or standard, different implementations of that sa...

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


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

Output:
安全论文分析：

title:The energy cost of cryptographic key establishment in wireless sensor
networks
author:Johann Großsch"adl and
Alexander Szekely and
Stefan Tillich
The Energy Cost of Cryptographic Key Establishment in
Wireless Sensor Networks (Extended Abstract)∗
Johann Großsch¨adl
jgrosz@iaik.tugraz.at
Alexander Szekely
aszekely@iaik.tugraz.at
Graz University of Technology
Stefan Tillich
stillich@iaik.tugraz.at
Institute for Applied Information Processing and Communications
Inffeldgasse 16a, A–8010 Graz, Austria
ABSTRACT
Wireless sensor nodes generally face serious limitations in
terms of computational power, energy supply, and network
bandwidth. Therefore, the implementation of eﬀective and
secure techniques for setting up a shared secret key between
sensor nodes is a challenging task. In this paper we analyze
and compare the energy cost of two diﬀerent protocols for
authenticated key establishment. The ﬁrst protocol employs
a lightweight variant of the Kerberos key transport mecha-
nism with 128-bit AES encryption. The second protocol is
based on ECMQV, an authenticated version of the elliptic
curve Diﬃe-Hellman key exchange, and uses a 256-bit prime
ﬁeld GF(p) as underlying algebraic structure. We evaluate
the energy cost of both protocols on a Rockwell WINS node
equipped with a 133 MHz StrongARM processor and a 100
kbit/s radio module. The evaluation considers both the pro-
cessor’s energy consumption for calculating cryptographic
primitives and the energy cost of radio communication for
diﬀerent transmit power levels. Our simulation results show
that the ECMQV key exchange consumes up to twice as
much energy as Kerberos-like key transport.
Keywords: Wireless networking, security protocols, key
establishment, cryptography, energy evaluation.
1.
INTRODUCTION
Wireless sensor networks often operate in hostile environ-
ments or collect sensitive data (e.g. in health care), which
calls for eﬀective measures to protect them against security
threats like unauthorized access,...


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

Input:
title:The energy cost of cryptographic key establishment in wireless sensor
networks
author:Johann Großsch"adl and
Alexander Szekely and
Stefan Tillich
The Energy Cost of Cryptographic Key Establishment in
Wireless Sensor Networks (Extended Abstract)∗
Johann Großsch¨adl
jgrosz@iaik.tugraz.at
Alexander Szekely
aszekely@iaik.tugraz.at
Graz University of Technology
Stefan Tillich
stillich@iaik.tugraz.at
Institute for Applied Information Processing and Communications
Inffeldgasse 16a, A–8010 Graz, Austria
ABSTRACT
Wireless sensor nodes generally face serious limitations in
terms of computational power, energy supply, and network
bandwidth. Therefore, the implementation of eﬀective and
secure techniques for setting up a shared secret key between
sensor nodes is a challenging task. In this paper we analyze
and compare the energy cost of two diﬀerent protocols for
authenticated key establishment. The ﬁrst protocol employs
a lightweight variant of the Kerberos key transport mecha-
nism with 128-bit AES encryption. The second protocol is
based on ECMQV, an authenticated version of the elliptic
curve Diﬃe-Hellman key exchange, and uses a 256-bit prime
ﬁeld GF(p) as underlying algebraic structure. We evaluate
the energy cost of both protocols on a Rockwell WINS node
equipped with a 133 MHz StrongARM processor and a 100
kbit/s radio module. The evaluation considers both the pro-
cessor’s energy consumption for calculating cryptographic
primitives and the energy cost of radio communication for
diﬀerent transmit power levels. Our simulation results show
that the ECMQV key exchange consumes up to twice as
much energy as Kerberos-like key transport.
Keywords: Wireless networking, security protocols, key
establishment, cryptography, energy evaluation.
1.
INTRODUCTION
Wireless sensor networks often operate in hostile environ-
ments or collect sensitive data (e.g. in health care), which
calls for eﬀective measures to protect them against security
threats like unauthorized access,...

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


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

Output:
安全论文分析：

title:Cryptanalysis and improvement of a multi-receiver identity-based key
encapsulation at INDOCRYPT 06
author:Jong Hwan Park and
Ki Tak Kim and
Dong Hoon Lee
Cryptanalysis and Improvement of a Multi-receiver
Identity-Based Key Encapsulation at INDOCRYPT 06∗
Jong Hwan Park
Ki Tak Kim
Dong Hoon Lee
Center for Information Security
Center for Information Security
Center for Information Security
Technologies
Korea University
decartian@korea.ac.kr
Technologies
Korea University
kitak@korea.ac.kr
Technologies
Korea University
donghlee@korea.ac.kr
ABSTRACT
Multi-receiver Identity-Based Key Encapsulation Mecha-
nism (mIB-KEM) allows a sender to distribute messages for
a set of receivers using the receiver’s identity as a public key.
Recently, Chatterjee and Sarkar [12] suggested a new mIB-
KEM which has sublinear-size ciphertexts and private keys
simultaneously. They demonstrated that their scheme is se-
cure against chosen plaintext (or ciphertext) attacks without
random oracles. In this paper, we show that their scheme is
not secure in that a revoked user can easily decrypt cipher-
texts. We next propose a new mIB-KEM which overcomes
the security ﬂaw identiﬁed in the construction of Chatterjee
and Sarkar.
Categories and Subject Descriptors
E.3 [Data Encryption]: Code breaking, Public key cryp-
tosystems
General Terms
Security
Keywords
Multi-receiver Identity-Based Key Encapsulation
1.
INTRODUCTION
To distribute a message to some set S of users, the trivial
method is to encrypt the message using each user’s public
key. As expected, ciphertext size in this setting increases
linearly with |S|. This results in too much ciphertext size
when S becomes a large set of receivers. Thus, this method
is less attractive, except for the case where S is small. An
∗This research was supported by the MIC(Ministry of
Information and Communication), Korea, under
the
ITRC(Information Technology Research Center) support
program supervised by the IITA(Institute of Information
Technology Advanc...


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

Input:
title:Cryptanalysis and improvement of a multi-receiver identity-based key
encapsulation at INDOCRYPT 06
author:Jong Hwan Park and
Ki Tak Kim and
Dong Hoon Lee
Cryptanalysis and Improvement of a Multi-receiver
Identity-Based Key Encapsulation at INDOCRYPT 06∗
Jong Hwan Park
Ki Tak Kim
Dong Hoon Lee
Center for Information Security
Center for Information Security
Center for Information Security
Technologies
Korea University
decartian@korea.ac.kr
Technologies
Korea University
kitak@korea.ac.kr
Technologies
Korea University
donghlee@korea.ac.kr
ABSTRACT
Multi-receiver Identity-Based Key Encapsulation Mecha-
nism (mIB-KEM) allows a sender to distribute messages for
a set of receivers using the receiver’s identity as a public key.
Recently, Chatterjee and Sarkar [12] suggested a new mIB-
KEM which has sublinear-size ciphertexts and private keys
simultaneously. They demonstrated that their scheme is se-
cure against chosen plaintext (or ciphertext) attacks without
random oracles. In this paper, we show that their scheme is
not secure in that a revoked user can easily decrypt cipher-
texts. We next propose a new mIB-KEM which overcomes
the security ﬂaw identiﬁed in the construction of Chatterjee
and Sarkar.
Categories and Subject Descriptors
E.3 [Data Encryption]: Code breaking, Public key cryp-
tosystems
General Terms
Security
Keywords
Multi-receiver Identity-Based Key Encapsulation
1.
INTRODUCTION
To distribute a message to some set S of users, the trivial
method is to encrypt the message using each user’s public
key. As expected, ciphertext size in this setting increases
linearly with |S|. This results in too much ciphertext size
when S becomes a large set of receivers. Thus, this method
is less attractive, except for the case where S is small. An
∗This research was supported by the MIC(Ministry of
Information and Communication), Korea, under
the
ITRC(Information Technology Research Center) support
program supervised by the IITA(Institute of Information
Technology Advanc...

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


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

Output:
安全论文分析：

title:A Model for Attribute-Based User-Role Assignment
author:Mohammad A. Al-Kahtani and
Ravi S. Sandhu
A Model for Attribute-Based User-Role Assignment
Mohammad A. Al-Kahtani
George Mason University
malkahta@gmu.edu
Abstract
The  Role-Based  Access  Control  (RBAC)  model
is
traditionally used to manually assign users to appropriate
roles,  based  on  a  specific  enterprise  policy,  thereby
authorizing  them  to  use  the  roles'  permissions.  In
environments where the  service-providing enterprise has
a  huge  customer  base  this  task  becomes  formidable.  An
appealing  solution  is  to  automatically  assign  users  to
roles. The central contribution of this paper is to describe
a model to dynamically assign users to roles based on a
finite  set  of  rules  defined  by  the  enterprise.  These  rules
take  into  consideration  the  attributes  of  users  and  any
constraints  set  forth  by  the  enterprise’s  security  policy.
The  model  also  allows  dynamic  revocation  of  assigned
roles based on conditions specified in the security policy.
The model provides a language to express these rules and
defines  a  mechanism  to  determine  seniority  among
different  rules.  The  paper  also  shows  how  to  use  the
model to express Mandatory Access Controls (MAC).
1. Introduction
to
superior  alternative
Role-Based Access Control (RBAC) has emerged as a
proven  and
traditional
discretionary and mandatory access controls [1, 2]. In
RBAC permissions are associated with roles, and users
are  made  members  of  appropriate  roles,  thereby
acquiring the roles' permissions. This greatly simplifies
management of permissions. Roles can be granted new
permissions  as  new  applications  and  systems  are
incorporated,  and  permissions  can  be  revoked  from
roles  as  needed.  Usually,  the  enterprise  security
officer(s)  manually  assign  users  to  roles  based  on
criteria specified by the enterprise.
Today,  an  in...


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

Input:
title:A Model for Attribute-Based User-Role Assignment
author:Mohammad A. Al-Kahtani and
Ravi S. Sandhu
A Model for Attribute-Based User-Role Assignment
Mohammad A. Al-Kahtani
George Mason University
malkahta@gmu.edu
Abstract
The  Role-Based  Access  Control  (RBAC)  model
is
traditionally used to manually assign users to appropriate
roles,  based  on  a  specific  enterprise  policy,  thereby
authorizing  them  to  use  the  roles'  permissions.  In
environments where the  service-providing enterprise has
a  huge  customer  base  this  task  becomes  formidable.  An
appealing  solution  is  to  automatically  assign  users  to
roles. The central contribution of this paper is to describe
a model to dynamically assign users to roles based on a
finite  set  of  rules  defined  by  the  enterprise.  These  rules
take  into  consideration  the  attributes  of  users  and  any
constraints  set  forth  by  the  enterprise’s  security  policy.
The  model  also  allows  dynamic  revocation  of  assigned
roles based on conditions specified in the security policy.
The model provides a language to express these rules and
defines  a  mechanism  to  determine  seniority  among
different  rules.  The  paper  also  shows  how  to  use  the
model to express Mandatory Access Controls (MAC).
1. Introduction
to
superior  alternative
Role-Based Access Control (RBAC) has emerged as a
proven  and
traditional
discretionary and mandatory access controls [1, 2]. In
RBAC permissions are associated with roles, and users
are  made  members  of  appropriate  roles,  thereby
acquiring the roles' permissions. This greatly simplifies
management of permissions. Roles can be granted new
permissions  as  new  applications  and  systems  are
incorporated,  and  permissions  can  be  revoked  from
roles  as  needed.  Usually,  the  enterprise  security
officer(s)  manually  assign  users  to  roles  based  on
criteria specified by the enterprise.
Today,  an  in...

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


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

Output:
安全论文分析：

title:Understanding the Dark Side of Big Data Clusters: An Analysis beyond
Failures
author:Andrea Rosà and
Lydia Y. Chen and
Walter Binder
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Understanding the Dark Side of Big Data
Clusters: An Analysis beyond Failures
Andrea Ros`a
Faculty of Informatics
Universit`a della Svizzera italiana
Lugano, Switzerland
Email: andrea.rosa@usi.ch
Lydia Y. Chen
Cloud Server Technologies Group
IBM Research Lab Zurich
R¨uschlikon, Switzerland
Email: yic@zurich.ibm.com
Walter Binder
Faculty of Informatics
Universit`a della Svizzera italiana
Lugano, Switzerland
Email: walter.binder@usi.ch
Abstract—Motivated by the high system complexity of today’s
datacenters, a large body of related studies tries to understand
workloads and resource utilization in datacenters. However, there
is little work on exploring unsuccessful job and task executions.
In this paper, we study three types of unsuccessful executions
in traces of a Google datacenter, namely fail, kill, and eviction.
The objective of our analysis is to identify their resource waste,
impacts on application performance, and root causes. We ﬁrst
quantitatively show their strong negative impact on CPU, RAM,
and DISK usage and on task slowdown. We analyze patterns
of unsuccessful jobs and tasks, particularly focusing on their
interdependency. Moreover, we uncover their root causes by
inspecting key workload and system attributes such as machine
locality and concurrency level. Our results help in the design of
low-latency and fault-tolerant big-data systems.
I.
INTRODUCTION
In today’s multi-tenancy and multi-purpose datacenters,
“big-data” is becoming the key application, featuring high
fanout jobs and performance dependency on data locality [1].
An increasing number of management systems aim at enhanc-
ing various aspects of big-data performance, in particular low-
la...


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

Input:
title:Understanding the Dark Side of Big Data Clusters: An Analysis beyond
Failures
author:Andrea Rosà and
Lydia Y. Chen and
Walter Binder
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Understanding the Dark Side of Big Data
Clusters: An Analysis beyond Failures
Andrea Ros`a
Faculty of Informatics
Universit`a della Svizzera italiana
Lugano, Switzerland
Email: andrea.rosa@usi.ch
Lydia Y. Chen
Cloud Server Technologies Group
IBM Research Lab Zurich
R¨uschlikon, Switzerland
Email: yic@zurich.ibm.com
Walter Binder
Faculty of Informatics
Universit`a della Svizzera italiana
Lugano, Switzerland
Email: walter.binder@usi.ch
Abstract—Motivated by the high system complexity of today’s
datacenters, a large body of related studies tries to understand
workloads and resource utilization in datacenters. However, there
is little work on exploring unsuccessful job and task executions.
In this paper, we study three types of unsuccessful executions
in traces of a Google datacenter, namely fail, kill, and eviction.
The objective of our analysis is to identify their resource waste,
impacts on application performance, and root causes. We ﬁrst
quantitatively show their strong negative impact on CPU, RAM,
and DISK usage and on task slowdown. We analyze patterns
of unsuccessful jobs and tasks, particularly focusing on their
interdependency. Moreover, we uncover their root causes by
inspecting key workload and system attributes such as machine
locality and concurrency level. Our results help in the design of
low-latency and fault-tolerant big-data systems.
I.
INTRODUCTION
In today’s multi-tenancy and multi-purpose datacenters,
“big-data” is becoming the key application, featuring high
fanout jobs and performance dependency on data locality [1].
An increasing number of management systems aim at enhanc-
ing various aspects of big-data performance, in particular low-
la...

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


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

Output:
安全论文分析：

title:On the Economics of Offline Password Cracking
author:Jeremiah Blocki and
Benjamin Harsha and
Samson Zhou
2018 IEEE Symposium on Security and Privacy
On the Economics of Ofﬂine Password Cracking
Jeremiah Blocki
Purdue University
Ben Harsha
Purdue University
Samson Zhou
Purdue University
Abstract—We develop an economic model of an ofﬂine pass-
word cracker which allows us to make quantitative predictions
about the fraction of accounts that a rational password attacker
would crack in the event of an authentication server breach. We
apply our economic model to analyze recent massive password
breaches at Yahoo!, Dropbox, LastPass and AshleyMadison.
All four organizations were using key-stretching to protect user
5
passwords. In fact, LastPass’ use of PBKDF2-SHA256 with 10
hash iterations exceeds 2017 NIST minimum recommendation
by an order of magnitude. Nevertheless, our analysis paints
a bleak picture: the adopted key-stretching levels provide
insufﬁcient protection for user passwords. In particular, we
present strong evidence that most user passwords follow a
Zipf’s law distribution, and characterize the behavior of a
rational attacker when user passwords are selected from a
Zipf’s law distribution. We show that there is a ﬁnite threshold
which depends on the Zipf’s law parameters that character-
izes the behavior of a rational attacker — if the value of
a cracked password (normalized by the cost of computing
the password hash function) exceeds this threshold then the
adversary’s optimal strategy is always to continue attacking
until each user password has been cracked. In all cases (Yahoo!,
Dropbox, LastPass and AshleyMadison) we ﬁnd that the value
of a cracked password almost certainly exceeds this threshold
meaning that a rational attacker would crack all passwords
that are selected from the Zipf’s law distribution (i.e., most user
passwords). This prediction holds even if we incorporate an
aggressive model of diminishing returns for the attacker (e.g.,
the to...


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

Input:
title:On the Economics of Offline Password Cracking
author:Jeremiah Blocki and
Benjamin Harsha and
Samson Zhou
2018 IEEE Symposium on Security and Privacy
On the Economics of Ofﬂine Password Cracking
Jeremiah Blocki
Purdue University
Ben Harsha
Purdue University
Samson Zhou
Purdue University
Abstract—We develop an economic model of an ofﬂine pass-
word cracker which allows us to make quantitative predictions
about the fraction of accounts that a rational password attacker
would crack in the event of an authentication server breach. We
apply our economic model to analyze recent massive password
breaches at Yahoo!, Dropbox, LastPass and AshleyMadison.
All four organizations were using key-stretching to protect user
5
passwords. In fact, LastPass’ use of PBKDF2-SHA256 with 10
hash iterations exceeds 2017 NIST minimum recommendation
by an order of magnitude. Nevertheless, our analysis paints
a bleak picture: the adopted key-stretching levels provide
insufﬁcient protection for user passwords. In particular, we
present strong evidence that most user passwords follow a
Zipf’s law distribution, and characterize the behavior of a
rational attacker when user passwords are selected from a
Zipf’s law distribution. We show that there is a ﬁnite threshold
which depends on the Zipf’s law parameters that character-
izes the behavior of a rational attacker — if the value of
a cracked password (normalized by the cost of computing
the password hash function) exceeds this threshold then the
adversary’s optimal strategy is always to continue attacking
until each user password has been cracked. In all cases (Yahoo!,
Dropbox, LastPass and AshleyMadison) we ﬁnd that the value
of a cracked password almost certainly exceeds this threshold
meaning that a rational attacker would crack all passwords
that are selected from the Zipf’s law distribution (i.e., most user
passwords). This prediction holds even if we incorporate an
aggressive model of diminishing returns for the attacker (e.g.,
the to...

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


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

Output:
安全论文分析：

title:The Influence of Code Coverage Metrics on Automated Testing Efficiency
in Android
author:Stanislav Dashevskyi and
Olga Gadyatskaya and
Aleksandr Pilgun and
Yury Zhauniarovich
The Influence of Code Coverage Metrics on
Automated Testing Efficiency in Android
Stanislav Dashevskyi
SnT, University of Luxembourg
stanislav.dashevskyi@uni.lu
Olga Gadyatskaya
Aleksandr Pilgun
Yury Zhauniarovich
SnT, University of Luxembourg
SnT, University of Luxembourg
Qatar Computing Research Institute, HBKU
olga.gadyatskaya@uni.lu
aleksandr.pilgun@uni.lu
yzhauniarovich@hbku.edu.qa
Context
Automated testing and dynamic analysis techniques are critical for ensuring the reliability and the security of third-party Android apps.
One of the biggest challenges for these techniques is effective app exploration in the black-box setting. Android apps have many entry points,
and their source code is unavailable for inspection. State-of-the-art tools utilize a wide variety of app exploration strategies that range from
generating random GUI events to systematic exploration of apps models [1], but there is no agreement on the success criteria.
Code coverage is a common metric used to evaluate efficiency of automated testing and dynamic analysis tools [1], and some of these tools
utilize code coverage as a component of a fitness function to guide app exploration and find more bugs [2].
Code coverage exists in many flavors, and there is currently no agreement in the community on which metrics to use in the fitness function.
Are they all the same, or is there a code coverage granularity that works best? We make the first step towards reaching this agreement.
Hypothesis
Combining different
granularities of code
coverage can be beneficial
for achieving better results
in automated testing of
Android apps.
Experiment setting
Sapienz [3] is a state-of-the-art bug finding tool for Android apps. It relies on Monkey [3] to generate
random input events; and applies a genetic algorithm to event se...


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

Input:
title:The Influence of Code Coverage Metrics on Automated Testing Efficiency
in Android
author:Stanislav Dashevskyi and
Olga Gadyatskaya and
Aleksandr Pilgun and
Yury Zhauniarovich
The Influence of Code Coverage Metrics on
Automated Testing Efficiency in Android
Stanislav Dashevskyi
SnT, University of Luxembourg
stanislav.dashevskyi@uni.lu
Olga Gadyatskaya
Aleksandr Pilgun
Yury Zhauniarovich
SnT, University of Luxembourg
SnT, University of Luxembourg
Qatar Computing Research Institute, HBKU
olga.gadyatskaya@uni.lu
aleksandr.pilgun@uni.lu
yzhauniarovich@hbku.edu.qa
Context
Automated testing and dynamic analysis techniques are critical for ensuring the reliability and the security of third-party Android apps.
One of the biggest challenges for these techniques is effective app exploration in the black-box setting. Android apps have many entry points,
and their source code is unavailable for inspection. State-of-the-art tools utilize a wide variety of app exploration strategies that range from
generating random GUI events to systematic exploration of apps models [1], but there is no agreement on the success criteria.
Code coverage is a common metric used to evaluate efficiency of automated testing and dynamic analysis tools [1], and some of these tools
utilize code coverage as a component of a fitness function to guide app exploration and find more bugs [2].
Code coverage exists in many flavors, and there is currently no agreement in the community on which metrics to use in the fitness function.
Are they all the same, or is there a code coverage granularity that works best? We make the first step towards reaching this agreement.
Hypothesis
Combining different
granularities of code
coverage can be beneficial
for achieving better results
in automated testing of
Android apps.
Experiment setting
Sapienz [3] is a state-of-the-art bug finding tool for Android apps. It relies on Monkey [3] to generate
random input events; and applies a genetic algorithm to event se...

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


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

Output:
安全论文分析：

title:Video stream quality impacts viewer behavior: inferring causality
using quasi-experimental designs
author:S. Shunmuga Krishnan and
Ramesh K. Sitaraman
Video Stream Quality Impacts Viewer Behavior: Inferring
Causality Using Quasi-Experimental Designs
S. Shunmuga Krishnan
sarumuga@akamai.com
Akamai Technologies
University of Massachusetts, Amherst
Ramesh K. Sitaraman
& Akamai Technologies
ramesh@cs.umass.edu
ABSTRACT
The distribution of videos over the Internet is drastically
transforming how media is consumed and monetized. Con-
tent providers, such as media outlets and video subscrip-
tion services, would like to ensure that their videos do not
fail, startup quickly, and play without interruptions. In re-
turn for their investment in video stream quality, content
providers expect less viewer abandonment, more viewer en-
gagement, and a greater fraction of repeat viewers, resulting
in greater revenues. The key question for a content provider
or a CDN is whether and to what extent changes in video
quality can cause changes in viewer behavior. Our work
is the ﬁrst to establish a causal relationship between video
quality and viewer behavior, taking a step beyond purely
correlational studies. To establish causality, we use Quasi-
Experimental Designs, a novel technique adapted from the
medical and social sciences.
We study the impact of video stream quality on viewer
behavior in a scientiﬁc data-driven manner by using exten-
sive traces from Akamai’s streaming network that include
23 million views from 6.7 million unique viewers. We show
that viewers start to abandon a video if it takes more than 2
seconds to start up, with each incremental delay of 1 second
resulting in a 5.8% increase in the abandonment rate. Fur-
ther, we show that a moderate amount of interruptions can
decrease the average play time of a viewer by a signiﬁcant
amount. A viewer who experiences a rebuﬀer delay equal to
1% of the video duration plays 5% less of the video in com-
parison to a simil...


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

Input:
title:Video stream quality impacts viewer behavior: inferring causality
using quasi-experimental designs
author:S. Shunmuga Krishnan and
Ramesh K. Sitaraman
Video Stream Quality Impacts Viewer Behavior: Inferring
Causality Using Quasi-Experimental Designs
S. Shunmuga Krishnan
sarumuga@akamai.com
Akamai Technologies
University of Massachusetts, Amherst
Ramesh K. Sitaraman
& Akamai Technologies
ramesh@cs.umass.edu
ABSTRACT
The distribution of videos over the Internet is drastically
transforming how media is consumed and monetized. Con-
tent providers, such as media outlets and video subscrip-
tion services, would like to ensure that their videos do not
fail, startup quickly, and play without interruptions. In re-
turn for their investment in video stream quality, content
providers expect less viewer abandonment, more viewer en-
gagement, and a greater fraction of repeat viewers, resulting
in greater revenues. The key question for a content provider
or a CDN is whether and to what extent changes in video
quality can cause changes in viewer behavior. Our work
is the ﬁrst to establish a causal relationship between video
quality and viewer behavior, taking a step beyond purely
correlational studies. To establish causality, we use Quasi-
Experimental Designs, a novel technique adapted from the
medical and social sciences.
We study the impact of video stream quality on viewer
behavior in a scientiﬁc data-driven manner by using exten-
sive traces from Akamai’s streaming network that include
23 million views from 6.7 million unique viewers. We show
that viewers start to abandon a video if it takes more than 2
seconds to start up, with each incremental delay of 1 second
resulting in a 5.8% increase in the abandonment rate. Fur-
ther, we show that a moderate amount of interruptions can
decrease the average play time of a viewer by a signiﬁcant
amount. A viewer who experiences a rebuﬀer delay equal to
1% of the video duration plays 5% less of the video in com-
parison to a simil...

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


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

Output:
安全论文分析：

title:Privacy-preserving multi-keyword text search in the cloud supporting
similarity-based ranking
author:Wenhai Sun and
Bing Wang and
Ning Cao and
Ming Li and
Wenjing Lou and
Y. Thomas Hou and
Hui Li
Privacy-preserving Multi-keyword Text Search in the Cloud
Supporting Similarity-based Ranking
Wenhai Sun†,††
whsun@xidian.edu.cn
Bing Wang††
bingwang@vt.edu
Ning Cao§
ncao@ece.wpi.edu
Ming Li‡
ming.li@usu.edu
Wenjing Lou††
wjlou@vt.edu
Y. Thomas Hou††
thou@vt.edu
Hui Li†
lihui@mail.xidian.edu.cn
†The State Key Laboratory of Integrated Services Networks, Xidian University, China
††Virginia Polytechnic Institute and State University, USA
§Worcester Polytechnic Institute, USA
‡Utah State University, USA
ABSTRACT
With the increasing popularity of cloud computing, huge
amount of documents are outsourced to the cloud for re-
duced management cost and ease of access. Although en-
cryption helps protecting user data conﬁdentiality, it leaves
the well-functioning yet practically-eﬃcient secure search
functions over encrypted data a challenging problem.
In
this paper, we present a privacy-preserving multi-keyword
text search (MTS) scheme with similarity-based ranking to
address this problem. To support multi-keyword search and
search result ranking, we propose to build the search in-
dex based on term frequency and the vector space model
with cosine similarity measure to achieve higher search re-
sult accuracy. To improve the search eﬃciency, we propose
a tree-based index structure and various adaption methods
for multi-dimensional (MD) algorithm so that the practical
search eﬃciency is much better than that of linear search. To
further enhance the search privacy, we propose two secure
index schemes to meet the stringent privacy requirements
under strong threat models, i.e., known ciphertext model
and known background model. Finally, we demonstrate the
eﬀectiveness and eﬃciency of the proposed schemes through
extensive experimental evaluation.
Categories and Subject Descriptors...


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

Input:
title:Privacy-preserving multi-keyword text search in the cloud supporting
similarity-based ranking
author:Wenhai Sun and
Bing Wang and
Ning Cao and
Ming Li and
Wenjing Lou and
Y. Thomas Hou and
Hui Li
Privacy-preserving Multi-keyword Text Search in the Cloud
Supporting Similarity-based Ranking
Wenhai Sun†,††
whsun@xidian.edu.cn
Bing Wang††
bingwang@vt.edu
Ning Cao§
ncao@ece.wpi.edu
Ming Li‡
ming.li@usu.edu
Wenjing Lou††
wjlou@vt.edu
Y. Thomas Hou††
thou@vt.edu
Hui Li†
lihui@mail.xidian.edu.cn
†The State Key Laboratory of Integrated Services Networks, Xidian University, China
††Virginia Polytechnic Institute and State University, USA
§Worcester Polytechnic Institute, USA
‡Utah State University, USA
ABSTRACT
With the increasing popularity of cloud computing, huge
amount of documents are outsourced to the cloud for re-
duced management cost and ease of access. Although en-
cryption helps protecting user data conﬁdentiality, it leaves
the well-functioning yet practically-eﬃcient secure search
functions over encrypted data a challenging problem.
In
this paper, we present a privacy-preserving multi-keyword
text search (MTS) scheme with similarity-based ranking to
address this problem. To support multi-keyword search and
search result ranking, we propose to build the search in-
dex based on term frequency and the vector space model
with cosine similarity measure to achieve higher search re-
sult accuracy. To improve the search eﬃciency, we propose
a tree-based index structure and various adaption methods
for multi-dimensional (MD) algorithm so that the practical
search eﬃciency is much better than that of linear search. To
further enhance the search privacy, we propose two secure
index schemes to meet the stringent privacy requirements
under strong threat models, i.e., known ciphertext model
and known background model. Finally, we demonstrate the
eﬀectiveness and eﬃciency of the proposed schemes through
extensive experimental evaluation.
Categories and Subject Descriptors...

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


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

Output:
安全论文分析：

title:Reasoning About Complementary Intrusion Evidence
author:Yan Zhai and
Peng Ning and
Purush Iyer and
Douglas S. Reeves
Reasoning about Complementary Intrusion Evidence∗
Yan Zhai, Peng Ning, Purush Iyer, Douglas S. Reeves
Cyber Defense Laboratory
Department of Computer Science
North Carolina State University
Raleigh, NC 29695-8207
{yzhai, pning, purush, reeves}@ncsu.edu
Abstract
This paper presents techniques to integrate and reason
about complementary intrusion evidence such as alerts gen-
erated by intrusion detection systems (IDSs) and reports by
system monitoring or vulnerability scanning tools. To facil-
itate the modeling of intrusion evidence, this paper classi-
ﬁes intrusion evidence into either event-based evidence or
state-based evidence. Event-based evidence refers to obser-
vations (or detections) of intrusive actions (e.g., IDS alerts),
while state-based evidence refers to observations of the ef-
fects of intrusions on system states. Based on the interde-
pendency between event-based and state-based evidence,
this paper develops techniques to automatically integrate
complementary evidence into Bayesian networks, and rea-
son about uncertain or unknown intrusion evidence based
on veriﬁed evidence. The experimental results in this pa-
per demonstrate the potential of the proposed techniques.
In particular, additional observations by system monitoring
or vulnerability scanning tools can potentially reduce the
false alert rate and increase the conﬁdence in alerts corre-
sponding to successful attacks.
1. Introduction
It is well-known that current intrusion detection systems
(IDSs) produce large numbers of alerts, including both ac-
tual and false alerts. The high volume and the low quality
of those alerts (i.e., missed attacks and false alerts) make it
very hard for human users or intrusion response systems to
understand the alerts and take appropriate actions.
∗
This work is partially supported by the National Science Foundation
(NSF) under grants ITR-0...


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

Input:
title:Reasoning About Complementary Intrusion Evidence
author:Yan Zhai and
Peng Ning and
Purush Iyer and
Douglas S. Reeves
Reasoning about Complementary Intrusion Evidence∗
Yan Zhai, Peng Ning, Purush Iyer, Douglas S. Reeves
Cyber Defense Laboratory
Department of Computer Science
North Carolina State University
Raleigh, NC 29695-8207
{yzhai, pning, purush, reeves}@ncsu.edu
Abstract
This paper presents techniques to integrate and reason
about complementary intrusion evidence such as alerts gen-
erated by intrusion detection systems (IDSs) and reports by
system monitoring or vulnerability scanning tools. To facil-
itate the modeling of intrusion evidence, this paper classi-
ﬁes intrusion evidence into either event-based evidence or
state-based evidence. Event-based evidence refers to obser-
vations (or detections) of intrusive actions (e.g., IDS alerts),
while state-based evidence refers to observations of the ef-
fects of intrusions on system states. Based on the interde-
pendency between event-based and state-based evidence,
this paper develops techniques to automatically integrate
complementary evidence into Bayesian networks, and rea-
son about uncertain or unknown intrusion evidence based
on veriﬁed evidence. The experimental results in this pa-
per demonstrate the potential of the proposed techniques.
In particular, additional observations by system monitoring
or vulnerability scanning tools can potentially reduce the
false alert rate and increase the conﬁdence in alerts corre-
sponding to successful attacks.
1. Introduction
It is well-known that current intrusion detection systems
(IDSs) produce large numbers of alerts, including both ac-
tual and false alerts. The high volume and the low quality
of those alerts (i.e., missed attacks and false alerts) make it
very hard for human users or intrusion response systems to
understand the alerts and take appropriate actions.
∗
This work is partially supported by the National Science Foundation
(NSF) under grants ITR-0...

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


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

Output:
安全论文分析：

title:Architecting reliable multi-core network-on-chip for small scale processing
technology
author:Xin Fu and
Tao Li and
Jos'e A. B. Fortes
20lO IEEEIIFIP
International
Conference
on Dependable
Systems
& Networks (DSN)
Architecting
Reliable
Multi-core
for Small Scale Processing
Network-on-Chip
Technology
CS Department,
University
of Illinois
at Urbana-Champaign
Xin Fu1
Tao Li,  Jose A.  B.
Fortes
of Florida
University
ECE Department,
taoli@ece.uf!.edu,
fortes@acis.uf!.edu
xfu@illinois.edu
Abstract
core design has made network
of future microprocessors.
technologies  continuously
scaling
down
(PV)
variation
(NBT!) significantly
Therefore,
it is
and mitigate
on a first step to optimize
in light of both PV and NBT! effects.
using small-scale
NoC
We
PV
that can hierarchically
processing
alleviate
their benign
regime,
component
to consider
architects
multi-Imany-
(NoC) a crucial
for multi-core
effects such as process
instability
and lifetime.
This paper reports
reliability
bias temperature
hardware reliability
The trend towards
on-chip
With CMOS processing
to the nanometer
and negative
decrease
imperative
these effects in NoCs implemented
technology.
architecture
propose novel techniques
and NBT! effects on NoC while leveraging
interaction.
efficiency
logics,
microarchitecture.
degradation
intelligently
power-reliability
show that our intra-router
VC _ M2) reduce  guardband
throughput
1R_M3) results
latency
and PV information
route packets,
by 24%. Our inter-router
across the NoC substrate.
in 50%  guardband
of key components
Our high-level
improvement.
design improves
Our low-level
delivering
(e.g. virtual
of critical
channels)
optimized
reduction
virtual
1. Introduction
PV and NBT!
channel allocation
paths of the pipelined
mechanisms
leverage
from multiple
router
NBT!
routers to
performance
results
Experimental
(i.e. VA_M1 and
level techniques
by 47...


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

Input:
title:Architecting reliable multi-core network-on-chip for small scale processing
technology
author:Xin Fu and
Tao Li and
Jos'e A. B. Fortes
20lO IEEEIIFIP
International
Conference
on Dependable
Systems
& Networks (DSN)
Architecting
Reliable
Multi-core
for Small Scale Processing
Network-on-Chip
Technology
CS Department,
University
of Illinois
at Urbana-Champaign
Xin Fu1
Tao Li,  Jose A.  B.
Fortes
of Florida
University
ECE Department,
taoli@ece.uf!.edu,
fortes@acis.uf!.edu
xfu@illinois.edu
Abstract
core design has made network
of future microprocessors.
technologies  continuously
scaling
down
(PV)
variation
(NBT!) significantly
Therefore,
it is
and mitigate
on a first step to optimize
in light of both PV and NBT! effects.
using small-scale
NoC
We
PV
that can hierarchically
processing
alleviate
their benign
regime,
component
to consider
architects
multi-Imany-
(NoC) a crucial
for multi-core
effects such as process
instability
and lifetime.
This paper reports
reliability
bias temperature
hardware reliability
The trend towards
on-chip
With CMOS processing
to the nanometer
and negative
decrease
imperative
these effects in NoCs implemented
technology.
architecture
propose novel techniques
and NBT! effects on NoC while leveraging
interaction.
efficiency
logics,
microarchitecture.
degradation
intelligently
power-reliability
show that our intra-router
VC _ M2) reduce  guardband
throughput
1R_M3) results
latency
and PV information
route packets,
by 24%. Our inter-router
across the NoC substrate.
in 50%  guardband
of key components
Our high-level
improvement.
design improves
Our low-level
delivering
(e.g. virtual
of critical
channels)
optimized
reduction
virtual
1. Introduction
PV and NBT!
channel allocation
paths of the pipelined
mechanisms
leverage
from multiple
router
NBT!
routers to
performance
results
Experimental
(i.e. VA_M1 and
level techniques
by 47...

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


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

Output:
安全论文分析：

title:Persona: an online social network with user-defined privacy
author:Randolph Baden and
Adam Bender and
Neil Spring and
Bobby Bhattacharjee and
Daniel Starin
Persona: An Online Social Network
with User-Deﬁned Privacy
Randy Baden, Adam Bender, Neil Spring, Bobby Bhattacharjee
University of Maryland
{randofu, bender, nspring, bobby}@cs.umd.edu
dstarin@starinconsulting.com
Daniel Starin
Starin Consulting∗
ABSTRACT
Online social networks (OSNs) are immensely popular, with
some claiming over 200 million users [10]. Users share pri-
vate content, such as personal information or photographs,
using OSN applications. Users must trust the OSN service
to protect personal information even as the OSN provider
beneﬁts from examining and sharing that information.
We present Persona, an OSN where users dictate who
may access their information. Persona hides user data with
attribute-based encryption (ABE), allowing users to apply
ﬁne-grained policies over who may view their data. Persona
provides an eﬀective means of creating applications in which
users, not the OSN, deﬁne policy over access to private data.
We demonstrate new cryptographic mechanisms that en-
hance the general applicability of ABE. We show how Per-
sona provides the functionality of existing online social net-
works with additional privacy beneﬁts. We describe an im-
plementation of Persona that replicates Facebook applica-
tions and show that Persona provides acceptable perfor-
mance when browsing privacy-enhanced web pages, even on
mobile devices.
Categories and Subject Descriptors
C.2.0 [Computer Systems Organization]: Computer Com-
munications Networks—General ; C.2.4 [Computer Sys-
tems Organization]: Computer Communications Networks—
Distributed Systems; E.3 [Data]: Data Encryption; H.3.4
[Information Systems]: Information Storage and Retrieval—
Systems and Software
General Terms
Design, Security, Performance
Keywords
Persona, OSN, Social Networks, ABE, Privacy, Facebook
∗Mr. Starin’s work on this project...


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

Input:
title:Persona: an online social network with user-defined privacy
author:Randolph Baden and
Adam Bender and
Neil Spring and
Bobby Bhattacharjee and
Daniel Starin
Persona: An Online Social Network
with User-Deﬁned Privacy
Randy Baden, Adam Bender, Neil Spring, Bobby Bhattacharjee
University of Maryland
{randofu, bender, nspring, bobby}@cs.umd.edu
dstarin@starinconsulting.com
Daniel Starin
Starin Consulting∗
ABSTRACT
Online social networks (OSNs) are immensely popular, with
some claiming over 200 million users [10]. Users share pri-
vate content, such as personal information or photographs,
using OSN applications. Users must trust the OSN service
to protect personal information even as the OSN provider
beneﬁts from examining and sharing that information.
We present Persona, an OSN where users dictate who
may access their information. Persona hides user data with
attribute-based encryption (ABE), allowing users to apply
ﬁne-grained policies over who may view their data. Persona
provides an eﬀective means of creating applications in which
users, not the OSN, deﬁne policy over access to private data.
We demonstrate new cryptographic mechanisms that en-
hance the general applicability of ABE. We show how Per-
sona provides the functionality of existing online social net-
works with additional privacy beneﬁts. We describe an im-
plementation of Persona that replicates Facebook applica-
tions and show that Persona provides acceptable perfor-
mance when browsing privacy-enhanced web pages, even on
mobile devices.
Categories and Subject Descriptors
C.2.0 [Computer Systems Organization]: Computer Com-
munications Networks—General ; C.2.4 [Computer Sys-
tems Organization]: Computer Communications Networks—
Distributed Systems; E.3 [Data]: Data Encryption; H.3.4
[Information Systems]: Information Storage and Retrieval—
Systems and Software
General Terms
Design, Security, Performance
Keywords
Persona, OSN, Social Networks, ABE, Privacy, Facebook
∗Mr. Starin’s work on this project...

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


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

Output:
安全论文分析：

title:Sensitive Information Tracking in Commodity IoT
author:Z. Berkay Celik and
Leonardo Babun and
Amit Kumar Sikder and
Hidayet Aksu and
Gang Tan and
Patrick D. McDaniel and
A. Selcuk Uluagac
Sensitive Information Tracking in Commodity IoT
Z. Berkay Celik, The Pennsylvania State University; Leonardo Babun, Amit Kumar Sikder, and
Hidayet Aksu, Florida International University; Gang Tan and Patrick McDaniel,
The Pennsylvania State University; A. Selcuk Uluagac, Florida International University
https://www.usenix.org/conference/usenixsecurity18/presentation/celik
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.Sensitive Information Tracking in Commodity IoT
Z. Berkay Celik∗1, Leonardo Babun∗2, Amit K. Sikder2, Hidayet Aksu2,
Gang Tan1, Patrick McDaniel1, and A. Selcuk Uluagac2
1 Systems and Internet Infrastructure Security Lab
Department of CSE, The Pennsylvania State University
{zbc102,gtan,mcdaniel}@cse.psu.edu
2 Cyber-Physical Systems Security Lab
Department of ECE, Florida International University
{lbabu002,asikd003,haksu,suluagac}@fiu.edu
Abstract
Broadly deﬁned as the Internet of Things (IoT), the
growth of commodity devices that integrate physical pro-
cesses with digital connectivity has had profound effects
on society–smart homes, personal monitoring devices, en-
hanced manufacturing and other IoT applications have
changed the way we live, play, and work. Yet extant IoT
platforms provide few means of evaluating the use (and
potential avenues for misuse) of sensitive information.
Thus, consumers and organizations have little informa-
tion to assess the security and privacy risks these devices
present. In this paper, we present SAINT, a static taint
analysis tool for IoT applications. SAINT operates in three
phases; (a) translation of platform-speciﬁc IoT source
code into an i...


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

Input:
title:Sensitive Information Tracking in Commodity IoT
author:Z. Berkay Celik and
Leonardo Babun and
Amit Kumar Sikder and
Hidayet Aksu and
Gang Tan and
Patrick D. McDaniel and
A. Selcuk Uluagac
Sensitive Information Tracking in Commodity IoT
Z. Berkay Celik, The Pennsylvania State University; Leonardo Babun, Amit Kumar Sikder, and
Hidayet Aksu, Florida International University; Gang Tan and Patrick McDaniel,
The Pennsylvania State University; A. Selcuk Uluagac, Florida International University
https://www.usenix.org/conference/usenixsecurity18/presentation/celik
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.Sensitive Information Tracking in Commodity IoT
Z. Berkay Celik∗1, Leonardo Babun∗2, Amit K. Sikder2, Hidayet Aksu2,
Gang Tan1, Patrick McDaniel1, and A. Selcuk Uluagac2
1 Systems and Internet Infrastructure Security Lab
Department of CSE, The Pennsylvania State University
{zbc102,gtan,mcdaniel}@cse.psu.edu
2 Cyber-Physical Systems Security Lab
Department of ECE, Florida International University
{lbabu002,asikd003,haksu,suluagac}@fiu.edu
Abstract
Broadly deﬁned as the Internet of Things (IoT), the
growth of commodity devices that integrate physical pro-
cesses with digital connectivity has had profound effects
on society–smart homes, personal monitoring devices, en-
hanced manufacturing and other IoT applications have
changed the way we live, play, and work. Yet extant IoT
platforms provide few means of evaluating the use (and
potential avenues for misuse) of sensitive information.
Thus, consumers and organizations have little informa-
tion to assess the security and privacy risks these devices
present. In this paper, we present SAINT, a static taint
analysis tool for IoT applications. SAINT operates in three
phases; (a) translation of platform-speciﬁc IoT source
code into an i...

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


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

Output:
安全论文分析：

title:Uncharted Networks: A First Measurement Study of the Bulk Power
System
author:Kelvin Mai and
Xi Qin and
Neil Ortiz Silva and
Jason Molina and
Alvaro A. C'ardenas
Uncharted Networks: A First Measurement Study of the Bulk
Power System
Kelvin Mai∗
The University of Texas at Dallas
Kelvin.Mai@utdallas.edu
University of California, Santa Cruz
University of California, Santa Cruz
Neil Ortiz
nortizsi@ucsc.edu
Xi Qin∗
xqin9@ucsc.edu
Jason Molina
Independent
jason100molina@gmail.com
ABSTRACT
In the last two decades, the communication technologies used for
supervision and control of critical infrastructures such as the power
grid, have been migrating from serial links to Internet-compatible
network protocols. Despite this trend, the research community
has not explored or measured the unique characteristics of these
industrial systems, and as a result, most of these networks remain
unstudied. In this paper we perform the first measurement study of
a Supervisory Control And Data Acquisition (SCADA) network in
the bulk power grid. We develop a new protocol parser that can be
used to analyze packets not conforming to standards, find attributes
to profile the SCADA network, and identify several outliers which
underscore the difficulties in managing a federated network where
different devices are under the control of different power companies.
CCS CONCEPTS
• Networks → Cyber-physical networks; Application layer
protocols; Network monitoring; Network measurement; Net-
work reliability; • Security and privacy → Intrusion detection sys-
tems; • Computing methodologies → Cluster analysis; Markov
decision processes;
KEYWORDS
SCADA, traffic analysis, IEC 104
ACM Reference Format:
Kelvin Mai, Xi Qin[1], Neil Ortiz, Jason Molina, and Alvaro A. Cardenas.
2020. Uncharted Networks: A First Measurement Study of the Bulk Power
System. In ACM Internet Measurement Conference (IMC ’20), October 27–
29, 2020, Virtual Event, USA. ACM, New York, NY, USA, 13 pages. https:
//doi.org/10.1145/...


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

Input:
title:Uncharted Networks: A First Measurement Study of the Bulk Power
System
author:Kelvin Mai and
Xi Qin and
Neil Ortiz Silva and
Jason Molina and
Alvaro A. C'ardenas
Uncharted Networks: A First Measurement Study of the Bulk
Power System
Kelvin Mai∗
The University of Texas at Dallas
Kelvin.Mai@utdallas.edu
University of California, Santa Cruz
University of California, Santa Cruz
Neil Ortiz
nortizsi@ucsc.edu
Xi Qin∗
xqin9@ucsc.edu
Jason Molina
Independent
jason100molina@gmail.com
ABSTRACT
In the last two decades, the communication technologies used for
supervision and control of critical infrastructures such as the power
grid, have been migrating from serial links to Internet-compatible
network protocols. Despite this trend, the research community
has not explored or measured the unique characteristics of these
industrial systems, and as a result, most of these networks remain
unstudied. In this paper we perform the first measurement study of
a Supervisory Control And Data Acquisition (SCADA) network in
the bulk power grid. We develop a new protocol parser that can be
used to analyze packets not conforming to standards, find attributes
to profile the SCADA network, and identify several outliers which
underscore the difficulties in managing a federated network where
different devices are under the control of different power companies.
CCS CONCEPTS
• Networks → Cyber-physical networks; Application layer
protocols; Network monitoring; Network measurement; Net-
work reliability; • Security and privacy → Intrusion detection sys-
tems; • Computing methodologies → Cluster analysis; Markov
decision processes;
KEYWORDS
SCADA, traffic analysis, IEC 104
ACM Reference Format:
Kelvin Mai, Xi Qin[1], Neil Ortiz, Jason Molina, and Alvaro A. Cardenas.
2020. Uncharted Networks: A First Measurement Study of the Bulk Power
System. In ACM Internet Measurement Conference (IMC ’20), October 27–
29, 2020, Virtual Event, USA. ACM, New York, NY, USA, 13 pages. https:
//doi.org/10.1145/...

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


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

Output:
安全论文分析：

title:Traffic statistics collection with FleXam
author:Sajad Shirali-Shahreza and
Yashar Ganjali
Traffic Statistics Collection with FleXam
Yashar Ganjali
Sajad Shirali-Shahreza
Department of Computer Science
University of Toronto, Canada
shirali@cs.toronto.edu
Department of Computer Science
University of Toronto, Canada
yganjali@cs.toronto.edu
ABSTRACT
One  of  the  limitations  of  wildcard  rules  in  Software  Defined
Networks,  such  as  OpenFlow,  is  losing  visibility.  FleXam  is  a
flexible sampling extension for OpenFlow that allows the controller
to  define  which  packets  should  be  sampled,  what  parts  of  each
packet should be selected, and where they should be sent. Here,
we present an interactive demo showing how FleXam enables the
controller  to  dynamically  adjust  sampling  rates  and  change  the
sampling scheme to optimally keep up with a sampling budget in
the context of a traffic statistics collection application.
Categories and Subject Descriptors
C.2.3  [Communication  Networks]:  Network  Operations  –
Network management, Network monitoring.
Keywords
OpenFlow; Sampling; SDN; Traffic Statistics.
1.  Introduction
Software-Defined Networking (SDN) provides a centralized view
of  the  network,  simplifying  programmatic  manipulation  and
management  of  the  network  traffic.  The  ability  to  easily  access
and manage individual flows is a significant advantage of SDN in
general, and OpenFlow specifically. This feature can be used to
implement  security  and  monitoring  applications such as firewall
[1]  or anomaly detection [2] as control applications, eliminating
the need for dedicated middleboxes.
While  managing  flows  individually  can  be  beneficial  –  e.g.  for
applications  such  as  firewalls  –  fine-grained  management  of
flows,  especially  short-lived ones, can lead to unacceptable side
effects: increased flow setup delay (first packet waiting in a switch
until the controller instr...


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

Input:
title:Traffic statistics collection with FleXam
author:Sajad Shirali-Shahreza and
Yashar Ganjali
Traffic Statistics Collection with FleXam
Yashar Ganjali
Sajad Shirali-Shahreza
Department of Computer Science
University of Toronto, Canada
shirali@cs.toronto.edu
Department of Computer Science
University of Toronto, Canada
yganjali@cs.toronto.edu
ABSTRACT
One  of  the  limitations  of  wildcard  rules  in  Software  Defined
Networks,  such  as  OpenFlow,  is  losing  visibility.  FleXam  is  a
flexible sampling extension for OpenFlow that allows the controller
to  define  which  packets  should  be  sampled,  what  parts  of  each
packet should be selected, and where they should be sent. Here,
we present an interactive demo showing how FleXam enables the
controller  to  dynamically  adjust  sampling  rates  and  change  the
sampling scheme to optimally keep up with a sampling budget in
the context of a traffic statistics collection application.
Categories and Subject Descriptors
C.2.3  [Communication  Networks]:  Network  Operations  –
Network management, Network monitoring.
Keywords
OpenFlow; Sampling; SDN; Traffic Statistics.
1.  Introduction
Software-Defined Networking (SDN) provides a centralized view
of  the  network,  simplifying  programmatic  manipulation  and
management  of  the  network  traffic.  The  ability  to  easily  access
and manage individual flows is a significant advantage of SDN in
general, and OpenFlow specifically. This feature can be used to
implement  security  and  monitoring  applications such as firewall
[1]  or anomaly detection [2] as control applications, eliminating
the need for dedicated middleboxes.
While  managing  flows  individually  can  be  beneficial  –  e.g.  for
applications  such  as  firewalls  –  fine-grained  management  of
flows,  especially  short-lived ones, can lead to unacceptable side
effects: increased flow setup delay (first packet waiting in a switch
until the controller instr...

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


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

Output:
安全论文分析：

title:Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email
Delivery Security
author:Zakir Durumeric and
David Adrian and
Ariana Mirian and
James Kasten and
Elie Bursztein and
Nicolas Lidzborski and
Kurt Thomas and
Vijay Eranti and
Michael Bailey and
J. Alex Halderman
Neither Snow Nor Rain Nor MITM . . .
An Empirical Analysis of Email Delivery Security
Zakir Durumeric† David Adrian† Ariana Mirian† James Kasten† Elie Bursztein‡
Nicolas Lidzborski‡ Kurt Thomas‡ Vijay Eranti‡ Michael Bailey§ J. Alex Halderman†
† University of Michigan ‡ Google, Inc.
§ University of Illinois, Urbana Champaign
{zakir, davadria, amirian, jdkasten, jhalderm}@umich.edu
{elieb, nlidz, kurtthomas, vijaye}@google.com
mdbailey@illinois.edu
ABSTRACT
The SMTP protocol is responsible for carrying some of users’ most
intimate communication, but like other Internet protocols, authen-
tication and conﬁdentiality were added only as an afterthought. In
this work, we present the ﬁrst report on global adoption rates of
SMTP security extensions, including: STARTTLS, SPF, DKIM, and
DMARC. We present data from two perspectives: SMTP server
conﬁgurations for the Alexa Top Million domains, and over a year
of SMTP connections to and from Gmail. We ﬁnd that the top mail
providers (e.g., Gmail, Yahoo, and Outlook) all proactively encrypt
and authenticate messages. However, these best practices have yet
to reach widespread adoption in a long tail of over 700,000 SMTP
servers, of which only 35% successfully conﬁgure encryption, and
1.1% specify a DMARC authentication policy. This security patch-
work— paired with SMTP policies that favor failing open to allow
gradual deployment—exposes users to attackers who downgrade
TLS connections in favor of cleartext and who falsify MX records
to reroute messages. We present evidence of such attacks in the
wild, highlighting seven countries where more than 20% of inbound
Gmail messages arrive in cleartext due to network attackers.
Keywords
SMTP, Email, Mail, TLS, ...


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

Input:
title:Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email
Delivery Security
author:Zakir Durumeric and
David Adrian and
Ariana Mirian and
James Kasten and
Elie Bursztein and
Nicolas Lidzborski and
Kurt Thomas and
Vijay Eranti and
Michael Bailey and
J. Alex Halderman
Neither Snow Nor Rain Nor MITM . . .
An Empirical Analysis of Email Delivery Security
Zakir Durumeric† David Adrian† Ariana Mirian† James Kasten† Elie Bursztein‡
Nicolas Lidzborski‡ Kurt Thomas‡ Vijay Eranti‡ Michael Bailey§ J. Alex Halderman†
† University of Michigan ‡ Google, Inc.
§ University of Illinois, Urbana Champaign
{zakir, davadria, amirian, jdkasten, jhalderm}@umich.edu
{elieb, nlidz, kurtthomas, vijaye}@google.com
mdbailey@illinois.edu
ABSTRACT
The SMTP protocol is responsible for carrying some of users’ most
intimate communication, but like other Internet protocols, authen-
tication and conﬁdentiality were added only as an afterthought. In
this work, we present the ﬁrst report on global adoption rates of
SMTP security extensions, including: STARTTLS, SPF, DKIM, and
DMARC. We present data from two perspectives: SMTP server
conﬁgurations for the Alexa Top Million domains, and over a year
of SMTP connections to and from Gmail. We ﬁnd that the top mail
providers (e.g., Gmail, Yahoo, and Outlook) all proactively encrypt
and authenticate messages. However, these best practices have yet
to reach widespread adoption in a long tail of over 700,000 SMTP
servers, of which only 35% successfully conﬁgure encryption, and
1.1% specify a DMARC authentication policy. This security patch-
work— paired with SMTP policies that favor failing open to allow
gradual deployment—exposes users to attackers who downgrade
TLS connections in favor of cleartext and who falsify MX records
to reroute messages. We present evidence of such attacks in the
wild, highlighting seven countries where more than 20% of inbound
Gmail messages arrive in cleartext due to network attackers.
Keywords
SMTP, Email, Mail, TLS, ...

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


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

Output:
安全论文分析：

title:How'd Security Benefit Reverse Engineers? : The Implication of Intel
CET on Function Identification
author:Hyungseok Kim and
Junoh Lee and
Soomin Kim and
Seungil Jung and
Sang Kil Cha
1
6
0
0
0
.
2
2
0
2
.
5
0
4
3
5
N
S
D
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
1
-
3
9
6
1
-
4
5
6
6
-
1
-
8
7
9
|
)
N
S
D
(
s
k
r
o
w
t
e
N
d
n
a
s
m
e
t
s
y
S
e
l
b
a
d
n
e
p
e
D
n
o
e
c
n
e
r
e
f
n
o
C
l
a
n
o
i
t
a
n
r
e
t
n
I
P
I
F
I
/
E
E
E
I
l
a
u
n
n
A
d
n
2
5
2
2
0
2
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
How’d Security Beneﬁt Reverse Engineers?
The Implication of Intel CET on Function Identiﬁcation
Hyungseok Kim∗†, Junoh Lee†, Soomin Kim†, Seungil Jung‡, Sang Kil Cha†
∗The Afﬁliated Institute of ETRI, †KAIST, ‡KAIST CSRC
hskim@nsr.re.kr, junoh@kaist.ac.kr, soomink@kaist.ac.kr, sijung@kaist.ac.kr, sangkilc@kaist.ac.kr
Abstract—As CPU vendors
introduce various hardware-
assisted security features, modern compilers have started to
produce binaries containing security-related instructions. Inter-
estingly, such instructions tend to alter the shape of resulting
binaries, which can potentially affect the effectiveness of binary
analysis. This paper presents the ﬁrst systematic study on
the implication of the Intel CET (Control-ﬂow Enforcement
Technology) instructions on function identiﬁcation. Our study
ﬁnds that CET-relevant instructions provide useful, although
limited, hints for function entries. Therefore, we devise a novel
function identiﬁcation algorithm that utilizes the usage patterns
of CET instructions, and demonstrate a tool named FunSeeker
that implements the idea. Our evaluation shows that FunSeeker
signiﬁcantly outperforms current state-of-the-art function iden-
tiﬁcation tools in terms of both correctness and speed.
Index Terms—function identiﬁcation, binary analysis, Intel
CET, reverse engineering
I. INTRODUCTION
Memory corruption bugs have been existed for about a half
century. Yet, ...


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

Input:
title:How'd Security Benefit Reverse Engineers? : The Implication of Intel
CET on Function Identification
author:Hyungseok Kim and
Junoh Lee and
Soomin Kim and
Seungil Jung and
Sang Kil Cha
1
6
0
0
0
.
2
2
0
2
.
5
0
4
3
5
N
S
D
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
1
-
3
9
6
1
-
4
5
6
6
-
1
-
8
7
9
|
)
N
S
D
(
s
k
r
o
w
t
e
N
d
n
a
s
m
e
t
s
y
S
e
l
b
a
d
n
e
p
e
D
n
o
e
c
n
e
r
e
f
n
o
C
l
a
n
o
i
t
a
n
r
e
t
n
I
P
I
F
I
/
E
E
E
I
l
a
u
n
n
A
d
n
2
5
2
2
0
2
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
How’d Security Beneﬁt Reverse Engineers?
The Implication of Intel CET on Function Identiﬁcation
Hyungseok Kim∗†, Junoh Lee†, Soomin Kim†, Seungil Jung‡, Sang Kil Cha†
∗The Afﬁliated Institute of ETRI, †KAIST, ‡KAIST CSRC
hskim@nsr.re.kr, junoh@kaist.ac.kr, soomink@kaist.ac.kr, sijung@kaist.ac.kr, sangkilc@kaist.ac.kr
Abstract—As CPU vendors
introduce various hardware-
assisted security features, modern compilers have started to
produce binaries containing security-related instructions. Inter-
estingly, such instructions tend to alter the shape of resulting
binaries, which can potentially affect the effectiveness of binary
analysis. This paper presents the ﬁrst systematic study on
the implication of the Intel CET (Control-ﬂow Enforcement
Technology) instructions on function identiﬁcation. Our study
ﬁnds that CET-relevant instructions provide useful, although
limited, hints for function entries. Therefore, we devise a novel
function identiﬁcation algorithm that utilizes the usage patterns
of CET instructions, and demonstrate a tool named FunSeeker
that implements the idea. Our evaluation shows that FunSeeker
signiﬁcantly outperforms current state-of-the-art function iden-
tiﬁcation tools in terms of both correctness and speed.
Index Terms—function identiﬁcation, binary analysis, Intel
CET, reverse engineering
I. INTRODUCTION
Memory corruption bugs have been existed for about a half
century. Yet, ...

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


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

Output:
安全论文分析：

title:Leap-Frog Packet Linking and Diverse Key Distributions for Improved
Integrity in Network Broadcasts
author:Michael T. Goodrich
Leap-Frog Packet Linking and Diverse Key Distributions for
Improved Integrity in Network Broadcasts
MICHAEL T. GOODRICH
Dept. of Computer Science
University of California, Irvine
Irvine, CA 92697-3425
goodrich (at) ieee.org
Abstract
We present two new approaches to improving the in-
tegrity of network broadcasts and multicasts with low stor-
age and computation overhead. The ﬁrst approach is a leap-
frog linking protocol for securing the integrity of packets
as they traverse a network during a broadcast, such as in
the setup phase for link-state routing. This technique al-
lows each router to gain conﬁdence about the integrity of
a packet before passing it on to the next router; hence, al-
lows many integrity violations to be stopped immediately
in their tracks. The second approach is a novel key pre-
distribution scheme that we use in conjunction with a small
number of hashed message authentication codes (HMACs),
which allows end-to-end integrity checking as well as im-
proved hop-by-hop integrity checking. Our schemes are
suited to environments, such as in ad hoc and overlay net-
works, where routers can share only a small number of sym-
metric keys. Moreover, our protocols do not use encryption
(which, of course, can be added as an optional security en-
hancement). Instead, security is based strictly on the use of
one-way hash functions; hence, our algorithms are consid-
erably faster than those based on traditional public-key sig-
nature schemes. This improvement in speed comes with only
modest reductions in the security for broadcasting, as our
schemes can tolerate small numbers of malicious routers,
provided they don’t form signiﬁcant cooperating coalitions.
1 Introduction
The integrity of messages in network broadcasts and
multicasts is an essential component of communication, as
false or modiﬁed packets contribute to congestion...


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

Input:
title:Leap-Frog Packet Linking and Diverse Key Distributions for Improved
Integrity in Network Broadcasts
author:Michael T. Goodrich
Leap-Frog Packet Linking and Diverse Key Distributions for
Improved Integrity in Network Broadcasts
MICHAEL T. GOODRICH
Dept. of Computer Science
University of California, Irvine
Irvine, CA 92697-3425
goodrich (at) ieee.org
Abstract
We present two new approaches to improving the in-
tegrity of network broadcasts and multicasts with low stor-
age and computation overhead. The ﬁrst approach is a leap-
frog linking protocol for securing the integrity of packets
as they traverse a network during a broadcast, such as in
the setup phase for link-state routing. This technique al-
lows each router to gain conﬁdence about the integrity of
a packet before passing it on to the next router; hence, al-
lows many integrity violations to be stopped immediately
in their tracks. The second approach is a novel key pre-
distribution scheme that we use in conjunction with a small
number of hashed message authentication codes (HMACs),
which allows end-to-end integrity checking as well as im-
proved hop-by-hop integrity checking. Our schemes are
suited to environments, such as in ad hoc and overlay net-
works, where routers can share only a small number of sym-
metric keys. Moreover, our protocols do not use encryption
(which, of course, can be added as an optional security en-
hancement). Instead, security is based strictly on the use of
one-way hash functions; hence, our algorithms are consid-
erably faster than those based on traditional public-key sig-
nature schemes. This improvement in speed comes with only
modest reductions in the security for broadcasting, as our
schemes can tolerate small numbers of malicious routers,
provided they don’t form signiﬁcant cooperating coalitions.
1 Introduction
The integrity of messages in network broadcasts and
multicasts is an essential component of communication, as
false or modiﬁed packets contribute to congestion...

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


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

Output:
安全论文分析：

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


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

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

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


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

Output:
安全论文分析：

title:Clickjacking: Attacks and Defenses
author:Lin-Shung Huang and
Alexander Moshchuk and
Helen J. Wang and
Stuart Schecter and
Collin Jackson
Clickjacking: Attacks and Defenses
Lin-Shung Huang
Carnegie Mellon University
linshung.huang@sv.cmu.edu
Alex Moshchuk
Microsoft Research
alexmos@microsoft.com
Helen J. Wang
Microsoft Research
helenw@microsoft.com
Stuart Schechter
Microsoft Research
stuart.schechter@microsoft.com
Collin Jackson
Carnegie Mellon University
collin.jackson@sv.cmu.edu
Abstract
Clickjacking attacks are an emerging threat on the web.
In this paper, we design new clickjacking attack variants
using existing techniques and demonstrate that existing
clickjacking defenses are insufﬁcient. Our attacks show
that clickjacking can cause severe damages, including
compromising a user’s private webcam, email or other
private data, and web surﬁng anonymity.
We observe the root cause of clickjacking is that an
attacker application presents a sensitive UI element of a
target application out of context to a user (such as hiding
the sensitive UI by making it transparent), and hence the
user is tricked to act out of context. To address this root
cause, we propose a new defense, InContext, in which
web sites (or applications) mark UI elements that are sen-
sitive, and browsers (or OSes) enforce context integrity
of user actions on these sensitive UI elements, ensuring
that a user sees everything she should see before her ac-
tion and that the timing of the action corresponds to her
intent.
Introduction
We have conducted user studies on Amazon Mechani-
cal Turk with 2064 participants to evaluate the effective-
ness of our attacks and our defense. We show that our at-
tacks have success rates ranging from 43% to 98%, and
our InContext defense can be very effective against the
clickjacking attacks in which the use of clickjacking is
more effective than social engineering.
1
When multiple applications or web sites (or OS princi-
pals [44] in general) share a graphical dis...


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

Input:
title:Clickjacking: Attacks and Defenses
author:Lin-Shung Huang and
Alexander Moshchuk and
Helen J. Wang and
Stuart Schecter and
Collin Jackson
Clickjacking: Attacks and Defenses
Lin-Shung Huang
Carnegie Mellon University
linshung.huang@sv.cmu.edu
Alex Moshchuk
Microsoft Research
alexmos@microsoft.com
Helen J. Wang
Microsoft Research
helenw@microsoft.com
Stuart Schechter
Microsoft Research
stuart.schechter@microsoft.com
Collin Jackson
Carnegie Mellon University
collin.jackson@sv.cmu.edu
Abstract
Clickjacking attacks are an emerging threat on the web.
In this paper, we design new clickjacking attack variants
using existing techniques and demonstrate that existing
clickjacking defenses are insufﬁcient. Our attacks show
that clickjacking can cause severe damages, including
compromising a user’s private webcam, email or other
private data, and web surﬁng anonymity.
We observe the root cause of clickjacking is that an
attacker application presents a sensitive UI element of a
target application out of context to a user (such as hiding
the sensitive UI by making it transparent), and hence the
user is tricked to act out of context. To address this root
cause, we propose a new defense, InContext, in which
web sites (or applications) mark UI elements that are sen-
sitive, and browsers (or OSes) enforce context integrity
of user actions on these sensitive UI elements, ensuring
that a user sees everything she should see before her ac-
tion and that the timing of the action corresponds to her
intent.
Introduction
We have conducted user studies on Amazon Mechani-
cal Turk with 2064 participants to evaluate the effective-
ness of our attacks and our defense. We show that our at-
tacks have success rates ranging from 43% to 98%, and
our InContext defense can be very effective against the
clickjacking attacks in which the use of clickjacking is
more effective than social engineering.
1
When multiple applications or web sites (or OS princi-
pals [44] in general) share a graphical dis...

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


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

Output:
安全论文分析：

title:SANA: Secure and Scalable Aggregate Network Attestation
author:Moreno Ambrosin and
Mauro Conti and
Ahmad Ibrahim and
Gregory Neven and
Ahmad-Reza Sadeghi and
Matthias Schunter
SANA: Secure and Scalable Aggregate Network Attestation
Moreno Ambrosin1, Mauro Conti1, Ahmad Ibrahim2∗, Gregory Neven3,
Ahmad-Reza Sadeghi2, and Matthias Schunter4
1University of Padua, Italy
3IBM Research - Zurich, Switzerland
2Technische Universität Darmstadt, Germany
4Intel Labs - Darmstadt, Germany
{ahmad.ibrahim, ahmad.sadeghi}@trust.tu-darmstadt.de,
{ambrosin, conti}@math.unipd.it, schunter@acm.org, NEV@zurich.ibm.com
ABSTRACT
Large numbers of smart connected devices, also named as the In-
ternet of Things (IoT), are permeating our environments (homes,
factories, cars, and also our body—with wearable devices) to collect
data and act on the insight derived. Ensuring software integrity (in-
cluding OS, apps, and conﬁgurations) on such smart devices is then
essential to guarantee both privacy and safety. A key mechanism to
protect the software integrity of these devices is remote attestation:
A process that allows a remote veriﬁer to validate the integrity of
the software of a device. This process usually makes use of a signed
hash value of the actual device’s software, generated by dedicated
hardware. While individual device attestation is a well-established
technique, to date integrity veriﬁcation of a very large number of
devices remains an open problem, due to scalability issues.
In this paper, we present SANA, the ﬁrst secure and scalable pro-
tocol for efﬁcient attestation of large sets of devices that works under
realistic assumptions. SANA relies on a novel signature scheme to
allow anyone to publicly verify a collective attestation in constant
time and space, for virtually an unlimited number of devices. We
substantially improve existing swarm attestation schemes [5] by sup-
porting a realistic trust model where: (1) only the targeted devices
are required to implement attest...


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

Input:
title:SANA: Secure and Scalable Aggregate Network Attestation
author:Moreno Ambrosin and
Mauro Conti and
Ahmad Ibrahim and
Gregory Neven and
Ahmad-Reza Sadeghi and
Matthias Schunter
SANA: Secure and Scalable Aggregate Network Attestation
Moreno Ambrosin1, Mauro Conti1, Ahmad Ibrahim2∗, Gregory Neven3,
Ahmad-Reza Sadeghi2, and Matthias Schunter4
1University of Padua, Italy
3IBM Research - Zurich, Switzerland
2Technische Universität Darmstadt, Germany
4Intel Labs - Darmstadt, Germany
{ahmad.ibrahim, ahmad.sadeghi}@trust.tu-darmstadt.de,
{ambrosin, conti}@math.unipd.it, schunter@acm.org, NEV@zurich.ibm.com
ABSTRACT
Large numbers of smart connected devices, also named as the In-
ternet of Things (IoT), are permeating our environments (homes,
factories, cars, and also our body—with wearable devices) to collect
data and act on the insight derived. Ensuring software integrity (in-
cluding OS, apps, and conﬁgurations) on such smart devices is then
essential to guarantee both privacy and safety. A key mechanism to
protect the software integrity of these devices is remote attestation:
A process that allows a remote veriﬁer to validate the integrity of
the software of a device. This process usually makes use of a signed
hash value of the actual device’s software, generated by dedicated
hardware. While individual device attestation is a well-established
technique, to date integrity veriﬁcation of a very large number of
devices remains an open problem, due to scalability issues.
In this paper, we present SANA, the ﬁrst secure and scalable pro-
tocol for efﬁcient attestation of large sets of devices that works under
realistic assumptions. SANA relies on a novel signature scheme to
allow anyone to publicly verify a collective attestation in constant
time and space, for virtually an unlimited number of devices. We
substantially improve existing swarm attestation schemes [5] by sup-
porting a realistic trust model where: (1) only the targeted devices
are required to implement attest...

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


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

Output:
安全论文分析：

title:Signal anomaly based attack detection in wireless sensor networks
author:Jeton Bacaj and
Leon Reznik
IEEE COMMUNICATIONS SURVEYS & TUTORIALS, ACCEPTED FOR PUBLICATION
1
Anomaly Detection in Wireless Sensor
Networks in a Non-Stationary Environment
Colin O’Reilly, Member, IEEE, Alexander Gluhak, Muhammad Ali Imran, Senior Member, IEEE, and
Sutharshan Rajasegarar, Member, IEEE
Abstract—Anomaly detection in a wireless sensor network
(WSN) is an important aspect of data analysis in order to
identify data items that signiﬁcantly differ from normal data.
A characteristic of the data generated by a WSN is that the
data distribution may alter over the lifetime of the network
due to the changing nature of the phenomenon being observed.
Anomaly detection techniques must be able to adapt to a non-
stationary data distribution in order to perform optimally. In
this survey, we provide a comprehensive overview of approaches
to anomaly detection in a WSN and their operation in a non-
stationary environment.
Index Terms—Wireless sensor networks, anomaly detection,
outlier detection, non-stationary, concept drift, distributed com-
puting
I. INTRODUCTION
L ARGE scale monitoring applications such as smart city
realisations [1], environmental monitoring [2], [3], indus-
trial monitoring [4], internal building monitoring [5], [6] and
surveillance [7], [8] provide valuable information for intelli-
gent decision making and smart living. However, collecting
data from such applications can pose a signiﬁcant challenge
due to the size and location of the monitored area, the envi-
ronmental conditions and the deployment timescale. WSNs
provide a platform for solving this monitoring challenge,
which are low cost, easy to deploy, and require little or no
maintenance during the lifetime of the network.
A WSN is formed using interconnected nodes that auto-
matically conﬁgure themselves. There are three important
elements that characterize a WSN node, namely one or
more sensors, a processing u...


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

Input:
title:Signal anomaly based attack detection in wireless sensor networks
author:Jeton Bacaj and
Leon Reznik
IEEE COMMUNICATIONS SURVEYS & TUTORIALS, ACCEPTED FOR PUBLICATION
1
Anomaly Detection in Wireless Sensor
Networks in a Non-Stationary Environment
Colin O’Reilly, Member, IEEE, Alexander Gluhak, Muhammad Ali Imran, Senior Member, IEEE, and
Sutharshan Rajasegarar, Member, IEEE
Abstract—Anomaly detection in a wireless sensor network
(WSN) is an important aspect of data analysis in order to
identify data items that signiﬁcantly differ from normal data.
A characteristic of the data generated by a WSN is that the
data distribution may alter over the lifetime of the network
due to the changing nature of the phenomenon being observed.
Anomaly detection techniques must be able to adapt to a non-
stationary data distribution in order to perform optimally. In
this survey, we provide a comprehensive overview of approaches
to anomaly detection in a WSN and their operation in a non-
stationary environment.
Index Terms—Wireless sensor networks, anomaly detection,
outlier detection, non-stationary, concept drift, distributed com-
puting
I. INTRODUCTION
L ARGE scale monitoring applications such as smart city
realisations [1], environmental monitoring [2], [3], indus-
trial monitoring [4], internal building monitoring [5], [6] and
surveillance [7], [8] provide valuable information for intelli-
gent decision making and smart living. However, collecting
data from such applications can pose a signiﬁcant challenge
due to the size and location of the monitored area, the envi-
ronmental conditions and the deployment timescale. WSNs
provide a platform for solving this monitoring challenge,
which are low cost, easy to deploy, and require little or no
maintenance during the lifetime of the network.
A WSN is formed using interconnected nodes that auto-
matically conﬁgure themselves. There are three important
elements that characterize a WSN node, namely one or
more sensors, a processing u...

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


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

Output:
安全论文分析：

title:AVANT-GUARD: scalable and vigilant switch flow management in software-defined
networks
author:Seungwon Shin and
Vinod Yegneswaran and
Phillip A. Porras and
Guofei Gu
AVANT-GUARD: Scalable and Vigilant Switch Flow
Management in Software-Deﬁned Networks
Seungwon Shin† Vinod Yegneswaran‡ Phillip Porras‡ Guofei Gu†
{swshin,guofei}@cse.tamu.edu {vinod, porras}@csl.sri.com
†Texas A&M University
‡SRI International
ABSTRACT
Among the leading reference implementations of the Software De-
ﬁned Networking (SDN) paradigm is the OpenFlow framework,
which decouples the control plane into a centralized application. In
this paper, we consider two aspects of OpenFlow that pose secu-
rity challenges, and we propose two solutions that could address
these concerns. The ﬁrst challenge is the inherent communication
bottleneck that arises between the data plane and the control plane,
which an adversary could exploit by mounting a control plane sat-
uration attack that disrupts network operations. Indeed, even well-
mined adversarial models, such as scanning or denial-of-service
(DoS) activity, can produce more potent impacts on OpenFlow net-
works than traditional networks. To address this challenge, we in-
troduce an extension to the OpenFlow data plane called connec-
tion migration, which dramatically reduces the amount of data-
to-control-plane interactions that arise during such attacks. The
second challenge is that of enabling the control plane to expedite
both detection of, and responses to, the changing ﬂow dynamics
within the data plane. For this, we introduce actuating triggers
over the data plane’s existing statistics collection services. These
triggers are inserted by control layer applications to both register
for asynchronous call backs, and insert conditional ﬂow rules that
are only activated when a trigger condition is detected within the
data plane’s statistics module. We present AVANT-GUARD, an im-
plementation of our two data plane extensions, evaluate the perfor-
...