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

Output:
安全论文分析：

title:Reliability and Security Monitoring of Virtual Machines Using Hardware
Architectural Invariants
author:Cuong Manh Pham and
Zachary Estrada and
Phuong Cao and
Zbigniew T. Kalbarczyk and
Ravishankar K. Iyer
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Reliability and Security Monitoring of Virtual
Machines Using Hardware Architectural Invariants
Cuong Pham, Zachary Estrada, Phuong Cao, Zbigniew Kalbarczyk, Ravishankar Iyer
University of Illinois at Urbana-Champaign
{pham9, zestrad2, pcao3, kalbarcz, rkiyer}@illinois.edu
Abstract—This paper presents a solution that simultaneously
addresses both reliability and security (RnS) in a monitoring
framework. We identify the commonalities between reliability
and security to guide the design of HyperTap, a hypervisor-level
framework that efﬁciently supports both types of monitoring in
virtualization environments. In HyperTap, the logging of system
events and states is common across monitors and constitutes
the core of the framework. The audit phase of each monitor is
implemented and operated independently. In addition, HyperTap
relies on hardware invariants to provide a strongly isolated root
of trust. HyperTap uses active monitoring, which can be adapted
to enforce a wide spectrum of RnS policies. We validate Hy-
perTap by introducing three example monitors: Guest OS Hang
Detection (GOSHD), Hidden RootKit Detection (HRKD), and
Privilege Escalation Detection (PED). Our experiments with fault
injection and real rootkits/exploits demonstrate that HyperTap
provides robust monitoring with low performance overhead.
I. INTRODUCTION
Reliability and security (RnS) are two essential aspects of
modern highly connected computing system...


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

Input:
title:Reliability and Security Monitoring of Virtual Machines Using Hardware
Architectural Invariants
author:Cuong Manh Pham and
Zachary Estrada and
Phuong Cao and
Zbigniew T. Kalbarczyk and
Ravishankar K. Iyer
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Reliability and Security Monitoring of Virtual
Machines Using Hardware Architectural Invariants
Cuong Pham, Zachary Estrada, Phuong Cao, Zbigniew Kalbarczyk, Ravishankar Iyer
University of Illinois at Urbana-Champaign
{pham9, zestrad2, pcao3, kalbarcz, rkiyer}@illinois.edu
Abstract—This paper presents a solution that simultaneously
addresses both reliability and security (RnS) in a monitoring
framework. We identify the commonalities between reliability
and security to guide the design of HyperTap, a hypervisor-level
framework that efﬁciently supports both types of monitoring in
virtualization environments. In HyperTap, the logging of system
events and states is common across monitors and constitutes
the core of the framework. The audit phase of each monitor is
implemented and operated independently. In addition, HyperTap
relies on hardware invariants to provide a strongly isolated root
of trust. HyperTap uses active monitoring, which can be adapted
to enforce a wide spectrum of RnS policies. We validate Hy-
perTap by introducing three example monitors: Guest OS Hang
Detection (GOSHD), Hidden RootKit Detection (HRKD), and
Privilege Escalation Detection (PED). Our experiments with fault
injection and real rootkits/exploits demonstrate that HyperTap
provides robust monitoring with low performance overhead.
I. INTRODUCTION
Reliability and security (RnS) are two essential aspects of
modern highly connected computing system...

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


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

Output:
安全论文分析：

title:A short anonymously revocable group signature scheme from decision
linear assumption
author:Toru Nakanishi and
Nobuo Funabiki
A Short Anonymously Revocable Group Signature Scheme
from Decision Linear Assumption
Toru Nakanishi
Nobuo Funabiki
Dept. of Communication Network Engineering
Dept. of Communication Network Engineering
Okayama University
Okayama, 700-8530 Japan
nakanisi@cne.okayama-u.ac.jp
Okayama University
Okayama, 700-8530 Japan
funabiki@cne.okayama-u.ac.jp
ABSTRACT
In group signature schemes, a signature is anonymous for
a veriﬁer, while only a designated Privacy Manager (P M )
can identify the signer. This identiﬁcation is used for tracing
a dishonest anonymous signer in case of an illegal act using
the signature. However, P M can violate signers’ anonymity.
Recently, Brickell and Li propose a novel countermeasure
for the anonymous dishonest signer without P M in the set-
ting of the direct anonymous attestation. Here, we call the
generalized group signature version anonymously revocable
group signature scheme. In this scheme, after an illegal act
using a group signature was found, the membership of the
dishonest signer can be anonymously revoked for excluding
the signer without the help of any P M . However, since
the Brickell-Li scheme is based on the RSA assumption and
the DDH assumption, the signature is long. In this paper,
we propose a short anonymously revocable group signature
scheme from supersingular curves, where we adopt the de-
cision linear (DLIN) assumption. Compared to the simple
adoption of the Brickell-Li DDH-based revoking approach to
supersingular curves, the length of our signature is reduced
to about from 30% to 60%.
Categories and Subject Descriptors
D.4.6 [Software]: Security and Protection—Authentication
General Terms
Security, Algorithms
Keywords
Group signature, Anonymity, Revocation
1.
INTRODUCTION
Group signature scheme [5] allows a group member to
anonymously sign a message on behalf of a group, where
the membership of ...


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

Input:
title:A short anonymously revocable group signature scheme from decision
linear assumption
author:Toru Nakanishi and
Nobuo Funabiki
A Short Anonymously Revocable Group Signature Scheme
from Decision Linear Assumption
Toru Nakanishi
Nobuo Funabiki
Dept. of Communication Network Engineering
Dept. of Communication Network Engineering
Okayama University
Okayama, 700-8530 Japan
nakanisi@cne.okayama-u.ac.jp
Okayama University
Okayama, 700-8530 Japan
funabiki@cne.okayama-u.ac.jp
ABSTRACT
In group signature schemes, a signature is anonymous for
a veriﬁer, while only a designated Privacy Manager (P M )
can identify the signer. This identiﬁcation is used for tracing
a dishonest anonymous signer in case of an illegal act using
the signature. However, P M can violate signers’ anonymity.
Recently, Brickell and Li propose a novel countermeasure
for the anonymous dishonest signer without P M in the set-
ting of the direct anonymous attestation. Here, we call the
generalized group signature version anonymously revocable
group signature scheme. In this scheme, after an illegal act
using a group signature was found, the membership of the
dishonest signer can be anonymously revoked for excluding
the signer without the help of any P M . However, since
the Brickell-Li scheme is based on the RSA assumption and
the DDH assumption, the signature is long. In this paper,
we propose a short anonymously revocable group signature
scheme from supersingular curves, where we adopt the de-
cision linear (DLIN) assumption. Compared to the simple
adoption of the Brickell-Li DDH-based revoking approach to
supersingular curves, the length of our signature is reduced
to about from 30% to 60%.
Categories and Subject Descriptors
D.4.6 [Software]: Security and Protection—Authentication
General Terms
Security, Algorithms
Keywords
Group signature, Anonymity, Revocation
1.
INTRODUCTION
Group signature scheme [5] allows a group member to
anonymously sign a message on behalf of a group, where
the membership of ...

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


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

Output:
安全论文分析：

title:Identity-Set-based Broadcast Encryption supporting "Cut-or-Select"
with Short Ciphertext
author:Yan Zhu and
Xin Wang and
Di Ma and
Ruiqi Guo
Identity-Set-based Broadcast Encryption supporting
“Cut-or-Select” with Short Ciphertext
Yan Zhu, Xin Wang
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
zhuyan@ustb.edu.cn
Di Ma
Science,
University of
Computer and Information
Michigan-Dearborn,
Dearborn, MI 48128
dmadma@umich.edu
RuiQi Guo
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
guoruiqi7@163.com
ABSTRACT
In this paper we present an identity-set-based broadcast en-
cryption scheme with three working modes: positive mem-
bership (Select-mode), all member (All-mode), and negative
membership (Cut-mode) over the user identity set, simulta-
neously. The core of our scheme is the implementation of
cryptographic representation of subset by using two aggre-
gation functions: Zeros-based aggregation and Poles-based
aggregation. These two aggregation functions are capable of
compressing any subset into one element in a bilinear map
group for determining the membership between an element
and a subset. Our scheme achieves the optimal bound of
O(1)-size for either ciphertext (consisting of just two ele-
ments) or decryption key (one element) for an identity set
of large size. We prove that our scheme is secure under the
General Diﬃe-Hellman Exponent (GDHE) assumption.
Categories and Subject Descriptors
E.3 [Data Encryption]: Public key cryptosystems; C.2.0
[Computer-Communication Networks]: General—Se-
curity and protection; D.4.6 [Operating Systems]: Secu-
rity and Protection—Cryptographic controls
General Terms
Security, Design, Algorithms, Performance
Keywords
Group-oriented Encryption, Cryptographic Representation
of Subset, Negative Membership, Set Membership, Identity-
Set-based Encryption
1.
INTRODUCTION
Broadcast encryption (BE) ...


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

Input:
title:Identity-Set-based Broadcast Encryption supporting "Cut-or-Select"
with Short Ciphertext
author:Yan Zhu and
Xin Wang and
Di Ma and
Ruiqi Guo
Identity-Set-based Broadcast Encryption supporting
“Cut-or-Select” with Short Ciphertext
Yan Zhu, Xin Wang
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
zhuyan@ustb.edu.cn
Di Ma
Science,
University of
Computer and Information
Michigan-Dearborn,
Dearborn, MI 48128
dmadma@umich.edu
RuiQi Guo
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
guoruiqi7@163.com
ABSTRACT
In this paper we present an identity-set-based broadcast en-
cryption scheme with three working modes: positive mem-
bership (Select-mode), all member (All-mode), and negative
membership (Cut-mode) over the user identity set, simulta-
neously. The core of our scheme is the implementation of
cryptographic representation of subset by using two aggre-
gation functions: Zeros-based aggregation and Poles-based
aggregation. These two aggregation functions are capable of
compressing any subset into one element in a bilinear map
group for determining the membership between an element
and a subset. Our scheme achieves the optimal bound of
O(1)-size for either ciphertext (consisting of just two ele-
ments) or decryption key (one element) for an identity set
of large size. We prove that our scheme is secure under the
General Diﬃe-Hellman Exponent (GDHE) assumption.
Categories and Subject Descriptors
E.3 [Data Encryption]: Public key cryptosystems; C.2.0
[Computer-Communication Networks]: General—Se-
curity and protection; D.4.6 [Operating Systems]: Secu-
rity and Protection—Cryptographic controls
General Terms
Security, Design, Algorithms, Performance
Keywords
Group-oriented Encryption, Cryptographic Representation
of Subset, Negative Membership, Set Membership, Identity-
Set-based Encryption
1.
INTRODUCTION
Broadcast encryption (BE) ...

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


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

Output:
安全论文分析：

title:QuantumHammer: A Practical Hybrid Attack on the LUOV Signature
Scheme
author:Koksal Mus and
Saad Islam and
Berk Sunar
QuantumHammer: A Practical Hybrid Attack on the LUOV
Signature Scheme
Koksal Mus†∗
Saad Islam∗
{kmus,sislam}@wpi.edu
∗ Worcester Polytechnic Institute, MA, USA
† Istanbul Aydin University, Istanbul, Turkey
ABSTRACT
Post-quantum schemes are expected to replace existing public-key
schemes within a decade in billions of devices. To facilitate the
transition, the US National Institute for Standards and Technology
(NIST) is running a standardization process. Multivariate signatures
is one of the main categories in NIST’s post-quantum cryptogra-
phy competition. Among the four candidates in this category, the
LUOV and Rainbow schemes are based on the Oil and Vinegar
scheme, first introduced in 1997 which has withstood over two
decades of cryptanalysis. Beyond mathematical security and effi-
ciency, security against side-channel attacks is a major concern
in the competition. The current sentiment is that post-quantum
schemes may be more resistant to fault-injection attacks due to
their large key sizes and the lack of algebraic structure. We show
that this is not true.
We introduce a novel hybrid attack, QuantumHammer, and
demonstrate it on the constant-time implementation of LUOV cur-
rently in Round 2 of the NIST post-quantum competition. The
QuantumHammer attack is a combination of two attacks, a bit-
tracing attack enabled via Rowhammer fault injection and a divide
and conquer attack that uses bit-tracing as an oracle. Using bit-
tracing, an attacker with access to faulty signatures collected using
Rowhammer attack, can recover secret key bits albeit slowly. We
employ a divide and conquer attack which exploits the structure in
the key generation part of LUOV and solves the system of equations
for the secret key more efficiently with few key bits recovered via
bit-tracing.
We have demonstrated the first successful in-the-wild attack
on LUOV recoveri...


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

Input:
title:QuantumHammer: A Practical Hybrid Attack on the LUOV Signature
Scheme
author:Koksal Mus and
Saad Islam and
Berk Sunar
QuantumHammer: A Practical Hybrid Attack on the LUOV
Signature Scheme
Koksal Mus†∗
Saad Islam∗
{kmus,sislam}@wpi.edu
∗ Worcester Polytechnic Institute, MA, USA
† Istanbul Aydin University, Istanbul, Turkey
ABSTRACT
Post-quantum schemes are expected to replace existing public-key
schemes within a decade in billions of devices. To facilitate the
transition, the US National Institute for Standards and Technology
(NIST) is running a standardization process. Multivariate signatures
is one of the main categories in NIST’s post-quantum cryptogra-
phy competition. Among the four candidates in this category, the
LUOV and Rainbow schemes are based on the Oil and Vinegar
scheme, first introduced in 1997 which has withstood over two
decades of cryptanalysis. Beyond mathematical security and effi-
ciency, security against side-channel attacks is a major concern
in the competition. The current sentiment is that post-quantum
schemes may be more resistant to fault-injection attacks due to
their large key sizes and the lack of algebraic structure. We show
that this is not true.
We introduce a novel hybrid attack, QuantumHammer, and
demonstrate it on the constant-time implementation of LUOV cur-
rently in Round 2 of the NIST post-quantum competition. The
QuantumHammer attack is a combination of two attacks, a bit-
tracing attack enabled via Rowhammer fault injection and a divide
and conquer attack that uses bit-tracing as an oracle. Using bit-
tracing, an attacker with access to faulty signatures collected using
Rowhammer attack, can recover secret key bits albeit slowly. We
employ a divide and conquer attack which exploits the structure in
the key generation part of LUOV and solves the system of equations
for the secret key more efficiently with few key bits recovered via
bit-tracing.
We have demonstrated the first successful in-the-wild attack
on LUOV recoveri...

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


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

Output:
安全论文分析：

title:Every microsecond counts: tracking fine-grain latencies with a lossy
difference aggregator
author:Ramana Rao Kompella and
Kirill Levchenko and
Alex C. Snoeren and
George Varghese
Every Microsecond Counts: Tracking
Fine-Grain Latencies with a Lossy Difference Aggregator
Ramana Rao Kompella†, Kirill Levchenko, Alex C. Snoeren, and George Varghese
†Purdue University and University of California, San Diego
ABSTRACT
Many network applications have stringent end-to-end latency re-
quirements, including VoIP and interactive video conferencing, au-
tomated trading, and high-performance computing—where even
microsecond variations may be intolerable. The resulting ﬁne-grain
measurement demands cannot be met effectively by existing tech-
nologies, such as SNMP, NetFlow, or active probing. We propose
instrumenting routers with a hash-based primitive that we call a
Lossy Difference Aggregator (LDA) to measure latencies down to
tens of microseconds and losses as infrequent as one in a million.
Such measurement can be viewed abstractly as what we refer to
as a coordinated streaming problem, which is fundamentally harder
than standard streaming problems due to the need to coordinate
values between nodes. We describe a compact data structure that
efﬁciently computes the average and standard deviation of latency
and loss rate in a coordinated streaming environment. Our theoret-
ical results translate to an efﬁcient hardware implementation at 40
Gbps using less than 1% of a typical 65-nm 400-MHz networking
ASIC. When compared to Poisson-spaced active probing with sim-
ilar overheads, our LDA mechanism delivers orders of magnitude
smaller relative error; active probing requires 50–60 times as much
bandwidth to deliver similar levels of accuracy.
Categories and Subject Descriptors
C.2.3 [Computer Communication Networks]: Network manage-
ment
General Terms
Measurement, algorithms
Keywords
Passive measurement, packet sampling
1.
INTRODUCTION
An increasing number of Internet-based app...


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

Input:
title:Every microsecond counts: tracking fine-grain latencies with a lossy
difference aggregator
author:Ramana Rao Kompella and
Kirill Levchenko and
Alex C. Snoeren and
George Varghese
Every Microsecond Counts: Tracking
Fine-Grain Latencies with a Lossy Difference Aggregator
Ramana Rao Kompella†, Kirill Levchenko, Alex C. Snoeren, and George Varghese
†Purdue University and University of California, San Diego
ABSTRACT
Many network applications have stringent end-to-end latency re-
quirements, including VoIP and interactive video conferencing, au-
tomated trading, and high-performance computing—where even
microsecond variations may be intolerable. The resulting ﬁne-grain
measurement demands cannot be met effectively by existing tech-
nologies, such as SNMP, NetFlow, or active probing. We propose
instrumenting routers with a hash-based primitive that we call a
Lossy Difference Aggregator (LDA) to measure latencies down to
tens of microseconds and losses as infrequent as one in a million.
Such measurement can be viewed abstractly as what we refer to
as a coordinated streaming problem, which is fundamentally harder
than standard streaming problems due to the need to coordinate
values between nodes. We describe a compact data structure that
efﬁciently computes the average and standard deviation of latency
and loss rate in a coordinated streaming environment. Our theoret-
ical results translate to an efﬁcient hardware implementation at 40
Gbps using less than 1% of a typical 65-nm 400-MHz networking
ASIC. When compared to Poisson-spaced active probing with sim-
ilar overheads, our LDA mechanism delivers orders of magnitude
smaller relative error; active probing requires 50–60 times as much
bandwidth to deliver similar levels of accuracy.
Categories and Subject Descriptors
C.2.3 [Computer Communication Networks]: Network manage-
ment
General Terms
Measurement, algorithms
Keywords
Passive measurement, packet sampling
1.
INTRODUCTION
An increasing number of Internet-based app...

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


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

Output:
安全论文分析：

title:Efficient Distribution of Key Chain Commitments for Broadcast Authentication
in Distributed Sensor Networks
author:Donggang Liu and
Peng Ning
E(cid:14)cient Distribution of Key Chain Commitments for Broadcast
Authentication in Distributed Sensor Networks(cid:3)
Donggang Liu
Peng Ning
Department of Computer Science
North Carolina State University
Raleigh, NC 27695-7534
Emails: dliu@unity.ncsu.edu, ning@csc.ncsu.edu
Abstract
Broadcast authentication is a fundamental security
service in distributed sensor networks. A scheme
named (cid:22)TESLA has been proposed for e(cid:14)cient broad-
cast authentication in such networks. However,
(cid:22)TESLA requires initial distribution of certain in-
formation based on unicast between the base sta-
tion and each sensor node before the actual authen-
tication of broadcast messages. Due to the limited
bandwidth in wireless sensor networks, this initial
unicast-based distribution severely limits the applica-
tion of (cid:22)TESLA in large sensor networks. This paper
presents a novel technique to replace the unicast-based
initialization with a broadcast-based one. As a result,
(cid:22)TESLA can be used in a sensor network with a large
amount of sensors, as long as the message from the
base station can reach these sensor nodes. This pa-
per further explores several techniques that improve
the performance, the robustness, as well as the secu-
rity of the proposed method. The resulting protocol
satis(cid:12)es several nice properties, including low over-
head, tolerance of message loss, scalability to large
networks, and resistance to replay attacks as well as
some known Denial of Service (DOS) attacks.
1. Introduction
A distributed sensor network usually consists of one
or several computationally powerful nodes called base
stations and a large amount of inexpensive, low capac-
ity nodes called sensors (or sensor nodes). The nodes
in a distributed sensor network communicate through
wireless communication, which is usually limited...


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

Input:
title:Efficient Distribution of Key Chain Commitments for Broadcast Authentication
in Distributed Sensor Networks
author:Donggang Liu and
Peng Ning
E(cid:14)cient Distribution of Key Chain Commitments for Broadcast
Authentication in Distributed Sensor Networks(cid:3)
Donggang Liu
Peng Ning
Department of Computer Science
North Carolina State University
Raleigh, NC 27695-7534
Emails: dliu@unity.ncsu.edu, ning@csc.ncsu.edu
Abstract
Broadcast authentication is a fundamental security
service in distributed sensor networks. A scheme
named (cid:22)TESLA has been proposed for e(cid:14)cient broad-
cast authentication in such networks. However,
(cid:22)TESLA requires initial distribution of certain in-
formation based on unicast between the base sta-
tion and each sensor node before the actual authen-
tication of broadcast messages. Due to the limited
bandwidth in wireless sensor networks, this initial
unicast-based distribution severely limits the applica-
tion of (cid:22)TESLA in large sensor networks. This paper
presents a novel technique to replace the unicast-based
initialization with a broadcast-based one. As a result,
(cid:22)TESLA can be used in a sensor network with a large
amount of sensors, as long as the message from the
base station can reach these sensor nodes. This pa-
per further explores several techniques that improve
the performance, the robustness, as well as the secu-
rity of the proposed method. The resulting protocol
satis(cid:12)es several nice properties, including low over-
head, tolerance of message loss, scalability to large
networks, and resistance to replay attacks as well as
some known Denial of Service (DOS) attacks.
1. Introduction
A distributed sensor network usually consists of one
or several computationally powerful nodes called base
stations and a large amount of inexpensive, low capac-
ity nodes called sensors (or sensor nodes). The nodes
in a distributed sensor network communicate through
wireless communication, which is usually limited...

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


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

Output:
安全论文分析：

title:SecTEE: A Software-based Approach to Secure Enclave Architecture
Using TEE
author:Shijun Zhao and
Qianying Zhang and
Yu Qin and
Wei Feng and
Dengguo Feng
SecTEE: A Software-based Approach to Secure Enclave
Architecture Using TEE
Shijun Zhao
Institute of Software Chinese
Academy of Sciences
Beijing, China
Qianying Zhang∗
College of Information Engineering,
Capital Normal University
Beijing, China
Yu Qin
Institute of Software Chinese
Academy of Sciences
Beijing, China
Wei Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
Dengguo Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
ABSTRACT
Secure enclaves provide a practical solution to secure computation,
and current approaches to secure enclaves are implemented by
extending hardware security mechanisms to the CPU architecture.
Therefore, it is hard for a platform to offer secure computation if its
CPU architecture is not equipped with any secure enclave features.
Unfortunately, ARM CPUs, dominating mobile devices and having
increasing momentum in cloud markets, do not provide any security
mechanisms achieving the security equivalent to modern secure
enclave architectures. In this paper, we propose SecTEE, a software-
based secure enclave architecture which is based on the CPU’s
isolation mechanism and does not require specialized security
hardware of the CPU architecture such as memory encryption
engines. SecTEE achieves a high level of security even compared
with hardware-based secure enclave architectures: resistance to
privileged host software attacks, lightweight physical attacks,
and memory access based side-channel attacks. Besides, SecTEE
provides rich trusted computing primitives for enclaves: integrity
measurement, remote attestation, data sealing, secrets provisioning,
and life cycle management. We implement a SecTEE prototype
based on the ARM TrustZone technology, but our approach can
be applied to other CPU architectures with isolation mechanisms.
The evaluation...


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

Input:
title:SecTEE: A Software-based Approach to Secure Enclave Architecture
Using TEE
author:Shijun Zhao and
Qianying Zhang and
Yu Qin and
Wei Feng and
Dengguo Feng
SecTEE: A Software-based Approach to Secure Enclave
Architecture Using TEE
Shijun Zhao
Institute of Software Chinese
Academy of Sciences
Beijing, China
Qianying Zhang∗
College of Information Engineering,
Capital Normal University
Beijing, China
Yu Qin
Institute of Software Chinese
Academy of Sciences
Beijing, China
Wei Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
Dengguo Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
ABSTRACT
Secure enclaves provide a practical solution to secure computation,
and current approaches to secure enclaves are implemented by
extending hardware security mechanisms to the CPU architecture.
Therefore, it is hard for a platform to offer secure computation if its
CPU architecture is not equipped with any secure enclave features.
Unfortunately, ARM CPUs, dominating mobile devices and having
increasing momentum in cloud markets, do not provide any security
mechanisms achieving the security equivalent to modern secure
enclave architectures. In this paper, we propose SecTEE, a software-
based secure enclave architecture which is based on the CPU’s
isolation mechanism and does not require specialized security
hardware of the CPU architecture such as memory encryption
engines. SecTEE achieves a high level of security even compared
with hardware-based secure enclave architectures: resistance to
privileged host software attacks, lightweight physical attacks,
and memory access based side-channel attacks. Besides, SecTEE
provides rich trusted computing primitives for enclaves: integrity
measurement, remote attestation, data sealing, secrets provisioning,
and life cycle management. We implement a SecTEE prototype
based on the ARM TrustZone technology, but our approach can
be applied to other CPU architectures with isolation mechanisms.
The evaluation...

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


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

Output:
安全论文分析：

title:Krace: Data Race Fuzzing for Kernel File Systems
author:Meng Xu and
Sanidhya Kashyap and
Hanqing Zhao and
Taesoo Kim
KRACE: Data Race Fuzzing for Kernel File Systems
Meng Xu Sanidhya Kashyap Hanqing Zhao Taesoo Kim
Georgia Institute of Technology
Abstract—Data races occur when two threads fail to use
proper synchronization when accessing shared data. In kernel file
systems, which are highly concurrent by design, data races are
common mistakes and often wreak havoc on the users, causing
inconsistent states or data losses. Prior fuzzing practices on file
systems have been effective in uncovering hundreds of bugs, but
they mostly focus on the sequential aspect of file system execution
and do not comprehensively explore the concurrency dimension
and hence, forgo the opportunity to catch data races.
In this paper, we bring coverage-guided fuzzing to the concur-
rency dimension with three new constructs: 1) a new coverage
tracking metric, alias coverage, specially designed to capture
the exploration progress in the concurrency dimension; 2) an
evolution algorithm for generating, mutating, and merging multi-
threaded syscall sequences as inputs for concurrency fuzzing;
and 3) a comprehensive lockset and happens-before modeling for
kernel synchronization primitives for precise data race detection.
These components are integrated into KRACE, an end-to-end
fuzzing framework that has discovered 23 data races in ext4,
btrfs, and the VFS layer so far, and 9 are confirmed to be harmful.
I. INTRODUCTION
In the current multi-core era, concurrency has been a major
thrust for performance improvements, especially for system
software. As is evident in kernel and file system evolutions [1–
4], a whole zoo of programming paradigms is introduced
to exploit multi-core computation, including but not limited
to asynchronous work queues, read-copy-update (RCU), and
optimistic locking such as sequence locks. However, alongside
performance improvements, concurrency bugs also find their
wa...


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

Input:
title:Krace: Data Race Fuzzing for Kernel File Systems
author:Meng Xu and
Sanidhya Kashyap and
Hanqing Zhao and
Taesoo Kim
KRACE: Data Race Fuzzing for Kernel File Systems
Meng Xu Sanidhya Kashyap Hanqing Zhao Taesoo Kim
Georgia Institute of Technology
Abstract—Data races occur when two threads fail to use
proper synchronization when accessing shared data. In kernel file
systems, which are highly concurrent by design, data races are
common mistakes and often wreak havoc on the users, causing
inconsistent states or data losses. Prior fuzzing practices on file
systems have been effective in uncovering hundreds of bugs, but
they mostly focus on the sequential aspect of file system execution
and do not comprehensively explore the concurrency dimension
and hence, forgo the opportunity to catch data races.
In this paper, we bring coverage-guided fuzzing to the concur-
rency dimension with three new constructs: 1) a new coverage
tracking metric, alias coverage, specially designed to capture
the exploration progress in the concurrency dimension; 2) an
evolution algorithm for generating, mutating, and merging multi-
threaded syscall sequences as inputs for concurrency fuzzing;
and 3) a comprehensive lockset and happens-before modeling for
kernel synchronization primitives for precise data race detection.
These components are integrated into KRACE, an end-to-end
fuzzing framework that has discovered 23 data races in ext4,
btrfs, and the VFS layer so far, and 9 are confirmed to be harmful.
I. INTRODUCTION
In the current multi-core era, concurrency has been a major
thrust for performance improvements, especially for system
software. As is evident in kernel and file system evolutions [1–
4], a whole zoo of programming paradigms is introduced
to exploit multi-core computation, including but not limited
to asynchronous work queues, read-copy-update (RCU), and
optimistic locking such as sequence locks. However, alongside
performance improvements, concurrency bugs also find their
wa...

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


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

Output:
安全论文分析：

title:Faulty Point Unit: ABI Poisoning Attacks on Intel SGX
author:Fritz Alder and
Jo Van Bulck and
David F. Oswald and
Frank Piessens
Faulty Point Unit: ABI Poisoning Attacks on
Intel SGX
Fritz Alder
fritz.alder@acm.org
David Oswald
imec-DistriNet, KU Leuven, Belgium
University of Birmingham, UK
d.f.oswald@bham.ac.uk
Jo Van Bulck
imec-DistriNet, KU Leuven, Belgium
jo.vanbulck@cs.kuleuven.be
Frank Piessens
imec-DistriNet, KU Leuven, Belgium
frank.piessens@cs.kuleuven.be
ABSTRACT
This paper analyzes a previously overlooked attack surface that al-
lows unprivileged adversaries to impact supposedly secure floating-
point computations in Intel SGX enclaves through the Application
Binary Interface (ABI). In a comprehensive study across 7 widely
used industry-standard and research enclave shielding runtimes, we
show that control and state registers of the x87 Floating-Point Unit
(FPU) and Intel Streaming SIMD Extensions (SSE) are not always
properly sanitized on enclave entry. First, we abuse the adversary’s
control over precision and rounding modes as a novel “ABI-level
fault injection” primitive to silently corrupt enclaved floating-point
operations, enabling a new class of stealthy, integrity-only attacks
that disturb the result of SGX enclave computations. Our analysis
reveals that this threat is especially relevant for applications that
use the older x87 FPU, which is still being used under certain con-
ditions for high-precision operations by modern compilers like gcc.
We exemplify the potential impact of ABI-level quality-degradation
attacks in a case study of an enclaved machine learning service
and in a larger analysis on the SPEC benchmark programs. Second,
we explore the impact on enclave confidentiality by showing that
the adversary’s control over floating-point exception masks can be
abused as an innovative controlled channel to detect FPU usage and
to recover enclaved multiplication operands in certain scenarios.
Our findings, affecting 5 out of the 7 studie...


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

Input:
title:Faulty Point Unit: ABI Poisoning Attacks on Intel SGX
author:Fritz Alder and
Jo Van Bulck and
David F. Oswald and
Frank Piessens
Faulty Point Unit: ABI Poisoning Attacks on
Intel SGX
Fritz Alder
fritz.alder@acm.org
David Oswald
imec-DistriNet, KU Leuven, Belgium
University of Birmingham, UK
d.f.oswald@bham.ac.uk
Jo Van Bulck
imec-DistriNet, KU Leuven, Belgium
jo.vanbulck@cs.kuleuven.be
Frank Piessens
imec-DistriNet, KU Leuven, Belgium
frank.piessens@cs.kuleuven.be
ABSTRACT
This paper analyzes a previously overlooked attack surface that al-
lows unprivileged adversaries to impact supposedly secure floating-
point computations in Intel SGX enclaves through the Application
Binary Interface (ABI). In a comprehensive study across 7 widely
used industry-standard and research enclave shielding runtimes, we
show that control and state registers of the x87 Floating-Point Unit
(FPU) and Intel Streaming SIMD Extensions (SSE) are not always
properly sanitized on enclave entry. First, we abuse the adversary’s
control over precision and rounding modes as a novel “ABI-level
fault injection” primitive to silently corrupt enclaved floating-point
operations, enabling a new class of stealthy, integrity-only attacks
that disturb the result of SGX enclave computations. Our analysis
reveals that this threat is especially relevant for applications that
use the older x87 FPU, which is still being used under certain con-
ditions for high-precision operations by modern compilers like gcc.
We exemplify the potential impact of ABI-level quality-degradation
attacks in a case study of an enclaved machine learning service
and in a larger analysis on the SPEC benchmark programs. Second,
we explore the impact on enclave confidentiality by showing that
the adversary’s control over floating-point exception masks can be
abused as an innovative controlled channel to detect FPU usage and
to recover enclaved multiplication operands in certain scenarios.
Our findings, affecting 5 out of the 7 studie...

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


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

Output:
安全论文分析：

title:A Multi-Modal Neuro-Physiological Study of Phishing Detection and
Malware Warnings
author:Ajaya Neupane and
Md. Lutfor Rahman and
Nitesh Saxena and
Leanne M. Hirshfield
A Multi-Modal Neuro-Physiological Study of
Phishing Detection and Malware Warnings
Ajaya Neupane
Department of Computer and
Information Sciences
University of Alabama at
Birmingham
aneupane@uab.edu
Nitesh Saxena
Department of Computer and
Information Sciences
University of Alabama at
Birmingham
saxena@uab.edu
Md. Lutfor Rahman∗
Aegis Foundry LLC
mdlutforrahman@csebuet.org
Leanne Hirshﬁeld
Newhouse School of Public
Communications
Syracuse University
lmhirshf@syr.edu
ABSTRACT
Detecting phishing attacks (identifying fake vs. real websites) and
heeding security warnings represent classical user-centered secu-
rity tasks subjected to a series of prior investigations. However, our
understanding of user behavior underlying these tasks is still not
fully mature, motivating further work concentrating at the neuro-
physiological level governing the human processing of such tasks.
We pursue a comprehensive three-dimensional study of phishing
detection and malware warnings, focusing not only on what users’
task performance is but also on how users process these tasks based
on: (1) neural activity captured using Electroencephalogram (EEG)
cognitive metrics, and (2) eye gaze patterns captured using an eye-
tracker. Our primary novelty lies in employing multi-modal neuro-
physiological measures in a single study and providing a near re-
alistic set-up (in contrast to a recent neuro-study conducted inside
an fMRI scanner). Our work serves to advance, extend and sup-
port prior knowledge in several signiﬁcant ways. Speciﬁcally, in
the context of phishing detection, we show that users do not spend
enough time analyzing key phishing indicators and often fail at de-
tecting these attacks, although they may be mentally engaged in
the task and subconsciously processing real sites differently from
fake sites. In the ...


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

Input:
title:A Multi-Modal Neuro-Physiological Study of Phishing Detection and
Malware Warnings
author:Ajaya Neupane and
Md. Lutfor Rahman and
Nitesh Saxena and
Leanne M. Hirshfield
A Multi-Modal Neuro-Physiological Study of
Phishing Detection and Malware Warnings
Ajaya Neupane
Department of Computer and
Information Sciences
University of Alabama at
Birmingham
aneupane@uab.edu
Nitesh Saxena
Department of Computer and
Information Sciences
University of Alabama at
Birmingham
saxena@uab.edu
Md. Lutfor Rahman∗
Aegis Foundry LLC
mdlutforrahman@csebuet.org
Leanne Hirshﬁeld
Newhouse School of Public
Communications
Syracuse University
lmhirshf@syr.edu
ABSTRACT
Detecting phishing attacks (identifying fake vs. real websites) and
heeding security warnings represent classical user-centered secu-
rity tasks subjected to a series of prior investigations. However, our
understanding of user behavior underlying these tasks is still not
fully mature, motivating further work concentrating at the neuro-
physiological level governing the human processing of such tasks.
We pursue a comprehensive three-dimensional study of phishing
detection and malware warnings, focusing not only on what users’
task performance is but also on how users process these tasks based
on: (1) neural activity captured using Electroencephalogram (EEG)
cognitive metrics, and (2) eye gaze patterns captured using an eye-
tracker. Our primary novelty lies in employing multi-modal neuro-
physiological measures in a single study and providing a near re-
alistic set-up (in contrast to a recent neuro-study conducted inside
an fMRI scanner). Our work serves to advance, extend and sup-
port prior knowledge in several signiﬁcant ways. Speciﬁcally, in
the context of phishing detection, we show that users do not spend
enough time analyzing key phishing indicators and often fail at de-
tecting these attacks, although they may be mentally engaged in
the task and subconsciously processing real sites differently from
fake sites. In the ...

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


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

Output:
安全论文分析：

title:Data Recovery from "Scrubbed" NAND Flash Storage: Need for Analog
Sanitization
author:Md. Mehedi Hasan and
Biswajit Ray
Data Recovery from “Scrubbed” NAND Flash Storage:
Need for Analog Sanitization
Md Mehedi Hasan and Biswajit Ray, The University of Alabama in Huntsville
https://www.usenix.org/conference/usenixsecurity20/presentation/hasan
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Data Recovery from “Scrubbed” NAND Flash Storage: Need for Analog Sanitiza-
Electrical and Computer Engineering Department, The University of Alabama in Huntsville
Md Mehedi Hasan and Biswajit Ray
tion
Abstract
Digital sanitization of flash based non-volatile memory sys-
tem is a well-researched topic. Since flash memory cell holds
information  in  the  analog  threshold  voltage,  flash  cell  may
hold the imprints of previously written data even after digital
sanitization.  In  this  paper,  we  show  that  data  is  partially  or
completely recoverable from the flash  media sanitized  with
“scrubbing”  based  technique,  which  is  a  popular  technique
for page deletion in NAND flash. We find that adversary may
utilize the data retention property of the memory cells for re-
covering  the  deleted  data  using  standard  digital  interfaces
with the memory. We demonstrate data recovery from com-
mercial flash memory chip, sanitized with scrubbing, by us-
ing partial erase operation on the chip. Our results show that
analog scrubbing is needed to securely delete information in
flash  system.  We  propose  and  implement  analog  scrubbing
using  partial  program  operation  based  on  the  file  creation
time information.
1. Introduction
Secure deletion of obsolete data from the storage medium is
a  topic  of  paramount  importance  to  ensure  the  privacy  and
security of the data owner. Accor...


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

Input:
title:Data Recovery from "Scrubbed" NAND Flash Storage: Need for Analog
Sanitization
author:Md. Mehedi Hasan and
Biswajit Ray
Data Recovery from “Scrubbed” NAND Flash Storage:
Need for Analog Sanitization
Md Mehedi Hasan and Biswajit Ray, The University of Alabama in Huntsville
https://www.usenix.org/conference/usenixsecurity20/presentation/hasan
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Data Recovery from “Scrubbed” NAND Flash Storage: Need for Analog Sanitiza-
Electrical and Computer Engineering Department, The University of Alabama in Huntsville
Md Mehedi Hasan and Biswajit Ray
tion
Abstract
Digital sanitization of flash based non-volatile memory sys-
tem is a well-researched topic. Since flash memory cell holds
information  in  the  analog  threshold  voltage,  flash  cell  may
hold the imprints of previously written data even after digital
sanitization.  In  this  paper,  we  show  that  data  is  partially  or
completely recoverable from the flash  media sanitized  with
“scrubbing”  based  technique,  which  is  a  popular  technique
for page deletion in NAND flash. We find that adversary may
utilize the data retention property of the memory cells for re-
covering  the  deleted  data  using  standard  digital  interfaces
with the memory. We demonstrate data recovery from com-
mercial flash memory chip, sanitized with scrubbing, by us-
ing partial erase operation on the chip. Our results show that
analog scrubbing is needed to securely delete information in
flash  system.  We  propose  and  implement  analog  scrubbing
using  partial  program  operation  based  on  the  file  creation
time information.
1. Introduction
Secure deletion of obsolete data from the storage medium is
a  topic  of  paramount  importance  to  ensure  the  privacy  and
security of the data owner. Accor...

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


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

Output:
安全论文分析：

title:How healthy are today's enterprise networks?
author:Saikat Guha and
Jaideep Chandrashekar and
Nina Taft and
Konstantina Papagiannaki
How Healthy are Today’s Enterprise Networks?
Saikat Guha
Cornell University
saikat@cs.cornell.edu
ABSTRACT
In this paper we take a look at the health of a typical enterprise
network via a new metric based on the fraction of useful ﬂows gen-
erated by endhosts. Flows considered non-useful are those that ex-
plicitly fail or else do not elicit a response from the intended desti-
nation. Examining traces collected from a large number of mobile
hosts in an enterprise network, we ﬁnd that about 34% of the ﬂows
are not useful. Through our study that combines data analysis and
ongoing interactions with our IT department, we learn that these
non-useful ﬂows arise from several causes. Our mobile hosts fre-
quently change environments, by either moving in and out of the
corporate environment, or by switching the point and means of at-
tachment to the corporate network. We ﬁnd that many of the fail-
ures occur due to the hosts’ lack of environment awareness, which
results in attempts to discover services that are not present in all
environments. Other causes include misconﬁguration, unnecessary
broadcast trafﬁc, and excessive connection retries. Understanding
this ever present noise in endhost communication is important for
a variety of reasons including the fact that it complicates anomaly
detection design and wastes resources, the latter of which is par-
ticularly crucial for wireless and mobile environments. Finally, we
discuss possible means to design applications and services that can
signiﬁcantly improve the health of the network.
Categories and Subject Descriptors
C.2.3 [Computer Systems Organization]: Computer Communi-
cation Networks—Network Operations; C.4 [Computer Systems
Organization]: Performance of Systems
General Terms
Measurement, Performance
Keywords
Network Health, Enterprise, Mobility, Environment Awareness
Permission to...


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

Input:
title:How healthy are today's enterprise networks?
author:Saikat Guha and
Jaideep Chandrashekar and
Nina Taft and
Konstantina Papagiannaki
How Healthy are Today’s Enterprise Networks?
Saikat Guha
Cornell University
saikat@cs.cornell.edu
ABSTRACT
In this paper we take a look at the health of a typical enterprise
network via a new metric based on the fraction of useful ﬂows gen-
erated by endhosts. Flows considered non-useful are those that ex-
plicitly fail or else do not elicit a response from the intended desti-
nation. Examining traces collected from a large number of mobile
hosts in an enterprise network, we ﬁnd that about 34% of the ﬂows
are not useful. Through our study that combines data analysis and
ongoing interactions with our IT department, we learn that these
non-useful ﬂows arise from several causes. Our mobile hosts fre-
quently change environments, by either moving in and out of the
corporate environment, or by switching the point and means of at-
tachment to the corporate network. We ﬁnd that many of the fail-
ures occur due to the hosts’ lack of environment awareness, which
results in attempts to discover services that are not present in all
environments. Other causes include misconﬁguration, unnecessary
broadcast trafﬁc, and excessive connection retries. Understanding
this ever present noise in endhost communication is important for
a variety of reasons including the fact that it complicates anomaly
detection design and wastes resources, the latter of which is par-
ticularly crucial for wireless and mobile environments. Finally, we
discuss possible means to design applications and services that can
signiﬁcantly improve the health of the network.
Categories and Subject Descriptors
C.2.3 [Computer Systems Organization]: Computer Communi-
cation Networks—Network Operations; C.4 [Computer Systems
Organization]: Performance of Systems
General Terms
Measurement, Performance
Keywords
Network Health, Enterprise, Mobility, Environment Awareness
Permission to...

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


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

Output:
安全论文分析：

title:Beyond Stack Inspection: A Unified Access-Control and Information-Flow
Security Model
author:Marco Pistoia and
Anindya Banerjee and
David A. Naumann
A Uniﬁed Access-Control and Information-Flow Security Model
Beyond Stack Inspection:
Marco Pistoia
∗
Anindya Banerjee
†
David A. Naumann
IBM T. J. Watson Research Ctr.
Hawthorne, New York, USA
Kansas State University
Manhattan, Kansas, USA
pistoia@us.ibm.com
ab@cis.ksu.edu
Stevens Institute of Technology
Hoboken, New Jersey, USA
naumann@cs.stevens.edu
Abstract
Modern component-based systems, such as Java and
Microsoft .NET Common Language Runtime (CLR), have
adopted Stack-Based Access Control (SBAC). Its purpose is
to use stack inspection to verify that all the code respon-
sible for a security-sensitive action is sufﬁciently autho-
rized to perform that action. Previous literature has shown
that the security model enforced by SBAC is ﬂawed in that
stack inspection may allow unauthorized code no longer
on the stack to inﬂuence the execution of security-sensitive
code. A different approach, History-Based Access Control
(HBAC), is safe but may prevent authorized code from exe-
cuting a security-sensitive operation if less trusted code was
previously executed. In this paper, we formally introduce
Information-Based Access Control (IBAC), a novel security
model that veriﬁes that all and only the code responsible
for a security-sensitive operation is sufﬁciently authorized.
Given an access-control policy α, we present a mechanism
to extract from it an implicit integrity policy ι, and we prove
that IBAC enforces ι. Furthermore, we discuss large-scale
application code scenarios to which IBAC can be success-
fully applied.
1
Introduction
Modern component-based systems allow code from dif-
ferent sources and with different levels of trust to be exe-
cuted at the same time. From an integrity point of view,
it is important to verify that, any time a security-sensitive
action guarded by a permission q is attempted, all the
cod...


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

Input:
title:Beyond Stack Inspection: A Unified Access-Control and Information-Flow
Security Model
author:Marco Pistoia and
Anindya Banerjee and
David A. Naumann
A Uniﬁed Access-Control and Information-Flow Security Model
Beyond Stack Inspection:
Marco Pistoia
∗
Anindya Banerjee
†
David A. Naumann
IBM T. J. Watson Research Ctr.
Hawthorne, New York, USA
Kansas State University
Manhattan, Kansas, USA
pistoia@us.ibm.com
ab@cis.ksu.edu
Stevens Institute of Technology
Hoboken, New Jersey, USA
naumann@cs.stevens.edu
Abstract
Modern component-based systems, such as Java and
Microsoft .NET Common Language Runtime (CLR), have
adopted Stack-Based Access Control (SBAC). Its purpose is
to use stack inspection to verify that all the code respon-
sible for a security-sensitive action is sufﬁciently autho-
rized to perform that action. Previous literature has shown
that the security model enforced by SBAC is ﬂawed in that
stack inspection may allow unauthorized code no longer
on the stack to inﬂuence the execution of security-sensitive
code. A different approach, History-Based Access Control
(HBAC), is safe but may prevent authorized code from exe-
cuting a security-sensitive operation if less trusted code was
previously executed. In this paper, we formally introduce
Information-Based Access Control (IBAC), a novel security
model that veriﬁes that all and only the code responsible
for a security-sensitive operation is sufﬁciently authorized.
Given an access-control policy α, we present a mechanism
to extract from it an implicit integrity policy ι, and we prove
that IBAC enforces ι. Furthermore, we discuss large-scale
application code scenarios to which IBAC can be success-
fully applied.
1
Introduction
Modern component-based systems allow code from dif-
ferent sources and with different levels of trust to be exe-
cuted at the same time. From an integrity point of view,
it is important to verify that, any time a security-sensitive
action guarded by a permission q is attempted, all the
cod...

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


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

Output:
安全论文分析：

title:Securify: Practical Security Analysis of Smart Contracts
author:Petar Tsankov and
Andrei Marian Dan and
Dana Drachsler-Cohen and
Arthur Gervais and
Florian B"unzli and
Martin T. Vechev
Machine Learning Model for Smart Contracts
Security Analysis
Pouyan Momeni
Yu Wang
Reza Samavi
McMaster University, Canada
McMaster University, Hamilton, Canada
McMaster University, Hamilton, Canada
momenip@mcmaster.ca
wang873@mcmaster.ca
samavir@mcmaster.ca
Abstract—In this paper, we introduce a machine learning
predictive model that detects patterns of security vulnerabilities
in smart contracts. We adapted two static code analyzers to label
more than 1000 smart contracts that were veriﬁed and used
on the Ethereum platform. Our model predicted a number of
major software vulnerabilities with the average accuracy of 95
percent. The model currently supports smart contracts developed
in Solidity, however, the approach described in this paper can be
applied to other languages and blockchain platforms.
Index Terms—blockchain, smart contract, security vulnerabil-
ity, machine learning, code analysis, software testing
I. INTRODUCTION
Blockchain is a new decentralized data structure with a wide
range of applications. A crucial component of blockchain is
the smart contract which is an agreement written in computer
code and stored on the blockchain. It can encode a set of
rules or terms predeﬁned by the parties and execute them
automatically to enforce actions when certain events occur
without any need for a third party [1]. The algorithmic
structure of blockchain and lack of a central authority make
the platform an attractive target for attackers. Smart contracts
have a rapid developing process and this makes smart contracts
a more vulnerable target for adversarial attacks as, in general,
newly released software components are more susceptible to
programming errors and design defects [2]. Smart contracts
control the logic of transactions and the impact of an attack can
change the c...


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

Input:
title:Securify: Practical Security Analysis of Smart Contracts
author:Petar Tsankov and
Andrei Marian Dan and
Dana Drachsler-Cohen and
Arthur Gervais and
Florian B"unzli and
Martin T. Vechev
Machine Learning Model for Smart Contracts
Security Analysis
Pouyan Momeni
Yu Wang
Reza Samavi
McMaster University, Canada
McMaster University, Hamilton, Canada
McMaster University, Hamilton, Canada
momenip@mcmaster.ca
wang873@mcmaster.ca
samavir@mcmaster.ca
Abstract—In this paper, we introduce a machine learning
predictive model that detects patterns of security vulnerabilities
in smart contracts. We adapted two static code analyzers to label
more than 1000 smart contracts that were veriﬁed and used
on the Ethereum platform. Our model predicted a number of
major software vulnerabilities with the average accuracy of 95
percent. The model currently supports smart contracts developed
in Solidity, however, the approach described in this paper can be
applied to other languages and blockchain platforms.
Index Terms—blockchain, smart contract, security vulnerabil-
ity, machine learning, code analysis, software testing
I. INTRODUCTION
Blockchain is a new decentralized data structure with a wide
range of applications. A crucial component of blockchain is
the smart contract which is an agreement written in computer
code and stored on the blockchain. It can encode a set of
rules or terms predeﬁned by the parties and execute them
automatically to enforce actions when certain events occur
without any need for a third party [1]. The algorithmic
structure of blockchain and lack of a central authority make
the platform an attractive target for attackers. Smart contracts
have a rapid developing process and this makes smart contracts
a more vulnerable target for adversarial attacks as, in general,
newly released software components are more susceptible to
programming errors and design defects [2]. Smart contracts
control the logic of transactions and the impact of an attack can
change the c...

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


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

Output:
安全论文分析：

title:Plug-N-Pwned: Comprehensive Vulnerability Analysis of OBD-II Dongles
as A New Over-the-Air Attack Surface in Automotive IoT
author:Haohuang Wen and
Qi Alfred Chen and
Zhiqiang Lin
Plug-N-Pwned: Comprehensive Vulnerability
Analysis of OBD-II Dongles as A New Over-the-Air
Attack Surface in Automotive IoT
Haohuang Wen, Ohio State University; Qi Alfred Chen, University of California, Irvine;
Zhiqiang Lin, Ohio State University
https://www.usenix.org/conference/usenixsecurity20/presentation/wen
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Plug-N-Pwned: Comprehensive Vulnerability Analysis of OBD-II Dongles as A
New Over-the-Air Attack Surface in Automotive IoT
Haohuang Wen
Qi Alfred Chen
The Ohio State University
University of California, Irvine
wen.423@osu.edu
alfchen@uci.edu
Zhiqiang Lin
The Ohio State University
zlin@cse.ohio-state.edu
Abstract
With the growing trend of the Internet of Things, a large
number of wireless OBD-II dongles are developed, which can
be simply plugged into vehicles to enable remote functions
such as sophisticated vehicle control and status monitoring.
However, since these dongles are directly connected with
in-vehicle networks, they may open a new over-the-air attack
surface for vehicles. In this paper, we conduct the ﬁrst com-
prehensive security analysis on all wireless OBD-II dongles
available on Amazon in the US in February 2019, which
were 77 in total. To systematically perform the analysis, we
design and implement an automated tool DONGLESCOPE
that dynamically tests these dongles from all possible attack
stages on a real automobile. With DONGLESCOPE, we have
identiﬁed 5 different types of vulnerabilities, with 4 being
newly discovered. Our results reveal that each of the 77
dongles exposes at least two types of these vulnerabilities,
which indicates a widespread vulne...


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

Input:
title:Plug-N-Pwned: Comprehensive Vulnerability Analysis of OBD-II Dongles
as A New Over-the-Air Attack Surface in Automotive IoT
author:Haohuang Wen and
Qi Alfred Chen and
Zhiqiang Lin
Plug-N-Pwned: Comprehensive Vulnerability
Analysis of OBD-II Dongles as A New Over-the-Air
Attack Surface in Automotive IoT
Haohuang Wen, Ohio State University; Qi Alfred Chen, University of California, Irvine;
Zhiqiang Lin, Ohio State University
https://www.usenix.org/conference/usenixsecurity20/presentation/wen
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Plug-N-Pwned: Comprehensive Vulnerability Analysis of OBD-II Dongles as A
New Over-the-Air Attack Surface in Automotive IoT
Haohuang Wen
Qi Alfred Chen
The Ohio State University
University of California, Irvine
wen.423@osu.edu
alfchen@uci.edu
Zhiqiang Lin
The Ohio State University
zlin@cse.ohio-state.edu
Abstract
With the growing trend of the Internet of Things, a large
number of wireless OBD-II dongles are developed, which can
be simply plugged into vehicles to enable remote functions
such as sophisticated vehicle control and status monitoring.
However, since these dongles are directly connected with
in-vehicle networks, they may open a new over-the-air attack
surface for vehicles. In this paper, we conduct the ﬁrst com-
prehensive security analysis on all wireless OBD-II dongles
available on Amazon in the US in February 2019, which
were 77 in total. To systematically perform the analysis, we
design and implement an automated tool DONGLESCOPE
that dynamically tests these dongles from all possible attack
stages on a real automobile. With DONGLESCOPE, we have
identiﬁed 5 different types of vulnerabilities, with 4 being
newly discovered. Our results reveal that each of the 77
dongles exposes at least two types of these vulnerabilities,
which indicates a widespread vulne...

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


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

Output:
安全论文分析：

title:Fibbing in action: On-demand load-balancing for better video delivery
author:Olivier Tilmans and
Stefano Vissicchio and
Laurent Vanbever and
Jennifer Rexford
On-demand load-balancing for better video delivery
Fibbing in action:
Olivier Tilmans‡∗, Stefano Vissicchio‡†, Laurent Vanbever§, Jennifer Rexford¶
‡ Université catholique de Louvain, § ETH Zürich, ¶Princeton University
‡ name.surname@uclouvain.be, § lvanbever@ethz.ch, ¶ jrex@cs.princeton.edu
ABSTRACT
Video streaming, in conjunction with social networks,
have given birth to a new traﬃc pattern over the Inter-
net: transient, localized traﬃc surges, known as ﬂash
crowds. Traditional traﬃc-engineering methods can hardly
cope with these surges, as they are unpredictable by
nature. Consequently, networks either have to be over-
provisioned, which is expensive and wastes resources,
or risk to periodically incur congestion, which infuriates
customers. This demonstration shows how Fibbing [1]
can improve network performance and preserve users’
quality of experience when accessing video streams, by
implementing a ﬁne-grained load-balancing service. This
service leverages two unique features of Fibbing: pro-
gramming per destination load-balancing and imple-
menting uneven splitting ratios.
CCS Concepts
•Networks → Network protocols; Programmable
networks; Network management; Network archi-
tectures;
Keywords
Fibbing; traﬃc engineering; link-state routing
1.
INTRODUCTION
Interactive applications (e.g., video streaming) im-
pose hard constraints on the performance of networks
(e.g., on losses or delay) in order to ensure a good qual-
ity of experience for their users. To guarantee good
∗O. Tilmans is supported by a grant from F.R.S.-FNRS FRIA.
†S. Vissicchio is a postdoctoral researcher from F.R.S.-FNRS.
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or
distributed for proﬁt or commercial advantage and that...


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

Input:
title:Fibbing in action: On-demand load-balancing for better video delivery
author:Olivier Tilmans and
Stefano Vissicchio and
Laurent Vanbever and
Jennifer Rexford
On-demand load-balancing for better video delivery
Fibbing in action:
Olivier Tilmans‡∗, Stefano Vissicchio‡†, Laurent Vanbever§, Jennifer Rexford¶
‡ Université catholique de Louvain, § ETH Zürich, ¶Princeton University
‡ name.surname@uclouvain.be, § lvanbever@ethz.ch, ¶ jrex@cs.princeton.edu
ABSTRACT
Video streaming, in conjunction with social networks,
have given birth to a new traﬃc pattern over the Inter-
net: transient, localized traﬃc surges, known as ﬂash
crowds. Traditional traﬃc-engineering methods can hardly
cope with these surges, as they are unpredictable by
nature. Consequently, networks either have to be over-
provisioned, which is expensive and wastes resources,
or risk to periodically incur congestion, which infuriates
customers. This demonstration shows how Fibbing [1]
can improve network performance and preserve users’
quality of experience when accessing video streams, by
implementing a ﬁne-grained load-balancing service. This
service leverages two unique features of Fibbing: pro-
gramming per destination load-balancing and imple-
menting uneven splitting ratios.
CCS Concepts
•Networks → Network protocols; Programmable
networks; Network management; Network archi-
tectures;
Keywords
Fibbing; traﬃc engineering; link-state routing
1.
INTRODUCTION
Interactive applications (e.g., video streaming) im-
pose hard constraints on the performance of networks
(e.g., on losses or delay) in order to ensure a good qual-
ity of experience for their users. To guarantee good
∗O. Tilmans is supported by a grant from F.R.S.-FNRS FRIA.
†S. Vissicchio is a postdoctoral researcher from F.R.S.-FNRS.
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or
distributed for proﬁt or commercial advantage and that...

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


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

Output:
安全论文分析：

title:Automatic error finding in access-control policies
author:Karthick Jayaraman and
Vijay Ganesh and
Mahesh V. Tripunitara and
Martin C. Rinard and
Steve J. Chapin
Automatic Error Finding in Access-Control Policies
∗
Karthick Jayaraman
karjay@microsoft.com
Microsoft
Vijay Ganesh
MIT
vganesh@csail.mit.edu
Mahesh Tripunitara
University of Waterloo
tripunit@uwaterloo.ca
Martin Rinard
MIT
rinard@csail.mit.edu
ABSTRACT
Verifying that access-control systems maintain desired se-
curity properties is recognized as an important problem
in security. Enterprise access-control systems have grown
to protect tens of thousands of resources, and there is a
need for veriﬁcation to scale commensurately. We present
a new abstraction-reﬁnement technique for automatically
ﬁnding errors in Administrative Role-Based Access Control
(ARBAC) security policies. ARBAC is the ﬁrst and most
comprehensive administrative scheme for Role-Based Access
Control (RBAC) systems. Underlying our approach is a
change in mindset: we propose that error ﬁnding comple-
ments veriﬁcation, can be more scalable, and allows for the
use of a wider variety of techniques. In our approach, we use
an abstraction-reﬁnement technique to ﬁrst identify and dis-
card roles that are unlikely to be relevant to the veriﬁcation
question (the abstraction step), and then restore such ab-
stracted roles incrementally (the reﬁnement steps). Errors
are one-sided: if there is an error in the abstracted policy,
then there is an error in the original policy. If there is an
error in a policy whose role-dependency graph diameter is
smaller than a certain bound, then we ﬁnd the error. Our
abstraction-reﬁnement technique complements conventional
state-space exploration techniques such as model checking.
We have implemented our technique in an access-control pol-
icy analysis tool. We show empirically that our tool scales
well to realistic policies, and is orders of magnitude faster
than prior tools.
Categories and Subject Descriptors: K...


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

Input:
title:Automatic error finding in access-control policies
author:Karthick Jayaraman and
Vijay Ganesh and
Mahesh V. Tripunitara and
Martin C. Rinard and
Steve J. Chapin
Automatic Error Finding in Access-Control Policies
∗
Karthick Jayaraman
karjay@microsoft.com
Microsoft
Vijay Ganesh
MIT
vganesh@csail.mit.edu
Mahesh Tripunitara
University of Waterloo
tripunit@uwaterloo.ca
Martin Rinard
MIT
rinard@csail.mit.edu
ABSTRACT
Verifying that access-control systems maintain desired se-
curity properties is recognized as an important problem
in security. Enterprise access-control systems have grown
to protect tens of thousands of resources, and there is a
need for veriﬁcation to scale commensurately. We present
a new abstraction-reﬁnement technique for automatically
ﬁnding errors in Administrative Role-Based Access Control
(ARBAC) security policies. ARBAC is the ﬁrst and most
comprehensive administrative scheme for Role-Based Access
Control (RBAC) systems. Underlying our approach is a
change in mindset: we propose that error ﬁnding comple-
ments veriﬁcation, can be more scalable, and allows for the
use of a wider variety of techniques. In our approach, we use
an abstraction-reﬁnement technique to ﬁrst identify and dis-
card roles that are unlikely to be relevant to the veriﬁcation
question (the abstraction step), and then restore such ab-
stracted roles incrementally (the reﬁnement steps). Errors
are one-sided: if there is an error in the abstracted policy,
then there is an error in the original policy. If there is an
error in a policy whose role-dependency graph diameter is
smaller than a certain bound, then we ﬁnd the error. Our
abstraction-reﬁnement technique complements conventional
state-space exploration techniques such as model checking.
We have implemented our technique in an access-control pol-
icy analysis tool. We show empirically that our tool scales
well to realistic policies, and is orders of magnitude faster
than prior tools.
Categories and Subject Descriptors: K...

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


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

Output:
安全论文分析：

title:The Psychology of Security for the Home Computer User
author:Adele E. Howe and
Indrajit Ray and
Mark Roberts and
Malgorzata Urbanska and
Zinta S. Byrne
2012 IEEE Symposium on Security and Privacy
The Psychology of Security for the Home Computer User
Adele E. Howe, Indrajit Ray, Mark Roberts, Malgorzata Urbanska
Computer Science Department
Colorado State University
Email: {howe, indrajit, mroberts, urbanska}@CS.ColoState.EDU
Fort Collins, CO 80523 U.S.A.
Zinta Byrne
Psychology Department
Colorado State University
Fort Collins, CO 80523 U.S.A.
Email: Zinta.Byrne@ColoState.EDU
Abstract—The home computer user is often said to be the
weakest link in computer security. They do not always follow
security advice, and they take actions, as in phishing, that
compromise themselves. In general, we do not understand why
users do not always behave safely, which would seem to be in
their best interest. This paper reviews the literature of surveys
and studies of factors that inﬂuence security decisions for home
computer users. We organize the review in four sections: un-
derstanding of threats, perceptions of risky behavior, efforts to
avoid security breaches and attitudes to security interventions.
We ﬁnd that these studies reveal a lot of reasons why current
security measures may not match the needs or abilities of home
computer users and suggest future work needed to inform how
security is delivered to this user group.
Keywords-usability and security, home users
I. WHY STUDY THE HOME COMPUTER USER?
The home computer user is often said to be the weak-
est link in computer security. Security and privacy threats
such as Web cookies and phishing require some form of
user complicity or acquiescence. Adequate security does
not come with the purchase of the computer but requires
additional software, careful settings within applications, ap-
propriate choices of passwords, regular updating of patches,
etc. Moreover, as applications are becoming more inter-
esting/useful and busine...


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

Input:
title:The Psychology of Security for the Home Computer User
author:Adele E. Howe and
Indrajit Ray and
Mark Roberts and
Malgorzata Urbanska and
Zinta S. Byrne
2012 IEEE Symposium on Security and Privacy
The Psychology of Security for the Home Computer User
Adele E. Howe, Indrajit Ray, Mark Roberts, Malgorzata Urbanska
Computer Science Department
Colorado State University
Email: {howe, indrajit, mroberts, urbanska}@CS.ColoState.EDU
Fort Collins, CO 80523 U.S.A.
Zinta Byrne
Psychology Department
Colorado State University
Fort Collins, CO 80523 U.S.A.
Email: Zinta.Byrne@ColoState.EDU
Abstract—The home computer user is often said to be the
weakest link in computer security. They do not always follow
security advice, and they take actions, as in phishing, that
compromise themselves. In general, we do not understand why
users do not always behave safely, which would seem to be in
their best interest. This paper reviews the literature of surveys
and studies of factors that inﬂuence security decisions for home
computer users. We organize the review in four sections: un-
derstanding of threats, perceptions of risky behavior, efforts to
avoid security breaches and attitudes to security interventions.
We ﬁnd that these studies reveal a lot of reasons why current
security measures may not match the needs or abilities of home
computer users and suggest future work needed to inform how
security is delivered to this user group.
Keywords-usability and security, home users
I. WHY STUDY THE HOME COMPUTER USER?
The home computer user is often said to be the weak-
est link in computer security. Security and privacy threats
such as Web cookies and phishing require some form of
user complicity or acquiescence. Adequate security does
not come with the purchase of the computer but requires
additional software, careful settings within applications, ap-
propriate choices of passwords, regular updating of patches,
etc. Moreover, as applications are becoming more inter-
esting/useful and busine...

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


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

Output:
安全论文分析：

title:Masquerade Detection Using Enriched Command Lines
author:Roy A. Maxion
Masquerade Detection Using Enriched Command Lines
Roy A. Maxion
maxion@cs.cmu.eduu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
A masquerade attack, in which one user impersonates
another,
is among the most serious forms of computer
abuse, largely because such attacks are often mounted by in-
siders, and can be very difﬁcult to detect. Automatic discov-
ery of masqueraders is sometimes undertaken by detecting
signiﬁcant departures from normal user behavior, as rep-
resented by user proﬁles based on users’ command histo-
ries. A series of experiments performed by Schonlau et al.
[12] achieved moderate success in masquerade detection
based on a data set comprised of truncated command lines,
i.e., single commands, stripped of any accompanying ﬂags,
arguments or elements of shell grammar such as pipes or
semi-colons. Using the same data, Maxion and Townsend
[8] improved on the Schonlau et al. results by 56%, raising
the detection rate from 39.4% to 61.5% at false-alarm rates
near 1%. The present paper extends this work by testing
the hypothesis that a limitation of these approaches is the
use of truncated command-line data, as opposed to com-
mand lines enriched with ﬂags, shell grammar, arguments
and information about aliases. Enriched command lines
were found to facilitate correct detection at the 82% level,
far exceeding previous results, with a corresponding 30%
reduction in the overall cost of errors, and only a small in-
crease in false alarms. Descriptions of pathological cases
illustrate strengths and limitations of both the data and the
detection algorithm.
1. Introduction
Colloquially, masquerading is the act of substituting one-
self for another. To masquerade is to disguise; to assume
the appearance of something one is not; to furnish with a
false appearance or an assumed identity; or to obscure th...


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

Input:
title:Masquerade Detection Using Enriched Command Lines
author:Roy A. Maxion
Masquerade Detection Using Enriched Command Lines
Roy A. Maxion
maxion@cs.cmu.eduu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
A masquerade attack, in which one user impersonates
another,
is among the most serious forms of computer
abuse, largely because such attacks are often mounted by in-
siders, and can be very difﬁcult to detect. Automatic discov-
ery of masqueraders is sometimes undertaken by detecting
signiﬁcant departures from normal user behavior, as rep-
resented by user proﬁles based on users’ command histo-
ries. A series of experiments performed by Schonlau et al.
[12] achieved moderate success in masquerade detection
based on a data set comprised of truncated command lines,
i.e., single commands, stripped of any accompanying ﬂags,
arguments or elements of shell grammar such as pipes or
semi-colons. Using the same data, Maxion and Townsend
[8] improved on the Schonlau et al. results by 56%, raising
the detection rate from 39.4% to 61.5% at false-alarm rates
near 1%. The present paper extends this work by testing
the hypothesis that a limitation of these approaches is the
use of truncated command-line data, as opposed to com-
mand lines enriched with ﬂags, shell grammar, arguments
and information about aliases. Enriched command lines
were found to facilitate correct detection at the 82% level,
far exceeding previous results, with a corresponding 30%
reduction in the overall cost of errors, and only a small in-
crease in false alarms. Descriptions of pathological cases
illustrate strengths and limitations of both the data and the
detection algorithm.
1. Introduction
Colloquially, masquerading is the act of substituting one-
self for another. To masquerade is to disguise; to assume
the appearance of something one is not; to furnish with a
false appearance or an assumed identity; or to obscure th...

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


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

Output:
安全论文分析：

title:PGP in Constrained Wireless Devices
author:Michael Brown and
Donny Cheung and
Darrel Hankerson and
Julio C'esar L'opez-Hern'andez and
Michael Kirkup and
Alfred Menezes
USENIX Association
Proceedings of the
9th USENIX Security Symposium
Denver, Colorado, USA
August 14 –17, 2000
THE ADVANCED COMPUTING SYSTEMS ASSOCIATION
© 2000 by The USENIX Association
Phone: 1 510 528 8649
FAX: 1 510 548 5738
All Rights Reserved
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
Rights to individual papers remain with the author or the author's employer.
 Permission is granted for noncommercial reproduction of the work for educational or research purposes.
This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein.
PGP in Constrained Wireless Devices
Michael Brown
(cid:3)
Donny Cheung
(cid:3)
Michael Kirkup
(cid:3)
Darrel Hankerson†
Alfred Menezes
Julio Lopez Hernandez‡
(cid:3)
Abstract
The market for Personal Digital Assistants (PDAs) is
growing at a rapid pace. An increasing number of prod-
ucts, such as the PalmPilot, are adding wireless com-
munications capabilities. PDA users are now able to
send and receive email just as they would from their
networked desktop machines. Because of the inherent
insecurity of wireless environments, a system is needed
for secure email communications. The requirements for
the security system will likely be inﬂuenced by the con-
straints of the PDA, including limited memory, limited
processing power, limited bandwidth, and a limited user
interface.
This paper describes our experience with porting PGP
to the Research in Motion (RIM) two-way pager, and in-
corporating elliptic curve cryptography into PGP’s suite
of public-key ciphers. Our main conclusion is that PGP
is a viable solution for providing secure and interopera-
ble email communications between constrained wireless
devices and desktop machines.
1 Introduction
It is expec...


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

Input:
title:PGP in Constrained Wireless Devices
author:Michael Brown and
Donny Cheung and
Darrel Hankerson and
Julio C'esar L'opez-Hern'andez and
Michael Kirkup and
Alfred Menezes
USENIX Association
Proceedings of the
9th USENIX Security Symposium
Denver, Colorado, USA
August 14 –17, 2000
THE ADVANCED COMPUTING SYSTEMS ASSOCIATION
© 2000 by The USENIX Association
Phone: 1 510 528 8649
FAX: 1 510 548 5738
All Rights Reserved
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
Rights to individual papers remain with the author or the author's employer.
 Permission is granted for noncommercial reproduction of the work for educational or research purposes.
This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein.
PGP in Constrained Wireless Devices
Michael Brown
(cid:3)
Donny Cheung
(cid:3)
Michael Kirkup
(cid:3)
Darrel Hankerson†
Alfred Menezes
Julio Lopez Hernandez‡
(cid:3)
Abstract
The market for Personal Digital Assistants (PDAs) is
growing at a rapid pace. An increasing number of prod-
ucts, such as the PalmPilot, are adding wireless com-
munications capabilities. PDA users are now able to
send and receive email just as they would from their
networked desktop machines. Because of the inherent
insecurity of wireless environments, a system is needed
for secure email communications. The requirements for
the security system will likely be inﬂuenced by the con-
straints of the PDA, including limited memory, limited
processing power, limited bandwidth, and a limited user
interface.
This paper describes our experience with porting PGP
to the Research in Motion (RIM) two-way pager, and in-
corporating elliptic curve cryptography into PGP’s suite
of public-key ciphers. Our main conclusion is that PGP
is a viable solution for providing secure and interopera-
ble email communications between constrained wireless
devices and desktop machines.
1 Introduction
It is expec...

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


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

Output:
安全论文分析：

title:Towards a Complete View of the Certificate Ecosystem
author:Benjamin VanderSloot and
Johanna Amann and
Matthew Bernhard and
Zakir Durumeric and
Michael Bailey and
J. Alex Halderman
Towards a Complete View of the
Certiﬁcate Ecosystem
Benjamin VanderSloot†
Johanna Amann‡
Matthew Bernhard†
Zakir Durumeric†‡
Michael Bailey§
J. Alex Halderman‡
†University of Michigan ‡International Computer Science Inst.
§ Univ. of Illinois Urbana-Champaign
{benvds, matber, zakir, jhalderm}@umich.edu, johanna@icir.org, mdbailey@illinois.edu
ABSTRACT
The HTTPS certiﬁcate ecosystem has been of great inter-
est to the measurement and security communities. Without
any ground truth, researchers have attempted to study this
PKI from a variety of fragmented perspectives, including
passively monitored networks, scans of the popular domains
or the IPv4 address space, search engines such as Censys,
and Certiﬁcate Transparency (CT) logs. In this work, we
comparatively analyze all these perspectives. We ﬁnd that
aggregated CT logs and Censys snapshots have many prop-
erties that complement each other, and that together they
encompass over 99% of all certiﬁcates found by any of these
techniques. However, they still miss 1.5% of certiﬁcates ob-
served in a crawl of all domains in .com, .net, and .org.
We go on to illustrate how this combined perspective affects
results from previous studies. In light of these ﬁndings, we
have worked with the operators of Censys to incorporate CT
log data into its results going forward, and we recommend
that future HTTPS measurement adopt this new vantage.
1.
INTRODUCTION
Nearly all secure web communication takes place over
HTTPS. Both the underlying TLS protocol and the sup-
porting certiﬁcate public key infrastructure (PKI) have been
studied extensively over the past ﬁve years, with questions
ranging from understanding the behavior of certiﬁcate au-
thorities [11, 14] to detecting server-side vulnerabilities and
tracking how quickly they are mitigated [7, 10, 2...


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

Input:
title:Towards a Complete View of the Certificate Ecosystem
author:Benjamin VanderSloot and
Johanna Amann and
Matthew Bernhard and
Zakir Durumeric and
Michael Bailey and
J. Alex Halderman
Towards a Complete View of the
Certiﬁcate Ecosystem
Benjamin VanderSloot†
Johanna Amann‡
Matthew Bernhard†
Zakir Durumeric†‡
Michael Bailey§
J. Alex Halderman‡
†University of Michigan ‡International Computer Science Inst.
§ Univ. of Illinois Urbana-Champaign
{benvds, matber, zakir, jhalderm}@umich.edu, johanna@icir.org, mdbailey@illinois.edu
ABSTRACT
The HTTPS certiﬁcate ecosystem has been of great inter-
est to the measurement and security communities. Without
any ground truth, researchers have attempted to study this
PKI from a variety of fragmented perspectives, including
passively monitored networks, scans of the popular domains
or the IPv4 address space, search engines such as Censys,
and Certiﬁcate Transparency (CT) logs. In this work, we
comparatively analyze all these perspectives. We ﬁnd that
aggregated CT logs and Censys snapshots have many prop-
erties that complement each other, and that together they
encompass over 99% of all certiﬁcates found by any of these
techniques. However, they still miss 1.5% of certiﬁcates ob-
served in a crawl of all domains in .com, .net, and .org.
We go on to illustrate how this combined perspective affects
results from previous studies. In light of these ﬁndings, we
have worked with the operators of Censys to incorporate CT
log data into its results going forward, and we recommend
that future HTTPS measurement adopt this new vantage.
1.
INTRODUCTION
Nearly all secure web communication takes place over
HTTPS. Both the underlying TLS protocol and the sup-
porting certiﬁcate public key infrastructure (PKI) have been
studied extensively over the past ﬁve years, with questions
ranging from understanding the behavior of certiﬁcate au-
thorities [11, 14] to detecting server-side vulnerabilities and
tracking how quickly they are mitigated [7, 10, 2...

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


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

Output:
安全论文分析：

title:An experimental study of home gateway characteristics
author:Seppo H"at"onen and
Aki Nyrhinen and
Lars Eggert and
Stephen D. Strowes and
Pasi Sarolahti and
Markku Kojo
An Experimental Study of Home Gateway Characteristics
Seppo Hätönen
University of Helsinki
shatonen@cs.helsinki.ﬁ
Stephen Strowes
University of Glasgow
sds@dcs.gla.ac.uk
Aki Nyrhinen
University of Helsinki
anyrhine@cs.helsinki.ﬁ
Lars Eggert
Nokia Research Center
lars.eggert@nokia.com
Pasi Sarolahti
HIIT / Aalto University
pasi.sarolahti@iki.ﬁ
Markku Kojo
University of Helsinki
kojo@cs.helsinki.ﬁ
ABSTRACT
Many residential and small business users connect to the Internet
via home gateways, such as DSL and cable modems. The charac-
teristics of these devices heavily inﬂuence the quality and perfor-
mance of the Internet service that these users receive. Anecdotal
evidence suggests that an extremely diverse set of behaviors ex-
ists in the deployed base, forcing application developers to design
for the lowest common denominator. This paper experimentally
analyzes some characteristics of a substantial number of differ-
ent home gateways: binding timeouts, queuing delays, throughput,
protocol support and others.
Categories and Subject Descriptors
C.4 [Performance of Systems]: Performance Attributes; C.2.6
[Computer Communication Networks]: Internetworking
General Terms
Experimentation, Measurement, Performance
Keywords
Home Gateways, Behavior, Characteristics, Measurements
1.
INTRODUCTION
Many residential and small business users connect to the Inter-
net through “home gateways” – a colloquial term for customer-
premises equipment (CPE) that includes DSL and cable modems,
WLAN access points and even some kinds of (wired) Ethernet
switches. The common deﬁning characteristic of home gateways
is that they do not just perform Ethernet switching or basic IP for-
warding over various link-layer technologies. They also perform
higher-layer operations, such as network address translation (NAT)
or, m...


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

Input:
title:An experimental study of home gateway characteristics
author:Seppo H"at"onen and
Aki Nyrhinen and
Lars Eggert and
Stephen D. Strowes and
Pasi Sarolahti and
Markku Kojo
An Experimental Study of Home Gateway Characteristics
Seppo Hätönen
University of Helsinki
shatonen@cs.helsinki.ﬁ
Stephen Strowes
University of Glasgow
sds@dcs.gla.ac.uk
Aki Nyrhinen
University of Helsinki
anyrhine@cs.helsinki.ﬁ
Lars Eggert
Nokia Research Center
lars.eggert@nokia.com
Pasi Sarolahti
HIIT / Aalto University
pasi.sarolahti@iki.ﬁ
Markku Kojo
University of Helsinki
kojo@cs.helsinki.ﬁ
ABSTRACT
Many residential and small business users connect to the Internet
via home gateways, such as DSL and cable modems. The charac-
teristics of these devices heavily inﬂuence the quality and perfor-
mance of the Internet service that these users receive. Anecdotal
evidence suggests that an extremely diverse set of behaviors ex-
ists in the deployed base, forcing application developers to design
for the lowest common denominator. This paper experimentally
analyzes some characteristics of a substantial number of differ-
ent home gateways: binding timeouts, queuing delays, throughput,
protocol support and others.
Categories and Subject Descriptors
C.4 [Performance of Systems]: Performance Attributes; C.2.6
[Computer Communication Networks]: Internetworking
General Terms
Experimentation, Measurement, Performance
Keywords
Home Gateways, Behavior, Characteristics, Measurements
1.
INTRODUCTION
Many residential and small business users connect to the Inter-
net through “home gateways” – a colloquial term for customer-
premises equipment (CPE) that includes DSL and cable modems,
WLAN access points and even some kinds of (wired) Ethernet
switches. The common deﬁning characteristic of home gateways
is that they do not just perform Ethernet switching or basic IP for-
warding over various link-layer technologies. They also perform
higher-layer operations, such as network address translation (NAT)
or, m...

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


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

Output:
安全论文分析：

title:Analysis of DTLS Implementations Using Protocol State Fuzzing
author:Paul Fiterau-Brostean and
Bengt Jonsson and
Robert Merget and
Joeri de Ruiter and
Konstantinos Sagonas and
Juraj Somorovsky
Analysis of DTLS Implementations Using
Protocol State Fuzzing
Paul Fiterau-Brostean and Bengt Jonsson, Uppsala University; Robert Merget,
Ruhr-University Bochum; Joeri de Ruiter, SIDN Labs; Konstantinos Sagonas,
Uppsala University; Juraj Somorovsky, Paderborn University
https://www.usenix.org/conference/usenixsecurity20/presentation/fiterau-brostean
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Analysis of DTLS Implementations
Using Protocol State Fuzzing
Paul Fiter˘au-Bro¸stean
Uppsala University
Bengt Jonsson
Uppsala University
Robert Merget
Ruhr University Bochum
Joeri de Ruiter
SIDN Labs
Konstantinos Sagonas
Uppsala University
Juraj Somorovsky
Paderborn University
Abstract
Recent years have witnessed an increasing number of proto-
cols relying on UDP. Compared to TCP, UDP offers perfor-
mance advantages such as simplicity and lower latency. This
has motivated its adoption in Voice over IP, tunneling techno-
logies, IoT, and novel Web protocols. To protect sensitive data
exchange in these scenarios, the DTLS protocol has been de-
veloped as a cryptographic variation of TLS. DTLS’s main
challenge is to support the stateless and unreliable transport of
UDP. This has forced protocol designers to make choices that
affect the complexity of DTLS, and to incorporate features
that need not be addressed in the numerous TLS analyses.
We present the ﬁrst comprehensive analysis of DTLS im-
plementations using protocol state fuzzing. To that end, we ex-
tend TLS-Attacker, an open source framework for analyzing
TLS implementations, with support for DTLS tailored to the
stateless and unreliable nature of the underlying U...


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

Input:
title:Analysis of DTLS Implementations Using Protocol State Fuzzing
author:Paul Fiterau-Brostean and
Bengt Jonsson and
Robert Merget and
Joeri de Ruiter and
Konstantinos Sagonas and
Juraj Somorovsky
Analysis of DTLS Implementations Using
Protocol State Fuzzing
Paul Fiterau-Brostean and Bengt Jonsson, Uppsala University; Robert Merget,
Ruhr-University Bochum; Joeri de Ruiter, SIDN Labs; Konstantinos Sagonas,
Uppsala University; Juraj Somorovsky, Paderborn University
https://www.usenix.org/conference/usenixsecurity20/presentation/fiterau-brostean
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.Analysis of DTLS Implementations
Using Protocol State Fuzzing
Paul Fiter˘au-Bro¸stean
Uppsala University
Bengt Jonsson
Uppsala University
Robert Merget
Ruhr University Bochum
Joeri de Ruiter
SIDN Labs
Konstantinos Sagonas
Uppsala University
Juraj Somorovsky
Paderborn University
Abstract
Recent years have witnessed an increasing number of proto-
cols relying on UDP. Compared to TCP, UDP offers perfor-
mance advantages such as simplicity and lower latency. This
has motivated its adoption in Voice over IP, tunneling techno-
logies, IoT, and novel Web protocols. To protect sensitive data
exchange in these scenarios, the DTLS protocol has been de-
veloped as a cryptographic variation of TLS. DTLS’s main
challenge is to support the stateless and unreliable transport of
UDP. This has forced protocol designers to make choices that
affect the complexity of DTLS, and to incorporate features
that need not be addressed in the numerous TLS analyses.
We present the ﬁrst comprehensive analysis of DTLS im-
plementations using protocol state fuzzing. To that end, we ex-
tend TLS-Attacker, an open source framework for analyzing
TLS implementations, with support for DTLS tailored to the
stateless and unreliable nature of the underlying U...

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


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

Output:
安全论文分析：

title:Poster: inference attacks against searchable encryption protocols
author:Mohammad Saiful Islam and
Mehmet Kuzu and
Murat Kantarcioglu
POSTER: Inference Attacks against Searchable Encryption
Protocols
Mohammad Saiful Islam
Jonsson School of
Engineering
and Computer Science
The University of Texas at
Dallas
Mehmet Kuzu
Jonsson School of
Engineering
and Computer Science
The University of Texas at
Dallas
Murat Kantarcioglu
Jonsson School of
Engineering
and Computer Science
The University of Texas at
Dallas
saiful@utdallas.edu
mehmet.kuzu@utdallas.edu
muratk@utdallas.edu
ABSTRACT
The advent of cloud computing has ushered in an era of mass
data storage in remote servers. Remote data storage oﬀers
reduced data management overhead for data owners in a cost
eﬀective manner. Sensitive documents, however, need to be
stored in encrypted format due to security concerns. But,
encrypted storage makes it diﬃcult to search on the stored
documents. Therefore, this poses a major barrier towards
selective retrieval of encrypted documents from the remote
servers. Various protocols have been proposed for keyword
search over encrypted data (commonly referred to as search-
able encryption) to address this issue. Oblivious RAM type
protocols oﬀer secure search over encrypted data, but are
too expensive to be used in practical applications. Unfortu-
nately, all of the symmetric key based encryption protocols
leak data access patterns due to eﬃciency reasons. In this
poster, we are the ﬁrst to analyze the eﬀects of access pat-
tern disclosure. To that end, we introduce a novel attack
model that exploits access pattern leakage to disclose sig-
niﬁcant amount of sensitive information using a modicum
of prior knowledge. We also present a preliminary set of
empirical results on a real dataset to justify our claim.
Categories and Subject Descriptors
K.6.5 [Management of Computing and Information
Systems]: Security and Protection—Unauthorized access;
H.3.3 [Information Storage and Retrieval]:...


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

Input:
title:Poster: inference attacks against searchable encryption protocols
author:Mohammad Saiful Islam and
Mehmet Kuzu and
Murat Kantarcioglu
POSTER: Inference Attacks against Searchable Encryption
Protocols
Mohammad Saiful Islam
Jonsson School of
Engineering
and Computer Science
The University of Texas at
Dallas
Mehmet Kuzu
Jonsson School of
Engineering
and Computer Science
The University of Texas at
Dallas
Murat Kantarcioglu
Jonsson School of
Engineering
and Computer Science
The University of Texas at
Dallas
saiful@utdallas.edu
mehmet.kuzu@utdallas.edu
muratk@utdallas.edu
ABSTRACT
The advent of cloud computing has ushered in an era of mass
data storage in remote servers. Remote data storage oﬀers
reduced data management overhead for data owners in a cost
eﬀective manner. Sensitive documents, however, need to be
stored in encrypted format due to security concerns. But,
encrypted storage makes it diﬃcult to search on the stored
documents. Therefore, this poses a major barrier towards
selective retrieval of encrypted documents from the remote
servers. Various protocols have been proposed for keyword
search over encrypted data (commonly referred to as search-
able encryption) to address this issue. Oblivious RAM type
protocols oﬀer secure search over encrypted data, but are
too expensive to be used in practical applications. Unfortu-
nately, all of the symmetric key based encryption protocols
leak data access patterns due to eﬃciency reasons. In this
poster, we are the ﬁrst to analyze the eﬀects of access pat-
tern disclosure. To that end, we introduce a novel attack
model that exploits access pattern leakage to disclose sig-
niﬁcant amount of sensitive information using a modicum
of prior knowledge. We also present a preliminary set of
empirical results on a real dataset to justify our claim.
Categories and Subject Descriptors
K.6.5 [Management of Computing and Information
Systems]: Security and Protection—Unauthorized access;
H.3.3 [Information Storage and Retrieval]:...

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