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

Output:
安全论文分析：

title:Dynamic behavior of slowly-responsive congestion control algorithms
author:Deepak Bansal and
Hari Balakrishnan and
Sally Floyd and
Scott Shenker
Dynamic Behavior of Slowly-Responsive Congestion
Control Algorithms
Deepak Bansal and Hari Balakrishnan
MIT Laboratory for Computer Science
Sally Floyd and Scott Shenker
AT&T Center for Internet Research at ICSI
fbansal,harig@lcs.mit.edu
fﬂoyd,shenkerg@aciri.org
Abstract
The recently developed notion of TCP-compatibility has led to a
number of proposals for alternative congestion control algorithms
whose long-term throughput as a function of a steady-state loss rate
is similar to that of TCP. Motivated by the needs of some stream-
ing and multicast applications, these algorithms seem poised to take
the current TCP-dominated Internet to an Internet where many con-
gestion control algorithms co-exist. An important characteristic of
these alternative algorithms is that they are slowly-responsive, re-
fraining from reacting as drastically as TCP to a single packet loss.
However, the TCP-compatibility criteria explored so far in the
literature considers only the static condition of a ﬁxed loss rate.
This paper investigates the behavior of slowly-responsive, TCP-
compatible congestion control algorithms under more realistic dy-
namic network conditions, addressing the fundamental question of
whether these algorithms are safe to deploy in the public Internet.
We study persistent loss rates, long- and short-term fairness prop-
erties, bottleneck link utilization, and smoothness of transmission
rates.
1.
Introduction
In the Internet’s current congestion control paradigm, routers
play a relatively passive role:
they merely indicate congestion
through packet drops or explicit congestion notiﬁcation. It is the
end-systems that perform the crucial role of responding appropri-
ately to these congestion signals. This paradigm of passive routers
and active hosts has been spectacularly successful; the conges-
tion management mechanism...


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

Input:
title:Dynamic behavior of slowly-responsive congestion control algorithms
author:Deepak Bansal and
Hari Balakrishnan and
Sally Floyd and
Scott Shenker
Dynamic Behavior of Slowly-Responsive Congestion
Control Algorithms
Deepak Bansal and Hari Balakrishnan
MIT Laboratory for Computer Science
Sally Floyd and Scott Shenker
AT&T Center for Internet Research at ICSI
fbansal,harig@lcs.mit.edu
fﬂoyd,shenkerg@aciri.org
Abstract
The recently developed notion of TCP-compatibility has led to a
number of proposals for alternative congestion control algorithms
whose long-term throughput as a function of a steady-state loss rate
is similar to that of TCP. Motivated by the needs of some stream-
ing and multicast applications, these algorithms seem poised to take
the current TCP-dominated Internet to an Internet where many con-
gestion control algorithms co-exist. An important characteristic of
these alternative algorithms is that they are slowly-responsive, re-
fraining from reacting as drastically as TCP to a single packet loss.
However, the TCP-compatibility criteria explored so far in the
literature considers only the static condition of a ﬁxed loss rate.
This paper investigates the behavior of slowly-responsive, TCP-
compatible congestion control algorithms under more realistic dy-
namic network conditions, addressing the fundamental question of
whether these algorithms are safe to deploy in the public Internet.
We study persistent loss rates, long- and short-term fairness prop-
erties, bottleneck link utilization, and smoothness of transmission
rates.
1.
Introduction
In the Internet’s current congestion control paradigm, routers
play a relatively passive role:
they merely indicate congestion
through packet drops or explicit congestion notiﬁcation. It is the
end-systems that perform the crucial role of responding appropri-
ately to these congestion signals. This paradigm of passive routers
and active hosts has been spectacularly successful; the conges-
tion management mechanism...

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


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

Output:
安全论文分析：

title:Bloom Cookies: Web Search Personalization without User Tracking
author:Nitesh Mor and
Oriana Riva and
Suman Nath and
John Kubiatowicz
Bloom Cookies: Web Search Personalization
without User Tracking
Nitesh Mor∗
Oriana Riva†
∗University of California, Berkeley
{mor@eecs,kubitron@cs}.berkeley.edu
Abstract—We propose Bloom cookies that encode a user’s
proﬁle in a compact and privacy-preserving way, without prevent-
ing online services from using it for personalization purposes.
The Bloom cookies design is inspired by our analysis of a large
set of web search logs that shows drawbacks of two proﬁle
obfuscation techniques, namely proﬁle generalization and noise
injection, today used by many privacy-preserving personaliza-
tion systems. We ﬁnd that proﬁle generalization signiﬁcantly
hurts personalization and fails to protect users from a server
linking user sessions over time. Noise injection can address
these problems, but only at the cost of a high communication
overhead and a noise dictionary generated by a trusted third
party. In contrast, Bloom cookies leverage Bloom ﬁlters as a
privacy-preserving data structure to provide a more convenient
privacy, personalization, and network efﬁciency tradeoff: they
provide similar (or better) personalization and privacy than
noise injection (and proﬁle generalization), but with an order
of magnitude lower communication cost and no noise dictionary.
We discuss how Bloom cookies can be used for personalized web
search, present an algorithm to automatically conﬁgure the noise
in Bloom cookies given a user’s privacy and personalization goals,
and evaluate their performance compared to the state-of-the-art.
I.
INTRODUCTION
Online services such as web search and advertising are
becoming increasingly personalized. The more and the longer a
service knows about an individual, the better personalization it
can provide. Typically, these online services build user proﬁles
(containing e.g., web sites frequently visited, user interests,
d...


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

Input:
title:Bloom Cookies: Web Search Personalization without User Tracking
author:Nitesh Mor and
Oriana Riva and
Suman Nath and
John Kubiatowicz
Bloom Cookies: Web Search Personalization
without User Tracking
Nitesh Mor∗
Oriana Riva†
∗University of California, Berkeley
{mor@eecs,kubitron@cs}.berkeley.edu
Abstract—We propose Bloom cookies that encode a user’s
proﬁle in a compact and privacy-preserving way, without prevent-
ing online services from using it for personalization purposes.
The Bloom cookies design is inspired by our analysis of a large
set of web search logs that shows drawbacks of two proﬁle
obfuscation techniques, namely proﬁle generalization and noise
injection, today used by many privacy-preserving personaliza-
tion systems. We ﬁnd that proﬁle generalization signiﬁcantly
hurts personalization and fails to protect users from a server
linking user sessions over time. Noise injection can address
these problems, but only at the cost of a high communication
overhead and a noise dictionary generated by a trusted third
party. In contrast, Bloom cookies leverage Bloom ﬁlters as a
privacy-preserving data structure to provide a more convenient
privacy, personalization, and network efﬁciency tradeoff: they
provide similar (or better) personalization and privacy than
noise injection (and proﬁle generalization), but with an order
of magnitude lower communication cost and no noise dictionary.
We discuss how Bloom cookies can be used for personalized web
search, present an algorithm to automatically conﬁgure the noise
in Bloom cookies given a user’s privacy and personalization goals,
and evaluate their performance compared to the state-of-the-art.
I.
INTRODUCTION
Online services such as web search and advertising are
becoming increasingly personalized. The more and the longer a
service knows about an individual, the better personalization it
can provide. Typically, these online services build user proﬁles
(containing e.g., web sites frequently visited, user interests,
d...

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


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

Output:
安全论文分析：

title:How to Find Correlated Internet Failures
author:Ramakrishna Padmanabhan and
Aaron Schulman and
Alberto Dainotti and
Dave Levin and
Neil Spring
How to Find Correlated Internet Failures
Ramakrishna Padmanabhan1,2(B), Aaron Schulman3, Alberto Dainotti2,
Dave Levin1, and Neil Spring1
1 University of Maryland, College Park, USA
{dml,nspring}@cs.umd.edu
2 CAID/UCSD, La Jolla, USA
{ramapad,alberto}@caida.org
3 UCSD, San Diego, USA
schulman@cs.ucsd.edu
Abstract. Even as residential users increasingly rely upon the Internet,
connectivity sometimes fails. Characterizing small-scale failures of last
mile networks is essential to improving Internet reliability.
In this paper, we develop and evaluate an approach to detect Inter-
net failure events that aﬀect multiple users simultaneously using mea-
surements from the Thunderping project. Thunderping probes addresses
across the U.S. When the areas in which they are geo-located are aﬀected
by severe weather alerts. It detects a disruption event when an IP address
ceases to respond to pings. In this paper, we focus on simultaneous dis-
ruptions of multiple addresses that are related to each other by geog-
raphy and ISP, and thus are indicative of a shared cause. Using bino-
mial testing, we detect groups of per-IP disruptions that are unlikely to
have happened independently. We characterize these dependent disrup-
tion events and present results that challenge conventional wisdom on
how such outages aﬀect Internet address blocks.
1 Introduction
Even as residential users rely increasingly upon the Internet, last-mile infras-
tructure continues to be vulnerable to connectivity outages [1–3,5,18,20–24].
Measurement-driven approaches to study residential Internet failures will help
improve reliability by identifying vulnerable networks and their challenges.
Techniques that detect outages at the Internet’s edge often seek, using ter-
minology from Richter et al. [19], disruption events: the abrupt loss of Internet
connectivity of ...


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

Input:
title:How to Find Correlated Internet Failures
author:Ramakrishna Padmanabhan and
Aaron Schulman and
Alberto Dainotti and
Dave Levin and
Neil Spring
How to Find Correlated Internet Failures
Ramakrishna Padmanabhan1,2(B), Aaron Schulman3, Alberto Dainotti2,
Dave Levin1, and Neil Spring1
1 University of Maryland, College Park, USA
{dml,nspring}@cs.umd.edu
2 CAID/UCSD, La Jolla, USA
{ramapad,alberto}@caida.org
3 UCSD, San Diego, USA
schulman@cs.ucsd.edu
Abstract. Even as residential users increasingly rely upon the Internet,
connectivity sometimes fails. Characterizing small-scale failures of last
mile networks is essential to improving Internet reliability.
In this paper, we develop and evaluate an approach to detect Inter-
net failure events that aﬀect multiple users simultaneously using mea-
surements from the Thunderping project. Thunderping probes addresses
across the U.S. When the areas in which they are geo-located are aﬀected
by severe weather alerts. It detects a disruption event when an IP address
ceases to respond to pings. In this paper, we focus on simultaneous dis-
ruptions of multiple addresses that are related to each other by geog-
raphy and ISP, and thus are indicative of a shared cause. Using bino-
mial testing, we detect groups of per-IP disruptions that are unlikely to
have happened independently. We characterize these dependent disrup-
tion events and present results that challenge conventional wisdom on
how such outages aﬀect Internet address blocks.
1 Introduction
Even as residential users rely increasingly upon the Internet, last-mile infras-
tructure continues to be vulnerable to connectivity outages [1–3,5,18,20–24].
Measurement-driven approaches to study residential Internet failures will help
improve reliability by identifying vulnerable networks and their challenges.
Techniques that detect outages at the Internet’s edge often seek, using ter-
minology from Richter et al. [19], disruption events: the abrupt loss of Internet
connectivity of ...

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


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

Output:
安全论文分析：

title:Cryptology As a Network Service
author:Tom Berson and
Drew Dean and
Matthew K. Franklin and
Diana K. Smetters and
Mike Spreitzer
Cryptography as a Network Service
Tom Berson
Xerox PARC‡
Drew Dean
Xerox PARC
Matt Franklin
U.C. Davis
Diana Smetters
Xerox PARC
berson@parc.xerox.com ddean@parc.xerox.com franklin@cs.ucdavis.edu
smetters@parc.xerox.com
Michael Spreitzer†
IBM Research
mspreitz@us.ibm.com
Abstract
Cryptography is a powerful tool for building secure dis-
tributed systems, albeit at substantial computational cost.
This is especially true for public key cryptography. Con-
ventional wisdom dictates that cryptography must be done
locally in order to be secure. We argue for an approach in
which public key cryptographic operations are provided
as a network service. This service operates over long-
lived associations secured by symmetric cryptography.
This network architecture amortizes the cost of special-
purpose cryptographic hardware across many users. We
describe the implementation of such a system, and perfor-
mance results we obtained.
1. Introduction
The received wisdom about cryptography is that it is
difﬁcult and expensive. This has led to system designs
and engineering tradeoffs that aim to minimize the use of
cryptography, and especially of public-key operations, be-
cause they are computationally intensive.
But this received wisdom is no longer true. A great
many inﬂuences have already made cryptography easy
and cheap, and will continue to make it easier and cheaper.
These diverse inﬂuences include the professionalization of
cryptographers, the creation of textbooks and of courses,
the steady growth of computational power delivered by
the operation of Moore’s law, the algorithmic advances
made by cryptographic researchers and engineers, the rise
of e-commerce and wireless infrastructures which have a
seemingly endless appetite for cryptographic services, the
entry of many young people into the ﬁeld, and the easing
of government export controls. ...


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

Input:
title:Cryptology As a Network Service
author:Tom Berson and
Drew Dean and
Matthew K. Franklin and
Diana K. Smetters and
Mike Spreitzer
Cryptography as a Network Service
Tom Berson
Xerox PARC‡
Drew Dean
Xerox PARC
Matt Franklin
U.C. Davis
Diana Smetters
Xerox PARC
berson@parc.xerox.com ddean@parc.xerox.com franklin@cs.ucdavis.edu
smetters@parc.xerox.com
Michael Spreitzer†
IBM Research
mspreitz@us.ibm.com
Abstract
Cryptography is a powerful tool for building secure dis-
tributed systems, albeit at substantial computational cost.
This is especially true for public key cryptography. Con-
ventional wisdom dictates that cryptography must be done
locally in order to be secure. We argue for an approach in
which public key cryptographic operations are provided
as a network service. This service operates over long-
lived associations secured by symmetric cryptography.
This network architecture amortizes the cost of special-
purpose cryptographic hardware across many users. We
describe the implementation of such a system, and perfor-
mance results we obtained.
1. Introduction
The received wisdom about cryptography is that it is
difﬁcult and expensive. This has led to system designs
and engineering tradeoffs that aim to minimize the use of
cryptography, and especially of public-key operations, be-
cause they are computationally intensive.
But this received wisdom is no longer true. A great
many inﬂuences have already made cryptography easy
and cheap, and will continue to make it easier and cheaper.
These diverse inﬂuences include the professionalization of
cryptographers, the creation of textbooks and of courses,
the steady growth of computational power delivered by
the operation of Moore’s law, the algorithmic advances
made by cryptographic researchers and engineers, the rise
of e-commerce and wireless infrastructures which have a
seemingly endless appetite for cryptographic services, the
entry of many young people into the ﬁeld, and the easing
of government export controls. ...

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


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

Output:
安全论文分析：

title:Cache Me If You Can: Effects of DNS Time-to-Live
author:Giovane C. M. Moura and
John S. Heidemann and
Ricardo de Oliveira Schmidt and
Wes Hardaker
Cache Me If You Can:
Effects of DNS Time-to-Live
Giovane C. M. Moura (1)
1: SIDN Labs and TU Delft
John Heidemann (2)
Ricardo de O. Schmidt (3) Wes Hardaker (2)
2: USC/Information Sciences Institute
3: University of Passo Fundo
ABSTRACT
DNS depends on extensive caching for good performance, and ev-
ery DNS zone owner must set Time-to-Live (TTL) values to control
their DNS caching. Today there is relatively little guidance backed
by research about how to set TTLs, and operators must balance
conflicting demands of caching against agility of configuration. Ex-
actly how TTL value choices affect operational networks is quite
challenging to understand due to interactions across the distributed
DNS service, where resolvers receive TTLs in different ways (an-
swers and hints), TTLs are specified in multiple places (zones and
their parent’s glue), and while DNS resolution must be security-
aware. This paper provides the first careful evaluation of how these
multiple, interacting factors affect the effective cache lifetimes of
DNS records, and provides recommendations for how to configure
DNS TTLs based on our findings. We provide recommendations
in TTL choice for different situations, and for where they must be
configured. We show that longer TTLs have significant promise
in reducing latency, reducing it from 183 ms to 28.7 ms for one
country-code TLD.
CCS CONCEPTS
• Networks → Network measurement; Naming and address-
ing.
KEYWORDS
DNS, recursive DNS servers, caching
ACM Reference Format:
Giovane C. M. Moura, John Heidemann, Ricardo de O. Schmidt, Wes Hardaker.
2019. Cache Me If You Can: Effects of DNS Time-to-Live . In Internet Mea-
surement Conference (IMC ’19), October 21–23, 2019, Amsterdam, Netherlands.
ACM, New York, NY, USA, 15 pages. https://doi.org/10.1145/3355369.3355568
1 INTRODUCTION
The Domain Name System (DNS)...


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

Input:
title:Cache Me If You Can: Effects of DNS Time-to-Live
author:Giovane C. M. Moura and
John S. Heidemann and
Ricardo de Oliveira Schmidt and
Wes Hardaker
Cache Me If You Can:
Effects of DNS Time-to-Live
Giovane C. M. Moura (1)
1: SIDN Labs and TU Delft
John Heidemann (2)
Ricardo de O. Schmidt (3) Wes Hardaker (2)
2: USC/Information Sciences Institute
3: University of Passo Fundo
ABSTRACT
DNS depends on extensive caching for good performance, and ev-
ery DNS zone owner must set Time-to-Live (TTL) values to control
their DNS caching. Today there is relatively little guidance backed
by research about how to set TTLs, and operators must balance
conflicting demands of caching against agility of configuration. Ex-
actly how TTL value choices affect operational networks is quite
challenging to understand due to interactions across the distributed
DNS service, where resolvers receive TTLs in different ways (an-
swers and hints), TTLs are specified in multiple places (zones and
their parent’s glue), and while DNS resolution must be security-
aware. This paper provides the first careful evaluation of how these
multiple, interacting factors affect the effective cache lifetimes of
DNS records, and provides recommendations for how to configure
DNS TTLs based on our findings. We provide recommendations
in TTL choice for different situations, and for where they must be
configured. We show that longer TTLs have significant promise
in reducing latency, reducing it from 183 ms to 28.7 ms for one
country-code TLD.
CCS CONCEPTS
• Networks → Network measurement; Naming and address-
ing.
KEYWORDS
DNS, recursive DNS servers, caching
ACM Reference Format:
Giovane C. M. Moura, John Heidemann, Ricardo de O. Schmidt, Wes Hardaker.
2019. Cache Me If You Can: Effects of DNS Time-to-Live . In Internet Mea-
surement Conference (IMC ’19), October 21–23, 2019, Amsterdam, Netherlands.
ACM, New York, NY, USA, 15 pages. https://doi.org/10.1145/3355369.3355568
1 INTRODUCTION
The Domain Name System (DNS)...

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


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

Output:
安全论文分析：

title:Setuid Demystified
author:Hao Chen and
David A. Wagner and
Drew Dean
USENIX Association
Proceedings of the
11th USENIX Security
Symposium
San Francisco, California, USA
August 5-9, 2002
© 2002 by The USENIX Association
Phone: 1 510 528 8649
FAX: 1 510 548 5738
THE ADVANCED COMPUTING SYSTEMS ASSOCIATION
All Rights Reserved
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
Rights to individual papers remain with the author or the author's employer.
 Permission is granted for noncommercial reproduction of the work for educational or research purposes.
This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein.
Setuid Demystiﬁed∗
Hao Chen
David Wagner
University of California at Berkeley
{hchen,daw}@cs.berkeley.edu
Drew Dean
SRI International
ddean@csl.sri.com
Abstract
Access control in Unix systems is mainly based on user
IDs, yet the system calls that modify user IDs (uid-setting
system calls), such as setuid, are poorly designed, in-
sufﬁciently documented, and widely misunderstood and
misused. This has caused many security vulnerabilities
in application programs. We propose to make progress
on the setuid mystery through two approaches. First,
we study kernel sources and compare the semantics of
the uid-setting system calls in three major Unix systems:
Linux, Solaris, and FreeBSD. Second, we develop a for-
mal model of user IDs as a Finite State Automaton (FSA)
and develop new techniques for automatic construction
of such models. We use the resulting FSA to uncover
pitfalls in the Unix API of the uid-setting system calls, to
identify differences in the semantics of these calls among
various Unix systems, to detect inconsistency in the han-
dling of user IDs within an OS kernel, and to check the
proper usage of these calls in programs automatically.
Finally, we provide general guidelines on the proper us-
age of the uid-setting system calls, and we propose a
high...


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

Input:
title:Setuid Demystified
author:Hao Chen and
David A. Wagner and
Drew Dean
USENIX Association
Proceedings of the
11th USENIX Security
Symposium
San Francisco, California, USA
August 5-9, 2002
© 2002 by The USENIX Association
Phone: 1 510 528 8649
FAX: 1 510 548 5738
THE ADVANCED COMPUTING SYSTEMS ASSOCIATION
All Rights Reserved
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
Rights to individual papers remain with the author or the author's employer.
 Permission is granted for noncommercial reproduction of the work for educational or research purposes.
This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein.
Setuid Demystiﬁed∗
Hao Chen
David Wagner
University of California at Berkeley
{hchen,daw}@cs.berkeley.edu
Drew Dean
SRI International
ddean@csl.sri.com
Abstract
Access control in Unix systems is mainly based on user
IDs, yet the system calls that modify user IDs (uid-setting
system calls), such as setuid, are poorly designed, in-
sufﬁciently documented, and widely misunderstood and
misused. This has caused many security vulnerabilities
in application programs. We propose to make progress
on the setuid mystery through two approaches. First,
we study kernel sources and compare the semantics of
the uid-setting system calls in three major Unix systems:
Linux, Solaris, and FreeBSD. Second, we develop a for-
mal model of user IDs as a Finite State Automaton (FSA)
and develop new techniques for automatic construction
of such models. We use the resulting FSA to uncover
pitfalls in the Unix API of the uid-setting system calls, to
identify differences in the semantics of these calls among
various Unix systems, to detect inconsistency in the han-
dling of user IDs within an OS kernel, and to check the
proper usage of these calls in programs automatically.
Finally, we provide general guidelines on the proper us-
age of the uid-setting system calls, and we propose a
high...

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


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

Output:
安全论文分析：

title:Imperio: Robust Over-the-Air Adversarial Examples for Automatic Speech
Recognition Systems
author:Lea Sch"onherr and
Thorsten Eisenhofer and
Steffen Zeiler and
Thorsten Holz and
Dorothea Kolossa
Imperio: Robust Over-the-Air Adversarial Examples for
Automatic Speech Recognition Systems
Lea Schönherr, Thorsten Eisenhofer, Steffen Zeiler, Thorsten Holz, and Dorothea Kolossa
{lea.schoenherr,thorsten.eisenhofer,steffen.zeiler,thorsten.holz,dorothea.kolossa}@rub.de
Ruhr University Bochum
0
2
0
2
v
o
N
4
2
]
R
C
.
s
c
[
5
v
1
5
5
1
0
.
8
0
9
1
:
v
i
X
r
a
ABSTRACT
Automatic speech recognition (ASR) systems can be fooled via
targeted adversarial examples, which induce the ASR to produce
arbitrary transcriptions in response to altered audio signals. How-
ever, state-of-the-art adversarial examples typically have to be fed
into the ASR system directly, and are not successful when played in
a room. Previously published over-the-air adversarial examples fall
into one of three categories: they are either handcrafted examples,
they are so conspicuous that human listeners can easily recognize
the target transcription once they are alerted to its content, or they
require precise information about the room where the attack takes
place, and are hence not transferable to other rooms.
In this paper, we demonstrate the first algorithm that produces
generic adversarial examples against hybrid ASR systems, which
remain robust in an over-the-air attack that is not adapted to the
specific environment. Hence, no prior knowledge of the room char-
acteristics is required. Instead, we use room impulse responses (RIRs)
to compute robust adversarial examples for arbitrary room char-
acteristics and employ the ASR system Kaldi to demonstrate the
attack. Further, our algorithm can utilize psychoacoustic meth-
ods to hide changes of the original audio signal below the human
thresholds of hearing. In practical experiments, we show that the
adversarial examples work for varying room setups,...


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

Input:
title:Imperio: Robust Over-the-Air Adversarial Examples for Automatic Speech
Recognition Systems
author:Lea Sch"onherr and
Thorsten Eisenhofer and
Steffen Zeiler and
Thorsten Holz and
Dorothea Kolossa
Imperio: Robust Over-the-Air Adversarial Examples for
Automatic Speech Recognition Systems
Lea Schönherr, Thorsten Eisenhofer, Steffen Zeiler, Thorsten Holz, and Dorothea Kolossa
{lea.schoenherr,thorsten.eisenhofer,steffen.zeiler,thorsten.holz,dorothea.kolossa}@rub.de
Ruhr University Bochum
0
2
0
2
v
o
N
4
2
]
R
C
.
s
c
[
5
v
1
5
5
1
0
.
8
0
9
1
:
v
i
X
r
a
ABSTRACT
Automatic speech recognition (ASR) systems can be fooled via
targeted adversarial examples, which induce the ASR to produce
arbitrary transcriptions in response to altered audio signals. How-
ever, state-of-the-art adversarial examples typically have to be fed
into the ASR system directly, and are not successful when played in
a room. Previously published over-the-air adversarial examples fall
into one of three categories: they are either handcrafted examples,
they are so conspicuous that human listeners can easily recognize
the target transcription once they are alerted to its content, or they
require precise information about the room where the attack takes
place, and are hence not transferable to other rooms.
In this paper, we demonstrate the first algorithm that produces
generic adversarial examples against hybrid ASR systems, which
remain robust in an over-the-air attack that is not adapted to the
specific environment. Hence, no prior knowledge of the room char-
acteristics is required. Instead, we use room impulse responses (RIRs)
to compute robust adversarial examples for arbitrary room char-
acteristics and employ the ASR system Kaldi to demonstrate the
attack. Further, our algorithm can utilize psychoacoustic meth-
ods to hide changes of the original audio signal below the human
thresholds of hearing. In practical experiments, we show that the
adversarial examples work for varying room setups,...

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


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

Output:
安全论文分析：

title:ProcHarvester: Fully Automated Analysis of Procfs Side-Channel Leaks
on Android
author:Raphael Spreitzer and
Felix Kirchengast and
Daniel Gruss and
Stefan Mangard
ProcHarvester: Fully Automated Analysis of Procfs Side-Channel
Leaks on Android
Raphael Spreitzer, Felix Kirchengast, Daniel Gruss, and Stefan Mangard
Graz University of Technology
ABSTRACT
The procfs has been identified as a viable source of side-channel
information leaks on mobile devices. Starting with Android M (An-
droid 6), access to the procfs has been continuously restricted in
order to cope with these attacks. Yet, more recent papers demon-
strated that even if access to process-specific information is re-
stricted within the procfs, global statistics can still be exploited.
However, with state-of-the-art techniques, the search for procfs
information leaks requires a significant amount of manual work.
This makes an exhaustive analysis of existing and newly introduced
procfs resources in terms of information leaks impractical.
We introduce ProcHarvester, a systematic and fully automated
technique to assess procfs information leaks. ProcHarvester au-
tomatically triggers events of interest and later on applies machine
learning techniques to identify procfs information leaks. We demon-
strate the power of ProcHarvester by identifying information
leaks to infer app starts from a set of 100 apps with an accuracy of
96% on Android N (Android 7). Thereby, we outperform the most
accurate app inference attack by about 10 percentage points. We
also demonstrate the ease of applicability of ProcHarvester by
showing how to profile other events such as website launches as
well as keyboard gestures, and we identify the first procfs side
channels on Android O (Android 8). ProcHarvester advances
investigations of procfs information leaks to the next level and will
hopefully help to reduce the attack surface of side-channel attacks.
CCS CONCEPTS
• Security and privacy → Mobile platform security;
KEYWORDS
Andr...


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

Input:
title:ProcHarvester: Fully Automated Analysis of Procfs Side-Channel Leaks
on Android
author:Raphael Spreitzer and
Felix Kirchengast and
Daniel Gruss and
Stefan Mangard
ProcHarvester: Fully Automated Analysis of Procfs Side-Channel
Leaks on Android
Raphael Spreitzer, Felix Kirchengast, Daniel Gruss, and Stefan Mangard
Graz University of Technology
ABSTRACT
The procfs has been identified as a viable source of side-channel
information leaks on mobile devices. Starting with Android M (An-
droid 6), access to the procfs has been continuously restricted in
order to cope with these attacks. Yet, more recent papers demon-
strated that even if access to process-specific information is re-
stricted within the procfs, global statistics can still be exploited.
However, with state-of-the-art techniques, the search for procfs
information leaks requires a significant amount of manual work.
This makes an exhaustive analysis of existing and newly introduced
procfs resources in terms of information leaks impractical.
We introduce ProcHarvester, a systematic and fully automated
technique to assess procfs information leaks. ProcHarvester au-
tomatically triggers events of interest and later on applies machine
learning techniques to identify procfs information leaks. We demon-
strate the power of ProcHarvester by identifying information
leaks to infer app starts from a set of 100 apps with an accuracy of
96% on Android N (Android 7). Thereby, we outperform the most
accurate app inference attack by about 10 percentage points. We
also demonstrate the ease of applicability of ProcHarvester by
showing how to profile other events such as website launches as
well as keyboard gestures, and we identify the first procfs side
channels on Android O (Android 8). ProcHarvester advances
investigations of procfs information leaks to the next level and will
hopefully help to reduce the attack surface of side-channel attacks.
CCS CONCEPTS
• Security and privacy → Mobile platform security;
KEYWORDS
Andr...

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


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

Output:
安全论文分析：

title:Efficient Repair of Polluted Machine Learning Systems via Causal Unlearning
author:Yinzhi Cao and
Alexander Fangxiao Yu and
Andrew Aday and
Eric Stahl and
Jon Merwine and
Junfeng Yang
Efficient Repair of Polluted Machine Learning Systems via
Causal Unlearning
Yinzhi Cao
Alexander Fangxiao Yu
Andrew Aday
Lehigh University, Bethlehem PA
Columbia University, New York, NY
Columbia University, New York, NY
yinzhi.cao@lehigh.edu
afy2103@columbia.edu
aza2112@columbia.edu
Eric Stahl
Jon Merwine
Junfeng Yang
Lehigh University, Bethlehem PA
Lehigh University, Bethlehem PA
Columbia University, New York, NY
ems316@lehigh.edu
jmm214@lehigh.edu
junfeng@cs.columbia.edu
ABSTRACT
Machine learning systems, though being successful in many real-
world applications, are known to remain prone to errors and attacks.
A major attack, called data pollution, injects maliciously crafted
training data samples into the training set, causing the system to
learn an incorrect model and subsequently misclassify testing sam-
ples. A natural solution to a data pollution attack is to remove the
polluted data from the training set and relearn a clean model. Unfor-
tunately, the training set of a real-world machine learning system can
contain millions of samples; it is thus hopeless for an administrator
to manually inspect all of them to weed out the polluted ones.
This paper presents an approach called causal unlearning and a
corresponding system called KARMA to efficiently repair a polluted
learning system. KARMA dramatically reduces the manual effort of
administrators by automatically detecting the set of polluted training
data samples with high precision and recall. Evaluation on three
learning systems show that KARMA greatly reduces manual effort
for repair, and has high precision and recall.
CCS CONCEPTS
• Computing methodologies → Machine learning; • Security and
privacy → Systems security;
KEYWORDS
Causality; Data Pollution Attacks; Machine Unlearning
ACM Reference format:
Yinzhi Cao, Alexa...


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

Input:
title:Efficient Repair of Polluted Machine Learning Systems via Causal Unlearning
author:Yinzhi Cao and
Alexander Fangxiao Yu and
Andrew Aday and
Eric Stahl and
Jon Merwine and
Junfeng Yang
Efficient Repair of Polluted Machine Learning Systems via
Causal Unlearning
Yinzhi Cao
Alexander Fangxiao Yu
Andrew Aday
Lehigh University, Bethlehem PA
Columbia University, New York, NY
Columbia University, New York, NY
yinzhi.cao@lehigh.edu
afy2103@columbia.edu
aza2112@columbia.edu
Eric Stahl
Jon Merwine
Junfeng Yang
Lehigh University, Bethlehem PA
Lehigh University, Bethlehem PA
Columbia University, New York, NY
ems316@lehigh.edu
jmm214@lehigh.edu
junfeng@cs.columbia.edu
ABSTRACT
Machine learning systems, though being successful in many real-
world applications, are known to remain prone to errors and attacks.
A major attack, called data pollution, injects maliciously crafted
training data samples into the training set, causing the system to
learn an incorrect model and subsequently misclassify testing sam-
ples. A natural solution to a data pollution attack is to remove the
polluted data from the training set and relearn a clean model. Unfor-
tunately, the training set of a real-world machine learning system can
contain millions of samples; it is thus hopeless for an administrator
to manually inspect all of them to weed out the polluted ones.
This paper presents an approach called causal unlearning and a
corresponding system called KARMA to efficiently repair a polluted
learning system. KARMA dramatically reduces the manual effort of
administrators by automatically detecting the set of polluted training
data samples with high precision and recall. Evaluation on three
learning systems show that KARMA greatly reduces manual effort
for repair, and has high precision and recall.
CCS CONCEPTS
• Computing methodologies → Machine learning; • Security and
privacy → Systems security;
KEYWORDS
Causality; Data Pollution Attacks; Machine Unlearning
ACM Reference format:
Yinzhi Cao, Alexa...

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


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

Output:
安全论文分析：

title:Zen and the art of network architecture
author:Larry Peterson
Zen and the Art of Network Architecture
Larry Peterson
Princeton University
llp@cs.princeton.edu
ABSTRACT
Network architectures are a unique artifact of computer science.
They  are  shaped  by  both  technical  and  non-technical  forces.
When  well-crafted,  they  define  fixed  points
that  catalyze
innovation. And they ultimately suffer from entropy and need to
be reinvented. Drawing on my experiences building and operating
network research testbeds, designing and deploying experimental
network  services,
the
commercial  sector,  and  witnessing  fundamental  shifts  in  the
networking  industry,  this  talk  explores  the  nature  of  network
architectures. It also attempts to extract a set of general lessons,
and apply them to the emerging cloud.
research  prototypes
transferring
to
Categories and Subject Descriptors
C. 2.1 [Computer Systems Organization]: Network
Architecture and Design – Network communications.
General Terms
Design, Experimentation, Performance, Reliability.
Keywords
Network Architecture.
Permission to make digital or hard copies of part or all of this work for personal or
classroom  use  is  granted  without  fee  provided  that  copies  are  not  made  or
distributed for profit or commercial advantage, and that copies bear this notice and
the full citation on the first page. Copyrights for third-party components of this work
must be honored. For all other uses, contact the owner/author(s). Copyright is held
by the author/owner(s).
SIGCOMM’13, August 12–16, 2013, Hong Kong, China.
ACM 978-1-4503-2056-6/13/08.
1


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

Input:
title:Zen and the art of network architecture
author:Larry Peterson
Zen and the Art of Network Architecture
Larry Peterson
Princeton University
llp@cs.princeton.edu
ABSTRACT
Network architectures are a unique artifact of computer science.
They  are  shaped  by  both  technical  and  non-technical  forces.
When  well-crafted,  they  define  fixed  points
that  catalyze
innovation. And they ultimately suffer from entropy and need to
be reinvented. Drawing on my experiences building and operating
network research testbeds, designing and deploying experimental
network  services,
the
commercial  sector,  and  witnessing  fundamental  shifts  in  the
networking  industry,  this  talk  explores  the  nature  of  network
architectures. It also attempts to extract a set of general lessons,
and apply them to the emerging cloud.
research  prototypes
transferring
to
Categories and Subject Descriptors
C. 2.1 [Computer Systems Organization]: Network
Architecture and Design – Network communications.
General Terms
Design, Experimentation, Performance, Reliability.
Keywords
Network Architecture.
Permission to make digital or hard copies of part or all of this work for personal or
classroom  use  is  granted  without  fee  provided  that  copies  are  not  made  or
distributed for profit or commercial advantage, and that copies bear this notice and
the full citation on the first page. Copyrights for third-party components of this work
must be honored. For all other uses, contact the owner/author(s). Copyright is held
by the author/owner(s).
SIGCOMM’13, August 12–16, 2013, Hong Kong, China.
ACM 978-1-4503-2056-6/13/08.
1

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


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

Output:
安全论文分析：

title:Next Generation P2P Botnets: Monitoring Under Adverse Conditions
author:Leon B"ock and
Emmanouil Vasilomanolakis and
Max M"uhlh"auser and
Shankar Karuppayah
Next Generation P2P Botnets:
Monitoring Under Adverse Conditions
Leon B¨ock1(B), Emmanouil Vasilomanolakis1, Max M¨uhlh¨auser1,
and Shankar Karuppayah2
1 Telecooperation Lab, Technische Universit¨at Darmstadt, Darmstadt, Germany
{boeck,vasilomano,max}@tk.tu-darmstadt.de
2 National Advanced IPv6 Centre, Universiti Sains Malaysia (USM), Gelugor,
Malaysia
kshankar@usm.my
Abstract. The eﬀects of botnet attacks, over the years, have been dev-
astating. From high volume Distributed Denial of Service (DDoS) attacks
to ransomware attacks, it is evident that defensive measures need to be
taken. Indeed, there has been a number of successful takedowns of bot-
nets that exhibit a centralized architecture. However, this is not the case
with distributed botnets that are more resilient and armed with coun-
termeasures against monitoring. In this paper, we argue that monitoring
countermeasures, applied by botmasters, will only become more sophisti-
cated; to such an extent that monitoring, under these adverse conditions,
may become infeasible. That said, we present the most detailed analy-
sis, to date, of parameters that inﬂuence a P2P botnet’s resilience and
monitoring resistance. Integral to our analysis, we introduce BotChurn
(BC) a realistic and botnet-focused churn generator that can assist in
the analysis of botnets. Our experimental results suggest that certain
parameter combinations greatly limit intelligence gathering operations.
Furthermore, our analysis highlights the need for extensive collaboration
between defenders. For instance, we show that even the combined knowl-
edge of 500 monitoring instances is insuﬃcient to fully enumerate some
of the examined botnets. In this context, we also raise the question of
whether botnet monitoring will still be feasible in the near future.
1 Introduction
Bo...


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

Input:
title:Next Generation P2P Botnets: Monitoring Under Adverse Conditions
author:Leon B"ock and
Emmanouil Vasilomanolakis and
Max M"uhlh"auser and
Shankar Karuppayah
Next Generation P2P Botnets:
Monitoring Under Adverse Conditions
Leon B¨ock1(B), Emmanouil Vasilomanolakis1, Max M¨uhlh¨auser1,
and Shankar Karuppayah2
1 Telecooperation Lab, Technische Universit¨at Darmstadt, Darmstadt, Germany
{boeck,vasilomano,max}@tk.tu-darmstadt.de
2 National Advanced IPv6 Centre, Universiti Sains Malaysia (USM), Gelugor,
Malaysia
kshankar@usm.my
Abstract. The eﬀects of botnet attacks, over the years, have been dev-
astating. From high volume Distributed Denial of Service (DDoS) attacks
to ransomware attacks, it is evident that defensive measures need to be
taken. Indeed, there has been a number of successful takedowns of bot-
nets that exhibit a centralized architecture. However, this is not the case
with distributed botnets that are more resilient and armed with coun-
termeasures against monitoring. In this paper, we argue that monitoring
countermeasures, applied by botmasters, will only become more sophisti-
cated; to such an extent that monitoring, under these adverse conditions,
may become infeasible. That said, we present the most detailed analy-
sis, to date, of parameters that inﬂuence a P2P botnet’s resilience and
monitoring resistance. Integral to our analysis, we introduce BotChurn
(BC) a realistic and botnet-focused churn generator that can assist in
the analysis of botnets. Our experimental results suggest that certain
parameter combinations greatly limit intelligence gathering operations.
Furthermore, our analysis highlights the need for extensive collaboration
between defenders. For instance, we show that even the combined knowl-
edge of 500 monitoring instances is insuﬃcient to fully enumerate some
of the examined botnets. In this context, we also raise the question of
whether botnet monitoring will still be feasible in the near future.
1 Introduction
Bo...

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


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

Output:
安全论文分析：

title:DataGuard: Dynamic data attestation in wireless sensor networks
author:Dazhi Zhang and
Donggang Liu
DataGuard: Dynamic Data Attestation in Wireless Sensor Networks
Dazhi Zhang and Donggang Liu
dazhi.zhang@mavs.uta.edu,dliu@uta.edu
Department of Computer Science and Engineering
The University of Texas at Arlington
Abstract
Attestation has become a promising approach for ensur-
ing software integrity in wireless sensor networks. How-
ever, current attestation either focuses on static system
properties, e.g., code integrity, or requires hardware sup-
port such as Trusted Platform Module (TPM). However,
there are attacks exploiting vulnerabilities that do not vio-
late static system properties, and sensor platforms may not
have hardware-based security support. This paper presents
a software attestation scheme for dynamic data integrity
based on data boundary integrity. It automatically trans-
forms the source code and inserts data guards to track run-
time program data. A data guard is unrecoverable once it
is corrupted by an attacker, even if the attacker fully con-
trols the system later. The corruption of any data guard at
runtime can be remotely detected. A corruption either indi-
cates a software attack or a bug in the software that needs
immediate attention. The beneﬁts of the proposed attesta-
tion scheme are as follows. First, it does not rely on any
additional hardware support, making it suitable for low-
cost sensor nodes. Second, it introduces minimal communi-
cation cost and has adjustable runtime memory overhead.
Third, it works even if sensor nodes use different hardware
platforms, as long as they run the same software. The pro-
totype implementation and the experiments on TelosB motes
show that the proposed technique is both effective and efﬁ-
cient for sensor networks.
1 Introduction
Wireless sensor nodes often lack advanced hardware
support for system integrity and are vulnerable to attacks
exploiting software ﬂaws. Additionally, it is often costl...


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

Input:
title:DataGuard: Dynamic data attestation in wireless sensor networks
author:Dazhi Zhang and
Donggang Liu
DataGuard: Dynamic Data Attestation in Wireless Sensor Networks
Dazhi Zhang and Donggang Liu
dazhi.zhang@mavs.uta.edu,dliu@uta.edu
Department of Computer Science and Engineering
The University of Texas at Arlington
Abstract
Attestation has become a promising approach for ensur-
ing software integrity in wireless sensor networks. How-
ever, current attestation either focuses on static system
properties, e.g., code integrity, or requires hardware sup-
port such as Trusted Platform Module (TPM). However,
there are attacks exploiting vulnerabilities that do not vio-
late static system properties, and sensor platforms may not
have hardware-based security support. This paper presents
a software attestation scheme for dynamic data integrity
based on data boundary integrity. It automatically trans-
forms the source code and inserts data guards to track run-
time program data. A data guard is unrecoverable once it
is corrupted by an attacker, even if the attacker fully con-
trols the system later. The corruption of any data guard at
runtime can be remotely detected. A corruption either indi-
cates a software attack or a bug in the software that needs
immediate attention. The beneﬁts of the proposed attesta-
tion scheme are as follows. First, it does not rely on any
additional hardware support, making it suitable for low-
cost sensor nodes. Second, it introduces minimal communi-
cation cost and has adjustable runtime memory overhead.
Third, it works even if sensor nodes use different hardware
platforms, as long as they run the same software. The pro-
totype implementation and the experiments on TelosB motes
show that the proposed technique is both effective and efﬁ-
cient for sensor networks.
1 Introduction
Wireless sensor nodes often lack advanced hardware
support for system integrity and are vulnerable to attacks
exploiting software ﬂaws. Additionally, it is often costl...

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


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

Output:
安全论文分析：

title:K-anonymous association rule hiding
author:Zutao Zhu and
Wenliang Du
Privacy Preserving Data Mining Using
Association Rule With Condensation Approach
 Supriya S. Borhade1 , Bipin B.Shinde2
Researcher, Department of Computer Engineering,
Pune University, Pune. 1
Researcher ,Department of Computer Engineering,
RGPV,Bhopal. 2
Abstract—With  the  rapid  development  data  mining  within
various  fields  and  security  and  privacy  concerns  come  into
view.  In  data  mining  while  releasing  micro-data  or  patterns
from large databases individual or organizational private data
may  get  compromise  the  information.  The  main  aim  behind
privacy  preserving  data  mining  is  to  maximizing  analysis
outcome  and  minimizing  disclosure  of
individuals  or
organizational private data. Association rule mining explores
interesting relationship between data. This paper is based on
concepts:  condensation  method  and  association  rule.  SMC
(secure  multiparty  computation)  securely  transferring  data
over  the  network  with  hiding  process  which  hide  sensitive
association rule which create threat to privacy. Now privacy
preserving  data  mining  has  become  increasingly  popular
because  it  provides  sharing  of  private  or  sensitive  data  for
analysis purposes. Most of people and organizations are afraid
or hesitate to share their data or refusing to share their data
or  sometimes  might  provide  wrong  data.  Due  to  rapid
proliferation  of  private  information  on  the  internet,  lot  of
research has been done in recent years for privacy preserving
data  mining.  Users  are  unwilling  to  provide  private  or
personal data unless and until privacy is assured. Sometimes
automated  transaction  system  holds  or  track  information
about individuals in day today’s life. For example credit card
transactions.
Keywords—Association  Rule,  Condensation,  PPDM,
SMC, Perturbation.
I.  INTRODUCTION
Now it has ...


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

Input:
title:K-anonymous association rule hiding
author:Zutao Zhu and
Wenliang Du
Privacy Preserving Data Mining Using
Association Rule With Condensation Approach
 Supriya S. Borhade1 , Bipin B.Shinde2
Researcher, Department of Computer Engineering,
Pune University, Pune. 1
Researcher ,Department of Computer Engineering,
RGPV,Bhopal. 2
Abstract—With  the  rapid  development  data  mining  within
various  fields  and  security  and  privacy  concerns  come  into
view.  In  data  mining  while  releasing  micro-data  or  patterns
from large databases individual or organizational private data
may  get  compromise  the  information.  The  main  aim  behind
privacy  preserving  data  mining  is  to  maximizing  analysis
outcome  and  minimizing  disclosure  of
individuals  or
organizational private data. Association rule mining explores
interesting relationship between data. This paper is based on
concepts:  condensation  method  and  association  rule.  SMC
(secure  multiparty  computation)  securely  transferring  data
over  the  network  with  hiding  process  which  hide  sensitive
association rule which create threat to privacy. Now privacy
preserving  data  mining  has  become  increasingly  popular
because  it  provides  sharing  of  private  or  sensitive  data  for
analysis purposes. Most of people and organizations are afraid
or hesitate to share their data or refusing to share their data
or  sometimes  might  provide  wrong  data.  Due  to  rapid
proliferation  of  private  information  on  the  internet,  lot  of
research has been done in recent years for privacy preserving
data  mining.  Users  are  unwilling  to  provide  private  or
personal data unless and until privacy is assured. Sometimes
automated  transaction  system  holds  or  track  information
about individuals in day today’s life. For example credit card
transactions.
Keywords—Association  Rule,  Condensation,  PPDM,
SMC, Perturbation.
I.  INTRODUCTION
Now it has ...

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


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

Output:
安全论文分析：

title:TextExerciser: Feedback-driven Text Input Exercising for Android Applications
author:Yuyu He and
Lei Zhang and
Zhemin Yang and
Yinzhi Cao and
Keke Lian and
Shuai Li and
Wei Yang and
Zhibo Zhang and
Min Yang and
Yuan Zhang and
Haixin Duan
2020 IEEE Symposium on Security and Privacy
TextExerciser: Feedback-driven Text Input
Yuyu He,1, Lei Zhang,1, Zhemin Yang1, Yinzhi Cao2, Keke Lian1, Shuai Li1, Wei Yang3, Zhibo Zhang1
Exercising for Android Applications
Min Yang1, Yuan Zhang1, Haixin Duan4
1: Fudan University, 2: Johns Hopkins University, 3: University of Texas at Dalla, 4: Tsinghua University
1: {heyy16, lei zhang14, yangzhemin, kklian18, lis19, zbzhang15, m yang, yuanxzhang}@fudan.edu.cn
2: yinzhi.cao@jhu.edu, 3: wei.yang@utdallas.edu, 4: duanhx@tsinghua.edu.cn
: The ﬁrst two authors have contributed equally to this work.
Abstract—Dynamic analysis of Android apps is often used
together with an exerciser to increase its code coverage. One big
obstacle in designing such Android app exercisers comes from
the existence of text-based inputs, which are often constrained
by the nature of the input ﬁeld, such as the length and character
restrictions.
In this paper, we propose TextExerciser, an iterative,
feedback-driven text input exerciser, which generates text inputs
for Android apps. Our key insight is that Android apps often
provide feedback, called hints, for malformed inputs so that our
system can utilize such hints to improve the input generation.
We implemented a prototype of TextExerciser and eval-
uated it by comparing TextExerciser with state-of-the-art
exercisers, such as The Monkey and DroidBot. Our evaluation
shows that TextExerciser can achieve signiﬁcantly higher
code coverage and trigger more sensitive behaviors than these
tools. We also combine TextExerciser with dynamic analysis
tools and show they are able to detect more privacy leaks and vul-
nerabilities with TextExerciser than with existing exercisers.
Particularly, existing tools, under th...


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

Input:
title:TextExerciser: Feedback-driven Text Input Exercising for Android Applications
author:Yuyu He and
Lei Zhang and
Zhemin Yang and
Yinzhi Cao and
Keke Lian and
Shuai Li and
Wei Yang and
Zhibo Zhang and
Min Yang and
Yuan Zhang and
Haixin Duan
2020 IEEE Symposium on Security and Privacy
TextExerciser: Feedback-driven Text Input
Yuyu He,1, Lei Zhang,1, Zhemin Yang1, Yinzhi Cao2, Keke Lian1, Shuai Li1, Wei Yang3, Zhibo Zhang1
Exercising for Android Applications
Min Yang1, Yuan Zhang1, Haixin Duan4
1: Fudan University, 2: Johns Hopkins University, 3: University of Texas at Dalla, 4: Tsinghua University
1: {heyy16, lei zhang14, yangzhemin, kklian18, lis19, zbzhang15, m yang, yuanxzhang}@fudan.edu.cn
2: yinzhi.cao@jhu.edu, 3: wei.yang@utdallas.edu, 4: duanhx@tsinghua.edu.cn
: The ﬁrst two authors have contributed equally to this work.
Abstract—Dynamic analysis of Android apps is often used
together with an exerciser to increase its code coverage. One big
obstacle in designing such Android app exercisers comes from
the existence of text-based inputs, which are often constrained
by the nature of the input ﬁeld, such as the length and character
restrictions.
In this paper, we propose TextExerciser, an iterative,
feedback-driven text input exerciser, which generates text inputs
for Android apps. Our key insight is that Android apps often
provide feedback, called hints, for malformed inputs so that our
system can utilize such hints to improve the input generation.
We implemented a prototype of TextExerciser and eval-
uated it by comparing TextExerciser with state-of-the-art
exercisers, such as The Monkey and DroidBot. Our evaluation
shows that TextExerciser can achieve signiﬁcantly higher
code coverage and trigger more sensitive behaviors than these
tools. We also combine TextExerciser with dynamic analysis
tools and show they are able to detect more privacy leaks and vul-
nerabilities with TextExerciser than with existing exercisers.
Particularly, existing tools, under th...

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


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

Output:
安全论文分析：

title:UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
author:Mridula Singh and
Patrick Leu and
AbdelRahman Abdou and
Srdjan Capkun
UWB-ED: Distance Enlargement Attack Detection
in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, and Srdjan Capkun, ETH Zurich
https://www.usenix.org/conference/usenixsecurity19/presentation/singh
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.UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, Srdjan Capkun
{ﬁrstname.lastname}@inf.ethz.ch
Dept. of Computer Science
ETH Zurich
Abstract
Mobile autonomous systems, robots, and cyber-physical sys-
tems rely on accurate positioning information. To conduct
distance-measurement, two devices exchange signals and,
knowing these signals propagate at the speed of light, the time
of arrival is used for distance estimations. Existing distance-
measurement techniques are incapable of protecting against
adversarial distance enlargement—a highly devastating tac-
tic in which the adversary reissues a delayed version of the
signals transmitted between devices, after distorting the au-
thentic signal to prevent the receiver from identifying it. The
adversary need not break crypto, nor compromise any upper-
layer security protocols for mounting this attack. No known
solution currently exists to protect against distance enlarge-
ment. We present Ultra-Wideband Enlargement Detection
(UWB-ED), a new modulation technique to detect distance
enlargement attacks, and securely verify distances between
two mutually trusted devices. We analyze UWB-ED under
an adversary that injects signals to block/modify authentic
signals. We show how UWB-ED is a good candidate for
802.15.4z Low Rate Pulse and the 5G standard.
1 Introduction
Ranging and positioning...


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

Input:
title:UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
author:Mridula Singh and
Patrick Leu and
AbdelRahman Abdou and
Srdjan Capkun
UWB-ED: Distance Enlargement Attack Detection
in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, and Srdjan Capkun, ETH Zurich
https://www.usenix.org/conference/usenixsecurity19/presentation/singh
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.UWB-ED: Distance Enlargement Attack Detection in Ultra-Wideband
Mridula Singh, Patrick Leu, AbdelRahman Abdou, Srdjan Capkun
{ﬁrstname.lastname}@inf.ethz.ch
Dept. of Computer Science
ETH Zurich
Abstract
Mobile autonomous systems, robots, and cyber-physical sys-
tems rely on accurate positioning information. To conduct
distance-measurement, two devices exchange signals and,
knowing these signals propagate at the speed of light, the time
of arrival is used for distance estimations. Existing distance-
measurement techniques are incapable of protecting against
adversarial distance enlargement—a highly devastating tac-
tic in which the adversary reissues a delayed version of the
signals transmitted between devices, after distorting the au-
thentic signal to prevent the receiver from identifying it. The
adversary need not break crypto, nor compromise any upper-
layer security protocols for mounting this attack. No known
solution currently exists to protect against distance enlarge-
ment. We present Ultra-Wideband Enlargement Detection
(UWB-ED), a new modulation technique to detect distance
enlargement attacks, and securely verify distances between
two mutually trusted devices. We analyze UWB-ED under
an adversary that injects signals to block/modify authentic
signals. We show how UWB-ED is a good candidate for
802.15.4z Low Rate Pulse and the 5G standard.
1 Introduction
Ranging and positioning...

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


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

Output:
安全论文分析：

title:Intrusion Detection in RBAC-administered Databases
author:Elisa Bertino and
Ashish Kamra and
Evimaria Terzi and
Athena Vakali
Intrusion Detection in RBAC-administered Databases ∗
Elisa Bertino
Purdue University
Ashish Kamra
Purdue University
bertino@cs.purdue.edu
akamra@ecn.purdue.edu
Evimaria Terzi
University of Helsinki
Athena Vakali
Aristotle University
terzi@cs.helsinki.fi
avakali@csd.auth.gr
Abstract
A considerable effort has been recently devoted to the
development of Database Management Systems (DBMS)
which guarantee high assurance security and privacy. An
important component of any strong security solution is rep-
resented by intrusion detection (ID) systems, able to detect
anomalous behavior by applications and users. To date,
however, there have been very few ID mechanisms specif-
ically tailored to database systems. In this paper, we pro-
pose such a mechanism. The approach we propose to ID
is based on mining database traces stored in log ﬁles. The
result of the mining process is used to form user proﬁles
that can model normal behavior and identify intruders. An
additional feature of our approach is that we couple our
mechanism with Role Based Access Control (RBAC). Under
a RBAC system permissions are associated with roles, usu-
ally grouping several users, rather than with single users.
Our ID system is able to determine role intruders, that is,
individuals that while holding a speciﬁc role, have a be-
havior different from the normal behavior of the role. An
important advantage of providing an ID mechanism speciﬁ-
cally tailored to databases is that it can also be used to pro-
tect against insider threats. Furthermore, the use of roles
makes our approach usable even for databases with large
user population. Our preliminary experimental evaluation
on both real and synthetic database traces show that our
methods work well in practical situations.
1. Introduction
Data represent today an important asset. We see an in-
creasing number of organizations ...


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

Input:
title:Intrusion Detection in RBAC-administered Databases
author:Elisa Bertino and
Ashish Kamra and
Evimaria Terzi and
Athena Vakali
Intrusion Detection in RBAC-administered Databases ∗
Elisa Bertino
Purdue University
Ashish Kamra
Purdue University
bertino@cs.purdue.edu
akamra@ecn.purdue.edu
Evimaria Terzi
University of Helsinki
Athena Vakali
Aristotle University
terzi@cs.helsinki.fi
avakali@csd.auth.gr
Abstract
A considerable effort has been recently devoted to the
development of Database Management Systems (DBMS)
which guarantee high assurance security and privacy. An
important component of any strong security solution is rep-
resented by intrusion detection (ID) systems, able to detect
anomalous behavior by applications and users. To date,
however, there have been very few ID mechanisms specif-
ically tailored to database systems. In this paper, we pro-
pose such a mechanism. The approach we propose to ID
is based on mining database traces stored in log ﬁles. The
result of the mining process is used to form user proﬁles
that can model normal behavior and identify intruders. An
additional feature of our approach is that we couple our
mechanism with Role Based Access Control (RBAC). Under
a RBAC system permissions are associated with roles, usu-
ally grouping several users, rather than with single users.
Our ID system is able to determine role intruders, that is,
individuals that while holding a speciﬁc role, have a be-
havior different from the normal behavior of the role. An
important advantage of providing an ID mechanism speciﬁ-
cally tailored to databases is that it can also be used to pro-
tect against insider threats. Furthermore, the use of roles
makes our approach usable even for databases with large
user population. Our preliminary experimental evaluation
on both real and synthetic database traces show that our
methods work well in practical situations.
1. Introduction
Data represent today an important asset. We see an in-
creasing number of organizations ...

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


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

Output:
安全论文分析：

title:Towards Generating High Coverage Vulnerability-Based Signatures with
Protocol-Level Constraint-Guided Exploration
author:Juan Caballero and
Zhenkai Liang and
Pongsin Poosankam and
Dawn Song
Towards Generating High Coverage
Vulnerability-Based Signatures with Protocol-Level
Constraint-Guided Exploration
Juan Caballero2,1, Zhenkai Liang3, Pongsin Poosankam2,1, and Dawn Song1
1 UC Berkeley
2 Carnegie Mellon University
3 National University of Singapore
Abstract. Signature-based input ﬁltering is an important and widely deployed de-
fense. But current signature generation methods have limited coverage and the gen-
erated signatures often can be easily evaded by an attacker with small variations of
the exploit message. In this paper, we propose protocol-level constraint-guided ex-
ploration, a new approach towards generating high coverage vulnerability-based
signatures. In particular, our approach generates high coverage, yet compact, vul-
nerability point reachability predicates, which capture many paths to the vulnera-
bility point. In our experimental results, our tool, Elcano, generates compact, high
coverage signatures for real-world vulnerabilities.
1 Introduction
Automatic signature generation remains an important open problem. According to
Symantec’s latest Internet Security Threat Report hundreds of new security-critical vul-
nerabilities were discovered in the second half of 2007 [1]. For many of these vulner-
abilities, the exploit development time is less than a day, while the patch development
time is often days or months [1]. In addition, the patch deployment time can be long
due to extensive testing cycles.
To address these issues, signature-based input ﬁltering has been widely deployed in
Intrusion Prevention (IPS) and Intrusion Detection (IDS) systems. Signature-based in-
put ﬁltering matches program inputs against a set of signatures and ﬂags matched inputs
as attacks. It provides an important means to protect vulnerable hosts when patches are
not...


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

Input:
title:Towards Generating High Coverage Vulnerability-Based Signatures with
Protocol-Level Constraint-Guided Exploration
author:Juan Caballero and
Zhenkai Liang and
Pongsin Poosankam and
Dawn Song
Towards Generating High Coverage
Vulnerability-Based Signatures with Protocol-Level
Constraint-Guided Exploration
Juan Caballero2,1, Zhenkai Liang3, Pongsin Poosankam2,1, and Dawn Song1
1 UC Berkeley
2 Carnegie Mellon University
3 National University of Singapore
Abstract. Signature-based input ﬁltering is an important and widely deployed de-
fense. But current signature generation methods have limited coverage and the gen-
erated signatures often can be easily evaded by an attacker with small variations of
the exploit message. In this paper, we propose protocol-level constraint-guided ex-
ploration, a new approach towards generating high coverage vulnerability-based
signatures. In particular, our approach generates high coverage, yet compact, vul-
nerability point reachability predicates, which capture many paths to the vulnera-
bility point. In our experimental results, our tool, Elcano, generates compact, high
coverage signatures for real-world vulnerabilities.
1 Introduction
Automatic signature generation remains an important open problem. According to
Symantec’s latest Internet Security Threat Report hundreds of new security-critical vul-
nerabilities were discovered in the second half of 2007 [1]. For many of these vulner-
abilities, the exploit development time is less than a day, while the patch development
time is often days or months [1]. In addition, the patch deployment time can be long
due to extensive testing cycles.
To address these issues, signature-based input ﬁltering has been widely deployed in
Intrusion Prevention (IPS) and Intrusion Detection (IDS) systems. Signature-based in-
put ﬁltering matches program inputs against a set of signatures and ﬂags matched inputs
as attacks. It provides an important means to protect vulnerable hosts when patches are
not...

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


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

Output:
安全论文分析：

title:A closer look at keyboard acoustic emanations: random passwords, typing
styles and decoding techniques
author:Tzipora Halevi and
Nitesh Saxena
A Closer Look at Keyboard Acoustic Emanations: Random
Passwords, Typing Styles and Decoding Techniques
ABSTRACT
We take a closer look at keyboard acoustic emanations speciﬁcally
for the purpose of eavesdropping over random passwords. In this
scenario, dictionary and HMM language models are not applicable;
the attacker can only utilize the raw acoustic information which
has been recorded. We investigate several existing signal process-
ing techniques for our purpose, and introduce a novel technique
– time-frequency decoding – that improves the detection accuracy
compared to previous techniques. We also carefully examine the
effect of typing style – a crucial variable largely ignored by prior
research – on the detection accuracy. Our results show that using
the same typing style (hunt and peck) for both training and decod-
ing the data, the best case success rate for detecting correctly the
typed key is 64% per character. The results also show that changing
the typing style, to touch typing, during the decoding stage reduces
the success rate, but using the time-frequency technique, we can
still achieve a success rate of around 40% per character.
Our work takes the keyboard acoustic attack one step further,
bringing it closer to a full-ﬂedged vulnerability under realistic sce-
narios (different typing styles and random passwords). Our results
suggest that while the performance of these attacks degrades un-
der such conditions, it is still possible, utilizing the time-frequency
technique, to considerably reduce the exhaustive search complexity
of retrieving a random password.
Keywords: Keyboard acoustic emanations; random passwords;
signal processing
1.
INTRODUCTION
The attacks based on acoustic emanations produced by electronic
devices have been a known source of concern and present a threat
to user privacy. Speciﬁcally, a...


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

Input:
title:A closer look at keyboard acoustic emanations: random passwords, typing
styles and decoding techniques
author:Tzipora Halevi and
Nitesh Saxena
A Closer Look at Keyboard Acoustic Emanations: Random
Passwords, Typing Styles and Decoding Techniques
ABSTRACT
We take a closer look at keyboard acoustic emanations speciﬁcally
for the purpose of eavesdropping over random passwords. In this
scenario, dictionary and HMM language models are not applicable;
the attacker can only utilize the raw acoustic information which
has been recorded. We investigate several existing signal process-
ing techniques for our purpose, and introduce a novel technique
– time-frequency decoding – that improves the detection accuracy
compared to previous techniques. We also carefully examine the
effect of typing style – a crucial variable largely ignored by prior
research – on the detection accuracy. Our results show that using
the same typing style (hunt and peck) for both training and decod-
ing the data, the best case success rate for detecting correctly the
typed key is 64% per character. The results also show that changing
the typing style, to touch typing, during the decoding stage reduces
the success rate, but using the time-frequency technique, we can
still achieve a success rate of around 40% per character.
Our work takes the keyboard acoustic attack one step further,
bringing it closer to a full-ﬂedged vulnerability under realistic sce-
narios (different typing styles and random passwords). Our results
suggest that while the performance of these attacks degrades un-
der such conditions, it is still possible, utilizing the time-frequency
technique, to considerably reduce the exhaustive search complexity
of retrieving a random password.
Keywords: Keyboard acoustic emanations; random passwords;
signal processing
1.
INTRODUCTION
The attacks based on acoustic emanations produced by electronic
devices have been a known source of concern and present a threat
to user privacy. Speciﬁcally, a...

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


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

Output:
安全论文分析：

title:: Practical Cache Attacks from the Network
author:Michael Kurth and
Ben Gras and
Dennis Andriesse and
Cristiano Giuffrida and
Herbert Bos and
Kaveh Razavi
2020 IEEE Symposium on Security and Privacy
NetCAT: Practical Cache Attacks from the Network
Michael Kurth∗§, Ben Gras∗, Dennis Andriesse∗, Cristiano Giuffrida∗, Herbert Bos∗, and Kaveh Razavi∗
∗Department of Computer Science
Vrije Universiteit Amsterdam, The Netherlands
m.kurth@vu.nl, beng@cs.vu.nl, da.andriesse@few.vu.nl
{kaveh, herbertb, giuffrida}@cs.vu.nl
§Department of Computer Science
ETH Zurich, Switzerland
kurthm@ethz.ch
Abstract—Increased peripheral performance is causing strain
on the memory subsystem of modern processors. For example,
available DRAM throughput can no longer sustain the trafﬁc
of a modern network card. Scrambling to deliver the promised
performance, instead of transferring peripheral data to and from
DRAM, modern Intel processors perform I/O operations directly
on the Last Level Cache (LLC). While Direct Cache Access
(DCA) instead of Direct Memory Access (DMA) is a sensible
performance optimization, it is unfortunately implemented with-
out care for security, as the LLC is now shared between the CPU
and all the attached devices, including the network card.
In this paper, we reverse engineer the behavior of DCA, widely
referred to as Data-Direct I/O (DDIO), on recent Intel processors
and present its ﬁrst security analysis. Based on our analysis, we
present NetCAT, the ﬁrst Network-based PRIME+PROBE Cache
Attack on the processor’s LLC of a remote machine. We show
that NetCAT not only enables attacks in cooperative settings
where an attacker can build a covert channel between a network
client and a sandboxed server process (without network), but
more worryingly, in general adversarial settings. In such settings,
NetCAT can enable disclosure of network timing-based sensitive
information. As an example, we show a keystroke timing attack
on a victim SSH connection belonging to another c...


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

Input:
title:: Practical Cache Attacks from the Network
author:Michael Kurth and
Ben Gras and
Dennis Andriesse and
Cristiano Giuffrida and
Herbert Bos and
Kaveh Razavi
2020 IEEE Symposium on Security and Privacy
NetCAT: Practical Cache Attacks from the Network
Michael Kurth∗§, Ben Gras∗, Dennis Andriesse∗, Cristiano Giuffrida∗, Herbert Bos∗, and Kaveh Razavi∗
∗Department of Computer Science
Vrije Universiteit Amsterdam, The Netherlands
m.kurth@vu.nl, beng@cs.vu.nl, da.andriesse@few.vu.nl
{kaveh, herbertb, giuffrida}@cs.vu.nl
§Department of Computer Science
ETH Zurich, Switzerland
kurthm@ethz.ch
Abstract—Increased peripheral performance is causing strain
on the memory subsystem of modern processors. For example,
available DRAM throughput can no longer sustain the trafﬁc
of a modern network card. Scrambling to deliver the promised
performance, instead of transferring peripheral data to and from
DRAM, modern Intel processors perform I/O operations directly
on the Last Level Cache (LLC). While Direct Cache Access
(DCA) instead of Direct Memory Access (DMA) is a sensible
performance optimization, it is unfortunately implemented with-
out care for security, as the LLC is now shared between the CPU
and all the attached devices, including the network card.
In this paper, we reverse engineer the behavior of DCA, widely
referred to as Data-Direct I/O (DDIO), on recent Intel processors
and present its ﬁrst security analysis. Based on our analysis, we
present NetCAT, the ﬁrst Network-based PRIME+PROBE Cache
Attack on the processor’s LLC of a remote machine. We show
that NetCAT not only enables attacks in cooperative settings
where an attacker can build a covert channel between a network
client and a sandboxed server process (without network), but
more worryingly, in general adversarial settings. In such settings,
NetCAT can enable disclosure of network timing-based sensitive
information. As an example, we show a keystroke timing attack
on a victim SSH connection belonging to another c...

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


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

Output:
安全论文分析：

title:When private set intersection meets big data: an efficient and scalable
protocol
author:Changyu Dong and
Liqun Chen and
Zikai Wen
When Private Set Intersection Meets Big Data:
An Efﬁcient and Scalable Protocol
Changyu Dong
Dept. of Computer and
Information Sciences
University of Strathclyde
Glasgow, UK
changyu.dong@strath.ac.uk
Liqun Chen
Hewlett-Packard Laboratories
Bristol, UK
liqun.chen@hp.com
Zikai Wen
Dept. of Computer and
Information Sciences
University of Strathclyde
Glasgow, UK
wjb12186@uni.strath.ac.uk
ABSTRACT
Large scale data processing brings new challenges to the design of
privacy-preserving protocols: how to meet the increasing require-
ments of speed and throughput of modern applications, and how to
scale up smoothly when data being protected is big. Efﬁciency and
scalability become critical criteria for privacy preserving protocols
in the age of Big Data. In this paper, we present a new Private Set
Intersection (PSI) protocol that is extremely efﬁcient and highly
scalable compared with existing protocols. The protocol is based
on a novel approach that we call oblivious Bloom intersection. It
has linear complexity and relies mostly on efﬁcient symmetric key
operations. It has high scalability due to the fact that most opera-
tions can be parallelized easily. The protocol has two versions: a
basic protocol and an enhanced protocol, the security of the two
variants is analyzed and proved in the semi-honest model and the
malicious model respectively. A prototype of the basic protocol
has been built. We report the result of performance evaluation and
compare it against the two previously fastest PSI protocols. Our
protocol is orders of magnitude faster than these two protocols. To
compute the intersection of two million-element sets, our protocol
needs only 41 seconds (80-bit security) and 339 seconds (256-bit
security) on moderate hardware in parallel mode.
Categories and Subject Descriptors
D.4.6 [OPERATING SYSTEMS]: Security and Protection—Cryp-
...


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

Input:
title:When private set intersection meets big data: an efficient and scalable
protocol
author:Changyu Dong and
Liqun Chen and
Zikai Wen
When Private Set Intersection Meets Big Data:
An Efﬁcient and Scalable Protocol
Changyu Dong
Dept. of Computer and
Information Sciences
University of Strathclyde
Glasgow, UK
changyu.dong@strath.ac.uk
Liqun Chen
Hewlett-Packard Laboratories
Bristol, UK
liqun.chen@hp.com
Zikai Wen
Dept. of Computer and
Information Sciences
University of Strathclyde
Glasgow, UK
wjb12186@uni.strath.ac.uk
ABSTRACT
Large scale data processing brings new challenges to the design of
privacy-preserving protocols: how to meet the increasing require-
ments of speed and throughput of modern applications, and how to
scale up smoothly when data being protected is big. Efﬁciency and
scalability become critical criteria for privacy preserving protocols
in the age of Big Data. In this paper, we present a new Private Set
Intersection (PSI) protocol that is extremely efﬁcient and highly
scalable compared with existing protocols. The protocol is based
on a novel approach that we call oblivious Bloom intersection. It
has linear complexity and relies mostly on efﬁcient symmetric key
operations. It has high scalability due to the fact that most opera-
tions can be parallelized easily. The protocol has two versions: a
basic protocol and an enhanced protocol, the security of the two
variants is analyzed and proved in the semi-honest model and the
malicious model respectively. A prototype of the basic protocol
has been built. We report the result of performance evaluation and
compare it against the two previously fastest PSI protocols. Our
protocol is orders of magnitude faster than these two protocols. To
compute the intersection of two million-element sets, our protocol
needs only 41 seconds (80-bit security) and 339 seconds (256-bit
security) on moderate hardware in parallel mode.
Categories and Subject Descriptors
D.4.6 [OPERATING SYSTEMS]: Security and Protection—Cryp-
...

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


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

Output:
安全论文分析：

title:Magellan: Generating Multi-Table Datapath from Datapath Oblivious
Algorithmic SDN Policies
author:Andreas Voellmy and
Shenshen Chen and
Xin Wang and
Yang Richard Yang
Magellan: Generating Multi-Table Datapath from
Datapath Oblivious Algorithmic SDN Policies
Andreas Voellmy+
Shenshen Chen∗
Yale University+
Xing Wang∗
Tongji University∗
Y. Richard Yang∗+
ABSTRACT
Despite the emergence of multi-table pipelining as a key fea-
ture of next-generation SDN data-path models, there is no
existing work that addresses the substantial programming
challenge of utilizing multi-tables automatically. In this pa-
per, we present Magellan, the ﬁrst system that addresses
the aforementioned challenge. Introducing two novel, sub-
stantial algorithms, map-explore and table-design, Magel-
lan achieves automatic derivation and population of multi-
table pipelines from a datapath-oblivious, high-level SDN
program written in a general-purpose language. Compar-
ing the ﬂow tables generated by Magellan with those pro-
duced from standard SDN controllers including OpenDay-
light and Floodlight, we show that Magellan uses between
46-68x fewer rules.
CCS Concepts
•Networks → Programming interfaces;
Keywords
SDN, Programming model, Multi-table pipeline
1.
INTRODUCTION
Multi-table pipelining has emerged as the foundation of
the next generation SDN datapath models. Avoiding key is-
sues such as unnecessary combinatorial explosions to sub-
stantially reduce datapath table sizes, multi-table pipelining
is essential for making SDN practical. At the same time,
the introduction of multi-tables also adds additional SDN
programming tasks including designing effective layout of
pipelines and populating the content of multiple tables.
In this work, we investigate how to automatically derive
and populate multi-table pipelines from datapath-oblivious
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made...


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

Input:
title:Magellan: Generating Multi-Table Datapath from Datapath Oblivious
Algorithmic SDN Policies
author:Andreas Voellmy and
Shenshen Chen and
Xin Wang and
Yang Richard Yang
Magellan: Generating Multi-Table Datapath from
Datapath Oblivious Algorithmic SDN Policies
Andreas Voellmy+
Shenshen Chen∗
Yale University+
Xing Wang∗
Tongji University∗
Y. Richard Yang∗+
ABSTRACT
Despite the emergence of multi-table pipelining as a key fea-
ture of next-generation SDN data-path models, there is no
existing work that addresses the substantial programming
challenge of utilizing multi-tables automatically. In this pa-
per, we present Magellan, the ﬁrst system that addresses
the aforementioned challenge. Introducing two novel, sub-
stantial algorithms, map-explore and table-design, Magel-
lan achieves automatic derivation and population of multi-
table pipelines from a datapath-oblivious, high-level SDN
program written in a general-purpose language. Compar-
ing the ﬂow tables generated by Magellan with those pro-
duced from standard SDN controllers including OpenDay-
light and Floodlight, we show that Magellan uses between
46-68x fewer rules.
CCS Concepts
•Networks → Programming interfaces;
Keywords
SDN, Programming model, Multi-table pipeline
1.
INTRODUCTION
Multi-table pipelining has emerged as the foundation of
the next generation SDN datapath models. Avoiding key is-
sues such as unnecessary combinatorial explosions to sub-
stantially reduce datapath table sizes, multi-table pipelining
is essential for making SDN practical. At the same time,
the introduction of multi-tables also adds additional SDN
programming tasks including designing effective layout of
pipelines and populating the content of multiple tables.
In this work, we investigate how to automatically derive
and populate multi-table pipelines from datapath-oblivious
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made...

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


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

Output:
安全论文分析：

title:How Fast Can Eventual Synchrony Lead to Consensus?
author:Partha Dutta and
Rachid Guerraoui and
Leslie Lamport
How Fast Can Eventual Synchrony Lead
to Consensus?
Partha Dutta
EPFL, Switzerland
Rachid Guerraoui
EPFL, Switzerland
Leslie Lamport
Microsoft
9 March 2005
To appear in Proceedings of the 2005 International Conference on
Dependable Systems and Networks (DSN 2005).
Abstract
It is well known that the consensus problem can be solved in a distributed
system if, after some time TS, no process fails and there is some upper bound
δ on how long it takes to deliver a message. We know of no existing algorithm
that guarantees consensus among N processes before time TS + O(N δ). We
show that consensus can be achieved by time TS + O(δ).
Contents
1 Introduction
2 Traditional Paxos
3 Round-Based Algorithms
4 The Modiﬁed Paxos Algorithm
5 The Modiﬁed B-Consensus Algorithm
6 Concluding Remarks
1
3
4
5
10
11
1
Introduction
Unbounded message delays and continual process failures make it impossible
to guarantee that a consensus algorithm will terminate [6]. Suppose there is
some time TS after which no process fails and messages are delivered within
a bounded length of time. How soon after time TS can an algorithm ensure
that all nonfaulty processes have reached consensus? It is this question that
we address.
We consider only omission (non-Byzantine) faults. We allow messages to
be lost and processes to fail by stopping, but messages may not be corrupted
and faulty processes may not perform incorrect actions. Byzantine faults
are discussed in the conclusion. A failed process can restart at any time.
Processes have timers that run at approximately the same rate after time
TS.
We say that the system is stable after time TS, and we let δ seconds be the
bound on message-delivery time after stability is reached. More precisely, we
assume that when the system is stable, a nonfaulty process will receive and
react to a message within δ seconds of when the message was sent. (Henc...


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

Input:
title:How Fast Can Eventual Synchrony Lead to Consensus?
author:Partha Dutta and
Rachid Guerraoui and
Leslie Lamport
How Fast Can Eventual Synchrony Lead
to Consensus?
Partha Dutta
EPFL, Switzerland
Rachid Guerraoui
EPFL, Switzerland
Leslie Lamport
Microsoft
9 March 2005
To appear in Proceedings of the 2005 International Conference on
Dependable Systems and Networks (DSN 2005).
Abstract
It is well known that the consensus problem can be solved in a distributed
system if, after some time TS, no process fails and there is some upper bound
δ on how long it takes to deliver a message. We know of no existing algorithm
that guarantees consensus among N processes before time TS + O(N δ). We
show that consensus can be achieved by time TS + O(δ).
Contents
1 Introduction
2 Traditional Paxos
3 Round-Based Algorithms
4 The Modiﬁed Paxos Algorithm
5 The Modiﬁed B-Consensus Algorithm
6 Concluding Remarks
1
3
4
5
10
11
1
Introduction
Unbounded message delays and continual process failures make it impossible
to guarantee that a consensus algorithm will terminate [6]. Suppose there is
some time TS after which no process fails and messages are delivered within
a bounded length of time. How soon after time TS can an algorithm ensure
that all nonfaulty processes have reached consensus? It is this question that
we address.
We consider only omission (non-Byzantine) faults. We allow messages to
be lost and processes to fail by stopping, but messages may not be corrupted
and faulty processes may not perform incorrect actions. Byzantine faults
are discussed in the conclusion. A failed process can restart at any time.
Processes have timers that run at approximately the same rate after time
TS.
We say that the system is stable after time TS, and we let δ seconds be the
bound on message-delivery time after stability is reached. More precisely, we
assume that when the system is stable, a nonfaulty process will receive and
react to a message within δ seconds of when the message was sent. (Henc...

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


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

Output:
安全论文分析：

title:Spamming botnets: signatures and characteristics
author:Yinglian Xie and
Fang Yu and
Kannan Achan and
Rina Panigrahy and
Geoff Hulten and
Ivan Osipkov
Spamming Botnets: Signatures and Characteristics
Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten+, Ivan Osipkov+
{yxie,fangyu,kachan,rina,ghulten,ivano}@microsoft.com
Microsoft Research, Silicon Valley
+Microsoft Corporation
ABSTRACT
In this paper, we focus on characterizing spamming botnets by
leveraging both spam payload and spam server trafﬁc properties.
Towards this goal, we developed a spam signature generation frame-
work called AutoRE to detect botnet-based spam emails and botnet
membership. AutoRE does not require pre-classiﬁed training data
or white lists. Moreover, it outputs high quality regular expression
signatures that can detect botnet spam with a low false positive rate.
Using a three-month sample of emails from Hotmail, AutoRE suc-
cessfully identiﬁed 7,721 botnet-based spam campaigns together
with 340,050 unique botnet host IP addresses.
Our in-depth analysis of the identiﬁed botnets revealed several
interesting ﬁndings regarding the degree of email obfuscation, prop-
erties of botnet IP addresses, sending patterns, and their correlation
with network scanning trafﬁc. We believe these observations are
useful information in the design of botnet detection schemes.
Categories and Subject Descriptors
C.2.3 [Computer Communication Networks]: Network Opera-
tions—network management; C.2.0 [Computer Communication
Networks]: General—security and protection
General Terms
Algorithms, Measurement, Security
Keywords
Spam, botnet, regular expression, signature generation
1.
INTRODUCTION
Botnets have been widely used for sending spam emails at a large
scale [14, 4, 19, 24]. By programming a large number of distributed
bots, spammers can effectively transmit thousands of spam emails
in a short duration. To date, detecting and blacklisting individual
bots is commonly regarded as difﬁcult, due ...


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

Input:
title:Spamming botnets: signatures and characteristics
author:Yinglian Xie and
Fang Yu and
Kannan Achan and
Rina Panigrahy and
Geoff Hulten and
Ivan Osipkov
Spamming Botnets: Signatures and Characteristics
Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten+, Ivan Osipkov+
{yxie,fangyu,kachan,rina,ghulten,ivano}@microsoft.com
Microsoft Research, Silicon Valley
+Microsoft Corporation
ABSTRACT
In this paper, we focus on characterizing spamming botnets by
leveraging both spam payload and spam server trafﬁc properties.
Towards this goal, we developed a spam signature generation frame-
work called AutoRE to detect botnet-based spam emails and botnet
membership. AutoRE does not require pre-classiﬁed training data
or white lists. Moreover, it outputs high quality regular expression
signatures that can detect botnet spam with a low false positive rate.
Using a three-month sample of emails from Hotmail, AutoRE suc-
cessfully identiﬁed 7,721 botnet-based spam campaigns together
with 340,050 unique botnet host IP addresses.
Our in-depth analysis of the identiﬁed botnets revealed several
interesting ﬁndings regarding the degree of email obfuscation, prop-
erties of botnet IP addresses, sending patterns, and their correlation
with network scanning trafﬁc. We believe these observations are
useful information in the design of botnet detection schemes.
Categories and Subject Descriptors
C.2.3 [Computer Communication Networks]: Network Opera-
tions—network management; C.2.0 [Computer Communication
Networks]: General—security and protection
General Terms
Algorithms, Measurement, Security
Keywords
Spam, botnet, regular expression, signature generation
1.
INTRODUCTION
Botnets have been widely used for sending spam emails at a large
scale [14, 4, 19, 24]. By programming a large number of distributed
bots, spammers can effectively transmit thousands of spam emails
in a short duration. To date, detecting and blacklisting individual
bots is commonly regarded as difﬁcult, due ...

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


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

Output:
安全论文分析：

title:POSTER: LocMask: A Location Privacy Protection Framework in Android
System
author:Qiuyu Xiao and
Jiayi Chen and
Le Yu and
Huaxin Li and
Haojin Zhu and
Muyuan Li and
Kui Ren
POSTER: LocMask: A Location Privacy Protection
Framework in Android System
Qiuyu Xiao, Jiayi Chen, Le Yu, Huaxin
Li, Haojin Zhu
Shanghai Jiao Tong University
Shanghai, China
{xiaoqiuyu, edjason, yule5100309221,
lihuaxin003, zhu-hj}@sjtu.edu.cn
Muyuan Li, Kui Ren
University at Buffalo
Buffalo, NY, USA
{muyuanli, kuiren}@buffalo.edu
ABSTRACT
The mobile users are facing a serious risk of losing loca-
tion privacy (e.g., users’ location information transmitted
by open advertisement network, and the reported event of
involuntary tracking of mobile users in popular mobile social
apps). In this study, we design and implement LocMask, a
system-level solution that provides location privacy protec-
tion in Android system. LocMask achieves the tradeoﬀ of
the privacy and the utility of location based services by pro-
viding the Quality of Protection (QoP) on demand, which
sets diﬀerent privacy protection levels to diﬀerent locations
based on how sensitive these locations are. Motivated by the
fact that Top locations (e.g, user’s home or oﬃce) are more
sensitive than less visiting locations, LocMask provides loca-
tion pro(cid:12)le management module that records the user’s mo-
bility history and ranks the locations in terms of the user’s
visiting frequency. With users’ location pro(cid:12)les, LocMask
can automatically determines the sensitiveness of these loca-
tions as well as their corresponding privacy protection level.
LocMask is also designed to incorporate various obfuscation
techniques. The eﬀectiveness of LocMask is supported by
extensive real-world data based evaluations.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General|
Security and Protection
Keywords
Location privacy; Smartphone security; Android
1.
INTRODUCTION
As an important tool in facilitating coordi...


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

Input:
title:POSTER: LocMask: A Location Privacy Protection Framework in Android
System
author:Qiuyu Xiao and
Jiayi Chen and
Le Yu and
Huaxin Li and
Haojin Zhu and
Muyuan Li and
Kui Ren
POSTER: LocMask: A Location Privacy Protection
Framework in Android System
Qiuyu Xiao, Jiayi Chen, Le Yu, Huaxin
Li, Haojin Zhu
Shanghai Jiao Tong University
Shanghai, China
{xiaoqiuyu, edjason, yule5100309221,
lihuaxin003, zhu-hj}@sjtu.edu.cn
Muyuan Li, Kui Ren
University at Buffalo
Buffalo, NY, USA
{muyuanli, kuiren}@buffalo.edu
ABSTRACT
The mobile users are facing a serious risk of losing loca-
tion privacy (e.g., users’ location information transmitted
by open advertisement network, and the reported event of
involuntary tracking of mobile users in popular mobile social
apps). In this study, we design and implement LocMask, a
system-level solution that provides location privacy protec-
tion in Android system. LocMask achieves the tradeoﬀ of
the privacy and the utility of location based services by pro-
viding the Quality of Protection (QoP) on demand, which
sets diﬀerent privacy protection levels to diﬀerent locations
based on how sensitive these locations are. Motivated by the
fact that Top locations (e.g, user’s home or oﬃce) are more
sensitive than less visiting locations, LocMask provides loca-
tion pro(cid:12)le management module that records the user’s mo-
bility history and ranks the locations in terms of the user’s
visiting frequency. With users’ location pro(cid:12)les, LocMask
can automatically determines the sensitiveness of these loca-
tions as well as their corresponding privacy protection level.
LocMask is also designed to incorporate various obfuscation
techniques. The eﬀectiveness of LocMask is supported by
extensive real-world data based evaluations.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General|
Security and Protection
Keywords
Location privacy; Smartphone security; Android
1.
INTRODUCTION
As an important tool in facilitating coordi...

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