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

Output:
安全论文分析：

title:An Internet-Wide Analysis of Traffic Policing
author:Tobias Flach and
Pavlos Papageorge and
Andreas Terzis and
Luis Pedrosa and
Yuchung Cheng and
Tayeb Karim and
Ethan Katz-Bassett and
Ramesh Govindan
An Internet-Wide Analysis of Trafﬁc Policing
Tobias Flach∗†, Pavlos Papageorge†, Andreas Terzis†, Luis D. Pedrosa∗,
Yuchung Cheng†, Tayeb Karim†, Ethan Katz-Bassett∗, and Ramesh Govindan∗
∗ University of Southern California † Google
Abstract. Large ﬂows like video streams consume signiﬁ-
cant bandwidth. Some ISPs actively manage these high vol-
ume ﬂows with techniques like policing, which enforces a
ﬂow rate by dropping excess trafﬁc. While the existence of
policing is well known, our contribution is an Internet-wide
study quantifying its prevalence and impact on transport-
level and video-quality metrics. We developed a heuristic to
identify policing from server-side traces and built a pipeline
to process traces at scale collected from hundreds of Google
servers worldwide. Using a dataset of 270 billion packets
served to 28,400 client ASes, we ﬁnd that, depending on re-
gion, up to 7% of connections are identiﬁed to be policed.
Loss rates are on average 6× higher when a trace is policed,
and it impacts video playback quality. We show that alterna-
tives to policing, like pacing and shaping, can achieve trafﬁc
management goals while avoiding the deleterious effects of
policing.
CCS Concepts
•Networks → Network measurement; Network performance
analysis;
1.
INTRODUCTION
Internet trafﬁc has increased ﬁvefold in ﬁve years [16],
much of it from the explosion of streaming video. YouTube
and Netﬂix together contribute nearly half of the trafﬁc to
North American Internet users [47,55,66]. Content providers
want to maximize user quality of experience. They spend
considerable effort optimizing their infrastructure to deliver
data as fast as possible [11, 25, 29].
In contrast, an ISP needs to accommodate trafﬁc from a
multitude of services and users, often through differen...


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

Input:
title:An Internet-Wide Analysis of Traffic Policing
author:Tobias Flach and
Pavlos Papageorge and
Andreas Terzis and
Luis Pedrosa and
Yuchung Cheng and
Tayeb Karim and
Ethan Katz-Bassett and
Ramesh Govindan
An Internet-Wide Analysis of Trafﬁc Policing
Tobias Flach∗†, Pavlos Papageorge†, Andreas Terzis†, Luis D. Pedrosa∗,
Yuchung Cheng†, Tayeb Karim†, Ethan Katz-Bassett∗, and Ramesh Govindan∗
∗ University of Southern California † Google
Abstract. Large ﬂows like video streams consume signiﬁ-
cant bandwidth. Some ISPs actively manage these high vol-
ume ﬂows with techniques like policing, which enforces a
ﬂow rate by dropping excess trafﬁc. While the existence of
policing is well known, our contribution is an Internet-wide
study quantifying its prevalence and impact on transport-
level and video-quality metrics. We developed a heuristic to
identify policing from server-side traces and built a pipeline
to process traces at scale collected from hundreds of Google
servers worldwide. Using a dataset of 270 billion packets
served to 28,400 client ASes, we ﬁnd that, depending on re-
gion, up to 7% of connections are identiﬁed to be policed.
Loss rates are on average 6× higher when a trace is policed,
and it impacts video playback quality. We show that alterna-
tives to policing, like pacing and shaping, can achieve trafﬁc
management goals while avoiding the deleterious effects of
policing.
CCS Concepts
•Networks → Network measurement; Network performance
analysis;
1.
INTRODUCTION
Internet trafﬁc has increased ﬁvefold in ﬁve years [16],
much of it from the explosion of streaming video. YouTube
and Netﬂix together contribute nearly half of the trafﬁc to
North American Internet users [47,55,66]. Content providers
want to maximize user quality of experience. They spend
considerable effort optimizing their infrastructure to deliver
data as fast as possible [11, 25, 29].
In contrast, an ISP needs to accommodate trafﬁc from a
multitude of services and users, often through differen...

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


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

Output:
安全论文分析：

title:Challenges, design and analysis of a large-scale p2p-vod system
author:Yan Huang and
Tom Z. J. Fu and
Dah-Ming Chiu and
John C. S. Lui and
Cheng Huang
Challenges, Design and Analysis of a Large-scale P2P-VoD
System
Yan Huang∗, Tom Z. J. Fu†, Dah-Ming Chiu†, John C. S. Lui‡ and Cheng Huang∗
∗{galehuang, ivanhuang}@pplive.com, Shanghai Synacast Media Tech.
†{zjfu6, dmchiu}@ie.cuhk.edu.hk, The Chinese University of Hong Kong
‡cslui@cse.cuhk.edu.hk, The Chinese University of Hong Kong
ABSTRACT
P2P ﬁle downloading and streaming have already become
very popular Internet applications. These systems dramat-
ically reduce the server loading, and provide a platform for
scalable content distribution, as long as there is interest for
the content. P2P-based video-on-demand (P2P-VoD) is a
new challenge for the P2P technology. Unlike streaming live
content, P2P-VoD has less synchrony in the users sharing
video content, therefore it is much more diﬃcult to allevi-
ate the server loading and at the same time maintaining
the streaming performance. To compensate, a small storage
is contributed by every peer, and new mechanisms for co-
ordinating content replication, content discovery, and peer
scheduling are carefully designed. In this paper, we describe
and discuss the challenges and the architectural design issues
of a large-scale P2P-VoD system based on the experiences
of a real system deployed by PPLive. The system is also
designed and instrumented with monitoring capability to
measure both system and component speciﬁc performance
metrics (for design improvements) as well as user satisfac-
tion. After analyzing a large amount of collected data, we
present a number of results on user behavior, various system
performance metrics, including user satisfaction, and discuss
what we observe based on the system design. The study of
a real life system provides valuable insights for the future
development of P2P-VoD technology.
Categories and Subject Descriptors
C.2 [Computer-Communic...


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

Input:
title:Challenges, design and analysis of a large-scale p2p-vod system
author:Yan Huang and
Tom Z. J. Fu and
Dah-Ming Chiu and
John C. S. Lui and
Cheng Huang
Challenges, Design and Analysis of a Large-scale P2P-VoD
System
Yan Huang∗, Tom Z. J. Fu†, Dah-Ming Chiu†, John C. S. Lui‡ and Cheng Huang∗
∗{galehuang, ivanhuang}@pplive.com, Shanghai Synacast Media Tech.
†{zjfu6, dmchiu}@ie.cuhk.edu.hk, The Chinese University of Hong Kong
‡cslui@cse.cuhk.edu.hk, The Chinese University of Hong Kong
ABSTRACT
P2P ﬁle downloading and streaming have already become
very popular Internet applications. These systems dramat-
ically reduce the server loading, and provide a platform for
scalable content distribution, as long as there is interest for
the content. P2P-based video-on-demand (P2P-VoD) is a
new challenge for the P2P technology. Unlike streaming live
content, P2P-VoD has less synchrony in the users sharing
video content, therefore it is much more diﬃcult to allevi-
ate the server loading and at the same time maintaining
the streaming performance. To compensate, a small storage
is contributed by every peer, and new mechanisms for co-
ordinating content replication, content discovery, and peer
scheduling are carefully designed. In this paper, we describe
and discuss the challenges and the architectural design issues
of a large-scale P2P-VoD system based on the experiences
of a real system deployed by PPLive. The system is also
designed and instrumented with monitoring capability to
measure both system and component speciﬁc performance
metrics (for design improvements) as well as user satisfac-
tion. After analyzing a large amount of collected data, we
present a number of results on user behavior, various system
performance metrics, including user satisfaction, and discuss
what we observe based on the system design. The study of
a real life system provides valuable insights for the future
development of P2P-VoD technology.
Categories and Subject Descriptors
C.2 [Computer-Communic...

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


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

Output:
安全论文分析：

title:Die Free or Live Hard? Empirical Evaluation and New Design for Fighting
Evolving Twitter Spammers
author:Chao Yang and
Robert Chandler Harkreader and
Guofei Gu
Die Free or Live Hard?
Empirical Evaluation and New Design for
Fighting Evolving Twitter Spammers
Chao Yang, Robert Chandler Harkreader, Guofei Gu
SUCCESS Lab, Texas A&M University
{yangchao, bharkreader, guofei}@cse.tamu.edu
Abstract. Due to the signiﬁcance and indispensability of detecting and
suspending Twitter spammers, many researchers along with the engi-
neers in Twitter Corporation have devoted themselves to keeping Twitter
as spam-free online communities. Meanwhile, Twitter spammers are also
evolving to evade existing detection techniques. In this paper, we make
an empirical analysis of the evasion tactics utilized by Twitter spam-
mers, and then design several new and robust features to detect Twitter
spammers. Finally, we formalize the robustness of 24 detection features
that are commonly utilized in the literature as well as our proposed ones.
Through our experiments, we show that our new designed features are
eﬀective to detect Twitter spammers, achieving a much higher detection
rate than three state-of-the-art approaches [35, 32, 34] while keeping an
even lower false positive rate.
1
Introduction
Spammers have utilized Twitter as the new platform to achieve their malicious
goals such as sending spam [2], spreading malware [12], hosting botnet command
and control (C&C) channels [5], and performing other illicit activities [29]. All
these malicious behaviors may cause signiﬁcant economic loss to our society
and even threaten national security. In August of 2009, nearly 11 percent of all
Twitter posts were spam [1]. In May of 2009, many innocent users’ accounts on
Twitter were hacked to spread advertisements [2]. In February of 2010, thou-
sands of Twitter users, such as the Press Complaints Commission, the BBC
correspondent Nick Higham and the Guardian’s head of audio Matt Wells, have
seen t...


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

Input:
title:Die Free or Live Hard? Empirical Evaluation and New Design for Fighting
Evolving Twitter Spammers
author:Chao Yang and
Robert Chandler Harkreader and
Guofei Gu
Die Free or Live Hard?
Empirical Evaluation and New Design for
Fighting Evolving Twitter Spammers
Chao Yang, Robert Chandler Harkreader, Guofei Gu
SUCCESS Lab, Texas A&M University
{yangchao, bharkreader, guofei}@cse.tamu.edu
Abstract. Due to the signiﬁcance and indispensability of detecting and
suspending Twitter spammers, many researchers along with the engi-
neers in Twitter Corporation have devoted themselves to keeping Twitter
as spam-free online communities. Meanwhile, Twitter spammers are also
evolving to evade existing detection techniques. In this paper, we make
an empirical analysis of the evasion tactics utilized by Twitter spam-
mers, and then design several new and robust features to detect Twitter
spammers. Finally, we formalize the robustness of 24 detection features
that are commonly utilized in the literature as well as our proposed ones.
Through our experiments, we show that our new designed features are
eﬀective to detect Twitter spammers, achieving a much higher detection
rate than three state-of-the-art approaches [35, 32, 34] while keeping an
even lower false positive rate.
1
Introduction
Spammers have utilized Twitter as the new platform to achieve their malicious
goals such as sending spam [2], spreading malware [12], hosting botnet command
and control (C&C) channels [5], and performing other illicit activities [29]. All
these malicious behaviors may cause signiﬁcant economic loss to our society
and even threaten national security. In August of 2009, nearly 11 percent of all
Twitter posts were spam [1]. In May of 2009, many innocent users’ accounts on
Twitter were hacked to spread advertisements [2]. In February of 2010, thou-
sands of Twitter users, such as the Press Complaints Commission, the BBC
correspondent Nick Higham and the Guardian’s head of audio Matt Wells, have
seen t...

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


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

Output:
安全论文分析：

title:Don't drop, detour!
author:Matt Calder and
Rui Miao and
Kyriakos Zarifis and
Ethan Katz-Bassett and
Minlan Yu and
Jitendra Padhye
Don’t Drop, Detour!
Matt Calder
Univ. of Southern California
calderm@usc.edu
Ethan Katz-Bassett
ethan.kb@usc.edu
Univ. of Southern California
Rui Miao
Univ. of Southern California
rmiao@usc.edu
Minlan Yu
Univ. of Southern California
minlanyu@usc.edu
Kyriakos Zariﬁs
Univ. of Southern California
kyriakos@usc.edu
Jitendra Padhye
Microsoft Research
padhye@microsoft.com
Categories and Subject Descriptors
C.2.1 [Computer-Communication Networks]: Network Archi-
tecture and Design
General Terms
Performance
Keywords
data center, buffers, packet loss
1.
INTRODUCTION
The mechanics of DIBS are best explained assuming output-buffered
switches, although it can work with any switch type. When a packet
arrives at a switch input port, the switch checks to see if the buffer
for the destination port is full. If so, instead of dropping the packet,
the switch selects one of its other ports at random 1 to forward the
packet on. Other switches will buffer and forward the packet, and it
will make its way to its destination, possibly coming back through
the switch that originally detoured it.
Modern data center networks (DCNs) are built with shallow-
buffered switches. These switches are cheaper than their deep-
buffered counterparts, and they also reduce the maximum queuing
delays packets may suffer. However, shallow buffers can lead to
high packet loss under bursty trafﬁc conditions (often caused by
the “incast” trafﬁc pattern [7]). DCTCP [3] attempts to solve this
problem by using ECN markings to throttle the ﬂows early, to avoid
buffer overﬂow. However, DCTCP cannot prevent packet loss if the
trafﬁc bursts are severe, and short-lived. One extreme example is a
large number of senders each sending one or two packets to a sin-
gle receiver. No feedback-based congestion control protocol can
prevent buffer overﬂow and packet losses under such extreme con-
di...


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

Input:
title:Don't drop, detour!
author:Matt Calder and
Rui Miao and
Kyriakos Zarifis and
Ethan Katz-Bassett and
Minlan Yu and
Jitendra Padhye
Don’t Drop, Detour!
Matt Calder
Univ. of Southern California
calderm@usc.edu
Ethan Katz-Bassett
ethan.kb@usc.edu
Univ. of Southern California
Rui Miao
Univ. of Southern California
rmiao@usc.edu
Minlan Yu
Univ. of Southern California
minlanyu@usc.edu
Kyriakos Zariﬁs
Univ. of Southern California
kyriakos@usc.edu
Jitendra Padhye
Microsoft Research
padhye@microsoft.com
Categories and Subject Descriptors
C.2.1 [Computer-Communication Networks]: Network Archi-
tecture and Design
General Terms
Performance
Keywords
data center, buffers, packet loss
1.
INTRODUCTION
The mechanics of DIBS are best explained assuming output-buffered
switches, although it can work with any switch type. When a packet
arrives at a switch input port, the switch checks to see if the buffer
for the destination port is full. If so, instead of dropping the packet,
the switch selects one of its other ports at random 1 to forward the
packet on. Other switches will buffer and forward the packet, and it
will make its way to its destination, possibly coming back through
the switch that originally detoured it.
Modern data center networks (DCNs) are built with shallow-
buffered switches. These switches are cheaper than their deep-
buffered counterparts, and they also reduce the maximum queuing
delays packets may suffer. However, shallow buffers can lead to
high packet loss under bursty trafﬁc conditions (often caused by
the “incast” trafﬁc pattern [7]). DCTCP [3] attempts to solve this
problem by using ECN markings to throttle the ﬂows early, to avoid
buffer overﬂow. However, DCTCP cannot prevent packet loss if the
trafﬁc bursts are severe, and short-lived. One extreme example is a
large number of senders each sending one or two packets to a sin-
gle receiver. No feedback-based congestion control protocol can
prevent buffer overﬂow and packet losses under such extreme con-
di...

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


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

Output:
安全论文分析：

title:Ring signatures: universally composable definitions and constructions
author:Kazuki Yoneyama and
Kazuo Ohta


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

Input:
title:Ring signatures: universally composable definitions and constructions
author:Kazuki Yoneyama and
Kazuo Ohta

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


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

Output:
安全论文分析：

title:Principles of Policy in Secure Groups
author:Hugh Harney and
Andrea Colgrove and
Patrick D. McDaniel
Principles of Policy in Secure Groups
Hugh Harney Andrea Colgrove
SPARTA, Inc.
Columbia, MD
hh acc
@sparta.com
Abstract
Security policy is increasingly being used as a vehicle for
specifying complex entity relationships. When used to de-
ﬁne group security, policy must be extended to state the en-
tirety of the security context. For this reason, the policy re-
quirements of secure groups are more complex than found
in traditional peer communication; group policies convey
information about associations greater and more abstract
than their pair-wise counterparts. This paper identiﬁes
and illustrates universal requirements of secure group pol-
icy and reasons about the adherence of the Group Secu-
rity Association Key Management Protocol (GSAKMP) to
these principles.
1. Introduction
The use of widely distributed resources on the Inter-
net has strained existing network infrastructures. Until
recently, applications and services were targeted to envi-
ronments spanning few administrative domains support-
ing a relatively static user community. However, the ex-
plosion of new forms of communication has invalidated
many of the basic assumptions upon which these systems
were built. Thus, the design of these systems, and of their
security in particular, has recently come under consider-
able scrutiny.
An approach addressing the requirements of these
 This work is supported in part under the National Science Foun-
dation Grant #ATM-9873025 and by the Defense Advanced Research
Projects Agency (DARPA) and Air Force Research Laboratory, Air
Force Materiel Command, USAF, under agreement number F30602-00-
2-0508. The U.S. Government is authorized to reproduce and distribute
reprints for Governmental purposes notwithstanding any copyright an-
notation thereon. The views and conclusions contained herein are those
of the authors and should not be interpreted as necessarily rep...


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

Input:
title:Principles of Policy in Secure Groups
author:Hugh Harney and
Andrea Colgrove and
Patrick D. McDaniel
Principles of Policy in Secure Groups
Hugh Harney Andrea Colgrove
SPARTA, Inc.
Columbia, MD
hh acc
@sparta.com
Abstract
Security policy is increasingly being used as a vehicle for
specifying complex entity relationships. When used to de-
ﬁne group security, policy must be extended to state the en-
tirety of the security context. For this reason, the policy re-
quirements of secure groups are more complex than found
in traditional peer communication; group policies convey
information about associations greater and more abstract
than their pair-wise counterparts. This paper identiﬁes
and illustrates universal requirements of secure group pol-
icy and reasons about the adherence of the Group Secu-
rity Association Key Management Protocol (GSAKMP) to
these principles.
1. Introduction
The use of widely distributed resources on the Inter-
net has strained existing network infrastructures. Until
recently, applications and services were targeted to envi-
ronments spanning few administrative domains support-
ing a relatively static user community. However, the ex-
plosion of new forms of communication has invalidated
many of the basic assumptions upon which these systems
were built. Thus, the design of these systems, and of their
security in particular, has recently come under consider-
able scrutiny.
An approach addressing the requirements of these
 This work is supported in part under the National Science Foun-
dation Grant #ATM-9873025 and by the Defense Advanced Research
Projects Agency (DARPA) and Air Force Research Laboratory, Air
Force Materiel Command, USAF, under agreement number F30602-00-
2-0508. The U.S. Government is authorized to reproduce and distribute
reprints for Governmental purposes notwithstanding any copyright an-
notation thereon. The views and conclusions contained herein are those
of the authors and should not be interpreted as necessarily rep...

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


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

Output:
安全论文分析：

title:POSTER: Towards Privacy-Preserving Biometric Identification in Cloud
Computing
author:Changhee Hahn and
Junbeom Hur
ARENBERG DOCTORAL SCHOOL
Faculty of Engineering Science
Secure and
Privacy-Preserving
Biometric Systems
Supervisor:
Prof. dr. ir. Bart Preneel
Christina-Angeliki Toli
Dissertation presented in partial
fulﬁllment of the requirements for
the degree of Doctor of Engineering
Science (PhD): Electrical
Engineering
November 2018
Secure and Privacy-Preserving
Biometric Systems
Christina-Angeliki TOLI
Examination committee:
Prof. dr. Adhemar Bultheel, chair
Prof. dr. ir. Bart Preneel, supervisor
Prof. dr. ir. Frank Piessens
Prof. dr. Maria Claudia Diaz Martinez
Dr. Enrique Argones Rúa
Prof. dr. Aikaterini Mitrokotsa
(Chalmers University of Technology)
Dissertation presented in partial
fulﬁllment of the requirements for
the degree of Doctor of Engineering
Science (PhD): Electrical Engineer-
ing
November 2018
© 2018 KU Leuven – Faculty of Engineering Science
Uitgegeven in eigen beheer, Christina-Angeliki Toli, Kasteelpark Arenberg 10, bus 2452, B-3001 Leuven
(Belgium)
Alle rechten voorbehouden. Niets uit deze uitgave mag worden vermenigvuldigd en/of openbaar gemaakt worden
door middel van druk, fotokopie, microﬁlm, elektronisch of op welke andere wijze ook zonder voorafgaande
schriftelijke toestemming van de uitgever.
All rights reserved. No part of the publication may be reproduced in any form by print, photoprint, microﬁlm,
electronic or any other means without written permission from the publisher.
Acknowledgements
“Whether you think you can or whether you think you can’t, you’re right.”
Henry Ford
This thesis is only the written result of a long journey. The note of
acknowledgements is the ﬁnishing touch on a personal quest. An accomplishment
that would not have had the same value without the help of some people who
deserve my gratitude.
I want to express my deep and sincere appreciation to my supervisor Prof. Bart
Preneel for giving me the opportun...


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

Input:
title:POSTER: Towards Privacy-Preserving Biometric Identification in Cloud
Computing
author:Changhee Hahn and
Junbeom Hur
ARENBERG DOCTORAL SCHOOL
Faculty of Engineering Science
Secure and
Privacy-Preserving
Biometric Systems
Supervisor:
Prof. dr. ir. Bart Preneel
Christina-Angeliki Toli
Dissertation presented in partial
fulﬁllment of the requirements for
the degree of Doctor of Engineering
Science (PhD): Electrical
Engineering
November 2018
Secure and Privacy-Preserving
Biometric Systems
Christina-Angeliki TOLI
Examination committee:
Prof. dr. Adhemar Bultheel, chair
Prof. dr. ir. Bart Preneel, supervisor
Prof. dr. ir. Frank Piessens
Prof. dr. Maria Claudia Diaz Martinez
Dr. Enrique Argones Rúa
Prof. dr. Aikaterini Mitrokotsa
(Chalmers University of Technology)
Dissertation presented in partial
fulﬁllment of the requirements for
the degree of Doctor of Engineering
Science (PhD): Electrical Engineer-
ing
November 2018
© 2018 KU Leuven – Faculty of Engineering Science
Uitgegeven in eigen beheer, Christina-Angeliki Toli, Kasteelpark Arenberg 10, bus 2452, B-3001 Leuven
(Belgium)
Alle rechten voorbehouden. Niets uit deze uitgave mag worden vermenigvuldigd en/of openbaar gemaakt worden
door middel van druk, fotokopie, microﬁlm, elektronisch of op welke andere wijze ook zonder voorafgaande
schriftelijke toestemming van de uitgever.
All rights reserved. No part of the publication may be reproduced in any form by print, photoprint, microﬁlm,
electronic or any other means without written permission from the publisher.
Acknowledgements
“Whether you think you can or whether you think you can’t, you’re right.”
Henry Ford
This thesis is only the written result of a long journey. The note of
acknowledgements is the ﬁnishing touch on a personal quest. An accomplishment
that would not have had the same value without the help of some people who
deserve my gratitude.
I want to express my deep and sincere appreciation to my supervisor Prof. Bart
Preneel for giving me the opportun...

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


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

Output:
安全论文分析：

title:Searchable Encryption with Secure and Efficient Updates
author:Florian Hahn and
Florian Kerschbaum
Searchable Encryption with Secure and Efﬁcient Updates
Florian Hahn
SAP, Karlsruhe
Germany
Florian Kerschbaum
SAP, Karlsruhe
Germany
ﬂorian.hahn@sap.com
ﬂorian.kerschbaum@sap.com
ABSTRACT
Searchable (symmetric) encryption allows encryption while
still enabling search for keywords.
Its immediate applica-
tion is cloud storage where a client outsources its ﬁles while
the (cloud) service provider should search and selectively
retrieve those. Searchable encryption is an active area of
research and a number of schemes with diﬀerent eﬃciency
and security characteristics have been proposed in the liter-
ature. Any scheme for practical adoption should be eﬃcient
– i.e. have sub-linear search time –, dynamic – i.e. allow
updates – and semantically secure to the most possible ex-
tent. Unfortunately, eﬃcient, dynamic searchable encryp-
tion schemes suﬀer from various drawbacks. Either they
deteriorate from semantic security to the security of deter-
ministic encryption under updates, they require to store in-
formation on the client and for deleted ﬁles and keywords
or they have very large index sizes. All of this is a problem,
since we can expect the majority of data to be later added
or changed. Since these schemes are also less eﬃcient than
deterministic encryption, they are currently an unfavorable
choice for encryption in the cloud. In this paper we present
the ﬁrst searchable encryption scheme whose updates leak
no more information than the access pattern, that still has
asymptotically optimal search time, linear, very small and
asymptotically optimal index size and can be implemented
without storage on the client (except the key). Our con-
struction is based on the novel idea of learning the index for
eﬃcient access from the access pattern itself. Furthermore,
we implement our system and show that it is highly eﬃcient
for cloud storage.
Categories and Subject Descri...


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

Input:
title:Searchable Encryption with Secure and Efficient Updates
author:Florian Hahn and
Florian Kerschbaum
Searchable Encryption with Secure and Efﬁcient Updates
Florian Hahn
SAP, Karlsruhe
Germany
Florian Kerschbaum
SAP, Karlsruhe
Germany
ﬂorian.hahn@sap.com
ﬂorian.kerschbaum@sap.com
ABSTRACT
Searchable (symmetric) encryption allows encryption while
still enabling search for keywords.
Its immediate applica-
tion is cloud storage where a client outsources its ﬁles while
the (cloud) service provider should search and selectively
retrieve those. Searchable encryption is an active area of
research and a number of schemes with diﬀerent eﬃciency
and security characteristics have been proposed in the liter-
ature. Any scheme for practical adoption should be eﬃcient
– i.e. have sub-linear search time –, dynamic – i.e. allow
updates – and semantically secure to the most possible ex-
tent. Unfortunately, eﬃcient, dynamic searchable encryp-
tion schemes suﬀer from various drawbacks. Either they
deteriorate from semantic security to the security of deter-
ministic encryption under updates, they require to store in-
formation on the client and for deleted ﬁles and keywords
or they have very large index sizes. All of this is a problem,
since we can expect the majority of data to be later added
or changed. Since these schemes are also less eﬃcient than
deterministic encryption, they are currently an unfavorable
choice for encryption in the cloud. In this paper we present
the ﬁrst searchable encryption scheme whose updates leak
no more information than the access pattern, that still has
asymptotically optimal search time, linear, very small and
asymptotically optimal index size and can be implemented
without storage on the client (except the key). Our con-
struction is based on the novel idea of learning the index for
eﬃcient access from the access pattern itself. Furthermore,
we implement our system and show that it is highly eﬃcient
for cloud storage.
Categories and Subject Descri...

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


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

Output:
安全论文分析：

title:How to Catch when Proxies Lie: Verifying the Physical Locations of
Network Proxies with Active Geolocation
author:Zachary Weinberg and
Shinyoung Cho and
Nicolas Christin and
Vyas Sekar and
Phillipa Gill
How to Catch when Proxies Lie
Verifying the Physical Locations of Network Proxies with Active Geolocation
Zachary Weinberg
Carnegie Mellon University
zackw@cmu.edu
Shinyoung Cho
Stony Brook University
shicho@cs.stonybrook.edu
Nicolas Christin
Carnegie Mellon University
nicolasc@cmu.edu
Vyas Sekar
Carnegie Mellon University
vsekar@cmu.edu
Phillipa Gill
University of Massachusetts
phillipa@cs.umass.edu
ABSTRACT
Internet users worldwide rely on commercial network proxies both
to conceal their true location and identity, and to control their appar-
ent location. Their reasons range from mundane to security-critical.
Proxy operators offer no proof that their advertised server loca-
tions are accurate. IP-to-location databases tend to agree with the
advertised locations, but there have been many reports of serious
errors in such databases.
In this study we estimate the locations of 2269 proxy servers from
ping-time measurements to hosts in known locations, combined
with AS and network information. These servers are operated by
seven proxy services, and, according to the operators, spread over
222 countries and territories. Our measurements show that one-
third of them are definitely not located in the advertised countries,
and another third might not be. Instead, they are concentrated in
countries where server hosting is cheap and reliable (e.g. Czech
Republic, Germany, Netherlands, UK, USA).
In the process, we address a number of technical challenges with
applying active geolocation to proxy servers, which may not be
directly pingable, and may restrict the types of packets that can be
sent through them, e.g. forbidding traceroute. We also test three
geolocation algorithms from previous literature, plus two variations
of our own design, at the scale of the whole worl...


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

Input:
title:How to Catch when Proxies Lie: Verifying the Physical Locations of
Network Proxies with Active Geolocation
author:Zachary Weinberg and
Shinyoung Cho and
Nicolas Christin and
Vyas Sekar and
Phillipa Gill
How to Catch when Proxies Lie
Verifying the Physical Locations of Network Proxies with Active Geolocation
Zachary Weinberg
Carnegie Mellon University
zackw@cmu.edu
Shinyoung Cho
Stony Brook University
shicho@cs.stonybrook.edu
Nicolas Christin
Carnegie Mellon University
nicolasc@cmu.edu
Vyas Sekar
Carnegie Mellon University
vsekar@cmu.edu
Phillipa Gill
University of Massachusetts
phillipa@cs.umass.edu
ABSTRACT
Internet users worldwide rely on commercial network proxies both
to conceal their true location and identity, and to control their appar-
ent location. Their reasons range from mundane to security-critical.
Proxy operators offer no proof that their advertised server loca-
tions are accurate. IP-to-location databases tend to agree with the
advertised locations, but there have been many reports of serious
errors in such databases.
In this study we estimate the locations of 2269 proxy servers from
ping-time measurements to hosts in known locations, combined
with AS and network information. These servers are operated by
seven proxy services, and, according to the operators, spread over
222 countries and territories. Our measurements show that one-
third of them are definitely not located in the advertised countries,
and another third might not be. Instead, they are concentrated in
countries where server hosting is cheap and reliable (e.g. Czech
Republic, Germany, Netherlands, UK, USA).
In the process, we address a number of technical challenges with
applying active geolocation to proxy servers, which may not be
directly pingable, and may restrict the types of packets that can be
sent through them, e.g. forbidding traceroute. We also test three
geolocation algorithms from previous literature, plus two variations
of our own design, at the scale of the whole worl...

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


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

Output:
安全论文分析：

title:Delegation of cryptographic servers for capture-resilient devices
author:Philip D. MacKenzie and
Michael K. Reiter
Delegation of Cryptographic Servers
for Capture-Resilient Devices
(Extended Abstract)
Philip MacKenzie
Bell Labs, Lucent Technologies
Michael K. Reiter
Bell Labs, Lucent Technologies
philmac@research.bell-labs.com
reiter@research.bell-labs.com
ABSTRACT
A device that performs private key operations (signatures
or decryptions), and whose private key operations are pro-
tected by a password, can be immunized against o(cid:15)ine dic-
tionary attacks in case of capture by forcing the device to
con(cid:12)rm a password guess with a designated remote server
in order to perform a private key operation. Recent propos-
als for achieving this allow untrusted servers and require no
server initialization per device. In this paper we extend these
proposals to enable dynamic delegation from one server to
another;
i.e., the device can subsequently use the second
server to secure its private key operations. One application
is to allow a user who is traveling to a foreign country to
temporarily delegate to a server local to that country the
ability to con(cid:12)rm password guesses and aid the user’s de-
vice in performing private key operations, or in the limit,
to temporarily delegate this ability to a token in the user’s
possession. Another application is proactive security for the
device’s private key, i.e., proactive updates to the device and
servers to eliminate any threat of o(cid:15)ine password guessing
attacks due to previously compromised servers.
1.
INTRODUCTION
A device that performs private key operations (signatures
or decryptions) risks exposure of its private key if captured.
While encrypting the private key with a password is com-
mon, this provides only marginal protection, since passwords
are well-known to be susceptible to o(cid:15)ine dictionary attacks
(e.g., [, ]). Much recent research has explored better
password protections for the pr...


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

Input:
title:Delegation of cryptographic servers for capture-resilient devices
author:Philip D. MacKenzie and
Michael K. Reiter
Delegation of Cryptographic Servers
for Capture-Resilient Devices
(Extended Abstract)
Philip MacKenzie
Bell Labs, Lucent Technologies
Michael K. Reiter
Bell Labs, Lucent Technologies
philmac@research.bell-labs.com
reiter@research.bell-labs.com
ABSTRACT
A device that performs private key operations (signatures
or decryptions), and whose private key operations are pro-
tected by a password, can be immunized against o(cid:15)ine dic-
tionary attacks in case of capture by forcing the device to
con(cid:12)rm a password guess with a designated remote server
in order to perform a private key operation. Recent propos-
als for achieving this allow untrusted servers and require no
server initialization per device. In this paper we extend these
proposals to enable dynamic delegation from one server to
another;
i.e., the device can subsequently use the second
server to secure its private key operations. One application
is to allow a user who is traveling to a foreign country to
temporarily delegate to a server local to that country the
ability to con(cid:12)rm password guesses and aid the user’s de-
vice in performing private key operations, or in the limit,
to temporarily delegate this ability to a token in the user’s
possession. Another application is proactive security for the
device’s private key, i.e., proactive updates to the device and
servers to eliminate any threat of o(cid:15)ine password guessing
attacks due to previously compromised servers.
1.
INTRODUCTION
A device that performs private key operations (signatures
or decryptions) risks exposure of its private key if captured.
While encrypting the private key with a password is com-
mon, this provides only marginal protection, since passwords
are well-known to be susceptible to o(cid:15)ine dictionary attacks
(e.g., [, ]). Much recent research has explored better
password protections for the pr...

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


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

Output:
安全论文分析：

title:HADES-IoT: A Practical Host-Based Anomaly Detection System for IoT
Devices
author:Dominik Breitenbacher and
Ivan Homoliak and
Yan Lin Aung and
Nils Ole Tippenhauer and
Yuval Elovici
HADES-IoT: A Practical Host-Based Anomaly Detection System
for IoT Devices (Extended Version)
Dominik Breitenbacher
Singapore University of Technology
and Design
Ivan Homoliak
and Design
dbreitenbacher@gmail.com
ivan_homoliak@sutd.edu.sg
Singapore University of Technology
Singapore University of Technology
Yan Lin Aung
and Design
linaung_yan@sutd.edu.sg
9
1
0
2
y
a
M
3
]
R
C
.
s
c
[
1
v
7
2
0
1
0
.
5
0
9
1
:
v
i
X
r
a
Nils Ole Tippenhauer
CISPA Helmholtz Center for
Information Security
tippenhauer@cispa.saarland
Yuval Elovici
Singapore University of Technology
and Design
yuval_elovici@sutd.edu.sg
ABSTRACT
Internet of Things (IoT) devices have become ubiquitous and are
spread across many application domains including the industry,
transportation, healthcare, and households. However, the prolifera-
tion of the IoT devices has raised the concerns about their security,
especially when observing that many manufacturers focus only
on the core functionality of their products due to short time to
market and low cost pressures, while neglecting security aspects.
Moreover, it does not exist any established or standardized method
for measuring and ensuring the security of IoT devices. Conse-
quently, vulnerabilities are left untreated, allowing attackers to
exploit IoT devices for various purposes, such as compromising
privacy, recruiting devices into a botnet, or misusing devices to
perform cryptocurrency mining.
In this paper, we present a practical Host-based Anomaly DE-
tection System for IoT (HADES-IoT) that represents the last line of
defense. HADES-IoT has proactive detection capabilities, provides
tamper-proof resistance, and it can be deployed on a wide range
of Linux-based IoT devices. The main advantage of HADES-IoT
is its low performance overhead, which makes it suitable for the
I...


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

Input:
title:HADES-IoT: A Practical Host-Based Anomaly Detection System for IoT
Devices
author:Dominik Breitenbacher and
Ivan Homoliak and
Yan Lin Aung and
Nils Ole Tippenhauer and
Yuval Elovici
HADES-IoT: A Practical Host-Based Anomaly Detection System
for IoT Devices (Extended Version)
Dominik Breitenbacher
Singapore University of Technology
and Design
Ivan Homoliak
and Design
dbreitenbacher@gmail.com
ivan_homoliak@sutd.edu.sg
Singapore University of Technology
Singapore University of Technology
Yan Lin Aung
and Design
linaung_yan@sutd.edu.sg
9
1
0
2
y
a
M
3
]
R
C
.
s
c
[
1
v
7
2
0
1
0
.
5
0
9
1
:
v
i
X
r
a
Nils Ole Tippenhauer
CISPA Helmholtz Center for
Information Security
tippenhauer@cispa.saarland
Yuval Elovici
Singapore University of Technology
and Design
yuval_elovici@sutd.edu.sg
ABSTRACT
Internet of Things (IoT) devices have become ubiquitous and are
spread across many application domains including the industry,
transportation, healthcare, and households. However, the prolifera-
tion of the IoT devices has raised the concerns about their security,
especially when observing that many manufacturers focus only
on the core functionality of their products due to short time to
market and low cost pressures, while neglecting security aspects.
Moreover, it does not exist any established or standardized method
for measuring and ensuring the security of IoT devices. Conse-
quently, vulnerabilities are left untreated, allowing attackers to
exploit IoT devices for various purposes, such as compromising
privacy, recruiting devices into a botnet, or misusing devices to
perform cryptocurrency mining.
In this paper, we present a practical Host-based Anomaly DE-
tection System for IoT (HADES-IoT) that represents the last line of
defense. HADES-IoT has proactive detection capabilities, provides
tamper-proof resistance, and it can be deployed on a wide range
of Linux-based IoT devices. The main advantage of HADES-IoT
is its low performance overhead, which makes it suitable for the
I...

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


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

Output:
安全论文分析：

title:iOS, Your OS, Everybody's OS: Vetting and Analyzing Network Services
of iOS Applications
author:Zhushou Tang and
Ke Tang and
Minhui Xue and
Yuan Tian and
Sen Chen and
Muhammad Ikram and
Tielei Wang and
Haojin Zhu
iOS, Your OS, Everybody’s OS: Vetting and Analyzing
Network Services of iOS Applications
Zhushou Tang, Shanghai Jiao Tong University and PWNZEN InfoTech Co., LTD;
Ke Tang, Shanghai Jiao Tong University; Minhui Xue, The University of Adelaide;
Yuan Tian, University of Virginia; Sen Chen, Nanyang Technological University;
Muhammad Ikram, Macquarie University; Tielei Wang, PWNZEN InfoTech Co., LTD;
Haojin Zhu, Shanghai Jiao Tong University
https://www.usenix.org/conference/usenixsecurity20/presentation/tang
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.iOS, Your OS, Everybody’s OS:
Vetting and Analyzing Network Services of iOS Applications
Zhushou Tang1,6 Ke Tang1 Minhui Xue2 Yuan Tian3
Sen Chen4 Muhammad Ikram5 Tielei Wang6 Haojin Zhu1
1Shanghai Jiao Tong University 2The University of Adelaide 3University of Virginia
4Nanyang Technological University 5Macquarie University 6PWNZEN InfoTech Co., LTD
Abstract
Smartphone applications that listen for network connections
introduce signiﬁcant security and privacy threats for users.
In this paper, we focus on vetting and analyzing the secu-
rity of iOS apps’ network services. To this end, we develop
an efﬁcient and scalable iOS app collection tool to down-
load 168,951 iOS apps in the wild. We investigate a set of
1,300 apps to understand the characteristics of network ser-
vice vulnerabilities, conﬁrming 11 vulnerabilities in popular
apps, such as Waze, Now, and QQBrowser. From these vul-
nerabilities, we create signatures for a large-scale analysis
of 168,951 iOS apps, which shows that the use of certain
third-party libraries listening for remot...


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

Input:
title:iOS, Your OS, Everybody's OS: Vetting and Analyzing Network Services
of iOS Applications
author:Zhushou Tang and
Ke Tang and
Minhui Xue and
Yuan Tian and
Sen Chen and
Muhammad Ikram and
Tielei Wang and
Haojin Zhu
iOS, Your OS, Everybody’s OS: Vetting and Analyzing
Network Services of iOS Applications
Zhushou Tang, Shanghai Jiao Tong University and PWNZEN InfoTech Co., LTD;
Ke Tang, Shanghai Jiao Tong University; Minhui Xue, The University of Adelaide;
Yuan Tian, University of Virginia; Sen Chen, Nanyang Technological University;
Muhammad Ikram, Macquarie University; Tielei Wang, PWNZEN InfoTech Co., LTD;
Haojin Zhu, Shanghai Jiao Tong University
https://www.usenix.org/conference/usenixsecurity20/presentation/tang
This paper is included in the Proceedings of the 29th USENIX Security Symposium.August 12–14, 2020978-1-939133-17-5Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX.iOS, Your OS, Everybody’s OS:
Vetting and Analyzing Network Services of iOS Applications
Zhushou Tang1,6 Ke Tang1 Minhui Xue2 Yuan Tian3
Sen Chen4 Muhammad Ikram5 Tielei Wang6 Haojin Zhu1
1Shanghai Jiao Tong University 2The University of Adelaide 3University of Virginia
4Nanyang Technological University 5Macquarie University 6PWNZEN InfoTech Co., LTD
Abstract
Smartphone applications that listen for network connections
introduce signiﬁcant security and privacy threats for users.
In this paper, we focus on vetting and analyzing the secu-
rity of iOS apps’ network services. To this end, we develop
an efﬁcient and scalable iOS app collection tool to down-
load 168,951 iOS apps in the wild. We investigate a set of
1,300 apps to understand the characteristics of network ser-
vice vulnerabilities, conﬁrming 11 vulnerabilities in popular
apps, such as Waze, Now, and QQBrowser. From these vul-
nerabilities, we create signatures for a large-scale analysis
of 168,951 iOS apps, which shows that the use of certain
third-party libraries listening for remot...

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


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

Output:
安全论文分析：

title:Living-Off-The-Land Command Detection Using Active Learning
author:Talha Ongun and
Jack W. Stokes and
Jonathan Bar Or and
Ke Tian and
Farid Tajaddodianfar and
Joshua Neil and
Christian Seifert and
Alina Oprea and
John C. Platt
Living-Off-The-Land Command Detection
Using Active Learning
Talha Ongun∗
Northeastern University
Boston, MA, USA
Ke Tian†
Microsoft
Redmond, WA, USA
Christian Seifert
Microsoft
Redmond, WA, USA
Jack W. Stokes
Microsoft
Redmond, WA, USA
Farid Tajaddodianfar‡
Microsoft
Redmond, WA, USA
Alina Oprea
Northeastern University
Boston, MA, USA
Jonathan Bar Or
Microsoft
Redmond, WA, USA
Joshua Neil
Microsoft
Redmond, WA, USA
John C. Platt§
Redmond, WA, USA
Microsoft
ABSTRACT
In recent years, enterprises have been targeted by advanced ad-
versaries who leverage creative ways to infiltrate their systems
and move laterally to gain access to critical data. One increasingly
common evasive method is to hide the malicious activity behind a
benign program by using tools that are already installed on user
computers. These programs are usually part of the operating system
distribution or another user-installed binary, therefore this type of
attack is called “Living-Off-The-Land”. Detecting these attacks is
challenging, as adversaries may not create malicious files on the
victim computers and anti-virus scans fail to detect them.
We propose the design of an Active Learning framework called
LOLAL for detecting Living-Off-the-Land attacks that iteratively
selects a set of uncertain and anomalous samples for labeling by a
human analyst. LOLAL is specifically designed to work well when
a limited number of labeled samples are available for training ma-
chine learning models to detect attacks. We investigate methods to
represent command-line text using word-embedding techniques,
and design ensemble boosting classifiers to distinguish malicious
and benign samples based on the embedding representation. We
leverage a large, anonymized dataset collected by an endpoint...


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

Input:
title:Living-Off-The-Land Command Detection Using Active Learning
author:Talha Ongun and
Jack W. Stokes and
Jonathan Bar Or and
Ke Tian and
Farid Tajaddodianfar and
Joshua Neil and
Christian Seifert and
Alina Oprea and
John C. Platt
Living-Off-The-Land Command Detection
Using Active Learning
Talha Ongun∗
Northeastern University
Boston, MA, USA
Ke Tian†
Microsoft
Redmond, WA, USA
Christian Seifert
Microsoft
Redmond, WA, USA
Jack W. Stokes
Microsoft
Redmond, WA, USA
Farid Tajaddodianfar‡
Microsoft
Redmond, WA, USA
Alina Oprea
Northeastern University
Boston, MA, USA
Jonathan Bar Or
Microsoft
Redmond, WA, USA
Joshua Neil
Microsoft
Redmond, WA, USA
John C. Platt§
Redmond, WA, USA
Microsoft
ABSTRACT
In recent years, enterprises have been targeted by advanced ad-
versaries who leverage creative ways to infiltrate their systems
and move laterally to gain access to critical data. One increasingly
common evasive method is to hide the malicious activity behind a
benign program by using tools that are already installed on user
computers. These programs are usually part of the operating system
distribution or another user-installed binary, therefore this type of
attack is called “Living-Off-The-Land”. Detecting these attacks is
challenging, as adversaries may not create malicious files on the
victim computers and anti-virus scans fail to detect them.
We propose the design of an Active Learning framework called
LOLAL for detecting Living-Off-the-Land attacks that iteratively
selects a set of uncertain and anomalous samples for labeling by a
human analyst. LOLAL is specifically designed to work well when
a limited number of labeled samples are available for training ma-
chine learning models to detect attacks. We investigate methods to
represent command-line text using word-embedding techniques,
and design ensemble boosting classifiers to distinguish malicious
and benign samples based on the embedding representation. We
leverage a large, anonymized dataset collected by an endpoint...

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


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

Output:
安全论文分析：

title:Simple bounds for a transient queue
author:Takayuki Osogami and
Rudy Raymond
Simple  bounds
for a transient
queue
Takayuki Osogami
-Tokyo
IBM Research
1623-14 Shimotsuruma,
Japan
Email: osogami@jp.ibm.com
Yamato-shi
242-8502,
Rudy Raymond
-Tokyo
IBM Research
1623-14 Shimotsuruma,
Japan
Email: raymond@jp.ibm.com
Yamato-shi
242-8502,
time, respectively.
Abstract-Bounds
a simple upper-bound,
on performance of a queueing model can
provide useful information
to guarantee quality of service for
communication networks. We study the bounds on the mean
delay in a transient GIIGIIl queue given the first two moments
of the service time and the inter-arrival
establish
which then is used to show that
the true transient mean-delay is at most four times larger than
an asymptotic diffusion-approximation.
We also prove that the
tight lower-bound is zero as long as the service time and the
inter-arrival
time have finite variance and the load is below
one. Tightness of the trivial lower-bound is in contrast to the
stationary
when the service time is sufficiently
our results can be applied to analyze the transient mean delay
of packets in the real-world Internet.
We also show how
mean-delay, which has strictly positive lower-bound
variable.
We
Index Terms-Queue, GIIGIIl, bounds, moments.
I. INTRODUCTION
metrics
models have
of service
requirements
perspective,
Bounds on performance
extensively
of queueing
in the literature.
The study is moti
and theoretical
the bounds can be used to guar
been studied
vated by both practical
From a practical
antee quality
theoretical
perspective,
give an understanding
model affect the performance
we investigate
GI/GI/1 queue given the first two moments of the service
S, and the inter-arrival
for communication
bounds on a performance
of which parameters
time, A, respectively.
of a queueing
metric and how. In this paper,
the bounds on the mean delay of a transient
networks. ...


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

Input:
title:Simple bounds for a transient queue
author:Takayuki Osogami and
Rudy Raymond
Simple  bounds
for a transient
queue
Takayuki Osogami
-Tokyo
IBM Research
1623-14 Shimotsuruma,
Japan
Email: osogami@jp.ibm.com
Yamato-shi
242-8502,
Rudy Raymond
-Tokyo
IBM Research
1623-14 Shimotsuruma,
Japan
Email: raymond@jp.ibm.com
Yamato-shi
242-8502,
time, respectively.
Abstract-Bounds
a simple upper-bound,
on performance of a queueing model can
provide useful information
to guarantee quality of service for
communication networks. We study the bounds on the mean
delay in a transient GIIGIIl queue given the first two moments
of the service time and the inter-arrival
establish
which then is used to show that
the true transient mean-delay is at most four times larger than
an asymptotic diffusion-approximation.
We also prove that the
tight lower-bound is zero as long as the service time and the
inter-arrival
time have finite variance and the load is below
one. Tightness of the trivial lower-bound is in contrast to the
stationary
when the service time is sufficiently
our results can be applied to analyze the transient mean delay
of packets in the real-world Internet.
We also show how
mean-delay, which has strictly positive lower-bound
variable.
We
Index Terms-Queue, GIIGIIl, bounds, moments.
I. INTRODUCTION
metrics
models have
of service
requirements
perspective,
Bounds on performance
extensively
of queueing
in the literature.
The study is moti
and theoretical
the bounds can be used to guar
been studied
vated by both practical
From a practical
antee quality
theoretical
perspective,
give an understanding
model affect the performance
we investigate
GI/GI/1 queue given the first two moments of the service
S, and the inter-arrival
for communication
bounds on a performance
of which parameters
time, A, respectively.
of a queueing
metric and how. In this paper,
the bounds on the mean delay of a transient
networks. ...

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


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

Output:
安全论文分析：

title:Understanding Mobile Traffic Patterns of Large Scale Cellular Towers
in Urban Environment
author:Huandong Wang and
Fengli Xu and
Yong Li and
Pengyu Zhang and
Depeng Jin
Understanding Mobile Trafﬁc Patterns of Large Scale
Cellular Towers in Urban Environment
Huandong Wang1, Fengli Xu1, Yong Li1, Pengyu Zhang2, Depeng Jin1
1Tsinghua National Laboratory for Information Science and Technology
Department of Electronic Engineering, Tsinghua University, Beijing 100084, China
{liyong07, jindp}@tsinghua.edu.cn, pyzhang@cs.umass.edu
2University of Massachusetts Amherst
ABSTRACT
Understanding mobile traﬃc patterns of large scale cellular
towers in urban environment is extremely valuable for In-
ternet service providers, mobile users, and government man-
agers of modern metropolis. This paper aims at extracting
and modeling the traﬃc patterns of large scale towers de-
ployed in a metropolitan city. To achieve this goal, we need
to address several challenges, including lack of appropriate
tools for processing large scale traﬃc measurement data,
unknown traﬃc patterns, as well as handling complicated
factors of urban ecology and human behaviors that aﬀect
traﬃc patterns. Our core contribution is a powerful model
which combines three dimensional information (time, loca-
tions of towers, and traﬃc frequency spectrum) to extract
and model the traﬃc patterns of thousands of cellular tow-
ers. Our empirical analysis reveals the following important
observations. First, only ﬁve basic time-domain traﬃc pat-
terns exist among the 9,600 cellular towers. Second, each of
the extracted traﬃc pattern maps to one type of geograph-
ical locations related to urban ecology, including residential
area, business district, transport, entertainment, and com-
prehensive area. Third, our frequency-domain traﬃc spec-
trum analysis suggests that the traﬃc of any tower among
the 9,600 can be constructed using a linear combination of
four primary components corresponding to human activi-
ty behaviors...


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

Input:
title:Understanding Mobile Traffic Patterns of Large Scale Cellular Towers
in Urban Environment
author:Huandong Wang and
Fengli Xu and
Yong Li and
Pengyu Zhang and
Depeng Jin
Understanding Mobile Trafﬁc Patterns of Large Scale
Cellular Towers in Urban Environment
Huandong Wang1, Fengli Xu1, Yong Li1, Pengyu Zhang2, Depeng Jin1
1Tsinghua National Laboratory for Information Science and Technology
Department of Electronic Engineering, Tsinghua University, Beijing 100084, China
{liyong07, jindp}@tsinghua.edu.cn, pyzhang@cs.umass.edu
2University of Massachusetts Amherst
ABSTRACT
Understanding mobile traﬃc patterns of large scale cellular
towers in urban environment is extremely valuable for In-
ternet service providers, mobile users, and government man-
agers of modern metropolis. This paper aims at extracting
and modeling the traﬃc patterns of large scale towers de-
ployed in a metropolitan city. To achieve this goal, we need
to address several challenges, including lack of appropriate
tools for processing large scale traﬃc measurement data,
unknown traﬃc patterns, as well as handling complicated
factors of urban ecology and human behaviors that aﬀect
traﬃc patterns. Our core contribution is a powerful model
which combines three dimensional information (time, loca-
tions of towers, and traﬃc frequency spectrum) to extract
and model the traﬃc patterns of thousands of cellular tow-
ers. Our empirical analysis reveals the following important
observations. First, only ﬁve basic time-domain traﬃc pat-
terns exist among the 9,600 cellular towers. Second, each of
the extracted traﬃc pattern maps to one type of geograph-
ical locations related to urban ecology, including residential
area, business district, transport, entertainment, and com-
prehensive area. Third, our frequency-domain traﬃc spec-
trum analysis suggests that the traﬃc of any tower among
the 9,600 can be constructed using a linear combination of
four primary components corresponding to human activi-
ty behaviors...

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


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

Output:
安全论文分析：

title:A new approach to DNS security (DNSSEC)
author:Giuseppe Ateniese and
Stefan Mangard
A New Approach to DNS Security (DNSSEC)
Giuseppe Ateniese
Stefan Mangard
Department of Computer Science and
JHU Information Security Institute
The Johns Hopkins University
3400 North Charles Street
Baltimore, MD 21218, USA
Institute for Applied Information
Processing and Communications (IAIK)
Graz University of Technology
Inffeldgasse 16a
8010 Graz, Austria
ateniese@cs.jhu.edu
stefan.mangard@iaik.at
ABSTRACT
The Domain Name System (DNS) is a distributed database
that allows convenient storing and retrieving of resource
records. DNS has been extended to provide security ser-
vices (DNSSEC) mainly through public-key cryptography.
We propose a new approach to DNSSEC that may result
in a signiﬁcantly more eﬃcient protocol. We introduce a
new strategy to build chains of trust from root servers to
authoritative servers. The techniques we employ are based
on symmetric-key cryptography.
Keywords
Domain Name System Security (DNSSEC), Authentication
Protocols, Digital Signatures, Symmetric Encryption
1.
INTRODUCTION
The Domain Name System (DNS) [14, 15, 16] is a hi-
erarchically distributed database that provides information
fundamental to Internet operations, such as translating be-
tween human readable host names and Internet Protocol
(IP) addresses. Due to the importance of the information
served by DNS, there is a strong demand for securing com-
munication within the DNS system. The current (insecure)
DNS does not prevent attackers from modifying or injecting
DNS messages. Users accessing hosts on the Internet rely
on the correct translation of host names to IP addresses
by the DNS system. A typical attack, referred to as DNS
spooﬁng, allows an attacker to manipulate DNS answers on
their way to the users. If an attacker makes changes in the
DNS tables of a single server, those changes will propagate
across the Internet. Recently, the RSA Security web page
was hijacked by spooﬁng the ...


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

Input:
title:A new approach to DNS security (DNSSEC)
author:Giuseppe Ateniese and
Stefan Mangard
A New Approach to DNS Security (DNSSEC)
Giuseppe Ateniese
Stefan Mangard
Department of Computer Science and
JHU Information Security Institute
The Johns Hopkins University
3400 North Charles Street
Baltimore, MD 21218, USA
Institute for Applied Information
Processing and Communications (IAIK)
Graz University of Technology
Inffeldgasse 16a
8010 Graz, Austria
ateniese@cs.jhu.edu
stefan.mangard@iaik.at
ABSTRACT
The Domain Name System (DNS) is a distributed database
that allows convenient storing and retrieving of resource
records. DNS has been extended to provide security ser-
vices (DNSSEC) mainly through public-key cryptography.
We propose a new approach to DNSSEC that may result
in a signiﬁcantly more eﬃcient protocol. We introduce a
new strategy to build chains of trust from root servers to
authoritative servers. The techniques we employ are based
on symmetric-key cryptography.
Keywords
Domain Name System Security (DNSSEC), Authentication
Protocols, Digital Signatures, Symmetric Encryption
1.
INTRODUCTION
The Domain Name System (DNS) [14, 15, 16] is a hi-
erarchically distributed database that provides information
fundamental to Internet operations, such as translating be-
tween human readable host names and Internet Protocol
(IP) addresses. Due to the importance of the information
served by DNS, there is a strong demand for securing com-
munication within the DNS system. The current (insecure)
DNS does not prevent attackers from modifying or injecting
DNS messages. Users accessing hosts on the Internet rely
on the correct translation of host names to IP addresses
by the DNS system. A typical attack, referred to as DNS
spooﬁng, allows an attacker to manipulate DNS answers on
their way to the users. If an attacker makes changes in the
DNS tables of a single server, those changes will propagate
across the Internet. Recently, the RSA Security web page
was hijacked by spooﬁng the ...

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


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

Output:
安全论文分析：

title:How to Make ASLR Win the Clone Wars: Runtime Re-Randomization
author:Kangjie Lu and
Wenke Lee and
Stefan N"urnberger and
Michael Backes
How to Make ASLR Win the Clone Wars:
Runtime Re-Randomization
Kangjie Lu†, Stefan N¨urnberger‡§, Michael Backes‡¶, and Wenke Lee†
†Georgia Institute of Technology, ‡CISPA, Saarland University, §DFKI, ¶MPI-SWS
kjlu@gatech.edu, {nuernberger, backes}@cs.uni-saarland.de, wenke@cc.gatech.edu
Abstract—Existing techniques for memory randomization
such as the widely explored Address Space Layout Randomization
(ASLR) perform a single, per-process randomization that is
applied before or at the process’ load-time. The efficacy of such
upfront randomizations crucially relies on the assumption that
an attacker has only one chance to guess the randomized address,
and that this attack succeeds only with a very low probability.
Recent research results have shown that this assumption is not
valid in many scenarios, e.g., daemon servers fork child processes
that inherent the state – and if applicable: the randomization – of
their parents, and thereby create clones with the same memory
layout. This enables the so-called clone-probing attacks where an
adversary repeatedly probes different clones in order to increase
its knowledge about their shared memory layout.
In this paper, we propose RUNTIMEASLR – the first ap-
proach that prevents clone-probing attacks without altering
the intended semantics of child process forking. The paper
makes the following three contributions. First, we propose a
semantics-preserving and runtime-based approach for preventing
clone-probing attacks by re-randomizing the address space of
every child after fork() at runtime while keeping the parent’s
state. We achieve this by devising a novel, automated pointer
tracking policy generation process that has to be run just once,
followed by a pointer tracking mechanism that is only applied to
the parent process. Second, we propose a systematic and holistic
pointer track...


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

Input:
title:How to Make ASLR Win the Clone Wars: Runtime Re-Randomization
author:Kangjie Lu and
Wenke Lee and
Stefan N"urnberger and
Michael Backes
How to Make ASLR Win the Clone Wars:
Runtime Re-Randomization
Kangjie Lu†, Stefan N¨urnberger‡§, Michael Backes‡¶, and Wenke Lee†
†Georgia Institute of Technology, ‡CISPA, Saarland University, §DFKI, ¶MPI-SWS
kjlu@gatech.edu, {nuernberger, backes}@cs.uni-saarland.de, wenke@cc.gatech.edu
Abstract—Existing techniques for memory randomization
such as the widely explored Address Space Layout Randomization
(ASLR) perform a single, per-process randomization that is
applied before or at the process’ load-time. The efficacy of such
upfront randomizations crucially relies on the assumption that
an attacker has only one chance to guess the randomized address,
and that this attack succeeds only with a very low probability.
Recent research results have shown that this assumption is not
valid in many scenarios, e.g., daemon servers fork child processes
that inherent the state – and if applicable: the randomization – of
their parents, and thereby create clones with the same memory
layout. This enables the so-called clone-probing attacks where an
adversary repeatedly probes different clones in order to increase
its knowledge about their shared memory layout.
In this paper, we propose RUNTIMEASLR – the first ap-
proach that prevents clone-probing attacks without altering
the intended semantics of child process forking. The paper
makes the following three contributions. First, we propose a
semantics-preserving and runtime-based approach for preventing
clone-probing attacks by re-randomizing the address space of
every child after fork() at runtime while keeping the parent’s
state. We achieve this by devising a novel, automated pointer
tracking policy generation process that has to be run just once,
followed by a pointer tracking mechanism that is only applied to
the parent process. Second, we propose a systematic and holistic
pointer track...

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


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

Output:
安全论文分析：

title:Seven Months' Worth of Mistakes: A Longitudinal Study of Typosquatting
Abuse
author:Pieter Agten and
Wouter Joosen and
Frank Piessens and
Nick Nikiforakis
Seven Months’ Worth of Mistakes:
A Longitudinal Study of Typosquatting Abuse
Pieter Agten∗, Wouter Joosen∗, Frank Piessens∗ and Nick Nikiforakis†
∗ iMinds-DistriNet, KU Leuven,
{firstname}.{lastname}@cs.kuleuven.be
† Department of Computer Science, Stony Brook University,
nick@cs.stonybrook.edu
Abstract—Typosquatting is the act of purposefully registering
a domain name that is a mistype of a popular domain name.
It is a concept that has been known and studied for over 15
years, yet still thoroughly practiced up until this day. While
previous typosquatting studies have always taken a snapshot of
the typosquatting landscape or base their longitudinal results
only on domain registration data, we present the ﬁrst content-
based,
longitudinal study of typosquatting. We collected data
about the typosquatting domains of the 500 most popular sites of
the Internet every day, for a period of seven months, and we use
this data to establish whether previously discovered typosquatting
trends still hold today, and to provide new results and insights
in the typosquatting landscape. In particular we reveal that,
even though 95% of the popular domains we investigated are
actively targeted by typosquatters, only few trademark owners
protect themselves against this practice by proactively registering
their own typosquatting domains. We take advantage of the
longitudinal aspect of our study to show, among other results,
that typosquatting domains change hands from typosquatters
to legitimate owners and vice versa, and that typosquatters
vary their monetization strategy by hosting different types of
pages over time. Our study also reveals that a large fraction of
typosquatting domains can be traced back to a small group of
typosquatting page hosters and that certain top-level domains are
much more prone to typosquatting than oth...


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

Input:
title:Seven Months' Worth of Mistakes: A Longitudinal Study of Typosquatting
Abuse
author:Pieter Agten and
Wouter Joosen and
Frank Piessens and
Nick Nikiforakis
Seven Months’ Worth of Mistakes:
A Longitudinal Study of Typosquatting Abuse
Pieter Agten∗, Wouter Joosen∗, Frank Piessens∗ and Nick Nikiforakis†
∗ iMinds-DistriNet, KU Leuven,
{firstname}.{lastname}@cs.kuleuven.be
† Department of Computer Science, Stony Brook University,
nick@cs.stonybrook.edu
Abstract—Typosquatting is the act of purposefully registering
a domain name that is a mistype of a popular domain name.
It is a concept that has been known and studied for over 15
years, yet still thoroughly practiced up until this day. While
previous typosquatting studies have always taken a snapshot of
the typosquatting landscape or base their longitudinal results
only on domain registration data, we present the ﬁrst content-
based,
longitudinal study of typosquatting. We collected data
about the typosquatting domains of the 500 most popular sites of
the Internet every day, for a period of seven months, and we use
this data to establish whether previously discovered typosquatting
trends still hold today, and to provide new results and insights
in the typosquatting landscape. In particular we reveal that,
even though 95% of the popular domains we investigated are
actively targeted by typosquatters, only few trademark owners
protect themselves against this practice by proactively registering
their own typosquatting domains. We take advantage of the
longitudinal aspect of our study to show, among other results,
that typosquatting domains change hands from typosquatters
to legitimate owners and vice versa, and that typosquatters
vary their monetization strategy by hosting different types of
pages over time. Our study also reveals that a large fraction of
typosquatting domains can be traced back to a small group of
typosquatting page hosters and that certain top-level domains are
much more prone to typosquatting than oth...

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


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

Output:
安全论文分析：

title:Crossing the "Valley of Death": Transitioning Research into Commercial
Products - A Personal Perspective
author:W. Douglas Maughan
2010 IEEE Symposium on Security and Privacy
Crossing the “Valley of Death”: Transitioning Research into Commercial Products
A Personal Perspective
W. Douglas Maughan
Potomac Institute for Policy Studies
Arlington, Virginia  USA
Douglas.Maughan@verizon.net
Abstract—Many  researchers  with  innovative  ideas  just  never
seem  to  be  able  to  bring  those  ideas  to  market.  One  of  the
biggest problems within the cybersecurity research community
is  transitioning  technology  into  commercial  product.  This
paper discusses these technology transition activities from the
view  of  a  program  manager  and  offers  several  examples  of
successful transition for consideration.
Keywords-  technology  transition;  cybersecurity;  research;
development; open source; small business
I. INTRODUCTION
A  consistent  problem  encountered  in  the  world  of
research  and  development  (R&D),  which  is  especially  true
for the field of cyber security, is taking the research through
a path of development, testing, evaluation, and transition into
operational  environments.  Past  experience  shows
that
transition plans developed and applied early in the life cycle
of the research program, with probable paths for the research
product,  are  effective  in  achieving  successful  transfer  from
research to application and use. Transition plans are subject
to  change  and  must  be
reviewed  often.  Different
technologies  are  better  suited  for  different  technology
transition  paths  and  in  some  instances  the  choice  of  the
transition  path  will  ultimately  determine  success  or  failure
for
the  “research  product”  becoming  a  “commercial
product”.
A July 2007 Department of Defense Report to Congress
on  Technology  Transition  noted  there  is  evidence  that  a
chasm  exists  between  the  ...


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

Input:
title:Crossing the "Valley of Death": Transitioning Research into Commercial
Products - A Personal Perspective
author:W. Douglas Maughan
2010 IEEE Symposium on Security and Privacy
Crossing the “Valley of Death”: Transitioning Research into Commercial Products
A Personal Perspective
W. Douglas Maughan
Potomac Institute for Policy Studies
Arlington, Virginia  USA
Douglas.Maughan@verizon.net
Abstract—Many  researchers  with  innovative  ideas  just  never
seem  to  be  able  to  bring  those  ideas  to  market.  One  of  the
biggest problems within the cybersecurity research community
is  transitioning  technology  into  commercial  product.  This
paper discusses these technology transition activities from the
view  of  a  program  manager  and  offers  several  examples  of
successful transition for consideration.
Keywords-  technology  transition;  cybersecurity;  research;
development; open source; small business
I. INTRODUCTION
A  consistent  problem  encountered  in  the  world  of
research  and  development  (R&D),  which  is  especially  true
for the field of cyber security, is taking the research through
a path of development, testing, evaluation, and transition into
operational  environments.  Past  experience  shows
that
transition plans developed and applied early in the life cycle
of the research program, with probable paths for the research
product,  are  effective  in  achieving  successful  transfer  from
research to application and use. Transition plans are subject
to  change  and  must  be
reviewed  often.  Different
technologies  are  better  suited  for  different  technology
transition  paths  and  in  some  instances  the  choice  of  the
transition  path  will  ultimately  determine  success  or  failure
for
the  “research  product”  becoming  a  “commercial
product”.
A July 2007 Department of Defense Report to Congress
on  Technology  Transition  noted  there  is  evidence  that  a
chasm  exists  between  the  ...

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


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

Output:
安全论文分析：

title:Using GANs for Sharing Networked Time Series Data: Challenges, Initial
Promise, and Open Questions
author:Zinan Lin and
Alankar Jain and
Chen Wang and
Giulia C. Fanti and
Vyas Sekar
Using GANs for Sharing Networked Time Series Data:
Challenges, Initial Promise, and Open Questions
Zinan Lin
Chen Wang
Alankar Jain
IBM
New York, NY
Chen.Wang1@ibm.com
Carnegie Mellon University
Pittsburgh, PA
zinanl@andrew.cmu.edu
Carnegie Mellon University
Pittsburgh, PA
alankarjain91@gmail.com
Giulia Fanti
Carnegie Mellon University
Pittsburgh, PA
gfanti@andrew.cmu.edu
Vyas Sekar
Carnegie Mellon University
Pittsburgh, PA
vsekar@andrew.cmu.edu
ABSTRACT
Limited data access is a longstanding barrier to data-driven re-
search and development in the networked systems community.
In this work, we explore if and how generative adversarial net-
works (GANs) can be used to incentivize data sharing by enabling
a generic framework for sharing synthetic datasets with minimal
expert knowledge. As a specific target, our focus in this paper is
on time series datasets with metadata (e.g., packet loss rate mea-
surements with corresponding ISPs). We identify key challenges
of existing GAN approaches for such workloads with respect to
fidelity (e.g., long-term dependencies, complex multidimensional
relationships, mode collapse) and privacy (i.e., existing guarantees
are poorly understood and can sacrifice fidelity). To improve fi-
delity, we design a custom workflow called DoppelGANger (DG)
and demonstrate that across diverse real-world datasets (e.g., band-
width measurements, cluster requests, web sessions) and use cases
(e.g., structural characterization, predictive modeling, algorithm
comparison), DG achieves up to 43% better fidelity than baseline
models. Although we do not resolve the privacy problem in this
work, we identify fundamental challenges with both classical no-
tions of privacy and recent advances to improve the privacy prop-
erties of GANs, and suggest a potential roadmap for add...


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

Input:
title:Using GANs for Sharing Networked Time Series Data: Challenges, Initial
Promise, and Open Questions
author:Zinan Lin and
Alankar Jain and
Chen Wang and
Giulia C. Fanti and
Vyas Sekar
Using GANs for Sharing Networked Time Series Data:
Challenges, Initial Promise, and Open Questions
Zinan Lin
Chen Wang
Alankar Jain
IBM
New York, NY
Chen.Wang1@ibm.com
Carnegie Mellon University
Pittsburgh, PA
zinanl@andrew.cmu.edu
Carnegie Mellon University
Pittsburgh, PA
alankarjain91@gmail.com
Giulia Fanti
Carnegie Mellon University
Pittsburgh, PA
gfanti@andrew.cmu.edu
Vyas Sekar
Carnegie Mellon University
Pittsburgh, PA
vsekar@andrew.cmu.edu
ABSTRACT
Limited data access is a longstanding barrier to data-driven re-
search and development in the networked systems community.
In this work, we explore if and how generative adversarial net-
works (GANs) can be used to incentivize data sharing by enabling
a generic framework for sharing synthetic datasets with minimal
expert knowledge. As a specific target, our focus in this paper is
on time series datasets with metadata (e.g., packet loss rate mea-
surements with corresponding ISPs). We identify key challenges
of existing GAN approaches for such workloads with respect to
fidelity (e.g., long-term dependencies, complex multidimensional
relationships, mode collapse) and privacy (i.e., existing guarantees
are poorly understood and can sacrifice fidelity). To improve fi-
delity, we design a custom workflow called DoppelGANger (DG)
and demonstrate that across diverse real-world datasets (e.g., band-
width measurements, cluster requests, web sessions) and use cases
(e.g., structural characterization, predictive modeling, algorithm
comparison), DG achieves up to 43% better fidelity than baseline
models. Although we do not resolve the privacy problem in this
work, we identify fundamental challenges with both classical no-
tions of privacy and recent advances to improve the privacy prop-
erties of GANs, and suggest a potential roadmap for add...

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


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

Output:
安全论文分析：

title:Cloudy with a Chance of Breach: Forecasting Cyber Security Incidents
author:Yang Liu and
Armin Sarabi and
Jing Zhang and
Parinaz Naghizadeh and
Manish Karir and
Michael Bailey and
Mingyan Liu
Cloudy with a Chance of Breach:
Forecasting Cyber Security Incidents
Yang Liu, Armin Sarabi, Jing Zhang, and Parinaz Naghizadeh, University of Michigan;
Manish Karir, QuadMetrics, Inc.; Michael Bailey, University of Illinois at Urbana-Champaign;
Mingyan Liu, University of Michigan and QuadMetrics, Inc.
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/liu
This paper is included in the Proceedings of the
24th USENIX Security Symposium
August 12–14, 2015 • Washington, D.C.
ISBN  978-1-939133-11-3
Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXCloudy with a Chance of Breach: Forecasting Cyber Security Incidents
Yang Liu1, Armin Sarabi1, Jing Zhang1, Parinaz Naghizadeh1
Manish Karir2, Michael Bailey3, Mingyan Liu1,2
1 EECS Department, University of Michigan, Ann Arbor
3 ECE Department, University of Illinois, Urbana-Champaign
2 QuadMetrics, Inc.
Abstract
In this study we characterize the extent to which cyber
security incidents, such as those referenced by Verizon
in its annual Data Breach Investigations Reports (DBIR),
can be predicted based on externally observable prop-
erties of an organization’s network. We seek to proac-
tively forecast an organization’s breaches and to do so
without cooperation of the organization itself. To ac-
complish this goal, we collect 258 externally measur-
able features about an organization’s network from two
main categories: mismanagement symptoms, such as
misconﬁgured DNS or BGP within a network, and mali-
cious activity time series, which include spam, phishing,
and scanning activity sourced from these organizations.
Using these features we train and test a Random For-
est (RF) classiﬁer against more than 1,000 incident re-
ports taken from the VERIS commun...


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

Input:
title:Cloudy with a Chance of Breach: Forecasting Cyber Security Incidents
author:Yang Liu and
Armin Sarabi and
Jing Zhang and
Parinaz Naghizadeh and
Manish Karir and
Michael Bailey and
Mingyan Liu
Cloudy with a Chance of Breach:
Forecasting Cyber Security Incidents
Yang Liu, Armin Sarabi, Jing Zhang, and Parinaz Naghizadeh, University of Michigan;
Manish Karir, QuadMetrics, Inc.; Michael Bailey, University of Illinois at Urbana-Champaign;
Mingyan Liu, University of Michigan and QuadMetrics, Inc.
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/liu
This paper is included in the Proceedings of the
24th USENIX Security Symposium
August 12–14, 2015 • Washington, D.C.
ISBN  978-1-939133-11-3
Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXCloudy with a Chance of Breach: Forecasting Cyber Security Incidents
Yang Liu1, Armin Sarabi1, Jing Zhang1, Parinaz Naghizadeh1
Manish Karir2, Michael Bailey3, Mingyan Liu1,2
1 EECS Department, University of Michigan, Ann Arbor
3 ECE Department, University of Illinois, Urbana-Champaign
2 QuadMetrics, Inc.
Abstract
In this study we characterize the extent to which cyber
security incidents, such as those referenced by Verizon
in its annual Data Breach Investigations Reports (DBIR),
can be predicted based on externally observable prop-
erties of an organization’s network. We seek to proac-
tively forecast an organization’s breaches and to do so
without cooperation of the organization itself. To ac-
complish this goal, we collect 258 externally measur-
able features about an organization’s network from two
main categories: mismanagement symptoms, such as
misconﬁgured DNS or BGP within a network, and mali-
cious activity time series, which include spam, phishing,
and scanning activity sourced from these organizations.
Using these features we train and test a Random For-
est (RF) classiﬁer against more than 1,000 incident re-
ports taken from the VERIS commun...

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


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

Output:
安全论文分析：

title:Achieving Flexibility for ABE with Outsourcing via Proxy Re-Encryption
author:Zuoxia Yu and
Man Ho Au and
Rupeng Yang and
Junzuo Lai and
Qiuliang Xu
Achieving Flexibility for ABE with Outsourcing via Proxy
Re-Encryption
Zuoxia Yu
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
zuoxia.yu@gmail.com
Man Ho Au∗
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
csallen@comp.polyu.edu.hk
Rupeng Yang
School of Computer Science and
Technology, Shandong University;
Department of Computing,
The Hong Kong Polytechnic
University
Jinan, China
orbbyrp@gmail.com
Junzuo Lai
College of Information Science and
Technology, Jinan University,
Guangzhou, China;
State Key Laboratory of Cryptology,
Beijing, China
laijunzuo@gmail.com
Qiuliang Xu
School of Computer Science and
Technology,
Shandong University
Jinan, China
xql@sdu.edu.cn
ABSTRACT
Outsourcing the decryption of attribute-based encryption (ABE)
ciphertext is a promising way to tackle the question of how users
can perform decryption efficiently. However, existing solutions re-
quire the type of the target ciphertext to be determined at the setup
of the outsourcing scheme. As such, making the target cryptosys-
tems (or the clients) to be versatile becomes an issue that warrants
investigations. In this paper, the problem we wish to tackle is to
transform an ABE ciphertext to any client who is using the same,
or possibly different, public-key encryption (PKE) system with the
sender. The problem is of practical interest since it is hard to require
all clients to use the same PKE, especially in the case of remote and
cross-system data sharing. In addition, we also consider whether
robust client-side decryption scheme can be adopted. This feature
is not supported in the existing ABE with outsourcing.
We introduce cross-system proxy re-encryptions (CS-PRE), a
new re-encryption paradigm in which a semi-trusted proxy con-
verts a ciphertext of a source cryptosystem (Π0) into...


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

Input:
title:Achieving Flexibility for ABE with Outsourcing via Proxy Re-Encryption
author:Zuoxia Yu and
Man Ho Au and
Rupeng Yang and
Junzuo Lai and
Qiuliang Xu
Achieving Flexibility for ABE with Outsourcing via Proxy
Re-Encryption
Zuoxia Yu
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
zuoxia.yu@gmail.com
Man Ho Au∗
Department of Computing,
The Hong Kong Polytechnic
University
Hong Kong, China
csallen@comp.polyu.edu.hk
Rupeng Yang
School of Computer Science and
Technology, Shandong University;
Department of Computing,
The Hong Kong Polytechnic
University
Jinan, China
orbbyrp@gmail.com
Junzuo Lai
College of Information Science and
Technology, Jinan University,
Guangzhou, China;
State Key Laboratory of Cryptology,
Beijing, China
laijunzuo@gmail.com
Qiuliang Xu
School of Computer Science and
Technology,
Shandong University
Jinan, China
xql@sdu.edu.cn
ABSTRACT
Outsourcing the decryption of attribute-based encryption (ABE)
ciphertext is a promising way to tackle the question of how users
can perform decryption efficiently. However, existing solutions re-
quire the type of the target ciphertext to be determined at the setup
of the outsourcing scheme. As such, making the target cryptosys-
tems (or the clients) to be versatile becomes an issue that warrants
investigations. In this paper, the problem we wish to tackle is to
transform an ABE ciphertext to any client who is using the same,
or possibly different, public-key encryption (PKE) system with the
sender. The problem is of practical interest since it is hard to require
all clients to use the same PKE, especially in the case of remote and
cross-system data sharing. In addition, we also consider whether
robust client-side decryption scheme can be adopted. This feature
is not supported in the existing ABE with outsourcing.
We introduce cross-system proxy re-encryptions (CS-PRE), a
new re-encryption paradigm in which a semi-trusted proxy con-
verts a ciphertext of a source cryptosystem (Π0) into...

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


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

Output:
安全论文分析：

title:T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
author:Xiaopeng Li and
Qiang Zeng and
Lannan Luo and
Tongbo Luo
T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
Xiaopeng Li
University of South Carolina
xl4@email.sc.edu
Lannan Luo
University of South Carolina
lluo@cse.sc.edu
Qiang Zeng∗
University of South Carolina
zeng1@cse.sc.edu
Tongbo Luo
JD.com
tongbo.luo@jd.com
ABSTRACT
Secure pairing is key to trustworthy deployment and application of
Internet of Things (IoT) devices. However, IoT devices lack conven-
tional user interfaces, such as keyboards and displays, which makes
many traditional pairing approaches inapplicable. Proximity-based
pairing approaches are very usable, but can be exploited by co-
located malicious devices. Approaches based on a user’s physical
operations on IoT devices are more secure, but typically require
inertial sensors, while many devices do not satisfy this require-
ment. A secure and usable pairing approach that can be applied to
heterogeneous IoT devices still does not exist. We develop a tech-
nique, Universal Operation Sensing, which allows an IoT device to
sense the user’s physical operations on it without requiring inertial
sensors. With this technique, a user holding a smartphone or wear-
ing a wristband can finish pairing in seconds through some very
simple operations, e.g., pressing a button or twisting a knob. More-
over, we reveal an inaccuracy issue in original fuzzy commitment
and propose faithful fuzzy commitment to resolve it. We design
a pairing protocol using faithful fuzzy commitment, and build a
prototype system named Touch-to-Pair (T2Pair, for short). The
comprehensive evaluation shows that it is secure and usable.
CCS CONCEPTS
• Security and privacy→ Security services; Network security;
• Computer systems organization→ Sensor networks.
KEYWORDS
Pairing; Internet of Things; fuzzy commitment; PAKE
ACM Reference Format:
Xiaopeng Li, Qiang Zeng, Lannan Luo, and Tongbo Luo. 2020. T2Pair...


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

Input:
title:T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
author:Xiaopeng Li and
Qiang Zeng and
Lannan Luo and
Tongbo Luo
T2Pair: Secure and Usable Pairing for Heterogeneous IoT Devices
Xiaopeng Li
University of South Carolina
xl4@email.sc.edu
Lannan Luo
University of South Carolina
lluo@cse.sc.edu
Qiang Zeng∗
University of South Carolina
zeng1@cse.sc.edu
Tongbo Luo
JD.com
tongbo.luo@jd.com
ABSTRACT
Secure pairing is key to trustworthy deployment and application of
Internet of Things (IoT) devices. However, IoT devices lack conven-
tional user interfaces, such as keyboards and displays, which makes
many traditional pairing approaches inapplicable. Proximity-based
pairing approaches are very usable, but can be exploited by co-
located malicious devices. Approaches based on a user’s physical
operations on IoT devices are more secure, but typically require
inertial sensors, while many devices do not satisfy this require-
ment. A secure and usable pairing approach that can be applied to
heterogeneous IoT devices still does not exist. We develop a tech-
nique, Universal Operation Sensing, which allows an IoT device to
sense the user’s physical operations on it without requiring inertial
sensors. With this technique, a user holding a smartphone or wear-
ing a wristband can finish pairing in seconds through some very
simple operations, e.g., pressing a button or twisting a knob. More-
over, we reveal an inaccuracy issue in original fuzzy commitment
and propose faithful fuzzy commitment to resolve it. We design
a pairing protocol using faithful fuzzy commitment, and build a
prototype system named Touch-to-Pair (T2Pair, for short). The
comprehensive evaluation shows that it is secure and usable.
CCS CONCEPTS
• Security and privacy→ Security services; Network security;
• Computer systems organization→ Sensor networks.
KEYWORDS
Pairing; Internet of Things; fuzzy commitment; PAKE
ACM Reference Format:
Xiaopeng Li, Qiang Zeng, Lannan Luo, and Tongbo Luo. 2020. T2Pair...

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


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

Output:
安全论文分析：

title:RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment
and Invalid Route Origins
author:Taejoong Chung and
Emile Aben and
Tim Bruijnzeels and
Balakrishnan Chandrasekaran and
David R. Choffnes and
Dave Levin and
Bruce M. Maggs and
Alan Mislove and
Roland van Rijswijk-Deij and
John P. Rula and
Nick Sullivan
RPKI is Coming of Age
A Longitudinal Study of RPKI Deployment and Invalid Route Origins
Taejoong Chung
Rochester Institute of Technology
Balakrishnan Chandrasekaran
Max Planck Institute for Informatics
Bruce M. Maggs
Duke University and
Akamai Technologies
Emile Aben
RIPE NCC
David Choffnes
Northeastern University
Alan Mislove
Northeastern University
Tim Bruijnzeels
NLNetLabs
Dave Levin
University of Maryland
Roland van Rijswijk-Deij
University of Twente and
NLNetLabs
John Rula
Akamai Technologies
Nick Sullivan
Cloudflare
ABSTRACT
Despite its critical role in Internet connectivity, the Border Gateway
Protocol (BGP) remains highly vulnerable to attacks such as prefix
hijacking, where an Autonomous System (AS) announces routes
for IP space it does not control. To address this issue, the Resource
Public Key Infrastructure (RPKI) was developed starting in 2008,
with deployment beginning in 2011. This paper performs the first
comprehensive, longitudinal study of the deployment, coverage,
and quality of RPKI.
We use a unique dataset containing all RPKI Route Origin Autho-
rizations (ROAs) from the moment RPKI was first deployed, more
than 8 years ago. We combine this dataset with BGP announce-
ments from more than 3,300 BGP collectors worldwide. Our analysis
shows the after a gradual start, RPKI has seen a rapid increase in
adoption over the past two years. We also show that although
misconfigurations were rampant when RPKI was first deployed
(causing many announcements to appear as invalid) they are quite
rare today. We develop a taxonomy of invalid RPKI announcements,
then quantify their prevalence. We further identify suspicious an-
nouncements indicativ...


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

Input:
title:RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment
and Invalid Route Origins
author:Taejoong Chung and
Emile Aben and
Tim Bruijnzeels and
Balakrishnan Chandrasekaran and
David R. Choffnes and
Dave Levin and
Bruce M. Maggs and
Alan Mislove and
Roland van Rijswijk-Deij and
John P. Rula and
Nick Sullivan
RPKI is Coming of Age
A Longitudinal Study of RPKI Deployment and Invalid Route Origins
Taejoong Chung
Rochester Institute of Technology
Balakrishnan Chandrasekaran
Max Planck Institute for Informatics
Bruce M. Maggs
Duke University and
Akamai Technologies
Emile Aben
RIPE NCC
David Choffnes
Northeastern University
Alan Mislove
Northeastern University
Tim Bruijnzeels
NLNetLabs
Dave Levin
University of Maryland
Roland van Rijswijk-Deij
University of Twente and
NLNetLabs
John Rula
Akamai Technologies
Nick Sullivan
Cloudflare
ABSTRACT
Despite its critical role in Internet connectivity, the Border Gateway
Protocol (BGP) remains highly vulnerable to attacks such as prefix
hijacking, where an Autonomous System (AS) announces routes
for IP space it does not control. To address this issue, the Resource
Public Key Infrastructure (RPKI) was developed starting in 2008,
with deployment beginning in 2011. This paper performs the first
comprehensive, longitudinal study of the deployment, coverage,
and quality of RPKI.
We use a unique dataset containing all RPKI Route Origin Autho-
rizations (ROAs) from the moment RPKI was first deployed, more
than 8 years ago. We combine this dataset with BGP announce-
ments from more than 3,300 BGP collectors worldwide. Our analysis
shows the after a gradual start, RPKI has seen a rapid increase in
adoption over the past two years. We also show that although
misconfigurations were rampant when RPKI was first deployed
(causing many announcements to appear as invalid) they are quite
rare today. We develop a taxonomy of invalid RPKI announcements,
then quantify their prevalence. We further identify suspicious an-
nouncements indicativ...

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


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

Output:
安全论文分析：

title:Profiling BGP Serial Hijackers: Capturing Persistent Misbehavior
in the Global Routing Table
author:Cecilia Testart and
Philipp Richter and
Alistair King and
Alberto Dainotti and
David Clark
Profiling BGP Serial Hijackers: Capturing Persistent
Misbehavior in the Global Routing Table
Cecilia Testart
MIT
ctestart@csail.mit.edu
Philipp Richter
MIT
richterp@csail.mit.edu
Alistair King
CAIDA, UC San Diego
alistair@caida.org
Alberto Dainotti
CAIDA, UC San Diego
alberto@caida.org
ABSTRACT
BGP hijacks remain an acute problem in today’s Internet, with wide-
spread consequences. While hijack detection systems are readily
available, they typically rely on a priori prefix-ownership infor-
mation and are reactive in nature. In this work, we take on a new
perspective on BGP hijacking activity: we introduce and track the
long-term routing behavior of serial hijackers, networks that re-
peatedly hijack address blocks for malicious purposes, often over
the course of many months or even years. Based on a ground truth
dataset that we construct by extracting information from network
operator mailing lists, we illuminate the dominant routing char-
acteristics of serial hijackers, and how they differ from legitimate
networks. We then distill features that can capture these behavioral
differences and train a machine learning model to automatically
identify Autonomous Systems (ASes) that exhibit characteristics
similar to serial hijackers. Our classifier identifies ≈ 900 ASes with
similar behavior in the global IPv4 routing table. We analyze and
categorize these networks, finding a wide range of indicators of
malicious activity, misconfiguration, as well as benign hijacking
activity. Our work presents a solid first step towards identifying
and understanding this important category of networks, which
can aid network operators in taking proactive measures to defend
themselves against prefix hijacking and serve as input for current
and future detection systems.
CCS CONCEPTS
• Networks →...


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

Input:
title:Profiling BGP Serial Hijackers: Capturing Persistent Misbehavior
in the Global Routing Table
author:Cecilia Testart and
Philipp Richter and
Alistair King and
Alberto Dainotti and
David Clark
Profiling BGP Serial Hijackers: Capturing Persistent
Misbehavior in the Global Routing Table
Cecilia Testart
MIT
ctestart@csail.mit.edu
Philipp Richter
MIT
richterp@csail.mit.edu
Alistair King
CAIDA, UC San Diego
alistair@caida.org
Alberto Dainotti
CAIDA, UC San Diego
alberto@caida.org
ABSTRACT
BGP hijacks remain an acute problem in today’s Internet, with wide-
spread consequences. While hijack detection systems are readily
available, they typically rely on a priori prefix-ownership infor-
mation and are reactive in nature. In this work, we take on a new
perspective on BGP hijacking activity: we introduce and track the
long-term routing behavior of serial hijackers, networks that re-
peatedly hijack address blocks for malicious purposes, often over
the course of many months or even years. Based on a ground truth
dataset that we construct by extracting information from network
operator mailing lists, we illuminate the dominant routing char-
acteristics of serial hijackers, and how they differ from legitimate
networks. We then distill features that can capture these behavioral
differences and train a machine learning model to automatically
identify Autonomous Systems (ASes) that exhibit characteristics
similar to serial hijackers. Our classifier identifies ≈ 900 ASes with
similar behavior in the global IPv4 routing table. We analyze and
categorize these networks, finding a wide range of indicators of
malicious activity, misconfiguration, as well as benign hijacking
activity. Our work presents a solid first step towards identifying
and understanding this important category of networks, which
can aid network operators in taking proactive measures to defend
themselves against prefix hijacking and serve as input for current
and future detection systems.
CCS CONCEPTS
• Networks →...

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