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

Output:
安全论文分析：

title:Efficient attributes for anonymous credentials
author:Jan Camenisch and
Thomas Groß
Efﬁcient Attributes for Anonymous Credentials
IBM Research, Zurich Research Laboratory
IBM Research, Zurich Research Laboratory
Jan Camenisch
Rüschlikon, Switzerland
jca@zurich.ibm.com
Thomas Groß
Rüschlikon, Switzerland
tgr@zurich.ibm.com
ABSTRACT
We extend the Camenisch-Lysyanskaya anonymous credential sys-
tem such that selective disclosure of attributes becomes highly ef-
ﬁcient. The resulting system signiﬁcantly improves upon existing
approaches, which suffer from a linear complexity in the total num-
ber of attributes. This limitation makes them unﬁt for many practi-
cal applications, such as electronic identity cards. Our system can
incorporate an arbitrary number of binary and ﬁnite-set attributes
without signiﬁcant performance impact. Our approach folds all
such attributes in a single attribute base and, thus, boosts the ef-
ﬁciency of all proofs of possession. The core idea is to encode dis-
crete binary and ﬁnite-set attribute values as prime numbers. We
use the divisibility property for efﬁcient proofs of their presence
or absence. We additionally contribute efﬁcient methods for con-
junctions and disjunctions. The system builds on the Strong-RSA
assumption alone.
We demonstrate the applicability and performance improve-
ments of our method in realistic application scenarios, such as,
electronic identity cards and complex/structured credentials. Our
method has crucial advantages in devices with restricted computa-
tional capabilities, such as smartcards and cell phones.
Categories and Subject Descriptors
E.3 [Data]: Data Encryption—Public key cryptosystems
General Terms
Algorithms, Performance, Security
Keywords
Privacy, Anonymous Credential Systems, Cryptographic Protocols,
Efﬁcient Attribute Encoding
1.
INTRODUCTION
The rise of user-centric identity management ampliﬁes the need
for a combination of strong security and privacy protection. Anony-
mous credential sys...


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

Input:
title:Efficient attributes for anonymous credentials
author:Jan Camenisch and
Thomas Groß
Efﬁcient Attributes for Anonymous Credentials
IBM Research, Zurich Research Laboratory
IBM Research, Zurich Research Laboratory
Jan Camenisch
Rüschlikon, Switzerland
jca@zurich.ibm.com
Thomas Groß
Rüschlikon, Switzerland
tgr@zurich.ibm.com
ABSTRACT
We extend the Camenisch-Lysyanskaya anonymous credential sys-
tem such that selective disclosure of attributes becomes highly ef-
ﬁcient. The resulting system signiﬁcantly improves upon existing
approaches, which suffer from a linear complexity in the total num-
ber of attributes. This limitation makes them unﬁt for many practi-
cal applications, such as electronic identity cards. Our system can
incorporate an arbitrary number of binary and ﬁnite-set attributes
without signiﬁcant performance impact. Our approach folds all
such attributes in a single attribute base and, thus, boosts the ef-
ﬁciency of all proofs of possession. The core idea is to encode dis-
crete binary and ﬁnite-set attribute values as prime numbers. We
use the divisibility property for efﬁcient proofs of their presence
or absence. We additionally contribute efﬁcient methods for con-
junctions and disjunctions. The system builds on the Strong-RSA
assumption alone.
We demonstrate the applicability and performance improve-
ments of our method in realistic application scenarios, such as,
electronic identity cards and complex/structured credentials. Our
method has crucial advantages in devices with restricted computa-
tional capabilities, such as smartcards and cell phones.
Categories and Subject Descriptors
E.3 [Data]: Data Encryption—Public key cryptosystems
General Terms
Algorithms, Performance, Security
Keywords
Privacy, Anonymous Credential Systems, Cryptographic Protocols,
Efﬁcient Attribute Encoding
1.
INTRODUCTION
The rise of user-centric identity management ampliﬁes the need
for a combination of strong security and privacy protection. Anony-
mous credential sys...

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


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

Output:
安全论文分析：

title:Multi-Writer Searchable Encryption: An LWE-based Realization and Implementation
author:Lei Xu and
Xingliang Yuan and
Ron Steinfeld and
Cong Wang and
Chungen Xu
Multi-Writer Searchable Encryption: An LWE-based Realization
and Implementation
Lei Xu†§, Xingliang Yuan‡, Ron Steinfeld‡, Cong Wang§, and Chungen Xu†
† School of Science, Nanjing University of Science and Technology, China
‡ Faculty of Information Technology, Monash University, Australia
§ Department of Computer Science, City University of Hong Kong, China
xuleicrypto@gmail.com,{xingliang.yuan,ron.steinfeld}@monash.edu,congwang@cityu.edu.hk,xuchung@njust.edu.cn
ABSTRACT
Multi-Writer Searchable Encryption, also known as public-key en-
cryption with keyword search(PEKS), serves a wide spectrum of
data sharing applications. It allows users to search over encrypted
data encrypted via different keys. However, most of the existing
PEKS schemes are built on classic security assumptions, which are
proven to be untenable to overcome the threats of quantum com-
puters. To address the above problem, in this paper, we propose a
lattice-based searchable encryption scheme from the learning with
errors (LWE) hardness assumption. Specifically, we observe that
the keys of each user in a basic scheme are composed of large-sized
matrices and basis of the lattice. To reduce the complexity of key
management, our scheme is designed to enable users to directly use
their identity for data encryption. We present several optimization
techniques for implementation to make our design nearly practical.
For completeness, we conduct rigorous security, complexity, and
parameter analysis on our scheme, and perform comprehensive
evaluations at a commodity machine. With a scenario of 100 users,
the cost of key generation for each user is 125s, and the cost of
searching a document with 1000 keywords is 13.4ms.
CCS CONCEPTS
• Security and privacy → Management and querying of en-
crypted data; Privacy-preserving protocols;
KEYWORDS
Multi-w...


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

Input:
title:Multi-Writer Searchable Encryption: An LWE-based Realization and Implementation
author:Lei Xu and
Xingliang Yuan and
Ron Steinfeld and
Cong Wang and
Chungen Xu
Multi-Writer Searchable Encryption: An LWE-based Realization
and Implementation
Lei Xu†§, Xingliang Yuan‡, Ron Steinfeld‡, Cong Wang§, and Chungen Xu†
† School of Science, Nanjing University of Science and Technology, China
‡ Faculty of Information Technology, Monash University, Australia
§ Department of Computer Science, City University of Hong Kong, China
xuleicrypto@gmail.com,{xingliang.yuan,ron.steinfeld}@monash.edu,congwang@cityu.edu.hk,xuchung@njust.edu.cn
ABSTRACT
Multi-Writer Searchable Encryption, also known as public-key en-
cryption with keyword search(PEKS), serves a wide spectrum of
data sharing applications. It allows users to search over encrypted
data encrypted via different keys. However, most of the existing
PEKS schemes are built on classic security assumptions, which are
proven to be untenable to overcome the threats of quantum com-
puters. To address the above problem, in this paper, we propose a
lattice-based searchable encryption scheme from the learning with
errors (LWE) hardness assumption. Specifically, we observe that
the keys of each user in a basic scheme are composed of large-sized
matrices and basis of the lattice. To reduce the complexity of key
management, our scheme is designed to enable users to directly use
their identity for data encryption. We present several optimization
techniques for implementation to make our design nearly practical.
For completeness, we conduct rigorous security, complexity, and
parameter analysis on our scheme, and perform comprehensive
evaluations at a commodity machine. With a scenario of 100 users,
the cost of key generation for each user is 125s, and the cost of
searching a document with 1000 keywords is 13.4ms.
CCS CONCEPTS
• Security and privacy → Management and querying of en-
crypted data; Privacy-preserving protocols;
KEYWORDS
Multi-w...

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


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

Output:
安全论文分析：

title:A View from the Cockpit: Exploring Pilot Reactions to Attacks on Avionic
Systems
author:Matthew Smith and
Martin Strohmeier and
Jon Harman and
Vincent Lenders and
Ivan Martinovic
A View from the Cockpit: Exploring Pilot Reactions
to Attacks on Avionic Systems
Matthew Smith∗, Martin Strohmeier∗†, Jonathan Harman, Vincent Lenders† and Ivan Martinovic∗
∗Department of Computer Science, University of Oxford, UK,
†Cyber-Defence Campus, armasuisse Science + Technology, Switzerland
ﬁrst.last@cs.ox.ac.uk
ﬁrst.last@armasuisse.ch
Abstract—Many wireless communications systems found in
aircraft lack standard security mechanisms, leaving them vulner-
able to attack. With affordable software-deﬁned radios readily
available, a novel threat has emerged which allows a wide range of
attackers to easily interfere with wireless avionic systems. Whilst
these vulnerabilities are known, predicting their ultimate effect is
difﬁcult. A major factor in this effect is how ﬂight crew respond,
especially whether their extensive training in fault handling helps
them to manage attacks.
To investigate this we conducted a user study, inviting 30
Airbus A320 type-rated pilots to ﬂy simulator scenarios in
which they were subjected to attacks on their avionics. We use
wireless attacks on three safety-related systems, based on existing
literature: Trafﬁc Collision Avoidance System (TCAS), Ground
Proximity Warning System (GPWS) and the Instrument Landing
System (ILS). To analyze their response, we collected control
input data coupled with closed and open interview responses.
We found that all three attack scenarios created signiﬁcant
control impact and disruption through missed approaches, avoid-
ance maneuvers and diversions. They further increased workload,
distrust in the affected system, and for each attack, at least a third
of our participants switched off the system entirely—even if they
were important safety systems. All pilots felt the scenarios were
useful, with 93.3% feeling that simulato...


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

Input:
title:A View from the Cockpit: Exploring Pilot Reactions to Attacks on Avionic
Systems
author:Matthew Smith and
Martin Strohmeier and
Jon Harman and
Vincent Lenders and
Ivan Martinovic
A View from the Cockpit: Exploring Pilot Reactions
to Attacks on Avionic Systems
Matthew Smith∗, Martin Strohmeier∗†, Jonathan Harman, Vincent Lenders† and Ivan Martinovic∗
∗Department of Computer Science, University of Oxford, UK,
†Cyber-Defence Campus, armasuisse Science + Technology, Switzerland
ﬁrst.last@cs.ox.ac.uk
ﬁrst.last@armasuisse.ch
Abstract—Many wireless communications systems found in
aircraft lack standard security mechanisms, leaving them vulner-
able to attack. With affordable software-deﬁned radios readily
available, a novel threat has emerged which allows a wide range of
attackers to easily interfere with wireless avionic systems. Whilst
these vulnerabilities are known, predicting their ultimate effect is
difﬁcult. A major factor in this effect is how ﬂight crew respond,
especially whether their extensive training in fault handling helps
them to manage attacks.
To investigate this we conducted a user study, inviting 30
Airbus A320 type-rated pilots to ﬂy simulator scenarios in
which they were subjected to attacks on their avionics. We use
wireless attacks on three safety-related systems, based on existing
literature: Trafﬁc Collision Avoidance System (TCAS), Ground
Proximity Warning System (GPWS) and the Instrument Landing
System (ILS). To analyze their response, we collected control
input data coupled with closed and open interview responses.
We found that all three attack scenarios created signiﬁcant
control impact and disruption through missed approaches, avoid-
ance maneuvers and diversions. They further increased workload,
distrust in the affected system, and for each attack, at least a third
of our participants switched off the system entirely—even if they
were important safety systems. All pilots felt the scenarios were
useful, with 93.3% feeling that simulato...

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


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

Output:
安全论文分析：

title:Approximate fingerprinting to accelerate pattern matching
author:Ramaswamy Ramaswamy and
Lukas Kencl and
Gianluca Iannaccone
Approximate Fingerprinting to Accelerate Pattern Matching
Ramaswamy
Ramaswamy
Univ. of Massachusetts
Lukas Kencl
Intel Research
Cambridge, UK
Gianluca Iannaccone
Intel Research
Cambridge, UK
rramaswa@ecs.umass.edu
lukas.kencl@intel.com
gianluca.iannaccone@intel.com
ABSTRACT
Pattern matching and analysis over network data streams
is increasingly becoming an essential primitive of network
monitoring systems.
It is a fundamental part of most in-
trusion detection systems, worm detecting algorithms and
many other anomaly detection mechanisms. It is a processing-
intensive task, usually requiring to search for a large number
of patterns simultaneously.
We propose the technique of “approximate ﬁngerprinting”
to reduce the memory demands and signiﬁcantly accelerate
the pattern matching process. The method computes ﬁnger-
prints of preﬁxes of the patterns and matches them against
the input stream. It acts as a generic preprocessor to a stan-
dard pattern matching engine by “clearing” a large fraction
of the input that would not match any of the patterns. The
main contribution is the “approximate” characteristic of the
ﬁngerprint, which allows to slide the ﬁngerprinting window
through the packet at a faster rate, while maintaining a
small memory footprint and low number of false positives.
An improvement over a Bloom ﬁlter solution, a ﬁngerprint
can indicate which patterns are the candidate matches. We
validate our technique by presenting the performance gain
for the popular Snort intrusion detection system with the
preprocessor in place.
Categories and Subject Descriptors
C.2.3 [Network Operations]: Network monitoring; I.5.2
[Design Methodology]: Classiﬁer design and evaluation;
C.2.0 [General]: Security and protection
General Terms
Performance, Design, Measurement
Keywords
Pattern matching, intrusion detection, ﬁngerprint, deep packet
inspectio...


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

Input:
title:Approximate fingerprinting to accelerate pattern matching
author:Ramaswamy Ramaswamy and
Lukas Kencl and
Gianluca Iannaccone
Approximate Fingerprinting to Accelerate Pattern Matching
Ramaswamy
Ramaswamy
Univ. of Massachusetts
Lukas Kencl
Intel Research
Cambridge, UK
Gianluca Iannaccone
Intel Research
Cambridge, UK
rramaswa@ecs.umass.edu
lukas.kencl@intel.com
gianluca.iannaccone@intel.com
ABSTRACT
Pattern matching and analysis over network data streams
is increasingly becoming an essential primitive of network
monitoring systems.
It is a fundamental part of most in-
trusion detection systems, worm detecting algorithms and
many other anomaly detection mechanisms. It is a processing-
intensive task, usually requiring to search for a large number
of patterns simultaneously.
We propose the technique of “approximate ﬁngerprinting”
to reduce the memory demands and signiﬁcantly accelerate
the pattern matching process. The method computes ﬁnger-
prints of preﬁxes of the patterns and matches them against
the input stream. It acts as a generic preprocessor to a stan-
dard pattern matching engine by “clearing” a large fraction
of the input that would not match any of the patterns. The
main contribution is the “approximate” characteristic of the
ﬁngerprint, which allows to slide the ﬁngerprinting window
through the packet at a faster rate, while maintaining a
small memory footprint and low number of false positives.
An improvement over a Bloom ﬁlter solution, a ﬁngerprint
can indicate which patterns are the candidate matches. We
validate our technique by presenting the performance gain
for the popular Snort intrusion detection system with the
preprocessor in place.
Categories and Subject Descriptors
C.2.3 [Network Operations]: Network monitoring; I.5.2
[Design Methodology]: Classiﬁer design and evaluation;
C.2.0 [General]: Security and protection
General Terms
Performance, Design, Measurement
Keywords
Pattern matching, intrusion detection, ﬁngerprint, deep packet
inspectio...

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


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

Output:
安全论文分析：

title:Receipt-mode trust negotiation: efficient authorization through outsourced
interactions
author:Andrew K. Adams and
Adam J. Lee and
Daniel Moss'e
Receipt-Mode Trust Negotiation: Efﬁcient Authorization
Through Outsourced Interactions
Andrew K. Adams†‡, Adam J. Lee‡, Daniel Mossé‡
† Pittsburgh Supercomputing Center
‡ Department of Computer Science, University of Pittsburgh
akadams@psc.edu, {adamlee, mosse}@cs.pitt.edu
ABSTRACT
In trust negotiation approaches to authorization, previously unac-
quainted entities establish trust in one another gradually via the bi-
lateral and iterative exchange of policies and digital credentials. Al-
though this affords resource providers with an expressive means of
access control for open systems, the trust negotiation process incurs
non-trivial computational and communications costs. In this paper,
we propose Receipt-Mode Trust Negotiation (RMTN) as a means
of mitigating the performance penalties on servers that use trust
negotiation. RMTN provides a means of off-loading the major-
ity of the trust negotiation process to delegated receipt-generating
helper servers. RMTN ensures that helpers produce correct trust
negotiation protocol receipts, and that the helpers are incapable of
impersonating the resource server outside of the RMTN protocol.
We describe an initial implementation of our RMTN protocol on
a Linux testbed, discuss the security of this protocol, and present
experimental results indicating that the receipt-mode protocol does
indeed enhance the performance of resource servers that rely on
trust negotiation approaches to authorization.
Keywords
Security, optimization, load balancing, trust negotiation
1.
INTRODUCTION
In open computing systems where resources are shared across
organizational boundaries, users and resource providers may not
always have trust relationships that are established a priori. As
such, traditional identity-based authorization mechanisms are un-
desirable. In trust negotiation approaches to ...


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

Input:
title:Receipt-mode trust negotiation: efficient authorization through outsourced
interactions
author:Andrew K. Adams and
Adam J. Lee and
Daniel Moss'e
Receipt-Mode Trust Negotiation: Efﬁcient Authorization
Through Outsourced Interactions
Andrew K. Adams†‡, Adam J. Lee‡, Daniel Mossé‡
† Pittsburgh Supercomputing Center
‡ Department of Computer Science, University of Pittsburgh
akadams@psc.edu, {adamlee, mosse}@cs.pitt.edu
ABSTRACT
In trust negotiation approaches to authorization, previously unac-
quainted entities establish trust in one another gradually via the bi-
lateral and iterative exchange of policies and digital credentials. Al-
though this affords resource providers with an expressive means of
access control for open systems, the trust negotiation process incurs
non-trivial computational and communications costs. In this paper,
we propose Receipt-Mode Trust Negotiation (RMTN) as a means
of mitigating the performance penalties on servers that use trust
negotiation. RMTN provides a means of off-loading the major-
ity of the trust negotiation process to delegated receipt-generating
helper servers. RMTN ensures that helpers produce correct trust
negotiation protocol receipts, and that the helpers are incapable of
impersonating the resource server outside of the RMTN protocol.
We describe an initial implementation of our RMTN protocol on
a Linux testbed, discuss the security of this protocol, and present
experimental results indicating that the receipt-mode protocol does
indeed enhance the performance of resource servers that rely on
trust negotiation approaches to authorization.
Keywords
Security, optimization, load balancing, trust negotiation
1.
INTRODUCTION
In open computing systems where resources are shared across
organizational boundaries, users and resource providers may not
always have trust relationships that are established a priori. As
such, traditional identity-based authorization mechanisms are un-
desirable. In trust negotiation approaches to ...

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


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

Output:
安全论文分析：

title:ShorTor: Improving Tor Network Latency via Multi-hop Overlay Routing
author:Kyle Hogan and
Sacha Servan-Schreiber and
Zachary Newman and
Ben Weintraub and
Cristina Nita-Rotaru and
Srinivas Devadas
9
1
6
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
ShorTor: Improving Tor Network Latency via
Multi-hop Overlay Routing
Kyle Hogan
MIT CSAIL
Sacha Servan-Schreiber
MIT CSAIL
Zachary Newman
MIT CSAIL
Ben Weintraub
Northeastern University
Cristina Nita-Rotaru
Northeastern University
Srinivas Devadas
MIT CSAIL
Abstract—We present ShorTor, a protocol for reducing latency
on the Tor network. ShorTor uses multi-hop overlay routing, a
technique typically employed by content delivery networks, to
inﬂuence the route Tor trafﬁc takes across the internet. In this
way, ShorTor avoids slow paths and improves the experience
for end users by reducing the latency of their connections while
imposing minimal bandwidth overhead.
ShorTor functions as an overlay on top of onion routing—Tor’s
existing routing protocol—and is run by Tor relays, making it
independent of the path selection performed by Tor clients. As
such, ShorTor reduces latency while preserving Tor’s existing
security properties. Speciﬁcally, the routes taken in ShorTor are
in no way correlated to either the Tor user or their destination,
including the geographic location of either party. We analyze
the security of ShorTor using the AnoA framework, showing
that ShorTor maintains all of Tor’s anonymity guarantees. We
augment our theoretical claims with an empirical analysis.
To evaluate ShorTor’s performance, we collect a real-world
dataset of over 400,000 latency measurements between the 1,000
most popular Tor relays, which collectively see the vast majority
of Tor trafﬁc. With this data, we identify pairs...


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

Input:
title:ShorTor: Improving Tor Network Latency via Multi-hop Overlay Routing
author:Kyle Hogan and
Sacha Servan-Schreiber and
Zachary Newman and
Ben Weintraub and
Cristina Nita-Rotaru and
Srinivas Devadas
9
1
6
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
ShorTor: Improving Tor Network Latency via
Multi-hop Overlay Routing
Kyle Hogan
MIT CSAIL
Sacha Servan-Schreiber
MIT CSAIL
Zachary Newman
MIT CSAIL
Ben Weintraub
Northeastern University
Cristina Nita-Rotaru
Northeastern University
Srinivas Devadas
MIT CSAIL
Abstract—We present ShorTor, a protocol for reducing latency
on the Tor network. ShorTor uses multi-hop overlay routing, a
technique typically employed by content delivery networks, to
inﬂuence the route Tor trafﬁc takes across the internet. In this
way, ShorTor avoids slow paths and improves the experience
for end users by reducing the latency of their connections while
imposing minimal bandwidth overhead.
ShorTor functions as an overlay on top of onion routing—Tor’s
existing routing protocol—and is run by Tor relays, making it
independent of the path selection performed by Tor clients. As
such, ShorTor reduces latency while preserving Tor’s existing
security properties. Speciﬁcally, the routes taken in ShorTor are
in no way correlated to either the Tor user or their destination,
including the geographic location of either party. We analyze
the security of ShorTor using the AnoA framework, showing
that ShorTor maintains all of Tor’s anonymity guarantees. We
augment our theoretical claims with an empirical analysis.
To evaluate ShorTor’s performance, we collect a real-world
dataset of over 400,000 latency measurements between the 1,000
most popular Tor relays, which collectively see the vast majority
of Tor trafﬁc. With this data, we identify pairs...

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


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

Output:
安全论文分析：

title:Bulk of interest: performance measurement of content-centric routing
author:Matthias W"ahlisch and
Thomas C. Schmidt and
Markus Vahlenkamp
Bulk of Interest: Performance Measurement of
Content-Centric Routing
Matthias Wählisch
Freie Universität Berlin
waehlisch@ieee.org
Thomas C. Schmidt
HAW Hamburg, Informatik
t.schmidt@ieee.org
Markus Vahlenkamp
HAW Hamburg, Informatik
markus@vahlenkamp.net
ABSTRACT
The paradigm of information-centric networking subsumes
recent approaches to integrate content replication services
into a future Internet layer. Current concepts foster either a
dynamic mapping that directs content requests to a nearby
copy, or an immediate routing on content identiﬁers. In this
paper, we evaluate in practical experiments the performance
of content routing, which we analyze with a focus on con-
ceptual aspects. Our ﬁndings indicate that the performance
of the content distribution system is threatened by a heavy
management of states that arise from the strong coupling
of the control to the data plane in the underlying routing
infrastructure.
Categories and Subject Descriptors
C.2.1 [Computer-Comm. Networks]: Network Archi-
tecture and Design
General Terms
Measurement, Security
Keywords
Performance, Experimental Evaluation, Routing
1.
INTRODUCTION
One major dedication of today’s Internet is the global dis-
tribution of content in huge amounts. Content distribution
networks (CDNs) facilitate an eﬃcient, wide-area replica-
tion of static data for selected content providers, whereas
the end-to-end design of TCP/IP does not foresee implicit
replication and in-network storage. There is no openly avail-
able standard solution for the asynchronous, global replica-
tion of popular content in the current Internet. Currently,
Information-Centric Networks (ICN) [1] propose to ﬁll this
gap.
Essentially two approaches to routing exist in current ICN
proposals, an evolutionary path that routes on IP, and ‘clean
slate’ concepts that route on content identiti...


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

Input:
title:Bulk of interest: performance measurement of content-centric routing
author:Matthias W"ahlisch and
Thomas C. Schmidt and
Markus Vahlenkamp
Bulk of Interest: Performance Measurement of
Content-Centric Routing
Matthias Wählisch
Freie Universität Berlin
waehlisch@ieee.org
Thomas C. Schmidt
HAW Hamburg, Informatik
t.schmidt@ieee.org
Markus Vahlenkamp
HAW Hamburg, Informatik
markus@vahlenkamp.net
ABSTRACT
The paradigm of information-centric networking subsumes
recent approaches to integrate content replication services
into a future Internet layer. Current concepts foster either a
dynamic mapping that directs content requests to a nearby
copy, or an immediate routing on content identiﬁers. In this
paper, we evaluate in practical experiments the performance
of content routing, which we analyze with a focus on con-
ceptual aspects. Our ﬁndings indicate that the performance
of the content distribution system is threatened by a heavy
management of states that arise from the strong coupling
of the control to the data plane in the underlying routing
infrastructure.
Categories and Subject Descriptors
C.2.1 [Computer-Comm. Networks]: Network Archi-
tecture and Design
General Terms
Measurement, Security
Keywords
Performance, Experimental Evaluation, Routing
1.
INTRODUCTION
One major dedication of today’s Internet is the global dis-
tribution of content in huge amounts. Content distribution
networks (CDNs) facilitate an eﬃcient, wide-area replica-
tion of static data for selected content providers, whereas
the end-to-end design of TCP/IP does not foresee implicit
replication and in-network storage. There is no openly avail-
able standard solution for the asynchronous, global replica-
tion of popular content in the current Internet. Currently,
Information-Centric Networks (ICN) [1] propose to ﬁll this
gap.
Essentially two approaches to routing exist in current ICN
proposals, an evolutionary path that routes on IP, and ‘clean
slate’ concepts that route on content identiti...

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


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

Output:
安全论文分析：

title:TransBlocker: Transforming and Taming Privacy-Breaching Android Applications
author:Mu Zhang and
Heng Yin
TransBlocker: Transforming and Taming Privacy-Breaching
Android Applications
Mu Zhang
Heng Yin
Department
  of
  Electrical
  Engineering
  and
  Computer
  Science,
Syracuse
  University
L.C.Smith College
  of
  Engineering
and
  Computer
  Science
Motivation: Privacy Leakage
•  A significant problem
– Various types of information
– Both benign and malicious apps
– Ads, analytic libraries
•  Information-flow security problem
– Individual checkpoints won’t work
– Dynamic analysis incurs performance overhead
Our Solution: Transblocker
A Running Example
Application-wide Dataflow Analysis
Static Instrumentation
•  Creating Shadow Variables
– Local Variables
– Static/Instance Fields
– Parameters and Return Value
Static Instrumentation
•  Instrumenting the Source
– Initialize tainting
Static Instrumentation
•  Instrumenting Taint Propagation
– Simple Assignments
– Function Calls
– API Calls
Static Instrumentation
•  Instrumenting the Sink
Optimization
•  Removing Redundant BoolWrapper
Statements
•  Removing Redundant Function Parameters
•  Inlining Instrumentation Code
•  Soot Built-in Optimizations
Optimization
Evaluation(cid:1)
•  Lines of Instrumented Code
– Before Optimization: 10%
– After Optimization: 4.48%
•  Runtime  Overhead: 1.5%(cid:1)
12
Conclusion
•  Privacy leakage is an information-flow
security problem
•  Our solution: Combine static analysis and
bytecode re-writing
– Easy to deploy
– Minimal overhead
Questions?
Questions?
Static Instrumentation
•  Cleaning the Taint


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

Input:
title:TransBlocker: Transforming and Taming Privacy-Breaching Android Applications
author:Mu Zhang and
Heng Yin
TransBlocker: Transforming and Taming Privacy-Breaching
Android Applications
Mu Zhang
Heng Yin
Department
  of
  Electrical
  Engineering
  and
  Computer
  Science,
Syracuse
  University
L.C.Smith College
  of
  Engineering
and
  Computer
  Science
Motivation: Privacy Leakage
•  A significant problem
– Various types of information
– Both benign and malicious apps
– Ads, analytic libraries
•  Information-flow security problem
– Individual checkpoints won’t work
– Dynamic analysis incurs performance overhead
Our Solution: Transblocker
A Running Example
Application-wide Dataflow Analysis
Static Instrumentation
•  Creating Shadow Variables
– Local Variables
– Static/Instance Fields
– Parameters and Return Value
Static Instrumentation
•  Instrumenting the Source
– Initialize tainting
Static Instrumentation
•  Instrumenting Taint Propagation
– Simple Assignments
– Function Calls
– API Calls
Static Instrumentation
•  Instrumenting the Sink
Optimization
•  Removing Redundant BoolWrapper
Statements
•  Removing Redundant Function Parameters
•  Inlining Instrumentation Code
•  Soot Built-in Optimizations
Optimization
Evaluation(cid:1)
•  Lines of Instrumented Code
– Before Optimization: 10%
– After Optimization: 4.48%
•  Runtime  Overhead: 1.5%(cid:1)
12
Conclusion
•  Privacy leakage is an information-flow
security problem
•  Our solution: Combine static analysis and
bytecode re-writing
– Easy to deploy
– Minimal overhead
Questions?
Questions?
Static Instrumentation
•  Cleaning the Taint

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


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

Output:
安全论文分析：

title:A Tunable Add-On Diagnostic Protocol for Time-Triggered Systems
author:Marco Serafini and
Neeraj Suri and
Jonny Vinter and
Astrit Ademaj and
Wolfgang Brandst"atter and
Fulvio Tagliabo and
Jens Koch
A Tunable Add-On Diagnostic Protocol for Time-Triggered Systems ∗
Marco Seraﬁni and Neeraj Suri
TU Darmstadt, Germany
Jonny Vinter
SP, Sweden
Astrit Ademaj
TU Vienna, Austria
{marco, suri}@informatik.tu-darmstadt.de
jonny.vinter@sp.se
ademaj@vmars.tuwien.ac.at
Wolfgang Brandst¨atter
Audi, Germany
Fulvio Tagliab`o
Fiat, Italy
Jens Koch
Airbus Deutschland, Germany
wolfgang.brandstaetter@audi.de
fulvio.tagliabo@crf.it
jens.koch@airbus.com
Abstract
We
present
a
protocol
diagnostic
systems
for
tunable
generic time-triggered (TT)
to detect crash
and send/receive omission faults. Compared to existing
diagnostic and membership protocols for TT systems, it
does not rely on the single-fault assumption and tolerates
malicious faults. It runs at the application level and can be
added on top of any TT system (possibly as a middleware
component) without requiring modiﬁcations at the system
level. The information on detected faults is accumulated
using a penalty/reward algorithm to handle transient faults.
After a fault is detected, the likelihood of node isolation can
be adapted to different system conﬁgurations, including
those where functions with different criticality levels
are integrated. Using actual automotive and aerospace
parameters, we experimentally demonstrate the transient
fault handling capabilities of the protocol.
1. Introduction and contributions
In both automotive and aerospace X-by-wire appli-
cations, TT platforms such as Flexray [1], TTP/C [2],
SAFEbus [3] and TT-Ethernet are increasingly being
adopted. Most TT platforms develop their static, built-in
diagnostic and membership approach.
Instead, we deﬁne
an on-line diagnostic/membership protocol that is a tunable
and portable add-on application level module.
It can be
integrated as a plug-in middleware m...


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

Input:
title:A Tunable Add-On Diagnostic Protocol for Time-Triggered Systems
author:Marco Serafini and
Neeraj Suri and
Jonny Vinter and
Astrit Ademaj and
Wolfgang Brandst"atter and
Fulvio Tagliabo and
Jens Koch
A Tunable Add-On Diagnostic Protocol for Time-Triggered Systems ∗
Marco Seraﬁni and Neeraj Suri
TU Darmstadt, Germany
Jonny Vinter
SP, Sweden
Astrit Ademaj
TU Vienna, Austria
{marco, suri}@informatik.tu-darmstadt.de
jonny.vinter@sp.se
ademaj@vmars.tuwien.ac.at
Wolfgang Brandst¨atter
Audi, Germany
Fulvio Tagliab`o
Fiat, Italy
Jens Koch
Airbus Deutschland, Germany
wolfgang.brandstaetter@audi.de
fulvio.tagliabo@crf.it
jens.koch@airbus.com
Abstract
We
present
a
protocol
diagnostic
systems
for
tunable
generic time-triggered (TT)
to detect crash
and send/receive omission faults. Compared to existing
diagnostic and membership protocols for TT systems, it
does not rely on the single-fault assumption and tolerates
malicious faults. It runs at the application level and can be
added on top of any TT system (possibly as a middleware
component) without requiring modiﬁcations at the system
level. The information on detected faults is accumulated
using a penalty/reward algorithm to handle transient faults.
After a fault is detected, the likelihood of node isolation can
be adapted to different system conﬁgurations, including
those where functions with different criticality levels
are integrated. Using actual automotive and aerospace
parameters, we experimentally demonstrate the transient
fault handling capabilities of the protocol.
1. Introduction and contributions
In both automotive and aerospace X-by-wire appli-
cations, TT platforms such as Flexray [1], TTP/C [2],
SAFEbus [3] and TT-Ethernet are increasingly being
adopted. Most TT platforms develop their static, built-in
diagnostic and membership approach.
Instead, we deﬁne
an on-line diagnostic/membership protocol that is a tunable
and portable add-on application level module.
It can be
integrated as a plug-in middleware m...

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


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

Output:
安全论文分析：

title:Fast Secure Multiparty ECDSA with Practical Distributed Key Generation
and Applications to Cryptocurrency Custody
author:Yehuda Lindell and
Ariel Nof
Fast Secure Multiparty ECDSA with Practical
Distributed Key Generation and Applications to
Cryptocurrency Custody∗
Yehuda Lindell†
Ariel Nof†
Samuel Ranellucci‡
October 14, 2018
Abstract
ECDSA is a standardized signing algorithm that is widely used in TLS, code signing, cryp-
tocurrency and more. Due to its importance, the problem of securely computing ECDSA in a
distributed manner (known as threshold signing) has received considerable interest. However,
despite this interest, there is still no full threshold solution for more than 2 parties (meaning
that any t-out-of-n parties can sign, security is preserved for any t−1 or fewer corrupted parties,
and t ≤ n can be any value thus supporting an honest minority) that has practical key distri-
bution. This is due to the fact that all previous solutions for this utilize Paillier homomorphic
encryption, and eﬃcient distributed Paillier key generation for more than two parties is not
known.
In this paper, we present the ﬁrst truly practical full threshold ECDSA signing protocol
that has both fast signing and fast key distribution. This solves a years-old open problem,
and opens the door to practical uses of threshold ECDSA signing that are in demand today.
One of these applications is the construction of secure cryptocurrency wallets (where key shares
are spread over multiple devices and so are hard to steal) and cryptocurrency custody solu-
tions (where large sums of invested cryptocurrency are strongly protected by splitting the key
between a bank/ﬁnancial institution, the customer who owns the currency, and possibly a third-
party trustee, in multiple shares at each). There is growing practical interest in such solutions,
but prior to our work these could not be deployed today due to the need for distributed key
generation.
1
Introduction
1.1 Background and Prior Wo...


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

Input:
title:Fast Secure Multiparty ECDSA with Practical Distributed Key Generation
and Applications to Cryptocurrency Custody
author:Yehuda Lindell and
Ariel Nof
Fast Secure Multiparty ECDSA with Practical
Distributed Key Generation and Applications to
Cryptocurrency Custody∗
Yehuda Lindell†
Ariel Nof†
Samuel Ranellucci‡
October 14, 2018
Abstract
ECDSA is a standardized signing algorithm that is widely used in TLS, code signing, cryp-
tocurrency and more. Due to its importance, the problem of securely computing ECDSA in a
distributed manner (known as threshold signing) has received considerable interest. However,
despite this interest, there is still no full threshold solution for more than 2 parties (meaning
that any t-out-of-n parties can sign, security is preserved for any t−1 or fewer corrupted parties,
and t ≤ n can be any value thus supporting an honest minority) that has practical key distri-
bution. This is due to the fact that all previous solutions for this utilize Paillier homomorphic
encryption, and eﬃcient distributed Paillier key generation for more than two parties is not
known.
In this paper, we present the ﬁrst truly practical full threshold ECDSA signing protocol
that has both fast signing and fast key distribution. This solves a years-old open problem,
and opens the door to practical uses of threshold ECDSA signing that are in demand today.
One of these applications is the construction of secure cryptocurrency wallets (where key shares
are spread over multiple devices and so are hard to steal) and cryptocurrency custody solu-
tions (where large sums of invested cryptocurrency are strongly protected by splitting the key
between a bank/ﬁnancial institution, the customer who owns the currency, and possibly a third-
party trustee, in multiple shares at each). There is growing practical interest in such solutions,
but prior to our work these could not be deployed today due to the need for distributed key
generation.
1
Introduction
1.1 Background and Prior Wo...

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


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

Output:
安全论文分析：

title:Automated Web Patrol with Strider HoneyMonkeys: Finding Web Sites
That Exploit Browser Vulnerabilities
author:Yi-Min Wang and
Doug Beck and
Xuxian Jiang and
Roussi Roussev and
Chad Verbowski and
Shuo Chen and
Samuel T. King
Automated Web Patrol with Strider HoneyMonkeys:
Finding Web Sites That Exploit Browser Vulnerabilities
Yi-Min Wang, Doug Beck, Xuxian Jiang, Roussi Roussev,
Chad Verbowski, Shuo Chen, and Sam King
Microsoft Research, Redmond
Abstract
Internet attacks that use malicious web sites to install
malware  programs  by  exploiting  browser  vulnerabilities
are  a  serious  emerging  threat.  In  response,  we  have
developed  an  automated  web  patrol
to
automatically  identify  and  monitor  these  malicious  sites.
We describe the design and implementation of the Strider
HoneyMonkey Exploit Detection System, which consists of
a  pipeline  of  “monkey  programs”  running  possibly
vulnerable  browsers  on  virtual  machines  with  different
patch  levels  and  patrolling  the  Web  to  seek  out  and
classify web sites that exploit browser vulnerabilities.
system
Within  the  first  month  of  utilizing  this  system,  we
identified 752 unique URLs hosted on 288 web sites that
could  successfully  exploit  unpatched  Windows  XP
machines. The system automatically constructed topology
graphs  based  on  traffic  redirection  to  capture  the
relationship between the exploit sites. This allowed us to
identify  several  major  players  who  are  responsible  for  a
large  number  of  exploit  pages.  By  monitoring  these  752
exploit-URLs on a daily basis, we discovered a malicious
web  site  that  was  performing  zero-day  exploits  of  the
unpatched  javaprxy.dll  vulnerability  and  was  operating
behind 25 exploit-URLs. It was confirmed as the first “in-
the-wild”,  zero-day  exploit  of  this  vulnerability  that  was
reported  to  the  Microsoft  Security  Response  Center.
Additionally,  by  scanning  the  m...


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

Input:
title:Automated Web Patrol with Strider HoneyMonkeys: Finding Web Sites
That Exploit Browser Vulnerabilities
author:Yi-Min Wang and
Doug Beck and
Xuxian Jiang and
Roussi Roussev and
Chad Verbowski and
Shuo Chen and
Samuel T. King
Automated Web Patrol with Strider HoneyMonkeys:
Finding Web Sites That Exploit Browser Vulnerabilities
Yi-Min Wang, Doug Beck, Xuxian Jiang, Roussi Roussev,
Chad Verbowski, Shuo Chen, and Sam King
Microsoft Research, Redmond
Abstract
Internet attacks that use malicious web sites to install
malware  programs  by  exploiting  browser  vulnerabilities
are  a  serious  emerging  threat.  In  response,  we  have
developed  an  automated  web  patrol
to
automatically  identify  and  monitor  these  malicious  sites.
We describe the design and implementation of the Strider
HoneyMonkey Exploit Detection System, which consists of
a  pipeline  of  “monkey  programs”  running  possibly
vulnerable  browsers  on  virtual  machines  with  different
patch  levels  and  patrolling  the  Web  to  seek  out  and
classify web sites that exploit browser vulnerabilities.
system
Within  the  first  month  of  utilizing  this  system,  we
identified 752 unique URLs hosted on 288 web sites that
could  successfully  exploit  unpatched  Windows  XP
machines. The system automatically constructed topology
graphs  based  on  traffic  redirection  to  capture  the
relationship between the exploit sites. This allowed us to
identify  several  major  players  who  are  responsible  for  a
large  number  of  exploit  pages.  By  monitoring  these  752
exploit-URLs on a daily basis, we discovered a malicious
web  site  that  was  performing  zero-day  exploits  of  the
unpatched  javaprxy.dll  vulnerability  and  was  operating
behind 25 exploit-URLs. It was confirmed as the first “in-
the-wild”,  zero-day  exploit  of  this  vulnerability  that  was
reported  to  the  Microsoft  Security  Response  Center.
Additionally,  by  scanning  the  m...

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


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

Output:
安全论文分析：

title:A Framework for Evaluating Software on Reduced Margins Hardware
author:Konstantinos Parasyris and
Panos K. Koutsovasilis and
Vassilis Vassiliadis and
Christos D. Antonopoulos and
Nikolaos Bellas and
Spyros Lalis
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
A Framework for Evaluating Software
on Reduced Margins Hardware
Konstantinos Parasyris, Panos Koutsovasilis, Vassilis Vassiliadis,
Christos D. Antonopoulos, Nikolaos Bellas, Spyros Lalis
Department of Electrical and Computer Engineering
Email: {koparasy, pkoutsovasilis, vasiliad, cda, nbellas, lalis}@uth.gr
University of Thessaly
IR drops, aging, and so on. Even identical chips with the same
microarchitecture, using the same technology libraries and
executing identical code may exhibit different behavior [5].
Therefore, using simulation-based or software fault injection
to study the effects of timing errors may be inaccurate, since
it cannot capture all the complex effects that take place when
the CPU is stressed beyond its nominal operating points.
Recently, a number of commercial platforms have been
released, on which it is technically possible to set the operating
frequency and voltage beyond nominal values. This makes it
possible to evaluate the effects of reduced margins on software
reliability while running the software natively at full speed [1],
[6], [7], [8]. Building on the availability of such platforms,
we present eXtended Margins eXperiment Manager (XM2),
a framework for conducting experiments on real hardware at
non-nominal conﬁgurations. XM2 can be used (i) to study,
analyze and understand how and under what circumstances
modern CPU microarchitectures fail when executing code at
unsafe margins (sections VI-A and VI-B), and (ii) to evaluate
energy gains when operating the CPU with reduced, but still
safe margins (section VI-C). This is possible in modern CPUs
as has already been shown recently for ARMv8 cores [1]
(iii) to evaluate the resilience of appl...


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

Input:
title:A Framework for Evaluating Software on Reduced Margins Hardware
author:Konstantinos Parasyris and
Panos K. Koutsovasilis and
Vassilis Vassiliadis and
Christos D. Antonopoulos and
Nikolaos Bellas and
Spyros Lalis
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
A Framework for Evaluating Software
on Reduced Margins Hardware
Konstantinos Parasyris, Panos Koutsovasilis, Vassilis Vassiliadis,
Christos D. Antonopoulos, Nikolaos Bellas, Spyros Lalis
Department of Electrical and Computer Engineering
Email: {koparasy, pkoutsovasilis, vasiliad, cda, nbellas, lalis}@uth.gr
University of Thessaly
IR drops, aging, and so on. Even identical chips with the same
microarchitecture, using the same technology libraries and
executing identical code may exhibit different behavior [5].
Therefore, using simulation-based or software fault injection
to study the effects of timing errors may be inaccurate, since
it cannot capture all the complex effects that take place when
the CPU is stressed beyond its nominal operating points.
Recently, a number of commercial platforms have been
released, on which it is technically possible to set the operating
frequency and voltage beyond nominal values. This makes it
possible to evaluate the effects of reduced margins on software
reliability while running the software natively at full speed [1],
[6], [7], [8]. Building on the availability of such platforms,
we present eXtended Margins eXperiment Manager (XM2),
a framework for conducting experiments on real hardware at
non-nominal conﬁgurations. XM2 can be used (i) to study,
analyze and understand how and under what circumstances
modern CPU microarchitectures fail when executing code at
unsafe margins (sections VI-A and VI-B), and (ii) to evaluate
energy gains when operating the CPU with reduced, but still
safe margins (section VI-C). This is possible in modern CPUs
as has already been shown recently for ARMv8 cores [1]
(iii) to evaluate the resilience of appl...

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


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

Output:
安全论文分析：

title:S3: A Symbolic String Solver for Vulnerability Detection in Web
Applications
author:Minh-Thai Trinh and
Duc-Hiep Chu and
Joxan Jaffar
S3: A Symbolic String Solver for Vulnerability Detection
in Web Applications
Minh-Thai Trinh
trinhmt@comp.nus.edu.sg
Duc-Hiep Chu
hiepcd@comp.nus.edu.sg
Joxan Jaffar
joxan@comp.nus.edu.sg
National University of Singapore
ABSTRACT
Motivated by the vulnerability analysis of web programs which
work on string inputs, we present S3, a new symbolic string solver.
Our solver employs a new algorithm for a constraint language that
is expressive enough for widespread applicability. Speciﬁcally, our
language covers all the main string operations, such as those in
JavaScript. The algorithm ﬁrst makes use of a symbolic represen-
tation so that membership in a set deﬁned by a regular expression
can be encoded as string equations. Secondly, there is a constraint-
based generation of instances from these symbolic expressions so
that the total number of instances can be limited. We evaluate S3
on a well-known set of practical benchmarks, demonstrating both
its robustness (more deﬁnitive answers) and its efﬁciency (about 20
times faster) against the state-of-the-art.
Categories and Subject Descriptors
D.4.6 [Security and Protection]: Veriﬁcation; D.2.5 [Software
Engineering]: Testing and Debugging
General Terms
Security, Reliability, Veriﬁcation
Keywords
String Analysis; String Constraint Solver; Web Applications
1.
INTRODUCTION
Web applications nowadays provide critical services over the In-
ternet and frequently handle sensitive data. Unfortunately, the de-
velopment is error prone, resulting in applications that are vulnera-
ble to attacks by malicious users. The global accessibility of critical
web applications make this an extremely serious problem.
According to the Open Web Application Security Project, or
OWASP for short [26], the most serious web application vulner-
abilities include: (#1) Injection ﬂaws (such as SQL injection) and
(#3) C...


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

Input:
title:S3: A Symbolic String Solver for Vulnerability Detection in Web
Applications
author:Minh-Thai Trinh and
Duc-Hiep Chu and
Joxan Jaffar
S3: A Symbolic String Solver for Vulnerability Detection
in Web Applications
Minh-Thai Trinh
trinhmt@comp.nus.edu.sg
Duc-Hiep Chu
hiepcd@comp.nus.edu.sg
Joxan Jaffar
joxan@comp.nus.edu.sg
National University of Singapore
ABSTRACT
Motivated by the vulnerability analysis of web programs which
work on string inputs, we present S3, a new symbolic string solver.
Our solver employs a new algorithm for a constraint language that
is expressive enough for widespread applicability. Speciﬁcally, our
language covers all the main string operations, such as those in
JavaScript. The algorithm ﬁrst makes use of a symbolic represen-
tation so that membership in a set deﬁned by a regular expression
can be encoded as string equations. Secondly, there is a constraint-
based generation of instances from these symbolic expressions so
that the total number of instances can be limited. We evaluate S3
on a well-known set of practical benchmarks, demonstrating both
its robustness (more deﬁnitive answers) and its efﬁciency (about 20
times faster) against the state-of-the-art.
Categories and Subject Descriptors
D.4.6 [Security and Protection]: Veriﬁcation; D.2.5 [Software
Engineering]: Testing and Debugging
General Terms
Security, Reliability, Veriﬁcation
Keywords
String Analysis; String Constraint Solver; Web Applications
1.
INTRODUCTION
Web applications nowadays provide critical services over the In-
ternet and frequently handle sensitive data. Unfortunately, the de-
velopment is error prone, resulting in applications that are vulnera-
ble to attacks by malicious users. The global accessibility of critical
web applications make this an extremely serious problem.
According to the Open Web Application Security Project, or
OWASP for short [26], the most serious web application vulner-
abilities include: (#1) Injection ﬂaws (such as SQL injection) and
(#3) C...

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


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

Output:
安全论文分析：

title:Utility-Optimized Local Differential Privacy Mechanisms for Distribution
Estimation
author:Takao Murakami and
Yusuke Kawamoto
Utility-Optimized Local Differential Privacy
Mechanisms for Distribution Estimation
Takao Murakami and Yusuke Kawamoto, AIST
https://www.usenix.org/conference/usenixsecurity19/presentation/murakami
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.Utility-Optimized Local Differential Privacy Mechanisms for
Distribution Estimation ∗
Takao Murakami
AIST
Yusuke Kawamoto
AIST
Abstract
LDP (Local Differential Privacy) has been widely studied to
estimate statistics of personal data (e.g., distribution underly-
ing the data) while protecting users’ privacy. Although LDP
does not require a trusted third party, it regards all personal
data equally sensitive, which causes excessive obfuscation
hence the loss of utility. In this paper, we introduce the notion
of ULDP (Utility-optimized LDP), which provides a privacy
guarantee equivalent to LDP only for sensitive data. We ﬁrst
consider the setting where all users use the same obfuscation
mechanism, and propose two mechanisms providing ULDP:
utility-optimized randomized response and utility-optimized
RAPPOR. We then consider the setting where the distinction
between sensitive and non-sensitive data can be different from
user to user. For this setting, we propose a personalized ULDP
mechanism with semantic tags to estimate the distribution of
personal data with high utility while keeping secret what is
sensitive for each user. We show theoretically and experimen-
tally that our mechanisms provide much higher utility than
the existing LDP mechanisms when there are a lot of non-
sensitive data. We also show that when most of the data are
non-sensitive, our mechanisms even provide almost the same
utility as non-private mecha...


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

Input:
title:Utility-Optimized Local Differential Privacy Mechanisms for Distribution
Estimation
author:Takao Murakami and
Yusuke Kawamoto
Utility-Optimized Local Differential Privacy
Mechanisms for Distribution Estimation
Takao Murakami and Yusuke Kawamoto, AIST
https://www.usenix.org/conference/usenixsecurity19/presentation/murakami
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.Utility-Optimized Local Differential Privacy Mechanisms for
Distribution Estimation ∗
Takao Murakami
AIST
Yusuke Kawamoto
AIST
Abstract
LDP (Local Differential Privacy) has been widely studied to
estimate statistics of personal data (e.g., distribution underly-
ing the data) while protecting users’ privacy. Although LDP
does not require a trusted third party, it regards all personal
data equally sensitive, which causes excessive obfuscation
hence the loss of utility. In this paper, we introduce the notion
of ULDP (Utility-optimized LDP), which provides a privacy
guarantee equivalent to LDP only for sensitive data. We ﬁrst
consider the setting where all users use the same obfuscation
mechanism, and propose two mechanisms providing ULDP:
utility-optimized randomized response and utility-optimized
RAPPOR. We then consider the setting where the distinction
between sensitive and non-sensitive data can be different from
user to user. For this setting, we propose a personalized ULDP
mechanism with semantic tags to estimate the distribution of
personal data with high utility while keeping secret what is
sensitive for each user. We show theoretically and experimen-
tally that our mechanisms provide much higher utility than
the existing LDP mechanisms when there are a lot of non-
sensitive data. We also show that when most of the data are
non-sensitive, our mechanisms even provide almost the same
utility as non-private mecha...

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


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

Output:
安全论文分析：

title:Attribute-based signature and its applications
author:Jin Li and
Man Ho Au and
Willy Susilo and
Dongqing Xie and
Kui Ren
Attribute-Based Signatures∗
Hemanta K. Maji†
Manoj Prabhakaran†
Mike Rosulek‡
November 22, 2010
Abstract
We introduce Attribute-Based Signatures (ABS), a versatile primitive that allows a party to
sign a message with ﬁne-grained control over identifying information. In ABS, a signer, who
possesses a set of attributes from the authority, can sign a message with a predicate that is
satisﬁed by his attributes. The signature reveals no more than the fact that a single user with
some set of attributes satisfying the predicate has attested to the message. In particular, the
signature hides the attributes used to satisfy the predicate and any identifying information about
the signer (that could link multiple signatures as being from the same signer). Furthermore,
users cannot collude to pool their attributes together.
We give a general framework for constructing ABS schemes, and then show several practical
instantiations based on groups with bilinear pairing operations, under standard assumptions.
Further, we give a construction which is secure even against a malicious attribute authority, but
the security for this scheme is proven in the generic group model. We describe several practical
problems that motivated this work, and how ABS can be used to solve them. Also, we show
how our techniques allow us to extend Groth-Sahai NIZK proofs to be simulation-extractable
and identity-based with low overhead.
1
Introduction
Alice, a ﬁnance manager in a big corporation, while going through her company’s ﬁnancial records,
has learned about a major international scandal. She decides to send these records to a major
newspaper, retaining her anonymity, but with a proof that she indeed has access to the records
in question. It turns out that several people, due to a combination of reasons, may have access
to these records: those in the New York, London or Tokyo ...


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

Input:
title:Attribute-based signature and its applications
author:Jin Li and
Man Ho Au and
Willy Susilo and
Dongqing Xie and
Kui Ren
Attribute-Based Signatures∗
Hemanta K. Maji†
Manoj Prabhakaran†
Mike Rosulek‡
November 22, 2010
Abstract
We introduce Attribute-Based Signatures (ABS), a versatile primitive that allows a party to
sign a message with ﬁne-grained control over identifying information. In ABS, a signer, who
possesses a set of attributes from the authority, can sign a message with a predicate that is
satisﬁed by his attributes. The signature reveals no more than the fact that a single user with
some set of attributes satisfying the predicate has attested to the message. In particular, the
signature hides the attributes used to satisfy the predicate and any identifying information about
the signer (that could link multiple signatures as being from the same signer). Furthermore,
users cannot collude to pool their attributes together.
We give a general framework for constructing ABS schemes, and then show several practical
instantiations based on groups with bilinear pairing operations, under standard assumptions.
Further, we give a construction which is secure even against a malicious attribute authority, but
the security for this scheme is proven in the generic group model. We describe several practical
problems that motivated this work, and how ABS can be used to solve them. Also, we show
how our techniques allow us to extend Groth-Sahai NIZK proofs to be simulation-extractable
and identity-based with low overhead.
1
Introduction
Alice, a ﬁnance manager in a big corporation, while going through her company’s ﬁnancial records,
has learned about a major international scandal. She decides to send these records to a major
newspaper, retaining her anonymity, but with a proof that she indeed has access to the records
in question. It turns out that several people, due to a combination of reasons, may have access
to these records: those in the New York, London or Tokyo ...

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


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

Output:
安全论文分析：

title:Availability, usage, and deployment characteristics of the domain
name system
author:Jeffrey Pang and
James Hendricks and
Aditya Akella and
Roberto De Prisco and
Bruce M. Maggs and
Srinivasan Seshan
Availability, Usage, and Deployment Characteristics of the
Domain Name System(cid:3)
Jeffrey Pang
Carnegie Mellon University
jeffpang@cs.cmu.edu
James Hendricks
Carnegie Mellon University
jimi@cs.cmu.edu
Aditya Akella
Carnegie Mellon University
aditya@cs.cmu.edu
Roberto De Priscoy
University of Salerno
robdep@unisa.it
Bruce Maggsy
Carnegie Mellon University
Srinivasan Seshan
Carnegie Mellon University
bmm@cs.cmu.edu
srini@cmu.edu
ABSTRACT
The Domain Name System (DNS) is a critical part of the Internet’s
infrastructure, and is one of the few examples of a robust, highly-
scalable, and operational distributed system. Although a few stud-
ies have been devoted to characterizing its properties, such as its
workload and the stability of the top-level servers, many key com-
ponents of DNS have not yet been examined. Based on large-scale
measurements taken from servers in a large content distribution net-
work, we present a detailed study of key characteristics of the DNS
infrastructure, such as load distribution, availability, and deploy-
ment patterns of DNS servers. Our analysis includes both local
DNS servers and servers in the authoritative hierarchy. We ﬁnd
that (1) the vast majority of users use a small fraction of deployed
name servers, (2) the availability of most name servers is high, and
(3) there exists a larger degree of diversity in local DNS server de-
ployment and usage than for authoritative servers. Furthermore,
we use our DNS measurements to draw conclusions about feder-
ated infrastructures in general. We evaluate and discuss the impact
of federated deployment models on future systems, such as Dis-
tributed Hash Tables.
Categories and Subject Descriptors
C.2 [Computer Systems Organization]: Computer-Communication
Networks; C.2.4 [Computer-Communication...


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

Input:
title:Availability, usage, and deployment characteristics of the domain
name system
author:Jeffrey Pang and
James Hendricks and
Aditya Akella and
Roberto De Prisco and
Bruce M. Maggs and
Srinivasan Seshan
Availability, Usage, and Deployment Characteristics of the
Domain Name System(cid:3)
Jeffrey Pang
Carnegie Mellon University
jeffpang@cs.cmu.edu
James Hendricks
Carnegie Mellon University
jimi@cs.cmu.edu
Aditya Akella
Carnegie Mellon University
aditya@cs.cmu.edu
Roberto De Priscoy
University of Salerno
robdep@unisa.it
Bruce Maggsy
Carnegie Mellon University
Srinivasan Seshan
Carnegie Mellon University
bmm@cs.cmu.edu
srini@cmu.edu
ABSTRACT
The Domain Name System (DNS) is a critical part of the Internet’s
infrastructure, and is one of the few examples of a robust, highly-
scalable, and operational distributed system. Although a few stud-
ies have been devoted to characterizing its properties, such as its
workload and the stability of the top-level servers, many key com-
ponents of DNS have not yet been examined. Based on large-scale
measurements taken from servers in a large content distribution net-
work, we present a detailed study of key characteristics of the DNS
infrastructure, such as load distribution, availability, and deploy-
ment patterns of DNS servers. Our analysis includes both local
DNS servers and servers in the authoritative hierarchy. We ﬁnd
that (1) the vast majority of users use a small fraction of deployed
name servers, (2) the availability of most name servers is high, and
(3) there exists a larger degree of diversity in local DNS server de-
ployment and usage than for authoritative servers. Furthermore,
we use our DNS measurements to draw conclusions about feder-
ated infrastructures in general. We evaluate and discuss the impact
of federated deployment models on future systems, such as Dis-
tributed Hash Tables.
Categories and Subject Descriptors
C.2 [Computer Systems Organization]: Computer-Communication
Networks; C.2.4 [Computer-Communication...

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


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

Output:
安全论文分析：

title:Taking Routers Off Their Meds: Why Assumptions Of Router Stability
Are Dangerous
author:Max Schuchard and
Christopher Thompson and
Nicholas Hopper and
Yongdae Kim
Taking Routers Off Their Meds:
Why Assumptions Of Router Stability Are Dangerous
Max Schuchard, Christopher Thompson, Nicholas Hopper, Yongdae Kim
University of Minnesota
{schuch, cthomp, hopper, kyd} @ cs.umn.edu
In this work, we examine how an adversary in control
of a BGP speaker in a transit AS can cause a victim router
in an arbitrary location on the Internet to become unstable.
Through experimentation with both hardware and software
routers, we look at the behavior of routers under abnor-
mal conditions and come to four conclusions. First, routers
placed in certain states behave in anything but a stable man-
ner. Second, unexpected but perfectly legal BGP messages
can place routers into those states with disconcerting ease.
Third, an adversary can use these messages to disrupt a vic-
tim router to which he is not directly connected. Fourth,
modern best practices do little to prevent these attacks.
)
(
 0
B
M
Time (s)
y
r
o
m
e
M
CISCO
Quagga
Through
Figure 1.
 500  1000  1500  2000  2500
70.0
60.0
50.0
40.0
30.0
20.0
10.0
0.0
-10.0
experi-
ments on hardware
and software routers,
we
observed what
happens when routers
ﬁnd
themselves
starved for CPU cy-
cles or memory. We
witnessed a variety of
failure modes, ranging
from severe perfor-
mance degradation to the unrecoverable failure of all active
routing sessions. We also observed that a router placed into
one of these states would more than likely cause its peers
to enter one or more of these states as well. An example of
this is a CPU starved router was the exhausting its peer’s
memory. When the rate of incoming BGP updates exceeds
a router’s computational capacity, the receiving router only
buffers a ﬁxed number of incoming BGP messages. When
those limits are reached it is up to the sender to buffer
all future updates until the CPU starved rout...


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

Input:
title:Taking Routers Off Their Meds: Why Assumptions Of Router Stability
Are Dangerous
author:Max Schuchard and
Christopher Thompson and
Nicholas Hopper and
Yongdae Kim
Taking Routers Off Their Meds:
Why Assumptions Of Router Stability Are Dangerous
Max Schuchard, Christopher Thompson, Nicholas Hopper, Yongdae Kim
University of Minnesota
{schuch, cthomp, hopper, kyd} @ cs.umn.edu
In this work, we examine how an adversary in control
of a BGP speaker in a transit AS can cause a victim router
in an arbitrary location on the Internet to become unstable.
Through experimentation with both hardware and software
routers, we look at the behavior of routers under abnor-
mal conditions and come to four conclusions. First, routers
placed in certain states behave in anything but a stable man-
ner. Second, unexpected but perfectly legal BGP messages
can place routers into those states with disconcerting ease.
Third, an adversary can use these messages to disrupt a vic-
tim router to which he is not directly connected. Fourth,
modern best practices do little to prevent these attacks.
)
(
 0
B
M
Time (s)
y
r
o
m
e
M
CISCO
Quagga
Through
Figure 1.
 500  1000  1500  2000  2500
70.0
60.0
50.0
40.0
30.0
20.0
10.0
0.0
-10.0
experi-
ments on hardware
and software routers,
we
observed what
happens when routers
ﬁnd
themselves
starved for CPU cy-
cles or memory. We
witnessed a variety of
failure modes, ranging
from severe perfor-
mance degradation to the unrecoverable failure of all active
routing sessions. We also observed that a router placed into
one of these states would more than likely cause its peers
to enter one or more of these states as well. An example of
this is a CPU starved router was the exhausting its peer’s
memory. When the rate of incoming BGP updates exceeds
a router’s computational capacity, the receiving router only
buffers a ﬁxed number of incoming BGP messages. When
those limits are reached it is up to the sender to buffer
all future updates until the CPU starved rout...

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


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

Output:
安全论文分析：

title:Polygraph: Automatically Generating Signatures for Polymorphic Worms
author:James Newsome and
Brad Karp and
Dawn Xiaodong Song
Polygraph: Automatically Generating Signatures
for Polymorphic Worms
James Newsome
Carnegie Mellon University
jnewsome@ece.cmu.edu
Brad Karp
Dawn Song
Intel Research Pittsburgh
brad.n.karp@intel.com
Carnegie Mellon University
bkarp+@cs.cmu.edu
Carnegie Mellon University
dawnsong@cmu.edu
Abstract
It is widely believed that content-signature-based intru-
sion detection systems (IDSes) are easily evaded by poly-
morphic worms, which vary their payload on every infec-
tion attempt.
In this paper, we present Polygraph, a sig-
nature generation system that successfully produces signa-
tures that match polymorphic worms. Polygraph gener-
ates signatures that consist of multiple disjoint content sub-
strings. In doing so, Polygraph leverages our insight that
for a real-world exploit to function properly, multiple in-
variant substrings must often be present in all variants of
a payload; these substrings typically correspond to proto-
col framing, return addresses, and in some cases, poorly
obfuscated code. We contribute a deﬁnition of the poly-
morphic signature generation problem; propose classes of
signature suited for matching polymorphic worm payloads;
and present algorithms for automatic generation of signa-
tures in these classes. Our evaluation of these algorithms on
a range of polymorphic worms demonstrates that Polygraph
produces signatures for polymorphic worms that exhibit low
false negatives and false positives.
1. Introduction and Motivation
Enabled by ever-more pervasive Internet connectivity, an
increasing variety of exploitable vulnerabilities in software,
and a lack of diversity in the software running on Internet-
attached hosts, Internet worms increasingly threaten the
availability and integrity of Internet-based services.
Toward defending against Internet worms (and other at-
tacks), the research community has proposed and ...


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

Input:
title:Polygraph: Automatically Generating Signatures for Polymorphic Worms
author:James Newsome and
Brad Karp and
Dawn Xiaodong Song
Polygraph: Automatically Generating Signatures
for Polymorphic Worms
James Newsome
Carnegie Mellon University
jnewsome@ece.cmu.edu
Brad Karp
Dawn Song
Intel Research Pittsburgh
brad.n.karp@intel.com
Carnegie Mellon University
bkarp+@cs.cmu.edu
Carnegie Mellon University
dawnsong@cmu.edu
Abstract
It is widely believed that content-signature-based intru-
sion detection systems (IDSes) are easily evaded by poly-
morphic worms, which vary their payload on every infec-
tion attempt.
In this paper, we present Polygraph, a sig-
nature generation system that successfully produces signa-
tures that match polymorphic worms. Polygraph gener-
ates signatures that consist of multiple disjoint content sub-
strings. In doing so, Polygraph leverages our insight that
for a real-world exploit to function properly, multiple in-
variant substrings must often be present in all variants of
a payload; these substrings typically correspond to proto-
col framing, return addresses, and in some cases, poorly
obfuscated code. We contribute a deﬁnition of the poly-
morphic signature generation problem; propose classes of
signature suited for matching polymorphic worm payloads;
and present algorithms for automatic generation of signa-
tures in these classes. Our evaluation of these algorithms on
a range of polymorphic worms demonstrates that Polygraph
produces signatures for polymorphic worms that exhibit low
false negatives and false positives.
1. Introduction and Motivation
Enabled by ever-more pervasive Internet connectivity, an
increasing variety of exploitable vulnerabilities in software,
and a lack of diversity in the software running on Internet-
attached hosts, Internet worms increasingly threaten the
availability and integrity of Internet-based services.
Toward defending against Internet worms (and other at-
tacks), the research community has proposed and ...

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


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

Output:
安全论文分析：

title:Efficient computational oblivious transfer using interactive hashing
author:Kirill Morozov and
George Savvides
Efﬁcient Computational Oblivious Transfer
Using Interactive Hashing
(cid:3)
Kirill Morozov
Faculty of Mathematics, Kyushu University
744 Motooka Nishi-ku Fukuoka 819-0395 Japan
morozov@math.kyushu-u.ac.jp
ABSTRACT
We present two protocols for reducing oblivious transfer
(OT) to the security of trapdoor permutations and to the
hardness of some coding problems, respectively. The (cid:12)rst
protocol is the most e(cid:14)cient known to date, while the sec-
ond one is a theoretical proof-of-concept. Our construc-
tions leverage the power of Interactive Hashing (IH). The
(cid:12)rst protocol can be viewed as a simple modi(cid:12)cation of the
well-known OT construction by Even, Goldreich and Lem-
pel (1985), in which a receiver must send a random domain
element to a sender through IH. Alternatively, our protocol
can be viewed as a simple modi(cid:12)cation of the construction
by Ostrovsky, Venkatesan and Yung (1993), in which the
players substitute the one-way permutation with a trapdoor
permutation. We use a similar approach to derive a second
OT protocol based on coding assumptions related to security
of the McEliece cryptosystem. In our second construction,
the receiver inputs a public key into IH while privately keep-
ing the corresponding secret key. Two di(cid:11)erent versions of
IH are used: the computationally secure one in the (cid:12)rst pro-
tocol, and the information-theoretically secure one in the
second.
Categories and Subject Descriptors
F.m [Theory of Computation]: Miscellaneous|distribu-
ted computation; E.3 [Data]: Data Encryption|public key
cryptosystems; E.4 [Data]: Coding and Information Theo-
ry|error correcting codes
General Terms
Security, Theory
Keywords
Oblivious transfer, interactive hashing, trapdoor permuta-
(cid:3)
This work was done when Kirill Morozov was with Research
Center for Information Security, National Institute of ...


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

Input:
title:Efficient computational oblivious transfer using interactive hashing
author:Kirill Morozov and
George Savvides
Efﬁcient Computational Oblivious Transfer
Using Interactive Hashing
(cid:3)
Kirill Morozov
Faculty of Mathematics, Kyushu University
744 Motooka Nishi-ku Fukuoka 819-0395 Japan
morozov@math.kyushu-u.ac.jp
ABSTRACT
We present two protocols for reducing oblivious transfer
(OT) to the security of trapdoor permutations and to the
hardness of some coding problems, respectively. The (cid:12)rst
protocol is the most e(cid:14)cient known to date, while the sec-
ond one is a theoretical proof-of-concept. Our construc-
tions leverage the power of Interactive Hashing (IH). The
(cid:12)rst protocol can be viewed as a simple modi(cid:12)cation of the
well-known OT construction by Even, Goldreich and Lem-
pel (1985), in which a receiver must send a random domain
element to a sender through IH. Alternatively, our protocol
can be viewed as a simple modi(cid:12)cation of the construction
by Ostrovsky, Venkatesan and Yung (1993), in which the
players substitute the one-way permutation with a trapdoor
permutation. We use a similar approach to derive a second
OT protocol based on coding assumptions related to security
of the McEliece cryptosystem. In our second construction,
the receiver inputs a public key into IH while privately keep-
ing the corresponding secret key. Two di(cid:11)erent versions of
IH are used: the computationally secure one in the (cid:12)rst pro-
tocol, and the information-theoretically secure one in the
second.
Categories and Subject Descriptors
F.m [Theory of Computation]: Miscellaneous|distribu-
ted computation; E.3 [Data]: Data Encryption|public key
cryptosystems; E.4 [Data]: Coding and Information Theo-
ry|error correcting codes
General Terms
Security, Theory
Keywords
Oblivious transfer, interactive hashing, trapdoor permuta-
(cid:3)
This work was done when Kirill Morozov was with Research
Center for Information Security, National Institute of ...

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


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

Output:
安全论文分析：

title:Swarm Attacks against Network-Level Emulation/Analysis
author:Simon P. Chung and
Aloysius K. Mok
Swarm Attacks against Network-Level
Emulation/Analysis
Simon P. Chung and Aloysius K. Mok(cid:2)
University of Texas at Austin, Austin TX 78712, USA
Department of Computer Sciences,
{phchung,mok}@cs.utexas.edu
Abstract. It is always assumed that if the attackers can achieve their
goal by exploiting a vulnerability once, they won’t exploit it twice. This
assumption shapes our view of what attacks look like, and aﬀects the
design of many security systems. In this work, we propose the swarm
attack, in which the attacker deliberately exploits the same vulnerability
multiple times, each intended to carry out only a small part of the attack
goal. We have studied eight systems that detect attacks using network-
level emulation/analysis, and ﬁnd them surprisingly vulnerable to attacks
based on this strategy.
Keywords: Decoder detection; network-level emulation; network IDS;
evasion; swarm attacks.
1 Introduction
In its simplest, most common form, a control hijacking attack works as follow: the
attacker sends in one single malicious input with the proper “protocol frame”
to trigger the targeted vulnerability, together with a self contained payload
that will achieve the attacker’s goal once executed. When the malicious input is
processed, certain control data structure will be overwritten, and this results in
an almost instant transfer of control to the attacker’s payload. We believe
many security systems are designed with this simple model of attacks in mind,
and it is usually implicitly assumed that the attacker gains nothing by making
the attack more complicated (or less “eﬃcient”). In other word, if they can get
all their attack code executed with one instance of control hijacking, they will
not divide their code into multiple pieces and execute them through multiple
exploitations of the vulnerability. Similarly, the attacker will overwrite the piece
of control data that...


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

Input:
title:Swarm Attacks against Network-Level Emulation/Analysis
author:Simon P. Chung and
Aloysius K. Mok
Swarm Attacks against Network-Level
Emulation/Analysis
Simon P. Chung and Aloysius K. Mok(cid:2)
University of Texas at Austin, Austin TX 78712, USA
Department of Computer Sciences,
{phchung,mok}@cs.utexas.edu
Abstract. It is always assumed that if the attackers can achieve their
goal by exploiting a vulnerability once, they won’t exploit it twice. This
assumption shapes our view of what attacks look like, and aﬀects the
design of many security systems. In this work, we propose the swarm
attack, in which the attacker deliberately exploits the same vulnerability
multiple times, each intended to carry out only a small part of the attack
goal. We have studied eight systems that detect attacks using network-
level emulation/analysis, and ﬁnd them surprisingly vulnerable to attacks
based on this strategy.
Keywords: Decoder detection; network-level emulation; network IDS;
evasion; swarm attacks.
1 Introduction
In its simplest, most common form, a control hijacking attack works as follow: the
attacker sends in one single malicious input with the proper “protocol frame”
to trigger the targeted vulnerability, together with a self contained payload
that will achieve the attacker’s goal once executed. When the malicious input is
processed, certain control data structure will be overwritten, and this results in
an almost instant transfer of control to the attacker’s payload. We believe
many security systems are designed with this simple model of attacks in mind,
and it is usually implicitly assumed that the attacker gains nothing by making
the attack more complicated (or less “eﬃcient”). In other word, if they can get
all their attack code executed with one instance of control hijacking, they will
not divide their code into multiple pieces and execute them through multiple
exploitations of the vulnerability. Similarly, the attacker will overwrite the piece
of control data that...

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


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

Output:
安全论文分析：

title:HyperDex: a distributed, searchable key-value store
author:Robert Escriva and
Bernard Wong and
Emin G"un Sirer
HyperDex: A Distributed, Searchable Key-Value Store
Robert Escriva
Computer Science
Department
Cornell University
escriva@cs.cornell.edu
Bernard Wong
Cheriton School of Computer
Science
University of Waterloo
bernard@uwaterloo.ca
Emin Gün Sirer
Computer Science
Department
Cornell University
egs@systems.cs.cornell.edu
ABSTRACT
Distributed key-value stores are now a standard component
of high-performance web services and cloud computing ap-
plications. While key-value stores oﬀer signiﬁcant perfor-
mance and scalability advantages compared to traditional
databases, they achieve these properties through a restricted
API that limits object retrieval—an object can only be re-
trieved by the (primary and only) key under which it was
inserted. This paper presents HyperDex, a novel distributed
key-value store that provides a unique search primitive that
enables queries on secondary attributes. The key insight
behind HyperDex is the concept of hyperspace hashing in
which objects with multiple attributes are mapped into a
multidimensional hyperspace. This mapping leads to eﬃ-
cient implementations not only for retrieval by primary key,
but also for partially-speciﬁed secondary attribute searches
and range queries. A novel chaining protocol enables the
system to achieve strong consistency, maintain availability
and guarantee fault tolerance. An evaluation of the full sys-
tem shows that HyperDex is 12-13× faster than Cassandra
and MongoDB for ﬁnding partially speciﬁed objects. Ad-
ditionally, HyperDex achieves 2-4× higher throughput for
get/put operations.
Categories and Subject Descriptors
D.4.7 [Operating Systems]: Organization and Design
Keywords
Key-Value Store, NoSQL, Fault-Tolerance, Strong Consis-
tency, Performance
1.
INTRODUCTION
Modern distributed applications are reshaping the land-
scape of storage systems. Recently emerging distributed
key-valu...


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

Input:
title:HyperDex: a distributed, searchable key-value store
author:Robert Escriva and
Bernard Wong and
Emin G"un Sirer
HyperDex: A Distributed, Searchable Key-Value Store
Robert Escriva
Computer Science
Department
Cornell University
escriva@cs.cornell.edu
Bernard Wong
Cheriton School of Computer
Science
University of Waterloo
bernard@uwaterloo.ca
Emin Gün Sirer
Computer Science
Department
Cornell University
egs@systems.cs.cornell.edu
ABSTRACT
Distributed key-value stores are now a standard component
of high-performance web services and cloud computing ap-
plications. While key-value stores oﬀer signiﬁcant perfor-
mance and scalability advantages compared to traditional
databases, they achieve these properties through a restricted
API that limits object retrieval—an object can only be re-
trieved by the (primary and only) key under which it was
inserted. This paper presents HyperDex, a novel distributed
key-value store that provides a unique search primitive that
enables queries on secondary attributes. The key insight
behind HyperDex is the concept of hyperspace hashing in
which objects with multiple attributes are mapped into a
multidimensional hyperspace. This mapping leads to eﬃ-
cient implementations not only for retrieval by primary key,
but also for partially-speciﬁed secondary attribute searches
and range queries. A novel chaining protocol enables the
system to achieve strong consistency, maintain availability
and guarantee fault tolerance. An evaluation of the full sys-
tem shows that HyperDex is 12-13× faster than Cassandra
and MongoDB for ﬁnding partially speciﬁed objects. Ad-
ditionally, HyperDex achieves 2-4× higher throughput for
get/put operations.
Categories and Subject Descriptors
D.4.7 [Operating Systems]: Organization and Design
Keywords
Key-Value Store, NoSQL, Fault-Tolerance, Strong Consis-
tency, Performance
1.
INTRODUCTION
Modern distributed applications are reshaping the land-
scape of storage systems. Recently emerging distributed
key-valu...

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


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

Output:
安全论文分析：

title:CoSMeDis: A Distributed Social Media Platform with Formally Verified
Confidentiality Guarantees
author:Thomas Bauereiß and
Armando Pesenti Gritti and
Andrei Popescu and
Franco Raimondi
2017 IEEE Symposium on Security and Privacy
CoSMeDis: A Distributed Social Media Platform
with Formally Veriﬁed Conﬁdentiality Guarantees
Thomas Bauereiß∗, Armando Pesenti Gritti†, Andrei Popescu‡§, Franco Raimondi‡
∗German Research Center for Artiﬁcial Intelligence (DFKI) Bremen, Germany
†Global NoticeBoard, UK
‡Department of Computer Science, Middlesex University London, UK
§Institute of Mathematics Simion Stoilow of the Romanian Academy
Abstract— We present the design, implementation and in-
formation ﬂow veriﬁcation of CoSMeDis, a distributed social
media platform. The system consists of an arbitrary number
of communicating nodes, deployable at different locations over
the Internet. Its registered users can post content and establish
intra-node and inter-node friendships, used to regulate access
control over the posts. The system’s kernel has been veriﬁed
in the proof assistant Isabelle/HOL and automatically extracted
as Scala code. We formalized a framework for composing a
class of information ﬂow security guarantees in a distributed
system, applicable to input/output automata. We instantiated this
framework to conﬁdentiality properties for CoSMeDis’s sources
of information: posts, friendship requests, and friendship status.
I.
INTRODUCTION
Recent years have seen an explosion of web-based systems
aimed at sharing information between multiple users in a con-
venient, but controlled fashion. Examples include enterprise
systems, social networks, e-commerce sites and cloud services.
These systems often deal with conﬁdential information, such
as credit card details, medical data, location information and
sensitive documents. Unfortunately, most of these systems
offer no guarantees concerning the prevention of unintended
ﬂow of information. Programming errors or ambiguous policy
...


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

Input:
title:CoSMeDis: A Distributed Social Media Platform with Formally Verified
Confidentiality Guarantees
author:Thomas Bauereiß and
Armando Pesenti Gritti and
Andrei Popescu and
Franco Raimondi
2017 IEEE Symposium on Security and Privacy
CoSMeDis: A Distributed Social Media Platform
with Formally Veriﬁed Conﬁdentiality Guarantees
Thomas Bauereiß∗, Armando Pesenti Gritti†, Andrei Popescu‡§, Franco Raimondi‡
∗German Research Center for Artiﬁcial Intelligence (DFKI) Bremen, Germany
†Global NoticeBoard, UK
‡Department of Computer Science, Middlesex University London, UK
§Institute of Mathematics Simion Stoilow of the Romanian Academy
Abstract— We present the design, implementation and in-
formation ﬂow veriﬁcation of CoSMeDis, a distributed social
media platform. The system consists of an arbitrary number
of communicating nodes, deployable at different locations over
the Internet. Its registered users can post content and establish
intra-node and inter-node friendships, used to regulate access
control over the posts. The system’s kernel has been veriﬁed
in the proof assistant Isabelle/HOL and automatically extracted
as Scala code. We formalized a framework for composing a
class of information ﬂow security guarantees in a distributed
system, applicable to input/output automata. We instantiated this
framework to conﬁdentiality properties for CoSMeDis’s sources
of information: posts, friendship requests, and friendship status.
I.
INTRODUCTION
Recent years have seen an explosion of web-based systems
aimed at sharing information between multiple users in a con-
venient, but controlled fashion. Examples include enterprise
systems, social networks, e-commerce sites and cloud services.
These systems often deal with conﬁdential information, such
as credit card details, medical data, location information and
sensitive documents. Unfortunately, most of these systems
offer no guarantees concerning the prevention of unintended
ﬂow of information. Programming errors or ambiguous policy
...

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


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

Output:
安全论文分析：

title:Raising the Bar: Evaluating Origin-wide Security Manifests
author:Steven Van Acker and
Daniel Hausknecht and
Andrei Sabelfeld
Raising the Bar: Evaluating Origin-wide Security Manifests
Chalmers University of Technology
Chalmers University of Technology
Steven Van Acker
Gothenburg, Sweden
Daniel Hausknecht
Gothenburg, Sweden
Andrei Sabelfeld
Chalmers University of Technology
Gothenburg, Sweden
ABSTRACT
Defending a web application from attackers requires the correct
conguration of several web security mechanisms for each and
every web page in that web application. This conguration process
can be dicult and result in gaps in the defense against web attack-
ers because some web pages may be overlooked. In this work we
provide a rst evaluation of the standard draft for an origin-wide
security conguration mechanism called the “origin manifest”. The
mechanism raises the security level of an entire web origin at once
while still allowing the specication of web security policies at
the web page level. We create prototype implementations of the
origin manifest mechanism for both the client-side and server-side,
and provide security ocers with an automated origin manifest
learner and generator to aid them with the conguration of their
web origins. To resolve potential collisions of policies dened by
the web origin with policies dened by web pages we formalize the
comparison and combination of web security policies and integrate
it into our prototype implementation. We evaluate the feasibility
of the origin manifest mechanism with a longitudinal study of pop-
ular websites to determine whether origin manifest les are stable
enough to not require frequent reconguration, and perform per-
formance measurements on the Alexa top 10,000 to determine the
network trac overhead. Our results show that the origin manifest
mechanism can eectively raise the security level of a web origin
while slightly improving network performance.
ACM Reference Format:
Steven Van Acker...


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

Input:
title:Raising the Bar: Evaluating Origin-wide Security Manifests
author:Steven Van Acker and
Daniel Hausknecht and
Andrei Sabelfeld
Raising the Bar: Evaluating Origin-wide Security Manifests
Chalmers University of Technology
Chalmers University of Technology
Steven Van Acker
Gothenburg, Sweden
Daniel Hausknecht
Gothenburg, Sweden
Andrei Sabelfeld
Chalmers University of Technology
Gothenburg, Sweden
ABSTRACT
Defending a web application from attackers requires the correct
conguration of several web security mechanisms for each and
every web page in that web application. This conguration process
can be dicult and result in gaps in the defense against web attack-
ers because some web pages may be overlooked. In this work we
provide a rst evaluation of the standard draft for an origin-wide
security conguration mechanism called the “origin manifest”. The
mechanism raises the security level of an entire web origin at once
while still allowing the specication of web security policies at
the web page level. We create prototype implementations of the
origin manifest mechanism for both the client-side and server-side,
and provide security ocers with an automated origin manifest
learner and generator to aid them with the conguration of their
web origins. To resolve potential collisions of policies dened by
the web origin with policies dened by web pages we formalize the
comparison and combination of web security policies and integrate
it into our prototype implementation. We evaluate the feasibility
of the origin manifest mechanism with a longitudinal study of pop-
ular websites to determine whether origin manifest les are stable
enough to not require frequent reconguration, and perform per-
formance measurements on the Alexa top 10,000 to determine the
network trac overhead. Our results show that the origin manifest
mechanism can eectively raise the security level of a web origin
while slightly improving network performance.
ACM Reference Format:
Steven Van Acker...

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


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

Output:
安全论文分析：

title:CodeAlchemist: Semantics-Aware Code Generation to Find Vulnerabilities
in JavaScript Engines
author:HyungSeok Han and
DongHyeon Oh and
Sang Kil Cha
CodeAlchemist: Semantics-Aware Code Generation
to Find Vulnerabilities in JavaScript Engines
HyungSeok Han
KAIST
DongHyeon Oh
KAIST
hyungseok.han@kaist.ac.kr
donghyeon.oh@kaist.ac.kr
Sang Kil Cha
KAIST
sangkilc@kaist.ac.kr
Abstract—JavaScript engines are an attractive target
for
attackers due to their popularity and ﬂexibility in building
exploits. Current state-of-the-art fuzzers for ﬁnding JavaScript
engine vulnerabilities focus mainly on generating syntactically
correct test cases based on either a predeﬁned context-free
grammar or a trained probabilistic language model. Unfor-
tunately, syntactically correct JavaScript sentences are often
semantically invalid at runtime. Furthermore, statically analyzing
the semantics of JavaScript code is challenging due to its
dynamic nature: JavaScript code is generated at runtime, and
JavaScript expressions are dynamically-typed. To address this
challenge, we propose a novel test case generation algorithm
that we call semantics-aware assembly, and implement it in a
fuzz testing tool termed CodeAlchemist. Our tool can generate
arbitrary JavaScript code snippets that are both semantically and
syntactically correct, and it effectively yields test cases that can
crash JavaScript engines. We found numerous vulnerabilities of
the latest JavaScript engines with CodeAlchemist and reported
them to the vendors.
I.
INTRODUCTION
JavaScript (JS) engines have become a core component of
modern web browsers as they enable dynamic and interactive
features on web pages. As of July of 2018, approximately
94.9% of all the websites use JS [34], and almost all smart-
phones are equipped with a JS-enabled browser today.
The growing popularity of JS also means that JS engines
are an appealing target for attackers. As developers attempt to
improve performance and functionality of modern JS engines,...


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

Input:
title:CodeAlchemist: Semantics-Aware Code Generation to Find Vulnerabilities
in JavaScript Engines
author:HyungSeok Han and
DongHyeon Oh and
Sang Kil Cha
CodeAlchemist: Semantics-Aware Code Generation
to Find Vulnerabilities in JavaScript Engines
HyungSeok Han
KAIST
DongHyeon Oh
KAIST
hyungseok.han@kaist.ac.kr
donghyeon.oh@kaist.ac.kr
Sang Kil Cha
KAIST
sangkilc@kaist.ac.kr
Abstract—JavaScript engines are an attractive target
for
attackers due to their popularity and ﬂexibility in building
exploits. Current state-of-the-art fuzzers for ﬁnding JavaScript
engine vulnerabilities focus mainly on generating syntactically
correct test cases based on either a predeﬁned context-free
grammar or a trained probabilistic language model. Unfor-
tunately, syntactically correct JavaScript sentences are often
semantically invalid at runtime. Furthermore, statically analyzing
the semantics of JavaScript code is challenging due to its
dynamic nature: JavaScript code is generated at runtime, and
JavaScript expressions are dynamically-typed. To address this
challenge, we propose a novel test case generation algorithm
that we call semantics-aware assembly, and implement it in a
fuzz testing tool termed CodeAlchemist. Our tool can generate
arbitrary JavaScript code snippets that are both semantically and
syntactically correct, and it effectively yields test cases that can
crash JavaScript engines. We found numerous vulnerabilities of
the latest JavaScript engines with CodeAlchemist and reported
them to the vendors.
I.
INTRODUCTION
JavaScript (JS) engines have become a core component of
modern web browsers as they enable dynamic and interactive
features on web pages. As of July of 2018, approximately
94.9% of all the websites use JS [34], and almost all smart-
phones are equipped with a JS-enabled browser today.
The growing popularity of JS also means that JS engines
are an appealing target for attackers. As developers attempt to
improve performance and functionality of modern JS engines,...

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