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

Output:
安全论文分析：

title:Fixing Races for Fun and Profit: How to Use access(2)
author:Drew Dean and
Alan J. Hu
USENIX Association
Proceedings of the
13th USENIX Security Symposium
San Diego, CA, USA
August 9–13, 2004
© 2004 by The USENIX Association
Phone: 1 510 528 8649
All Rights Reserved
FAX: 1 510 548 5738
Rights to individual papers remain with the author or the author's employer.
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
 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.
Fixing Races for Fun and Proﬁt: How to use access(2)
Drew Dean∗
Computer Science Laboratory, SRI International
ddean@csl.sri.com
Alan J. Hu†
Dept. of Computer Science, University of British Columbia
ajh@cs.ubc.ca
Abstract
It is well known that it is insecure to use the access(2)
system call in a setuid program to test for the ability of
the program’s executor to access a ﬁle before opening
said ﬁle. Although the access(2) call appears to have
been designed exactly for this use, such use is vulnera-
ble to a race condition. This race condition is a classic
example of a time-of-check-to-time-of-use (TOCTTOU)
problem. We prove the “folk theorem” that no portable,
deterministic solution exists without changes to the sys-
tem call interface, we present a probabilistic solution,
and we examine the effect of increasing CPU speeds on
the exploitability of the attack.
1
Introduction
Since the 1988 Morris worm, and particularly the 1996
tutorial on stack smashing in Phrack [1], the buffer over-
ﬂow has been the attacker’s weapon of choice for sub-
verting system security. Many techniques for preventing
or mitigating the effects of the lack of memory safety
have appeared in the literature [9, 14, 12, 13, 3]. Prior to
the popularization of stack smashing, various race con-
ditions were commonly utilized as...


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

Input:
title:Fixing Races for Fun and Profit: How to Use access(2)
author:Drew Dean and
Alan J. Hu
USENIX Association
Proceedings of the
13th USENIX Security Symposium
San Diego, CA, USA
August 9–13, 2004
© 2004 by The USENIX Association
Phone: 1 510 528 8649
All Rights Reserved
FAX: 1 510 548 5738
Rights to individual papers remain with the author or the author's employer.
Email: office@usenix.org
For more information about the USENIX Association:
WWW: http://www.usenix.org
 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.
Fixing Races for Fun and Proﬁt: How to use access(2)
Drew Dean∗
Computer Science Laboratory, SRI International
ddean@csl.sri.com
Alan J. Hu†
Dept. of Computer Science, University of British Columbia
ajh@cs.ubc.ca
Abstract
It is well known that it is insecure to use the access(2)
system call in a setuid program to test for the ability of
the program’s executor to access a ﬁle before opening
said ﬁle. Although the access(2) call appears to have
been designed exactly for this use, such use is vulnera-
ble to a race condition. This race condition is a classic
example of a time-of-check-to-time-of-use (TOCTTOU)
problem. We prove the “folk theorem” that no portable,
deterministic solution exists without changes to the sys-
tem call interface, we present a probabilistic solution,
and we examine the effect of increasing CPU speeds on
the exploitability of the attack.
1
Introduction
Since the 1988 Morris worm, and particularly the 1996
tutorial on stack smashing in Phrack [1], the buffer over-
ﬂow has been the attacker’s weapon of choice for sub-
verting system security. Many techniques for preventing
or mitigating the effects of the lack of memory safety
have appeared in the literature [9, 14, 12, 13, 3]. Prior to
the popularization of stack smashing, various race con-
ditions were commonly utilized as...

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


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

Output:
安全论文分析：

title:A Probabilistic Population Study of the Conficker-C Botnet
author:Rhiannon Weaver
A Probabilistic Population Study of the
Conﬁcker-C Botnet
Rhiannon Weaver
CERT, Software Engineering Institute
rweaver@cert.org
Abstract. We estimate the number of active machines per hour infected
with the Conﬁcker-C worm, using a probability model of Conﬁcker-C’s
UDP P2P scanning behavior. For an observer with access to a propor-
tion δ of monitored IPv4 space, we derive the distribution of the number
of times a single infected host is observed scanning the monitored space,
based on a study of the P2P protocol, and on network and behavioral
variability by relative hour of the day. We use these distributional re-
sults in conjunction with the L´evy form of the Central Limit Theorem
to estimate the total number of active hosts in a single hour. We apply
the model to observed data from Conﬁcker-C scans sent over a 51-day
period (March 5th through April 24th, 2009) to a large private network.
Keywords: Botnets, Conﬁcker, Population Estimation, Probability
Models, Central Limit Theorem.
1 Introduction
When new botnets emerge, the classic question is, ”How big is it?” In the sta-
tistical literature, population estimation is based on mark-recapture models and
their extensions to a wide class of generalized linear models [6]. In network anal-
ysis, simple mark-recapture techniques, which reduce to counting intersections
among overlapping sets, have been applied to study botnet populations [3,8,9],
as well as to other phenomena such as peer-to-peer ﬁle sharing networks [10,16].
But the “overlapping sets” method is valid only for closed populations with di-
rect observation of individuals of interest, and equal probability of capture for
all individuals. Internet phenomena often violate these assumptions, resulting in
the need for more sophisticated modeling techniques.
Extending mark-recapture models to open populations is widely addressed in
the literature (eg. [17]), but network phen...


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

Input:
title:A Probabilistic Population Study of the Conficker-C Botnet
author:Rhiannon Weaver
A Probabilistic Population Study of the
Conﬁcker-C Botnet
Rhiannon Weaver
CERT, Software Engineering Institute
rweaver@cert.org
Abstract. We estimate the number of active machines per hour infected
with the Conﬁcker-C worm, using a probability model of Conﬁcker-C’s
UDP P2P scanning behavior. For an observer with access to a propor-
tion δ of monitored IPv4 space, we derive the distribution of the number
of times a single infected host is observed scanning the monitored space,
based on a study of the P2P protocol, and on network and behavioral
variability by relative hour of the day. We use these distributional re-
sults in conjunction with the L´evy form of the Central Limit Theorem
to estimate the total number of active hosts in a single hour. We apply
the model to observed data from Conﬁcker-C scans sent over a 51-day
period (March 5th through April 24th, 2009) to a large private network.
Keywords: Botnets, Conﬁcker, Population Estimation, Probability
Models, Central Limit Theorem.
1 Introduction
When new botnets emerge, the classic question is, ”How big is it?” In the sta-
tistical literature, population estimation is based on mark-recapture models and
their extensions to a wide class of generalized linear models [6]. In network anal-
ysis, simple mark-recapture techniques, which reduce to counting intersections
among overlapping sets, have been applied to study botnet populations [3,8,9],
as well as to other phenomena such as peer-to-peer ﬁle sharing networks [10,16].
But the “overlapping sets” method is valid only for closed populations with di-
rect observation of individuals of interest, and equal probability of capture for
all individuals. Internet phenomena often violate these assumptions, resulting in
the need for more sophisticated modeling techniques.
Extending mark-recapture models to open populations is widely addressed in
the literature (eg. [17]), but network phen...

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


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

Output:
安全论文分析：

title:Leakage of Dataset Properties in Multi-Party Machine Learning
author:Wanrong Zhang and
Shruti Tople and
Olga Ohrimenko
Leakage of Dataset Properties in
Multi-Party Machine Learning
Wanrong Zhang, Georgia Institute of Technology; Shruti Tople,
Microsoft Research; Olga Ohrimenko, The University of Melbourne
https://www.usenix.org/conference/usenixsecurity21/presentation/zhang-wanrong
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.Leakage of Dataset Properties in Multi-Party Machine Learning
Wanrong Zhang§
Georgia Institute of Technology
Shruti Tople
Microsoft Research
Olga Ohrimenko§
The University of Melbourne
Abstract
Secure multi-party machine learning allows several par-
ties to build a model on their pooled data to increase
utility while not explicitly sharing data with each other.
We show that such multi-party computation can cause
leakage of global dataset properties between the parties
even when parties obtain only black-box access to the
ﬁnal model. In particular, a “curious” party can infer
the distribution of sensitive attributes in other parties’
data with high accuracy. This raises concerns regarding
the conﬁdentiality of properties pertaining to the whole
dataset as opposed to individual data records. We show
that our attack can leak population-level properties in
datasets of different types, including tabular, text, and
graph data. To understand and measure the source of
leakage, we consider several models of correlation be-
tween a sensitive attribute and the rest of the data. Using
multiple machine learning models, we show that leakage
occurs even if the sensitive attribute is not included in
the training data and has a low correlation with other
attributes or the target variable.
1
Introduction
Modern machine learning models have been shown
to memorize information about their training...


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

Input:
title:Leakage of Dataset Properties in Multi-Party Machine Learning
author:Wanrong Zhang and
Shruti Tople and
Olga Ohrimenko
Leakage of Dataset Properties in
Multi-Party Machine Learning
Wanrong Zhang, Georgia Institute of Technology; Shruti Tople,
Microsoft Research; Olga Ohrimenko, The University of Melbourne
https://www.usenix.org/conference/usenixsecurity21/presentation/zhang-wanrong
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.Leakage of Dataset Properties in Multi-Party Machine Learning
Wanrong Zhang§
Georgia Institute of Technology
Shruti Tople
Microsoft Research
Olga Ohrimenko§
The University of Melbourne
Abstract
Secure multi-party machine learning allows several par-
ties to build a model on their pooled data to increase
utility while not explicitly sharing data with each other.
We show that such multi-party computation can cause
leakage of global dataset properties between the parties
even when parties obtain only black-box access to the
ﬁnal model. In particular, a “curious” party can infer
the distribution of sensitive attributes in other parties’
data with high accuracy. This raises concerns regarding
the conﬁdentiality of properties pertaining to the whole
dataset as opposed to individual data records. We show
that our attack can leak population-level properties in
datasets of different types, including tabular, text, and
graph data. To understand and measure the source of
leakage, we consider several models of correlation be-
tween a sensitive attribute and the rest of the data. Using
multiple machine learning models, we show that leakage
occurs even if the sensitive attribute is not included in
the training data and has a low correlation with other
attributes or the target variable.
1
Introduction
Modern machine learning models have been shown
to memorize information about their training...

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


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

Output:
安全论文分析：

title:SILVER: Fine-Grained and Transparent Protection Domain Primitives
in Commodity OS Kernel
author:Xi Xiong and
Peng Liu
SILVER: Fine-grained and Transparent
Protection Domain Primitives in Commodity OS
Kernel
Xi Xiong and Peng Liu
Penn State University
Abstract. Untrusted kernel extensions remain one of the major threats
to the security of commodity OS kernels. Current containment approaches
still have limitations in terms of security, granularity and ﬂexibility, pri-
marily due to the absence of secure resource management and commu-
nication methods. This paper presents SILVER, a framework that oﬀers
transparent protection domain primitives to achieve ﬁne-grained access
control and secure communication between OS kernel and extensions.
SILVER keeps track of security properties (e.g., owner principal and in-
tegrity level) of data objects in kernel space with a novel security-aware
memory management scheme, which enables ﬁne-grained access control
in an eﬀective manner. Moreover, SILVER introduces secure primitives
for data communication between protection domains based on a uniﬁed
integrity model. SILVER’s protection domain primitives provide great
ﬂexibility by allowing developers to explicitly deﬁne security properties
of individual program data, as well as control privilege delegation, data
transfer and service exportation. We have implemented a prototype of
SILVER in Linux. The evaluation results reveal that SILVER is eﬀective
against various kinds of kernel threats with a reasonable performance
and resource overhead.
Keywords: Protection domain, OS kernel, Virtualization
1
Introduction
As commodity operating systems are becoming more and more secure in terms
of privilege separation and intrusion containment at the OS level, attackers have
an increasing interest of directly subverting the OS kernel to take over the entire
computer system. Among all avenues towards attacking the OS kernel, untrusted
kernel extensions (e.g., third-party device drivers) are th...


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

Input:
title:SILVER: Fine-Grained and Transparent Protection Domain Primitives
in Commodity OS Kernel
author:Xi Xiong and
Peng Liu
SILVER: Fine-grained and Transparent
Protection Domain Primitives in Commodity OS
Kernel
Xi Xiong and Peng Liu
Penn State University
Abstract. Untrusted kernel extensions remain one of the major threats
to the security of commodity OS kernels. Current containment approaches
still have limitations in terms of security, granularity and ﬂexibility, pri-
marily due to the absence of secure resource management and commu-
nication methods. This paper presents SILVER, a framework that oﬀers
transparent protection domain primitives to achieve ﬁne-grained access
control and secure communication between OS kernel and extensions.
SILVER keeps track of security properties (e.g., owner principal and in-
tegrity level) of data objects in kernel space with a novel security-aware
memory management scheme, which enables ﬁne-grained access control
in an eﬀective manner. Moreover, SILVER introduces secure primitives
for data communication between protection domains based on a uniﬁed
integrity model. SILVER’s protection domain primitives provide great
ﬂexibility by allowing developers to explicitly deﬁne security properties
of individual program data, as well as control privilege delegation, data
transfer and service exportation. We have implemented a prototype of
SILVER in Linux. The evaluation results reveal that SILVER is eﬀective
against various kinds of kernel threats with a reasonable performance
and resource overhead.
Keywords: Protection domain, OS kernel, Virtualization
1
Introduction
As commodity operating systems are becoming more and more secure in terms
of privilege separation and intrusion containment at the OS level, attackers have
an increasing interest of directly subverting the OS kernel to take over the entire
computer system. Among all avenues towards attacking the OS kernel, untrusted
kernel extensions (e.g., third-party device drivers) are th...

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


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

Output:
安全论文分析：

title:Error injection-based study of soft error propagation in AMD Bulldozer
microprocessor module
author:Cristian Constantinescu and
Mike Butler and
Chris Weller
Error Injection-based Study of Soft Error Propagation in AMD Bulldozer
Microprocessor Module
Cristian Constantinescu*, Mike Butler** and Chris Weller*
Advanced Micro Devices, Inc.
* Fort Collins, CO, USA
** Sunnyvale, CA, USA
e-mail: {cristian.constantinescu; mike.butler; chris.weller}@amd.com
(SEU)  and
Abstract—  Single-event  upsets
single-event
transients  (SET)  may  lead  to  crashes  or  even  silent  data
corruption  (SDC)  in  microprocessors.    Error  detection  and
recovery features are employed to mitigate the impact of SEU
and  SET.  However,  these  features  add  performance,  area,
power,  and  cost  overheads.  As  a  result,  designers  must
concentrate their efforts on protecting the most sensitive areas
of  the  processor.  Simulated  error  injection was  used  to  study
the  propagation  of  the  SEU-induced  soft  errors  in  the  latest
AMD microprocessor  module,  Bulldozer. This paper  presents
the  Bulldozer  architecture,  error  injection  methodology,  and
experimental results. Propagation of  soft errors is quantified
by  derating  factors.  Error  injection  is  performed  both  at  the
module  and  unit  level,  derating  factors  and  simulation  times
being  compared.  Accuracy  is  assessed  by  deriving  confidence
intervals of the derating factors. The experiments point out the
most  sensitive  units  of  the  Bulldozer  module,  and  allow
efficient implementation of the error-handling features.
Keywords-
error
microprocessor design; RTL model; error handling
simulated
soft
errors;
injection;
I.
 INTRODUCTION
Energetic  particles,  such  as  neutrons  and  protons,  may
induce soft errors in the storage elements (SRAM, sequential
logic) of a microprocessor. Similar effects may be observed
due to alpha particles generated by th...


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

Input:
title:Error injection-based study of soft error propagation in AMD Bulldozer
microprocessor module
author:Cristian Constantinescu and
Mike Butler and
Chris Weller
Error Injection-based Study of Soft Error Propagation in AMD Bulldozer
Microprocessor Module
Cristian Constantinescu*, Mike Butler** and Chris Weller*
Advanced Micro Devices, Inc.
* Fort Collins, CO, USA
** Sunnyvale, CA, USA
e-mail: {cristian.constantinescu; mike.butler; chris.weller}@amd.com
(SEU)  and
Abstract—  Single-event  upsets
single-event
transients  (SET)  may  lead  to  crashes  or  even  silent  data
corruption  (SDC)  in  microprocessors.    Error  detection  and
recovery features are employed to mitigate the impact of SEU
and  SET.  However,  these  features  add  performance,  area,
power,  and  cost  overheads.  As  a  result,  designers  must
concentrate their efforts on protecting the most sensitive areas
of  the  processor.  Simulated  error  injection was  used  to  study
the  propagation  of  the  SEU-induced  soft  errors  in  the  latest
AMD microprocessor  module,  Bulldozer. This paper  presents
the  Bulldozer  architecture,  error  injection  methodology,  and
experimental results. Propagation of  soft errors is quantified
by  derating  factors.  Error  injection  is  performed  both  at  the
module  and  unit  level,  derating  factors  and  simulation  times
being  compared.  Accuracy  is  assessed  by  deriving  confidence
intervals of the derating factors. The experiments point out the
most  sensitive  units  of  the  Bulldozer  module,  and  allow
efficient implementation of the error-handling features.
Keywords-
error
microprocessor design; RTL model; error handling
simulated
soft
errors;
injection;
I.
 INTRODUCTION
Energetic  particles,  such  as  neutrons  and  protons,  may
induce soft errors in the storage elements (SRAM, sequential
logic) of a microprocessor. Similar effects may be observed
due to alpha particles generated by th...

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


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

Output:
安全论文分析：

title:Efficient High Hamming Distance CRCs for Embedded Networks
author:Justin Ray and
Philip Koopman
Efﬁcient High Hamming Distance CRCs for Embedded Networks
Justin Ray, Philip Koopman
Department of Electrical and Computer Engineering
Carnegie Mellon University
Pittsburgh, PA 15217
Email: {justinr2, koopman}@ece.cmu.edu
Abstract
Cyclic redundancy codes (CRCs) are widely used in
network transmission and data storage applications be-
cause they provide better error detection than lighter weight
checksum techniques. 24- and 32-bit CRC computations
are becoming necessary to provide sufﬁcient error detec-
tion capability (Hamming distance) for critical embedded
network applications. However, the computational cost of
such CRCs can be too high for resource-constrained em-
bedded systems, which are predominantly equipped with 8-
bit microcontrollers that have limited computing power and
small memory size. We evaluate the options for speeding
up CRC computations on 8-bit processors, including com-
paring variants of table lookup approaches for memory cost
and speed. We also evaluate classes of CRC generator poly-
nomials which have the same computational cost as 24- or
16-bit CRCs, but provide 32-bit CRC levels of error detec-
tion, and recommend good polynomials within those classes
for data word lengths typical of embedded networking ap-
plications.
1 Introduction
Using cyclic redundancy codes (CRCs) for error detec-
tion in embedded systems involves a tradeoff among speed,
memory consumption, and error detection effectiveness.
Because many embedded systems have signiﬁcant resource
constraints, it is important to understand the available trade-
off options and, if possible, ﬁnd ways to attain better error
detection at lower computational cost. In this paper we an-
alyze existing algorithm tradeoffs to quantify typical trade-
off parameters for embedded applications. Additionally, we
identify two new classes of 32-bit CRCs that can be calcu-
lated with the same computati...


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

Input:
title:Efficient High Hamming Distance CRCs for Embedded Networks
author:Justin Ray and
Philip Koopman
Efﬁcient High Hamming Distance CRCs for Embedded Networks
Justin Ray, Philip Koopman
Department of Electrical and Computer Engineering
Carnegie Mellon University
Pittsburgh, PA 15217
Email: {justinr2, koopman}@ece.cmu.edu
Abstract
Cyclic redundancy codes (CRCs) are widely used in
network transmission and data storage applications be-
cause they provide better error detection than lighter weight
checksum techniques. 24- and 32-bit CRC computations
are becoming necessary to provide sufﬁcient error detec-
tion capability (Hamming distance) for critical embedded
network applications. However, the computational cost of
such CRCs can be too high for resource-constrained em-
bedded systems, which are predominantly equipped with 8-
bit microcontrollers that have limited computing power and
small memory size. We evaluate the options for speeding
up CRC computations on 8-bit processors, including com-
paring variants of table lookup approaches for memory cost
and speed. We also evaluate classes of CRC generator poly-
nomials which have the same computational cost as 24- or
16-bit CRCs, but provide 32-bit CRC levels of error detec-
tion, and recommend good polynomials within those classes
for data word lengths typical of embedded networking ap-
plications.
1 Introduction
Using cyclic redundancy codes (CRCs) for error detec-
tion in embedded systems involves a tradeoff among speed,
memory consumption, and error detection effectiveness.
Because many embedded systems have signiﬁcant resource
constraints, it is important to understand the available trade-
off options and, if possible, ﬁnd ways to attain better error
detection at lower computational cost. In this paper we an-
alyze existing algorithm tradeoffs to quantify typical trade-
off parameters for embedded applications. Additionally, we
identify two new classes of 32-bit CRCs that can be calcu-
lated with the same computati...

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


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

Output:
安全论文分析：

title:A New Approach for Anonymous Password Authentication
author:Yanjiang Yang and
Jianying Zhou and
Jian Weng and
Feng Bao
2009 Annual Computer Security Applications Conference
A New Approach for Anonymous Password Authentication
Yanjiang Yang, Jianying Zhou
Institute for Infocomm Research
Singapore 138632, Singapore
Email: {yyang,jyzhou}@i2r.a-star.edu.sg
Jian Weng
Jinan University, Guangzhou, China
& Singapore Management University
Feng Bao
Institute for Infocomm Research
Singapore 138632, Singapore
Email: cryptjweng@gmail.com
Email: baofeng@i2r.a-star.edu.sg
Abstract—Anonymous password authentication reinforces
password authentication with the protection of user privacy.
Considering the increasing concern of
individual privacy
nowadays, anonymous password authentication represents a
promising privacy-preserving authentication primitive. How-
ever, anonymous password authentication in the standard
setting has several inherent weaknesses, making its practicality
questionable. In this paper, we propose a new and efﬁcient ap-
proach for anonymous password authentication. Our approach
assumes a different setting where users do not register their
passwords to the server; rather, they use passwords to protect
their authentication credentials. We present a concrete scheme,
and get over a number of challenges in securing password-
protected credentials against off-line guessing attacks. Our
experimental results conﬁrm that conventional anonymous
password authentication does not scale well, while our new
scheme demonstrates very good performance.
Keywords-anonymous password authentication; guessing at-
tack; unlinkability; scalability;
I. INTRODUCTION
Inputting one’s “user ID” and “password” has been the
most common practice for authentication since the advent of
computers, and is still gaining popularity. Every day, there
are probably billions of instances of password usage in cy-
berspace. The reason for the wide employment of password
authentication is straightforward...


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

Input:
title:A New Approach for Anonymous Password Authentication
author:Yanjiang Yang and
Jianying Zhou and
Jian Weng and
Feng Bao
2009 Annual Computer Security Applications Conference
A New Approach for Anonymous Password Authentication
Yanjiang Yang, Jianying Zhou
Institute for Infocomm Research
Singapore 138632, Singapore
Email: {yyang,jyzhou}@i2r.a-star.edu.sg
Jian Weng
Jinan University, Guangzhou, China
& Singapore Management University
Feng Bao
Institute for Infocomm Research
Singapore 138632, Singapore
Email: cryptjweng@gmail.com
Email: baofeng@i2r.a-star.edu.sg
Abstract—Anonymous password authentication reinforces
password authentication with the protection of user privacy.
Considering the increasing concern of
individual privacy
nowadays, anonymous password authentication represents a
promising privacy-preserving authentication primitive. How-
ever, anonymous password authentication in the standard
setting has several inherent weaknesses, making its practicality
questionable. In this paper, we propose a new and efﬁcient ap-
proach for anonymous password authentication. Our approach
assumes a different setting where users do not register their
passwords to the server; rather, they use passwords to protect
their authentication credentials. We present a concrete scheme,
and get over a number of challenges in securing password-
protected credentials against off-line guessing attacks. Our
experimental results conﬁrm that conventional anonymous
password authentication does not scale well, while our new
scheme demonstrates very good performance.
Keywords-anonymous password authentication; guessing at-
tack; unlinkability; scalability;
I. INTRODUCTION
Inputting one’s “user ID” and “password” has been the
most common practice for authentication since the advent of
computers, and is still gaining popularity. Every day, there
are probably billions of instances of password usage in cy-
berspace. The reason for the wide employment of password
authentication is straightforward...

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


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

Output:
安全论文分析：

title:On the impact of research network based testbeds on wide-area experiments
author:Himabindu Pucha and
Y. Charlie Hu and
Zhuoqing Morley Mao
On the Impact of Research Network Based Testbeds on
Wide-area Experiments
Himabindu Pucha
School of ECE
Purdue University
West Lafayette, IN 47906
hpucha@purdue.edu
Y. Charlie Hu
School of ECE
Purdue University
West Lafayette, IN 47906
ychu@purdue.edu
Z. Morley Mao
Dept. of EECS
University of Michigan
Ann Arbor, MI 48109
zmao@eecs.umich.edu
ABSTRACT
An important stage of wide-area systems and networking
research is to prototype a system to understand its per-
formance when deployed in the real Internet. A key re-
quirement of prototyping is that results obtained from the
prototype experiments be representative of the behavior if
the system were deployed over nodes connected to commer-
cial ISPs. Recently, distributed testbeds such as PlanetLab
and RON have become increasingly popular for performing
wide-area experimentation. However, such testbeds typi-
cally consist of a signiﬁcant fraction of nodes with connec-
tivity to research and education networks which potentially
hinder their usability in prototyping systems.
In this paper, we investigate the impact of testbeds with
connectivity to research and education networks on the ap-
plications and network services so that such testbeds can
be leveraged for evaluation and prototyping. Speciﬁcally,
we investigate when the representativeness of wide-area ex-
periments deployed on such testbeds is aﬀected by studying
the routing paths that applications use over such testbeds.
We then investigate how the representativeness of wide-area
experiments is aﬀected by studying the performance prop-
erties of such paths. We further measure the impact of us-
ing such testbeds on application performance via application
case studies. Finally, we propose a technique that uses the
currently available testbeds but reduces their bias by ex-
posing applications evaluated to network conditions m...


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

Input:
title:On the impact of research network based testbeds on wide-area experiments
author:Himabindu Pucha and
Y. Charlie Hu and
Zhuoqing Morley Mao
On the Impact of Research Network Based Testbeds on
Wide-area Experiments
Himabindu Pucha
School of ECE
Purdue University
West Lafayette, IN 47906
hpucha@purdue.edu
Y. Charlie Hu
School of ECE
Purdue University
West Lafayette, IN 47906
ychu@purdue.edu
Z. Morley Mao
Dept. of EECS
University of Michigan
Ann Arbor, MI 48109
zmao@eecs.umich.edu
ABSTRACT
An important stage of wide-area systems and networking
research is to prototype a system to understand its per-
formance when deployed in the real Internet. A key re-
quirement of prototyping is that results obtained from the
prototype experiments be representative of the behavior if
the system were deployed over nodes connected to commer-
cial ISPs. Recently, distributed testbeds such as PlanetLab
and RON have become increasingly popular for performing
wide-area experimentation. However, such testbeds typi-
cally consist of a signiﬁcant fraction of nodes with connec-
tivity to research and education networks which potentially
hinder their usability in prototyping systems.
In this paper, we investigate the impact of testbeds with
connectivity to research and education networks on the ap-
plications and network services so that such testbeds can
be leveraged for evaluation and prototyping. Speciﬁcally,
we investigate when the representativeness of wide-area ex-
periments deployed on such testbeds is aﬀected by studying
the routing paths that applications use over such testbeds.
We then investigate how the representativeness of wide-area
experiments is aﬀected by studying the performance prop-
erties of such paths. We further measure the impact of us-
ing such testbeds on application performance via application
case studies. Finally, we propose a technique that uses the
currently available testbeds but reduces their bias by ex-
posing applications evaluated to network conditions m...

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


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

Output:
安全论文分析：

title:CADE: Detecting and Explaining Concept Drift Samples for Security
Applications
author:Limin Yang and
Wenbo Guo and
Qingying Hao and
Arridhana Ciptadi and
Ali Ahmadzadeh and
Xinyu Xing and
Gang Wang
CADE: Detecting and Explaining Concept Drift
Samples for Security Applications
Limin Yang, University of Illinois at Urbana-Champaign; Wenbo Guo,
The Pennsylvania State University; Qingying Hao, University of Illinois at
Urbana-Champaign; Arridhana Ciptadi and Ali Ahmadzadeh, Blue Hexagon;
Xinyu Xing, The Pennsylvania State University; Gang Wang, University of
Illinois at Urbana-Champaign
https://www.usenix.org/conference/usenixsecurity21/presentation/yang-limin
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.CADE: Detecting and Explaining Concept Drift Samples
for Security Applications
Limin Yang*, Wenbo Guo†, Qingying Hao*, Arridhana Ciptadi‡
Ali Ahmadzadeh‡, Xinyu Xing†, Gang Wang*
*University of Illinois at Urbana-Champaign †The Pennsylvania State University ‡Blue Hexagon
liminy2@illinois.edu, wzg13@ist.psu.edu, qhao2@illinois.edu, {arri, ali}@bluehexagon.ai, xxing@ist.psu.edu, gangw@illinois.edu
Abstract
Concept drift poses a critical challenge to deploy machine
learning models to solve practical security problems. Due
to the dynamic behavior changes of attackers (and/or the
benign counterparts), the testing data distribution is often
shifting from the original training data over time, causing
major failures to the deployed model.
To combat concept drift, we present a novel system CADE
aiming to 1) detect drifting samples that deviate from existing
classes, and 2) provide explanations to reason the detected
drift. Unlike traditional approaches (that require a large num-
ber of new labels to determine concept drift statistically), we
aim to identify individual drifting samples as they arrive. Rec-
og...


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

Input:
title:CADE: Detecting and Explaining Concept Drift Samples for Security
Applications
author:Limin Yang and
Wenbo Guo and
Qingying Hao and
Arridhana Ciptadi and
Ali Ahmadzadeh and
Xinyu Xing and
Gang Wang
CADE: Detecting and Explaining Concept Drift
Samples for Security Applications
Limin Yang, University of Illinois at Urbana-Champaign; Wenbo Guo,
The Pennsylvania State University; Qingying Hao, University of Illinois at
Urbana-Champaign; Arridhana Ciptadi and Ali Ahmadzadeh, Blue Hexagon;
Xinyu Xing, The Pennsylvania State University; Gang Wang, University of
Illinois at Urbana-Champaign
https://www.usenix.org/conference/usenixsecurity21/presentation/yang-limin
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.CADE: Detecting and Explaining Concept Drift Samples
for Security Applications
Limin Yang*, Wenbo Guo†, Qingying Hao*, Arridhana Ciptadi‡
Ali Ahmadzadeh‡, Xinyu Xing†, Gang Wang*
*University of Illinois at Urbana-Champaign †The Pennsylvania State University ‡Blue Hexagon
liminy2@illinois.edu, wzg13@ist.psu.edu, qhao2@illinois.edu, {arri, ali}@bluehexagon.ai, xxing@ist.psu.edu, gangw@illinois.edu
Abstract
Concept drift poses a critical challenge to deploy machine
learning models to solve practical security problems. Due
to the dynamic behavior changes of attackers (and/or the
benign counterparts), the testing data distribution is often
shifting from the original training data over time, causing
major failures to the deployed model.
To combat concept drift, we present a novel system CADE
aiming to 1) detect drifting samples that deviate from existing
classes, and 2) provide explanations to reason the detected
drift. Unlike traditional approaches (that require a large num-
ber of new labels to determine concept drift statistically), we
aim to identify individual drifting samples as they arrive. Rec-
og...

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


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

Output:
安全论文分析：

title:Implementing Pushback: Router-Based Defense Against DDoS Attacks
author:John Ioannidis and
Steven M. Bellovin
Implementing Pushback: Router-Based Defense Against DDoS Attacks
John Ioannidis
ji@research.att.com
AT&T Labs Research
Steven M. Bellovin
smb@research.att.com
AT&T Labs Research
Abstract
Pushback is a mechanism for defending against dis-
tributed denial-of-service (DDoS) attacks. DDoS attacks
are treated as a congestion-control problem, but because
most such congestion is caused by malicious hosts not obey-
ing traditional end-to-end congestion control, the problem
must be handled by the routers. Functionality is added to
each router to detect and preferentially drop packets that
probably belong to an attack. Upstream routers are also
notiﬁed to drop such packets (hence the term Pushback) in
order that the router’s resources be used to route legitimate
trafﬁc. In this paper we present an architecture for Push-
back, its implementation under FreeBSD, and suggestions
for how such a system can be implemented in core routers.
1. Introduction
Distributed Denial of Service (DDoS) attacks have be-
come an increasingly frequent disturbance of the global
Internet[15]. They are very hard to defend against because
they do not target speciﬁc vulnerabilities of systems, but
rather the very fact that the target is connected to the net-
work. All known DDoS attacks take advantage of the large
number of hosts on the Internet that have poor or no se-
curity; the perpetrators break into such hosts, install slave
programs, and at the right time instruct thousands of these
slave programs to attack a particular destination. The attack
does not have to exploit a security hole at the target to cause
a problem (although that would exacerbate the problem, to
the attacker’s beneﬁt), and there is almost nothing the vic-
tim can do to protect itself.
Under normal operating conditions, and assuming that
network links and router processing capacity have been ade-
quately provisione...


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

Input:
title:Implementing Pushback: Router-Based Defense Against DDoS Attacks
author:John Ioannidis and
Steven M. Bellovin
Implementing Pushback: Router-Based Defense Against DDoS Attacks
John Ioannidis
ji@research.att.com
AT&T Labs Research
Steven M. Bellovin
smb@research.att.com
AT&T Labs Research
Abstract
Pushback is a mechanism for defending against dis-
tributed denial-of-service (DDoS) attacks. DDoS attacks
are treated as a congestion-control problem, but because
most such congestion is caused by malicious hosts not obey-
ing traditional end-to-end congestion control, the problem
must be handled by the routers. Functionality is added to
each router to detect and preferentially drop packets that
probably belong to an attack. Upstream routers are also
notiﬁed to drop such packets (hence the term Pushback) in
order that the router’s resources be used to route legitimate
trafﬁc. In this paper we present an architecture for Push-
back, its implementation under FreeBSD, and suggestions
for how such a system can be implemented in core routers.
1. Introduction
Distributed Denial of Service (DDoS) attacks have be-
come an increasingly frequent disturbance of the global
Internet[15]. They are very hard to defend against because
they do not target speciﬁc vulnerabilities of systems, but
rather the very fact that the target is connected to the net-
work. All known DDoS attacks take advantage of the large
number of hosts on the Internet that have poor or no se-
curity; the perpetrators break into such hosts, install slave
programs, and at the right time instruct thousands of these
slave programs to attack a particular destination. The attack
does not have to exploit a security hole at the target to cause
a problem (although that would exacerbate the problem, to
the attacker’s beneﬁt), and there is almost nothing the vic-
tim can do to protect itself.
Under normal operating conditions, and assuming that
network links and router processing capacity have been ade-
quately provisione...

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


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

Output:
安全论文分析：

title:TrustGraph: Trusted Graphics Subsystem for High Assurance Systems
author:Hamed Okhravi and
David M. Nicol
2009 Annual Computer Security Applications Conference
TrustGraph: Trusted Graphics Subsystem for High Assurance Systems
Hamed Okhravi
David M. Nicol
Department of Electrical and Computer Engineering
Department of Electrical and Computer Engineering
University of Illinois at Urbana-Champaign
University of Illinois at Urbana-Champaign
Urbana, USA
Email: okhravi2@illinois.edu
Urbana, USA
Email: dmnicol@illinois.edu
Abstract—High assurance MILS and MLS systems require
strict limitation of the interactions between different security
compartments based on a security policy. Virtualization can
be used to provide a high degree of separation in such
systems. Even with perfect isolation, however, the I/O devices
are shared between different security compartments. Among
the I/O controllers, the graphics subsystem is the largest
and the most complex. This paper describes the design and
implementation of TrustGraph, a trusted graphics subsystem
for high assurance systems. First, we explain the threats and
attacks possible against an unsecured graphics subsystem. We
then describe the design of TrustGraph, the security principles
it is built upon, and its implementation. Finally, we verify
our implementation through different levels of veriﬁcation
which include functionality testing for simple operations, attack
testing for security mechanisms, and formal veriﬁcation for the
critical components of the implementation. An analysis of the
graphics API covert channel attack is presented, its channel
capacity is measured, and the capacity is reduced using the
idea of fuzzy time.
Keywords-Trusted Graphics; Multi-Level Security; Virtual-
ization; Formal Veriﬁcation; Covert Channel Analysis
I. INTRODUCTION
High assurance secure systems require strict compliance
of the system activities with a security policy. Multiple in-
dependent levels of security (MILS) and multilevel securi...


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

Input:
title:TrustGraph: Trusted Graphics Subsystem for High Assurance Systems
author:Hamed Okhravi and
David M. Nicol
2009 Annual Computer Security Applications Conference
TrustGraph: Trusted Graphics Subsystem for High Assurance Systems
Hamed Okhravi
David M. Nicol
Department of Electrical and Computer Engineering
Department of Electrical and Computer Engineering
University of Illinois at Urbana-Champaign
University of Illinois at Urbana-Champaign
Urbana, USA
Email: okhravi2@illinois.edu
Urbana, USA
Email: dmnicol@illinois.edu
Abstract—High assurance MILS and MLS systems require
strict limitation of the interactions between different security
compartments based on a security policy. Virtualization can
be used to provide a high degree of separation in such
systems. Even with perfect isolation, however, the I/O devices
are shared between different security compartments. Among
the I/O controllers, the graphics subsystem is the largest
and the most complex. This paper describes the design and
implementation of TrustGraph, a trusted graphics subsystem
for high assurance systems. First, we explain the threats and
attacks possible against an unsecured graphics subsystem. We
then describe the design of TrustGraph, the security principles
it is built upon, and its implementation. Finally, we verify
our implementation through different levels of veriﬁcation
which include functionality testing for simple operations, attack
testing for security mechanisms, and formal veriﬁcation for the
critical components of the implementation. An analysis of the
graphics API covert channel attack is presented, its channel
capacity is measured, and the capacity is reduced using the
idea of fuzzy time.
Keywords-Trusted Graphics; Multi-Level Security; Virtual-
ization; Formal Veriﬁcation; Covert Channel Analysis
I. INTRODUCTION
High assurance secure systems require strict compliance
of the system activities with a security policy. Multiple in-
dependent levels of security (MILS) and multilevel securi...

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


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

Output:
安全论文分析：

title:Component-Based Formal Analysis of 5G-AKA: Channel Assumptions and
Session Confusion
author:Cas Cremers and
Martin Dehnel-Wild
Component-Based Formal Analysis of 5G-AKA:
Channel Assumptions and Session Confusion
Cas Cremers
Martin Dehnel-Wild
CISPA Helmholtz Center for Information Security, Germany
Department of Computer Science, University of Oxford
cremers@cispa.saarland
martin@dehnelwild.co.uk
Abstract—The 5G mobile telephony standards are nearing
completion; upon adoption these will be used by billions across
the globe. Ensuring the security of 5G communication is of the
utmost importance, building trust in a critical component of
everyday life and national infrastructure.
We perform ﬁne-grained formal analysis of 5G’s main au-
thentication and key agreement protocol (AKA), and provide
the ﬁrst models to explicitly consider all parties deﬁned by the
protocol speciﬁcation. Our analysis reveals that the security of
5G-AKA critically relies on unstated assumptions on the inner
workings of the underlying channels. In practice this means that
following the 5G-AKA speciﬁcation, a provider can easily and
‘correctly’ implement the standard insecurely, leaving the protocol
vulnerable to a security-critical race condition. We provide the
ﬁrst models and analysis considering component and channel
compromise in 5G, whose results further demonstrate the fragility
and subtle trust assumptions of the 5G-AKA protocol.
We propose formally veriﬁed ﬁxes to the encountered issues,
and have worked with 3GPP to ensure these ﬁxes are adopted.
I.
INTRODUCTION
The 5th Generation (5G) mobile networks and telecom-
munications standard is currently under development, and are
nearly ﬁnalised. A crucial building block in this standard is the
“5G Authentication and Key Agreement” (5G-AKA) protocol.
This protocol is developed by 3GPP, and is an evolution
of the AKA variants used in 3G and 4G, and is used to
authenticate and establish keys between the involved parties.
These parties inclu...


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

Input:
title:Component-Based Formal Analysis of 5G-AKA: Channel Assumptions and
Session Confusion
author:Cas Cremers and
Martin Dehnel-Wild
Component-Based Formal Analysis of 5G-AKA:
Channel Assumptions and Session Confusion
Cas Cremers
Martin Dehnel-Wild
CISPA Helmholtz Center for Information Security, Germany
Department of Computer Science, University of Oxford
cremers@cispa.saarland
martin@dehnelwild.co.uk
Abstract—The 5G mobile telephony standards are nearing
completion; upon adoption these will be used by billions across
the globe. Ensuring the security of 5G communication is of the
utmost importance, building trust in a critical component of
everyday life and national infrastructure.
We perform ﬁne-grained formal analysis of 5G’s main au-
thentication and key agreement protocol (AKA), and provide
the ﬁrst models to explicitly consider all parties deﬁned by the
protocol speciﬁcation. Our analysis reveals that the security of
5G-AKA critically relies on unstated assumptions on the inner
workings of the underlying channels. In practice this means that
following the 5G-AKA speciﬁcation, a provider can easily and
‘correctly’ implement the standard insecurely, leaving the protocol
vulnerable to a security-critical race condition. We provide the
ﬁrst models and analysis considering component and channel
compromise in 5G, whose results further demonstrate the fragility
and subtle trust assumptions of the 5G-AKA protocol.
We propose formally veriﬁed ﬁxes to the encountered issues,
and have worked with 3GPP to ensure these ﬁxes are adopted.
I.
INTRODUCTION
The 5th Generation (5G) mobile networks and telecom-
munications standard is currently under development, and are
nearly ﬁnalised. A crucial building block in this standard is the
“5G Authentication and Key Agreement” (5G-AKA) protocol.
This protocol is developed by 3GPP, and is an evolution
of the AKA variants used in 3G and 4G, and is used to
authenticate and establish keys between the involved parties.
These parties inclu...

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


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

Output:
安全论文分析：

title:New Constructions and Practical Applications for Private Stream Searching
(Extended Abstract)
author:John Bethencourt and
Dawn Xiaodong Song and
Brent Waters
New Constructions and Practical Applications for
Private Stream Searching (Extended Abstract)
John Bethencourt
Dawn Song
Carnegie Mellon University
Carnegie Mellon University
bethenco@cs.cmu.edu
dawnsong@cmu.edu
Brent Waters
SRI International
bwaters@csl.sri.com
Abstract
A system for private stream searching allows a client
to retrieve documents matching some search criteria
from a remote server while the server evaluating the re-
quest remains provably oblivious to the search criteria.
In this extended abstract, we give a high level outline
of a new scheme for this problem and an experimental
analysis of its scalability. The new scheme is highly
eﬃcient in practice. We demonstrate the practical ap-
plicability of the scheme by considering its performance
in the demanding scenario of providing a privacy pre-
serving version of the Google News Alerts service.
1 Introduction
Sources of information on the Internet include con-
ventional websites, time sensitive web pages such as
news articles and blog posts, newsgroup posts, online
auctions, and web based forums or classiﬁed ads. To
make use of these resources we need search mechanisms
that distill the information relevant to each user. Nor-
mally, such mechanisms require the user to provide a
server with a query such as a textual keyword that
the server will compare against the documents in some
large data set. This model becomes problematic for
applications in which the user would like to hide the
search criteria. A user might want to protect the pri-
vacy of his search queries for a variety of reasons, in-
cluding protection of commercial interests and personal
privacy. Such privacy issues were brought into the
spotlight in 2005 when the U.S. Department of Jus-
tice subpoenaed records of search terms from popular
web search engines.
Trivially, search priv...


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

Input:
title:New Constructions and Practical Applications for Private Stream Searching
(Extended Abstract)
author:John Bethencourt and
Dawn Xiaodong Song and
Brent Waters
New Constructions and Practical Applications for
Private Stream Searching (Extended Abstract)
John Bethencourt
Dawn Song
Carnegie Mellon University
Carnegie Mellon University
bethenco@cs.cmu.edu
dawnsong@cmu.edu
Brent Waters
SRI International
bwaters@csl.sri.com
Abstract
A system for private stream searching allows a client
to retrieve documents matching some search criteria
from a remote server while the server evaluating the re-
quest remains provably oblivious to the search criteria.
In this extended abstract, we give a high level outline
of a new scheme for this problem and an experimental
analysis of its scalability. The new scheme is highly
eﬃcient in practice. We demonstrate the practical ap-
plicability of the scheme by considering its performance
in the demanding scenario of providing a privacy pre-
serving version of the Google News Alerts service.
1 Introduction
Sources of information on the Internet include con-
ventional websites, time sensitive web pages such as
news articles and blog posts, newsgroup posts, online
auctions, and web based forums or classiﬁed ads. To
make use of these resources we need search mechanisms
that distill the information relevant to each user. Nor-
mally, such mechanisms require the user to provide a
server with a query such as a textual keyword that
the server will compare against the documents in some
large data set. This model becomes problematic for
applications in which the user would like to hide the
search criteria. A user might want to protect the pri-
vacy of his search queries for a variety of reasons, in-
cluding protection of commercial interests and personal
privacy. Such privacy issues were brought into the
spotlight in 2005 when the U.S. Department of Jus-
tice subpoenaed records of search terms from popular
web search engines.
Trivially, search priv...

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


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

Output:
安全论文分析：

title:Fighting malicious code: an eternal struggle
author:Christopher Kruegel
Fighting Malicious Code – An Eternal Struggle
Christopher Kruegel
University of California, Santa Barbara
chris@cs.ucsb.edu
Categories and Subject Descriptors
D.4.6 [Security and Protection]: Invasive Software
Keywords
Intrusion/anomaly detection and malware mitigation
Speaker’s Bio
of  California,
Christopher  Kruegel  is  a  Professor  in
the  Computer  Science  Dept.  at  the
University
Santa
Barbara.  He  is  also  a  co-founder  of
Lastline,  Inc.,  where  he  currently
serves
the  Chief  Scientist.
Christopher's  research
interests  are
computer
communications
security, with an emphasis on malware
analysis  and  detection,  web  security,
and  intrusion  detection.  He  enjoys  to
build  systems  and  to  make  security
tools
public.
Christopher  has  published  more  than
100 conference and journal papers. He is a recipient of the NSF
CAREER Award, the MIT Technology Review TR35 Award for
young innovators, an IBM Faculty Award, and several best paper
awards.
available
to
the
as
and
ABSTRACT
Despite  many  years  of  research  and  significant  commercial
investment,  the  malware  problem  is  far  from  being  solved  (or
even  reasonably  well  contained).  Every  week,  the  main-  stream
press publishes articles that describe yet another in- cident where
millions  of  credit  cards  were  leaked,  a  large  company  discloses
that  adversaries  had  remote  access  to  its  corporate  secrets  for
years,  and  we  discover  a  new  botnet  with  tens  of  thousands  of
compromised machines. Clearly, this situation is not acceptable,
but why isn't it getting any better?
In this talk, I will discuss some of the reasons why the malware
problem  is  fundamentally  hard,  and  why  existing  defenses  in
industry are no longer working. I will then outline progress that
researchers  and  industry  have  made  over  the  last  years,  a...


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

Input:
title:Fighting malicious code: an eternal struggle
author:Christopher Kruegel
Fighting Malicious Code – An Eternal Struggle
Christopher Kruegel
University of California, Santa Barbara
chris@cs.ucsb.edu
Categories and Subject Descriptors
D.4.6 [Security and Protection]: Invasive Software
Keywords
Intrusion/anomaly detection and malware mitigation
Speaker’s Bio
of  California,
Christopher  Kruegel  is  a  Professor  in
the  Computer  Science  Dept.  at  the
University
Santa
Barbara.  He  is  also  a  co-founder  of
Lastline,  Inc.,  where  he  currently
serves
the  Chief  Scientist.
Christopher's  research
interests  are
computer
communications
security, with an emphasis on malware
analysis  and  detection,  web  security,
and  intrusion  detection.  He  enjoys  to
build  systems  and  to  make  security
tools
public.
Christopher  has  published  more  than
100 conference and journal papers. He is a recipient of the NSF
CAREER Award, the MIT Technology Review TR35 Award for
young innovators, an IBM Faculty Award, and several best paper
awards.
available
to
the
as
and
ABSTRACT
Despite  many  years  of  research  and  significant  commercial
investment,  the  malware  problem  is  far  from  being  solved  (or
even  reasonably  well  contained).  Every  week,  the  main-  stream
press publishes articles that describe yet another in- cident where
millions  of  credit  cards  were  leaked,  a  large  company  discloses
that  adversaries  had  remote  access  to  its  corporate  secrets  for
years,  and  we  discover  a  new  botnet  with  tens  of  thousands  of
compromised machines. Clearly, this situation is not acceptable,
but why isn't it getting any better?
In this talk, I will discuss some of the reasons why the malware
problem  is  fundamentally  hard,  and  why  existing  defenses  in
industry are no longer working. I will then outline progress that
researchers  and  industry  have  made  over  the  last  years,  a...

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


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

Output:
安全论文分析：

title:Spectroscopy of Traceroute Delays
author:Andre Broido and
Young Hyun and
Kimberly C. Claffy
Spectroscopy of Traceroute Delays
Andre Broido, Young Hyun, and kc claffy
Cooperative Association for Internet Data Analysis,
SDSC, University of California, San Diego
{broido, youngh, kc}@caida.org
Abstract. We analyze delays of traceroute probes, i.e. packets that elicit ICMP
TimeExceeded messages, for a full range of probe sizes up to 9000 bytes as ob-
served on unloaded high-end routers. Our ultimate motivation is to use traceroute
RTTs for Internet mapping of router and PoP (ISP point-of-presence) level nodes,
including potentially gleaning information on equipment models, link technolo-
gies, capacities, latencies, and spatial positions. To our knowledge it is the ﬁrst
study to examine in a reliable testbed setting the detailed statistics of ICMP re-
sponse generation.
We ﬁnd that two fundamental assumptions about ICMP often do not hold in
modern routers, namely that ICMP delays are a linear function of packet size and
that ICMP generation rate is equal to the capacity of the inteface on which probes
are received. The primary causes of these violations appear to be optimizations
that suppress size dependence, e.g. buffer carving, and rate-limiting of internal
ICMP packet and bit rates. Our results suggest that the linear model of packet
delay as a function of packet size merits revisiting for many situations, especially
for packets over 1500 bytes. Our ﬁndings also suggest possibilities of developing
new techniques for bandwidth estimation and router ﬁngerprinting.
1
Introduction
Remote network mapping is usually done via active measurement. Generally a measure-
ment host sends packets that trigger ICMP replies from routers, and the reply information
is integrated into a map. ICMP time exceeded, echo reply and port unreachable responses
are commonly elicited for this purpose.
An ICMP reply carries binary (“host is alive”), discrete (“9 hops away”) and temporal
(“r...


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

Input:
title:Spectroscopy of Traceroute Delays
author:Andre Broido and
Young Hyun and
Kimberly C. Claffy
Spectroscopy of Traceroute Delays
Andre Broido, Young Hyun, and kc claffy
Cooperative Association for Internet Data Analysis,
SDSC, University of California, San Diego
{broido, youngh, kc}@caida.org
Abstract. We analyze delays of traceroute probes, i.e. packets that elicit ICMP
TimeExceeded messages, for a full range of probe sizes up to 9000 bytes as ob-
served on unloaded high-end routers. Our ultimate motivation is to use traceroute
RTTs for Internet mapping of router and PoP (ISP point-of-presence) level nodes,
including potentially gleaning information on equipment models, link technolo-
gies, capacities, latencies, and spatial positions. To our knowledge it is the ﬁrst
study to examine in a reliable testbed setting the detailed statistics of ICMP re-
sponse generation.
We ﬁnd that two fundamental assumptions about ICMP often do not hold in
modern routers, namely that ICMP delays are a linear function of packet size and
that ICMP generation rate is equal to the capacity of the inteface on which probes
are received. The primary causes of these violations appear to be optimizations
that suppress size dependence, e.g. buffer carving, and rate-limiting of internal
ICMP packet and bit rates. Our results suggest that the linear model of packet
delay as a function of packet size merits revisiting for many situations, especially
for packets over 1500 bytes. Our ﬁndings also suggest possibilities of developing
new techniques for bandwidth estimation and router ﬁngerprinting.
1
Introduction
Remote network mapping is usually done via active measurement. Generally a measure-
ment host sends packets that trigger ICMP replies from routers, and the reply information
is integrated into a map. ICMP time exceeded, echo reply and port unreachable responses
are commonly elicited for this purpose.
An ICMP reply carries binary (“host is alive”), discrete (“9 hops away”) and temporal
(“r...

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


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

Output:
安全论文分析：

title:BlackMirror: Preventing Wallhacks in 3D Online FPS Games
author:Seonghyun Park and
Adil Ahmad and
Byoungyoung Lee
BlackMirror: Preventing Wallhacks in 3D Online FPS Games
Seonghyun Park
Seoul National University
shpark95@snu.ac.kr
Adil Ahmad
Purdue University
ahmad37@purdue.edu
Byoungyoung Lee∗
Seoul National University
byoungyoung@snu.ac.kr
ABSTRACT
Online gaming, with a reported 152 billion US dollar market, is
immensely popular today. One of the critical issues in multiplayer
online games is cheating, in which a player uses an illegal methodol-
ogy to create an advantage beyond honest game play. For example,
wallhacks, the main focus of this work, animate enemy objects on a
cheating player’s screen, despite being actually hidden behind walls
(or other occluding objects). Since such cheats discourage honest
players and cause game companies to lose revenue, gaming compa-
nies deploy mitigation solutions alongside game applications on
the player’s machine. However, their solutions are fundamentally
flawed since they are deployed on a machine where the attacker
has absolute control.
This paper presents BlackMirror, a new game design with a
trusted execution environment, Intel SGX. Leveraging strong data
isolation guarantees provided by SGX, BlackMirror addresses
the root cause of wallhacks by storing sensitive game data within
an SGX-protected region. BlackMirror overcomes various chal-
lenges in achieving its goal including partitioning game client to
avoid SGX’s memory limitations, as well as cross-checking in-
puts provided by untrusted keyboard and mouse. Furthermore,
BlackMirror supports GPU-based 3D rendering by performing
highly-accurate visibility testing and disclosing sensitive data only
when it is required in a given game scene. We protect Quake II
using BlackMirror, and our evaluation results demonstrate that
BlackMirror-protected Quake II is fully functional and secure.
More specifically, BlackMirror incurs 0.57 ms per-frame delays on
average, whic...


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

Input:
title:BlackMirror: Preventing Wallhacks in 3D Online FPS Games
author:Seonghyun Park and
Adil Ahmad and
Byoungyoung Lee
BlackMirror: Preventing Wallhacks in 3D Online FPS Games
Seonghyun Park
Seoul National University
shpark95@snu.ac.kr
Adil Ahmad
Purdue University
ahmad37@purdue.edu
Byoungyoung Lee∗
Seoul National University
byoungyoung@snu.ac.kr
ABSTRACT
Online gaming, with a reported 152 billion US dollar market, is
immensely popular today. One of the critical issues in multiplayer
online games is cheating, in which a player uses an illegal methodol-
ogy to create an advantage beyond honest game play. For example,
wallhacks, the main focus of this work, animate enemy objects on a
cheating player’s screen, despite being actually hidden behind walls
(or other occluding objects). Since such cheats discourage honest
players and cause game companies to lose revenue, gaming compa-
nies deploy mitigation solutions alongside game applications on
the player’s machine. However, their solutions are fundamentally
flawed since they are deployed on a machine where the attacker
has absolute control.
This paper presents BlackMirror, a new game design with a
trusted execution environment, Intel SGX. Leveraging strong data
isolation guarantees provided by SGX, BlackMirror addresses
the root cause of wallhacks by storing sensitive game data within
an SGX-protected region. BlackMirror overcomes various chal-
lenges in achieving its goal including partitioning game client to
avoid SGX’s memory limitations, as well as cross-checking in-
puts provided by untrusted keyboard and mouse. Furthermore,
BlackMirror supports GPU-based 3D rendering by performing
highly-accurate visibility testing and disclosing sensitive data only
when it is required in a given game scene. We protect Quake II
using BlackMirror, and our evaluation results demonstrate that
BlackMirror-protected Quake II is fully functional and secure.
More specifically, BlackMirror incurs 0.57 ms per-frame delays on
average, whic...

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


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

Output:
安全论文分析：

title:Exploiting social networking sites for spam
author:Markus Huber and
Martin Mulazzani and
Edgar R. Weippl and
Gerhard Kitzler and
Sigrun Goluch
Exploiting Social Networking Sites for Spam
Markus Huber, Martin Mulazzani, Edgar Weippl, Gerhard Kitzler, Sigrun Goluch
SBA Research
{mhuber,mmulazzani,eweippl,gkitzler,sgoluch}@sba-research.org
Favoritenstrasse 16
AT-1040 Vienna, Austria
ABSTRACT
In the ongoing arms race between spammers and the multi-
million dollar anti-spam industry, the number of unsolicited
e-mail messages (better known as “spam”) and phishing has
increased heavily in the last decade. In this paper, we show
that our friend-in-the-middle attacks on social networking
sites (SNSs) can be used to harvest social data in an auto-
mated fashion. This social data can then be exploited for
large-scale attacks such as context-aware spam and social-
phishing. We prove the feasibility of our attack exemplarily
on Facebook and identify possible consequences based on a
mathematical model and simulations. Alarmingly, all major
SNSs are vulnerable to our attack as they fail to secure the
network layer appropriately.
Categories and Subject Descriptors
K.6.5 [Management of Computing and Information
Systems]: Security and Protection; E.1 [Data Structures]:
Graphs and networks
General Terms
Security, experimentation, theory
Keywords
Social network security, spam, phishing
1.
INTRODUCTION
Criminals, as well as direct marketers, continue to clog
mailboxes with unsolicited bulk e-mails (e.g., spam and phish-
ing) in the hope of ﬁnancial gain. So far, their strategy is
straightforward, namely to send out a vast numbers of unso-
licited e-mails in order to maximize proﬁt on the tiny frac-
tion that falls for their scams. Their pool of target e-mail
addresses is normally based upon data harvested with web
crawlers or trojans, sometimes even including plain dictionary-
based guessing of valid targets. Previous research indicates
that social networking sites (SNSs) might ch...


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

Input:
title:Exploiting social networking sites for spam
author:Markus Huber and
Martin Mulazzani and
Edgar R. Weippl and
Gerhard Kitzler and
Sigrun Goluch
Exploiting Social Networking Sites for Spam
Markus Huber, Martin Mulazzani, Edgar Weippl, Gerhard Kitzler, Sigrun Goluch
SBA Research
{mhuber,mmulazzani,eweippl,gkitzler,sgoluch}@sba-research.org
Favoritenstrasse 16
AT-1040 Vienna, Austria
ABSTRACT
In the ongoing arms race between spammers and the multi-
million dollar anti-spam industry, the number of unsolicited
e-mail messages (better known as “spam”) and phishing has
increased heavily in the last decade. In this paper, we show
that our friend-in-the-middle attacks on social networking
sites (SNSs) can be used to harvest social data in an auto-
mated fashion. This social data can then be exploited for
large-scale attacks such as context-aware spam and social-
phishing. We prove the feasibility of our attack exemplarily
on Facebook and identify possible consequences based on a
mathematical model and simulations. Alarmingly, all major
SNSs are vulnerable to our attack as they fail to secure the
network layer appropriately.
Categories and Subject Descriptors
K.6.5 [Management of Computing and Information
Systems]: Security and Protection; E.1 [Data Structures]:
Graphs and networks
General Terms
Security, experimentation, theory
Keywords
Social network security, spam, phishing
1.
INTRODUCTION
Criminals, as well as direct marketers, continue to clog
mailboxes with unsolicited bulk e-mails (e.g., spam and phish-
ing) in the hope of ﬁnancial gain. So far, their strategy is
straightforward, namely to send out a vast numbers of unso-
licited e-mails in order to maximize proﬁt on the tiny frac-
tion that falls for their scams. Their pool of target e-mail
addresses is normally based upon data harvested with web
crawlers or trojans, sometimes even including plain dictionary-
based guessing of valid targets. Previous research indicates
that social networking sites (SNSs) might ch...

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


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

Output:
安全论文分析：

title:Could End System Caching and Cooperation Replace In-Network Caching
in CCN?
author:Haibo Wu and
Jun Li and
Jiang Zhi
Could End System Caching and Cooperation
Replace In-Network Caching in CCN?
Haibo Wu
Jun Li+
Jiang Zhi
wuhaibo@cstnet.cn
zhijiang@cstnet.cn
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China, 100190
lijun@cnic.cn
ABSTRACT
still
systems
resources  of  end
CCN  has  been  witnessed  as  a  promising  future  Internet
architecture.  In-network  caching  has  been  paid  much
attention, but there is still no consensus on its usage, due to
its  non-negligible  costs.  Meanwhile,  massive  storage  and
bandwidth
remain
underutilized.  To  this  end,  we  present  an  End  System
Caching and Cooperation scheme in CCN, called ESCC to
realize content distribution of CCN, without using costly in-
network  caching.  ESCC  enables  fast  content  distribution
through clients caching and sharing contents with each other.
Experiments
that  ESCC  can  achieve  better
performance  than  the  universal  caching.  It  is  also  quite
simple, efficient, robust and has low overhead. ESCC could
be  a  candidate  substitute  for  the  costly  and  unnecessary
universal caching.
Categories & Subject Descriptors: C.2.1
[Computer-Communication Networks]: Network
Architecture and Design
Keywords: CCN, end system, caching, cooperation
1.  INTRODUCTION
show
CCN (Content Centric Networking) [1] has been proposed
as  a  promising  alternative
to  current  host-to-host
communication paradigm. In-network caching is regarded as
its  key  feature.  Overall  in-network  routers  equipped  with
caches potentially store named contents, which can be used
for  subsequent  requests.  In-network  caching  can  reduce
bandwidth  consumption  and  content  retrieval  time  by
making  contents  closer  to  requesters.  However,  these
benefits  come  at  a  non-negligible  cost.  Such  universal
caching  introduc...


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

Input:
title:Could End System Caching and Cooperation Replace In-Network Caching
in CCN?
author:Haibo Wu and
Jun Li and
Jiang Zhi
Could End System Caching and Cooperation
Replace In-Network Caching in CCN?
Haibo Wu
Jun Li+
Jiang Zhi
wuhaibo@cstnet.cn
zhijiang@cstnet.cn
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China, 100190
lijun@cnic.cn
ABSTRACT
still
systems
resources  of  end
CCN  has  been  witnessed  as  a  promising  future  Internet
architecture.  In-network  caching  has  been  paid  much
attention, but there is still no consensus on its usage, due to
its  non-negligible  costs.  Meanwhile,  massive  storage  and
bandwidth
remain
underutilized.  To  this  end,  we  present  an  End  System
Caching and Cooperation scheme in CCN, called ESCC to
realize content distribution of CCN, without using costly in-
network  caching.  ESCC  enables  fast  content  distribution
through clients caching and sharing contents with each other.
Experiments
that  ESCC  can  achieve  better
performance  than  the  universal  caching.  It  is  also  quite
simple, efficient, robust and has low overhead. ESCC could
be  a  candidate  substitute  for  the  costly  and  unnecessary
universal caching.
Categories & Subject Descriptors: C.2.1
[Computer-Communication Networks]: Network
Architecture and Design
Keywords: CCN, end system, caching, cooperation
1.  INTRODUCTION
show
CCN (Content Centric Networking) [1] has been proposed
as  a  promising  alternative
to  current  host-to-host
communication paradigm. In-network caching is regarded as
its  key  feature.  Overall  in-network  routers  equipped  with
caches potentially store named contents, which can be used
for  subsequent  requests.  In-network  caching  can  reduce
bandwidth  consumption  and  content  retrieval  time  by
making  contents  closer  to  requesters.  However,  these
benefits  come  at  a  non-negligible  cost.  Such  universal
caching  introduc...

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


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

Output:
安全论文分析：

title:Performance Limitations of ADSL Users: A Case Study
author:Matti Siekkinen and
Denis Collange and
Guillaume Urvoy-Keller and
Ernst W. Biersack
Performance Limitations of ADSL Users:
A Case Study(cid:2)
Matti Siekkinen1,(cid:2)(cid:2), Denis Collange2, Guillaume Urvoy-Keller3,
and Ernst W. Biersack3
1 University of Oslo, Dept. of Informatics, Postbox 1080 Blindern, 0316 Oslo, Norway
2 France T´el´ecom R&D, 905, rue Albert Einstein, 06921 Sophia-Antipolis, France
siekkine@ifi.uio.no
3 Institut Eurecom, 2229, route des crˆetes, 06904 Sophia-Antipolis, France
denis.collange@orange-ftgroup.com
{urvoy,erbi}@eurecom.fr
Abstract. We report results from the analysis of a 24-hour packet trace
containing TCP traﬃc of approximately 1300 residential ADSL clients.
Some of our observations conﬁrm earlier studies: the major fraction of
the total traﬃc originates from P2P applications and small fractions of
connections and clients are responsible for the vast majority of the traﬃc.
However, our main contribution is a throughput performance analysis of
the clients. We observe suprisingly low utilizations of upload and down-
load capacity for most of the clients. Furthermore, by using our TCP root
cause analysis tool, we obtain a striking result: in over 90% of the cases,
the low utilization is mostly due to the (P2P) applications clients use,
which limit the transmission rate and not due to network congestion, for
instance. P2P applications typically impose upload rate limits to avoid
uplink saturation that hurt download performance. Our analysis shows
that these rate limits are very low and, as a consequence, the aggregate
download rates for these applications are low.
1 Introduction
We analyze a large packet trace of clients connected to the Internet via ADSL
to investigate the causes of throughput limitations experienced by the end users.
For this purpose we use a TCP root cause analysis tool that we apply to TCP
connections. We consider throughput as the performance metric....


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

Input:
title:Performance Limitations of ADSL Users: A Case Study
author:Matti Siekkinen and
Denis Collange and
Guillaume Urvoy-Keller and
Ernst W. Biersack
Performance Limitations of ADSL Users:
A Case Study(cid:2)
Matti Siekkinen1,(cid:2)(cid:2), Denis Collange2, Guillaume Urvoy-Keller3,
and Ernst W. Biersack3
1 University of Oslo, Dept. of Informatics, Postbox 1080 Blindern, 0316 Oslo, Norway
2 France T´el´ecom R&D, 905, rue Albert Einstein, 06921 Sophia-Antipolis, France
siekkine@ifi.uio.no
3 Institut Eurecom, 2229, route des crˆetes, 06904 Sophia-Antipolis, France
denis.collange@orange-ftgroup.com
{urvoy,erbi}@eurecom.fr
Abstract. We report results from the analysis of a 24-hour packet trace
containing TCP traﬃc of approximately 1300 residential ADSL clients.
Some of our observations conﬁrm earlier studies: the major fraction of
the total traﬃc originates from P2P applications and small fractions of
connections and clients are responsible for the vast majority of the traﬃc.
However, our main contribution is a throughput performance analysis of
the clients. We observe suprisingly low utilizations of upload and down-
load capacity for most of the clients. Furthermore, by using our TCP root
cause analysis tool, we obtain a striking result: in over 90% of the cases,
the low utilization is mostly due to the (P2P) applications clients use,
which limit the transmission rate and not due to network congestion, for
instance. P2P applications typically impose upload rate limits to avoid
uplink saturation that hurt download performance. Our analysis shows
that these rate limits are very low and, as a consequence, the aggregate
download rates for these applications are low.
1 Introduction
We analyze a large packet trace of clients connected to the Internet via ADSL
to investigate the causes of throughput limitations experienced by the end users.
For this purpose we use a TCP root cause analysis tool that we apply to TCP
connections. We consider throughput as the performance metric....

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


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

Output:
安全论文分析：

title:On the Free Bridge Across the Digital Divide: Assessing the Quality
of Facebook's Free Basics Service
author:Rijurekha Sen and
Hasnain Ali Pirzada and
Amreesh Phokeer and
Zaid Ahmed Farooq and
Satadal Sengupta and
David R. Choffnes and
Krishna P. Gummadi
On the Free Bridge Across the Digital Divide:
Assessing the Quality of Facebook’s
Free Basics Service
Rijurekha Sen†
(cid:72)
Hasnain Ali Pirzada
David Choffnes‡
†Max Planck Institute for Software Systems (MPI-SWS)
(cid:72)
(cid:5)University of Cape Town (cid:91)LUMS (cid:63)IIT Kharagpur
Satadal Sengupta(cid:63)
Amreesh Phokeer(cid:5)
Zaid Ahmed Farooq(cid:91)
Krishna P. Gummadi†
University of Wisconsin-Madison
‡Northeastern University
ABSTRACT
Free Basics is an initiative backed by Facebook to provide
users in developing countries free mobile Internet access to
selected services. Despite its wide-spread deployment and
its potential impact on bridging the digital divide, to date,
few studies have rigorously measured the quality of the free
Internet service offered by Free Basics. In this short paper,
we characterize the quality of the Free Basics service offered
in Pakistan and South Africa along three dimensions: (i) the
selection of accessible Web services, (ii) the functionality of
those services, and (iii) the network performance for those
services. While preliminary, our ﬁndings show that data-
driven studies are essential for having more informed public
debates on the pros and cons of the current design of the Free
Basics service.
1.
Internet.org [1] is a consortium founded and led by Face-
book since 2013 with the goal of bringing affordable In-
ternet access to everyone in the world. Free Basics is the
ﬂagship initiative by Internet.org, offering free access to se-
lect Web services in partnership with mobile (cellular) ser-
vice providers in developing and under-developed countries
around the world. As of May 12th 2016, Free Basics has
been deployed in over 40 countries in Africa, Asia, and Cen-
tral...


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

Input:
title:On the Free Bridge Across the Digital Divide: Assessing the Quality
of Facebook's Free Basics Service
author:Rijurekha Sen and
Hasnain Ali Pirzada and
Amreesh Phokeer and
Zaid Ahmed Farooq and
Satadal Sengupta and
David R. Choffnes and
Krishna P. Gummadi
On the Free Bridge Across the Digital Divide:
Assessing the Quality of Facebook’s
Free Basics Service
Rijurekha Sen†
(cid:72)
Hasnain Ali Pirzada
David Choffnes‡
†Max Planck Institute for Software Systems (MPI-SWS)
(cid:72)
(cid:5)University of Cape Town (cid:91)LUMS (cid:63)IIT Kharagpur
Satadal Sengupta(cid:63)
Amreesh Phokeer(cid:5)
Zaid Ahmed Farooq(cid:91)
Krishna P. Gummadi†
University of Wisconsin-Madison
‡Northeastern University
ABSTRACT
Free Basics is an initiative backed by Facebook to provide
users in developing countries free mobile Internet access to
selected services. Despite its wide-spread deployment and
its potential impact on bridging the digital divide, to date,
few studies have rigorously measured the quality of the free
Internet service offered by Free Basics. In this short paper,
we characterize the quality of the Free Basics service offered
in Pakistan and South Africa along three dimensions: (i) the
selection of accessible Web services, (ii) the functionality of
those services, and (iii) the network performance for those
services. While preliminary, our ﬁndings show that data-
driven studies are essential for having more informed public
debates on the pros and cons of the current design of the Free
Basics service.
1.
Internet.org [1] is a consortium founded and led by Face-
book since 2013 with the goal of bringing affordable In-
ternet access to everyone in the world. Free Basics is the
ﬂagship initiative by Internet.org, offering free access to se-
lect Web services in partnership with mobile (cellular) ser-
vice providers in developing and under-developed countries
around the world. As of May 12th 2016, Free Basics has
been deployed in over 40 countries in Africa, Asia, and Cen-
tral...

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


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

Output:
安全论文分析：

title:Breaking for commercials: characterizing mobile advertising
author:Narseo Vallina-Rodriguez and
Jay Shah and
Alessandro Finamore and
Yan Grunenberger and
Konstantina Papagiannaki and
Hamed Haddadi and
Jon Crowcroft
Breaking for Commercials:
Characterizing Mobile Advertising
Narseo Vallina-Rodriguez†, Jay Shah†, Alessandro Finamore‡
Yan Grunenberger⋄, Hamed Haddadi§, Konstantina Papagiannaki⋄, Jon Crowcroft†
University of Cambridge†, Politecnico di Torino‡, Telefonica Research⋄
Queen Mary University of London§
name.surname@cl.cam.ac.uk†, ﬁnamore@tlc.polito.it‡, {yan,dina}@tid.es⋄
hamed@eecs.qmul.ac.uk§
ABSTRACT
1.
INTRODUCTION
Mobile phones and tablets can be considered as the ﬁrst incarnation
of the post-PC era. Their explosive adoption rate has been driven
by a number of factors, with the most signifcant inﬂuence being
applications (apps) and app markets. Individuals and organizations
are able to develop and publish apps, and the most popular form of
monetization is mobile advertising.
The mobile advertisement (ad) ecosystem has been the target of
prior research, but these works typically focused on a small set of
apps or are from a user privacy perspective. In this work we make
use of a unique, anonymized data set corresponding to one day of
trafﬁc for a major European mobile carrier with more than 3 million
subscribers. We further take a principled approach to characterize
mobile ad trafﬁc along a number of dimensions, such as overall
trafﬁc, frequency, as well as possible implications in terms of en-
ergy on a mobile device.
Our analysis demonstrates a number of inefﬁciencies in today’s
ad delivery. We discuss the beneﬁts of well-known techniques,
such as pre-fetching and caching, to limit the energy and network
signalling overhead caused by current systems. A prototype im-
plementation on Android devices demonstrates an improvement of
50% in terms of energy consumption for ofﬂine ad-sponsored apps
while limiting the amount of ad related trafﬁc.
Keywords
E...


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

Input:
title:Breaking for commercials: characterizing mobile advertising
author:Narseo Vallina-Rodriguez and
Jay Shah and
Alessandro Finamore and
Yan Grunenberger and
Konstantina Papagiannaki and
Hamed Haddadi and
Jon Crowcroft
Breaking for Commercials:
Characterizing Mobile Advertising
Narseo Vallina-Rodriguez†, Jay Shah†, Alessandro Finamore‡
Yan Grunenberger⋄, Hamed Haddadi§, Konstantina Papagiannaki⋄, Jon Crowcroft†
University of Cambridge†, Politecnico di Torino‡, Telefonica Research⋄
Queen Mary University of London§
name.surname@cl.cam.ac.uk†, ﬁnamore@tlc.polito.it‡, {yan,dina}@tid.es⋄
hamed@eecs.qmul.ac.uk§
ABSTRACT
1.
INTRODUCTION
Mobile phones and tablets can be considered as the ﬁrst incarnation
of the post-PC era. Their explosive adoption rate has been driven
by a number of factors, with the most signifcant inﬂuence being
applications (apps) and app markets. Individuals and organizations
are able to develop and publish apps, and the most popular form of
monetization is mobile advertising.
The mobile advertisement (ad) ecosystem has been the target of
prior research, but these works typically focused on a small set of
apps or are from a user privacy perspective. In this work we make
use of a unique, anonymized data set corresponding to one day of
trafﬁc for a major European mobile carrier with more than 3 million
subscribers. We further take a principled approach to characterize
mobile ad trafﬁc along a number of dimensions, such as overall
trafﬁc, frequency, as well as possible implications in terms of en-
ergy on a mobile device.
Our analysis demonstrates a number of inefﬁciencies in today’s
ad delivery. We discuss the beneﬁts of well-known techniques,
such as pre-fetching and caching, to limit the energy and network
signalling overhead caused by current systems. A prototype im-
plementation on Android devices demonstrates an improvement of
50% in terms of energy consumption for ofﬂine ad-sponsored apps
while limiting the amount of ad related trafﬁc.
Keywords
E...

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


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

Output:
安全论文分析：

title:PDF Mirage: Content Masking Attack Against Information-Based Online
Services
author:Ian D. Markwood and
Dakun Shen and
Yao Liu and
Zhuo Lu
PDF Mirage: Content Masking Attack Against
Information-Based Online Services
Ian Markwood, Dakun Shen, Yao Liu, and Zhuo Lu, University of South Florida
https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/markwood
This paper is included in the Proceedings of the 26th USENIX Security SymposiumAugust 16–18, 2017 • Vancouver, BC, CanadaISBN 978-1-931971-40-9Open access to the Proceedings of the 26th USENIX Security Symposium is sponsored by USENIXPDF Mirage: Content Masking Attack
Against Information-Based Online Services
Ian Markwood∗†, Dakun Shen∗†, Yao Liu†, and Zhuo Lu†
†University of South Florida, Tampa, FL, U.S.A
*Co-First Authors
Abstract
We present a new class of content masking attacks
against the Adobe PDF standard, causing documents to
appear to humans dissimilar to the underlying content ex-
tracted by information-based services. We show three at-
tack variants with notable impact on real-world systems.
Our ﬁrst attack allows academic paper writers and re-
viewers to collude via subverting the automatic reviewer
assignment systems in current use by academic confer-
ences including INFOCOM, which we reproduced. Our
second attack renders ineffective plagiarism detection
software, particularly Turnitin, targeting speciﬁc small
plagiarism similarity scores to appear natural and evade
detection.
In our ﬁnal attack, we place masked con-
tent into the indexes for Bing, Yahoo!, and DuckDuckGo
which renders as information entirely different from the
keywords used to locate it, enabling spam, profane, or
possibly illegal content to go unnoticed by these search
engines but still returned in unrelated search results.
Lastly, as these systems eschew optical character recog-
nition (OCR) for its overhead, we offer a comprehensive
and lightweight alternative mitigation method.
1
Introduction
Desi...


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

Input:
title:PDF Mirage: Content Masking Attack Against Information-Based Online
Services
author:Ian D. Markwood and
Dakun Shen and
Yao Liu and
Zhuo Lu
PDF Mirage: Content Masking Attack Against
Information-Based Online Services
Ian Markwood, Dakun Shen, Yao Liu, and Zhuo Lu, University of South Florida
https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/markwood
This paper is included in the Proceedings of the 26th USENIX Security SymposiumAugust 16–18, 2017 • Vancouver, BC, CanadaISBN 978-1-931971-40-9Open access to the Proceedings of the 26th USENIX Security Symposium is sponsored by USENIXPDF Mirage: Content Masking Attack
Against Information-Based Online Services
Ian Markwood∗†, Dakun Shen∗†, Yao Liu†, and Zhuo Lu†
†University of South Florida, Tampa, FL, U.S.A
*Co-First Authors
Abstract
We present a new class of content masking attacks
against the Adobe PDF standard, causing documents to
appear to humans dissimilar to the underlying content ex-
tracted by information-based services. We show three at-
tack variants with notable impact on real-world systems.
Our ﬁrst attack allows academic paper writers and re-
viewers to collude via subverting the automatic reviewer
assignment systems in current use by academic confer-
ences including INFOCOM, which we reproduced. Our
second attack renders ineffective plagiarism detection
software, particularly Turnitin, targeting speciﬁc small
plagiarism similarity scores to appear natural and evade
detection.
In our ﬁnal attack, we place masked con-
tent into the indexes for Bing, Yahoo!, and DuckDuckGo
which renders as information entirely different from the
keywords used to locate it, enabling spam, profane, or
possibly illegal content to go unnoticed by these search
engines but still returned in unrelated search results.
Lastly, as these systems eschew optical character recog-
nition (OCR) for its overhead, we offer a comprehensive
and lightweight alternative mitigation method.
1
Introduction
Desi...

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


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

Output:
安全论文分析：

title:POSTER: Password Entering and Transmission Security
author:Gamze Canova and
Melanie Volkamer and
Simon Weiler
CORE
Provided by KITopen
Poster: Password Entering and Transmission Security
Metadata, citation and similar papers at core.ac.uk
Gamze Canova
Technische Universität
Darmstadt
gamze.canova@cased.de
Melanie Volkamer
Technische Universität
volkamer@cased.de
Darmstadt
Simon Weiler
Technische Universität
Darmstadt
simon.weiler@stud.tu-
darmstadt.de
ABSTRACT
The most popular form of user authentication on websites is
the use of passwords. When entering a password, it is cru-
cial that the website uses HTTPS (for the entire content).
However, this is often not the case. We propose PassSec -
a Firefox Add-On to support users to detect password ﬁelds
on which their password might be endangered. In addition,
PassSec displays a non-blocking warning next to the pass-
word ﬁeld, once users click into the password ﬁeld. The user
is provided with possible consequences of entering a pass-
word, recommendations and further information if wanted.
Categories and Subject Descriptors
H.5.2 [Information Interfaces and Presentation]: User
interfaces—user-centered design; K.6.5 [Management of
Computing and Information Systems]: Security and
Protection
General Terms
Security, Human Factors
Keywords
Usable security, user support, password security, security
interventions
1.
INTRODUCTION
The most popular form of user authentication on websites
is the use of passwords. This is mainly due to its convenience
and simplicity. Protecting a user’s password is crucial, espe-
cially because many users tend to reuse the same password
for diﬀerent services [5]. That is, once a password is, e.g.
eavesdropped, this password could be reused by the eaves-
dropper for other services of the victim.
Ideally, a password should be entered only if the server is
authentic and the website with the password ﬁeld is using
HTTPS, while all elements of this website are exchanged
Permission to make digital...


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

Input:
title:POSTER: Password Entering and Transmission Security
author:Gamze Canova and
Melanie Volkamer and
Simon Weiler
CORE
Provided by KITopen
Poster: Password Entering and Transmission Security
Metadata, citation and similar papers at core.ac.uk
Gamze Canova
Technische Universität
Darmstadt
gamze.canova@cased.de
Melanie Volkamer
Technische Universität
volkamer@cased.de
Darmstadt
Simon Weiler
Technische Universität
Darmstadt
simon.weiler@stud.tu-
darmstadt.de
ABSTRACT
The most popular form of user authentication on websites is
the use of passwords. When entering a password, it is cru-
cial that the website uses HTTPS (for the entire content).
However, this is often not the case. We propose PassSec -
a Firefox Add-On to support users to detect password ﬁelds
on which their password might be endangered. In addition,
PassSec displays a non-blocking warning next to the pass-
word ﬁeld, once users click into the password ﬁeld. The user
is provided with possible consequences of entering a pass-
word, recommendations and further information if wanted.
Categories and Subject Descriptors
H.5.2 [Information Interfaces and Presentation]: User
interfaces—user-centered design; K.6.5 [Management of
Computing and Information Systems]: Security and
Protection
General Terms
Security, Human Factors
Keywords
Usable security, user support, password security, security
interventions
1.
INTRODUCTION
The most popular form of user authentication on websites
is the use of passwords. This is mainly due to its convenience
and simplicity. Protecting a user’s password is crucial, espe-
cially because many users tend to reuse the same password
for diﬀerent services [5]. That is, once a password is, e.g.
eavesdropped, this password could be reused by the eaves-
dropper for other services of the victim.
Ideally, a password should be entered only if the server is
authentic and the website with the password ﬁeld is using
HTTPS, while all elements of this website are exchanged
Permission to make digital...

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


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

Output:
安全论文分析：

title:Privacy-preserving distance computation and proximity testing on earth,
done right
author:Jaroslav Sedenka and
Paolo Gasti
Privacy-Preserving Distance Computation
and Proximity Testing on Earth, Done Right
Jaroslav Šedˇenka∗
Dept. of Mathematics and Statistics
Masaryk University
Kotláˇrská 2, 61137 Brno, Czech Republic
sedenka@mail.muni.cz
Paolo Gasti
School of Engineering and Computing Sciences
New York Institute of Technology
1855 Broadway, New York, NY 10023, USA
pgasti@nyit.edu
ABSTRACT
In recent years, the availability of GPS-enabled smartphones
have made location-based services extremely popular. A
multitude of applications rely on location information to
provide a wide range of services. Location information is,
however, extremely sensitive and can be easily abused. In this
paper, we introduce the ﬁrst protocols for secure computation
of distance and for proximity testing over a sphere. Our
secure distance protocols allow two parties, Alice and Bob,
to determine their mutual distance without disclosing any
additional information about their location. Through our
secure proximity testing protocols, Alice only learns if Bob is
in close proximity, i.e., within some arbitrary distance.
Our techniques rely on three diﬀerent representations of
Earth, which provide diﬀerent trade-oﬀs between accuracy
and performance. We show, via experiments on a prototype
implementation, that our protocols are practical on resource-
constrained smartphone devices. Our distance computation
protocols runs, in fact, in 54 to 78 ms on a commodity
Android smartphone. Similarly, our proximity tests require
between 1.2 s and 2.8 s on the same platform. The imprecision
introduced by our protocols is very small, i.e., between 0.1%
and 3% on average, depending on the distance.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Public Policy
Issues—Privacy; E.3 [DATA ENCRYPTION]
1.
INTRODUCTION
Since the introduction of the ﬁrst popular GPS-enabled
smartphones, location-a...


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

Input:
title:Privacy-preserving distance computation and proximity testing on earth,
done right
author:Jaroslav Sedenka and
Paolo Gasti
Privacy-Preserving Distance Computation
and Proximity Testing on Earth, Done Right
Jaroslav Šedˇenka∗
Dept. of Mathematics and Statistics
Masaryk University
Kotláˇrská 2, 61137 Brno, Czech Republic
sedenka@mail.muni.cz
Paolo Gasti
School of Engineering and Computing Sciences
New York Institute of Technology
1855 Broadway, New York, NY 10023, USA
pgasti@nyit.edu
ABSTRACT
In recent years, the availability of GPS-enabled smartphones
have made location-based services extremely popular. A
multitude of applications rely on location information to
provide a wide range of services. Location information is,
however, extremely sensitive and can be easily abused. In this
paper, we introduce the ﬁrst protocols for secure computation
of distance and for proximity testing over a sphere. Our
secure distance protocols allow two parties, Alice and Bob,
to determine their mutual distance without disclosing any
additional information about their location. Through our
secure proximity testing protocols, Alice only learns if Bob is
in close proximity, i.e., within some arbitrary distance.
Our techniques rely on three diﬀerent representations of
Earth, which provide diﬀerent trade-oﬀs between accuracy
and performance. We show, via experiments on a prototype
implementation, that our protocols are practical on resource-
constrained smartphone devices. Our distance computation
protocols runs, in fact, in 54 to 78 ms on a commodity
Android smartphone. Similarly, our proximity tests require
between 1.2 s and 2.8 s on the same platform. The imprecision
introduced by our protocols is very small, i.e., between 0.1%
and 3% on average, depending on the distance.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Public Policy
Issues—Privacy; E.3 [DATA ENCRYPTION]
1.
INTRODUCTION
Since the introduction of the ﬁrst popular GPS-enabled
smartphones, location-a...

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