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

Output:
安全论文分析：

title:Revisiting anomaly detection system design philosophy
author:Ayesha Binte Ashfaq and
Muhammad Qasim Ali and
Ehab Al-Shaer and
Syed Ali Khayam
POSTER: Revisiting Anomaly Detection System Design
Philosophy
Ayesha Binte Ashfaq1, Muhammad Qasim Ali2, Ehab Al-Shaer2 and Syed Ali Khayam3
1 School of Electrical Engineering and Computer Science
National University of Sciences and Technology, Islamabad, Pakistan
2 Department of Software and Information Systems
University of North Carolina Charlotte
3 PLUMgrid Inc.
Sunnyvale, CA
ayesha.ashfaq@seecs.edu.pk; {mali12,ealshaer}@uncc.edu; khayam@gmail.com
ABSTRACT
The inherent design of anomaly detection systems (ADSs)
make them highly susceptible to evasion attacks and hence
their wide-spread commercial deployment has not been wit-
nessed. There are two main reasons for this: 1) ADSs in-
cur high false positives; 2) Are highly susceptible to evasion
attacks (false negatives). While eﬀorts have been made to
minimize false positives, evasion is still an open problem. We
argue that ADSs design is inherently ﬂawed since it relies on
the ADS’s detection logic and feature space which is trivial
to estimate. In information security e.g. cryptographic algo-
rithms (such as DES), security is inherently dependent upon
the key and not the algorithm, which makes these systems
very robust by rendering evasion computationally infeasible.
We believe there is a need to redesign the anomaly detec-
tion systems similar to cryptographic systems. We propose
to randomize the feature space of an ADS such that it acts
as a cryptographic key for the ADS and hence this random-
ized feature space is used by the ADS logic for detection of
anomalies. This would make the evasion of the ADS com-
putationally infeasible for the attacker.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General—
Security and Protection; D.4.6 [Security and Protection]:
Invasive Software; K.6.5 [Security and Protection]: Unau-
thorized access
Key...


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

Input:
title:Revisiting anomaly detection system design philosophy
author:Ayesha Binte Ashfaq and
Muhammad Qasim Ali and
Ehab Al-Shaer and
Syed Ali Khayam
POSTER: Revisiting Anomaly Detection System Design
Philosophy
Ayesha Binte Ashfaq1, Muhammad Qasim Ali2, Ehab Al-Shaer2 and Syed Ali Khayam3
1 School of Electrical Engineering and Computer Science
National University of Sciences and Technology, Islamabad, Pakistan
2 Department of Software and Information Systems
University of North Carolina Charlotte
3 PLUMgrid Inc.
Sunnyvale, CA
ayesha.ashfaq@seecs.edu.pk; {mali12,ealshaer}@uncc.edu; khayam@gmail.com
ABSTRACT
The inherent design of anomaly detection systems (ADSs)
make them highly susceptible to evasion attacks and hence
their wide-spread commercial deployment has not been wit-
nessed. There are two main reasons for this: 1) ADSs in-
cur high false positives; 2) Are highly susceptible to evasion
attacks (false negatives). While eﬀorts have been made to
minimize false positives, evasion is still an open problem. We
argue that ADSs design is inherently ﬂawed since it relies on
the ADS’s detection logic and feature space which is trivial
to estimate. In information security e.g. cryptographic algo-
rithms (such as DES), security is inherently dependent upon
the key and not the algorithm, which makes these systems
very robust by rendering evasion computationally infeasible.
We believe there is a need to redesign the anomaly detec-
tion systems similar to cryptographic systems. We propose
to randomize the feature space of an ADS such that it acts
as a cryptographic key for the ADS and hence this random-
ized feature space is used by the ADS logic for detection of
anomalies. This would make the evasion of the ADS com-
putationally infeasible for the attacker.
Categories and Subject Descriptors
C.2.0 [Computer-Communication Networks]: General—
Security and Protection; D.4.6 [Security and Protection]:
Invasive Software; K.6.5 [Security and Protection]: Unau-
thorized access
Key...

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


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

Output:
安全论文分析：

title:S-ARP: a Secure Address Resolution Protocol
author:Danilo Bruschi and
A. Ornaghi and
Emilia Rosti
S-ARP: a Secure Address Resolution Protocol∗
D. Bruschi, A. Ornaghi, E. Rosti
Dipartimento di Informatica e Comunicazione
Universit`a degli Studi di Milano, Italy
E-mail: alor@sikurezza.org, {bruschi, rosti}@dico.unimi.it
Abstract
Tapping into the communication between two hosts on a
LAN has become quite simple thanks to tools that can be
downloaded from the Internet. Such tools use the Address
Resolution Protocol (ARP) poisoning technique, which re-
lies on hosts caching reply messages even though the cor-
responding requests were never sent. Since no message au-
thentication is provided, any host of the LAN can forge a
message containing malicious information.
This paper presents a secure version of ARP that pro-
vides protection against ARP poisoning. Each host has a
public/private key pair certiﬁed by a local trusted party on
the LAN, which acts as a Certiﬁcation Authority. Messages
are digitally signed by the sender, thus preventing the in-
jection of spurious and/or spoofed information. As a proof
of concept, the proposed solution was implemented on a
Linux box. Performance measurements show that PKI based
strong authentication is feasible to secure even low level
protocols, as long as the overhead for key validity veriﬁca-
tion is kept small.
1. Introduction
IP over Ethernet networks are the most popular Local
Area Networks nowadays. They use ARP, the Address Res-
olution Protocol, to resolve IP addresses into hardware, or
MAC (Medium Access Controllers), addresses [12]. All the
hosts in the LAN keep a cache of resolved addresses. ARP
resolution is invoked when a new IP address has to be re-
solved or an entry in the cache expires. The ARP poisoning
attack consists of maliciously modifying the association be-
tween an IP address and its corresponding MAC address.
Various tools available on the Internet [11], [13], [18], al-
low so called “script kiddies” to...


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

Input:
title:S-ARP: a Secure Address Resolution Protocol
author:Danilo Bruschi and
A. Ornaghi and
Emilia Rosti
S-ARP: a Secure Address Resolution Protocol∗
D. Bruschi, A. Ornaghi, E. Rosti
Dipartimento di Informatica e Comunicazione
Universit`a degli Studi di Milano, Italy
E-mail: alor@sikurezza.org, {bruschi, rosti}@dico.unimi.it
Abstract
Tapping into the communication between two hosts on a
LAN has become quite simple thanks to tools that can be
downloaded from the Internet. Such tools use the Address
Resolution Protocol (ARP) poisoning technique, which re-
lies on hosts caching reply messages even though the cor-
responding requests were never sent. Since no message au-
thentication is provided, any host of the LAN can forge a
message containing malicious information.
This paper presents a secure version of ARP that pro-
vides protection against ARP poisoning. Each host has a
public/private key pair certiﬁed by a local trusted party on
the LAN, which acts as a Certiﬁcation Authority. Messages
are digitally signed by the sender, thus preventing the in-
jection of spurious and/or spoofed information. As a proof
of concept, the proposed solution was implemented on a
Linux box. Performance measurements show that PKI based
strong authentication is feasible to secure even low level
protocols, as long as the overhead for key validity veriﬁca-
tion is kept small.
1. Introduction
IP over Ethernet networks are the most popular Local
Area Networks nowadays. They use ARP, the Address Res-
olution Protocol, to resolve IP addresses into hardware, or
MAC (Medium Access Controllers), addresses [12]. All the
hosts in the LAN keep a cache of resolved addresses. ARP
resolution is invoked when a new IP address has to be re-
solved or an entry in the cache expires. The ARP poisoning
attack consists of maliciously modifying the association be-
tween an IP address and its corresponding MAC address.
Various tools available on the Internet [11], [13], [18], al-
low so called “script kiddies” to...

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


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

Output:
安全论文分析：

title:RDMC: A Reliable RDMA Multicast for Large Objects
author:Jonathan Behrens and
Sagar Jha and
Ken Birman and
Edward Tremel
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
RDMC: A Reliable RDMA Multicast for Large Objects
Jonathan Behrens1,2, Sagar Jha1, Ken Birman1, Edward Tremel1
1Department of Computer Science, Cornell University
2MIT CSAIL
Introduction
Abstract
Multicast patterns are common in cloud computing and data-
center settings. Applications and infrastructure tools such as
Spark frequently move large objects around, update ﬁles repli-
cated to multiple nodes, or push new versions of programs to
compute nodes. Some applications use replication directly, for
example to increase fault-tolerance or achieve parallelism. Im-
plementations of Paxos, block chains and other libraries of-
ten employ a hand-built reliable multicast as a primitive. Yet
operating systems continue to be focused on point-to-point
communication solutions such as TCP. Our system, RDMC
(RDMA Multicast), offers reliable multicast functionality con-
structed from RDMA unicast. We discuss design choices,
present a theoretical analysis of RDMC’s robustness to delays
and slow network links, and report on experiments that evalu-
ate RDMC over Mellanox RDMA.
1
Datacenter loads are heavily dominated by data copying de-
lays, often from a source node to two or more destinations.
By 2011, distributed ﬁle systems like Cosmos (Microsoft),
GFS (Google), and HDFS (Hadoop) handled many petabytes
of writes per day (hundreds of Gb/s) [6], and the throughput
is surely far higher today. Many ﬁles are replicated to multi-
ple storage servers [8]. The latency of this process determines
overall write performance for end-user applications. At Face-
book, Hadoop traces show that for jobs with reduce phases,
the transfer of data between successive phases represents 33%
of total run time [4]. Google’s Borg has a median task startup
latency of around 25 seconds (about 80% d...


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

Input:
title:RDMC: A Reliable RDMA Multicast for Large Objects
author:Jonathan Behrens and
Sagar Jha and
Ken Birman and
Edward Tremel
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
RDMC: A Reliable RDMA Multicast for Large Objects
Jonathan Behrens1,2, Sagar Jha1, Ken Birman1, Edward Tremel1
1Department of Computer Science, Cornell University
2MIT CSAIL
Introduction
Abstract
Multicast patterns are common in cloud computing and data-
center settings. Applications and infrastructure tools such as
Spark frequently move large objects around, update ﬁles repli-
cated to multiple nodes, or push new versions of programs to
compute nodes. Some applications use replication directly, for
example to increase fault-tolerance or achieve parallelism. Im-
plementations of Paxos, block chains and other libraries of-
ten employ a hand-built reliable multicast as a primitive. Yet
operating systems continue to be focused on point-to-point
communication solutions such as TCP. Our system, RDMC
(RDMA Multicast), offers reliable multicast functionality con-
structed from RDMA unicast. We discuss design choices,
present a theoretical analysis of RDMC’s robustness to delays
and slow network links, and report on experiments that evalu-
ate RDMC over Mellanox RDMA.
1
Datacenter loads are heavily dominated by data copying de-
lays, often from a source node to two or more destinations.
By 2011, distributed ﬁle systems like Cosmos (Microsoft),
GFS (Google), and HDFS (Hadoop) handled many petabytes
of writes per day (hundreds of Gb/s) [6], and the throughput
is surely far higher today. Many ﬁles are replicated to multi-
ple storage servers [8]. The latency of this process determines
overall write performance for end-user applications. At Face-
book, Hadoop traces show that for jobs with reduce phases,
the transfer of data between successive phases represents 33%
of total run time [4]. Google’s Borg has a median task startup
latency of around 25 seconds (about 80% d...

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


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

Output:
安全论文分析：

title:Locally Private Graph Neural Networks
author:Sina Sajadmanesh and
Daniel Gatica-Perez
Locally Private Graph Neural Networks
Sina Sajadmanesh
sajadmanesh@idiap.ch
Idiap Research Institute
EPFL
ABSTRACT
Graph Neural Networks (GNNs) have demonstrated superior perfor-
mance in learning node representations for various graph inference
tasks. However, learning over graph data can raise privacy con-
cerns when nodes represent people or human-related variables
that involve sensitive or personal information. In this paper, we
study the problem of node data privacy, where graph nodes (e.g.,
social network users) have potentially sensitive data that is kept
private, but they could be beneficial for a central server for train-
ing a GNN over the graph. To address this problem, we propose
a privacy-preserving, architecture-agnostic GNN learning frame-
work with formal privacy guarantees based on Local Differential
Privacy (LDP). Specifically, we develop a locally private mechanism
to perturb and compress node features, which the server can effi-
ciently collect to approximate the GNN’s neighborhood aggregation
step. Furthermore, to improve the accuracy of the estimation, we
prepend to the GNN a denoising layer, called KProp, which is based
on the multi-hop aggregation of node features. Finally, we propose
a robust algorithm for learning with privatized noisy labels, where
we again benefit from KProp’s denoising capability to increase the
accuracy of label inference for node classification. Extensive ex-
periments conducted over real-world datasets demonstrate that
our method can maintain a satisfying level of accuracy with low
privacy loss.
CCS CONCEPTS
• Computing methodologies → Neural networks; • Security
and privacy → Data anonymization and sanitization; Privacy
protections.
KEYWORDS
Differential Privacy; Private Learning; Graph Neural Networks;
Node Classification
ACM Reference Format:
Sina Sajadmanesh and Daniel Gatica-Perez. 2021. Locally Private Graph
Neural Networ...


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

Input:
title:Locally Private Graph Neural Networks
author:Sina Sajadmanesh and
Daniel Gatica-Perez
Locally Private Graph Neural Networks
Sina Sajadmanesh
sajadmanesh@idiap.ch
Idiap Research Institute
EPFL
ABSTRACT
Graph Neural Networks (GNNs) have demonstrated superior perfor-
mance in learning node representations for various graph inference
tasks. However, learning over graph data can raise privacy con-
cerns when nodes represent people or human-related variables
that involve sensitive or personal information. In this paper, we
study the problem of node data privacy, where graph nodes (e.g.,
social network users) have potentially sensitive data that is kept
private, but they could be beneficial for a central server for train-
ing a GNN over the graph. To address this problem, we propose
a privacy-preserving, architecture-agnostic GNN learning frame-
work with formal privacy guarantees based on Local Differential
Privacy (LDP). Specifically, we develop a locally private mechanism
to perturb and compress node features, which the server can effi-
ciently collect to approximate the GNN’s neighborhood aggregation
step. Furthermore, to improve the accuracy of the estimation, we
prepend to the GNN a denoising layer, called KProp, which is based
on the multi-hop aggregation of node features. Finally, we propose
a robust algorithm for learning with privatized noisy labels, where
we again benefit from KProp’s denoising capability to increase the
accuracy of label inference for node classification. Extensive ex-
periments conducted over real-world datasets demonstrate that
our method can maintain a satisfying level of accuracy with low
privacy loss.
CCS CONCEPTS
• Computing methodologies → Neural networks; • Security
and privacy → Data anonymization and sanitization; Privacy
protections.
KEYWORDS
Differential Privacy; Private Learning; Graph Neural Networks;
Node Classification
ACM Reference Format:
Sina Sajadmanesh and Daniel Gatica-Perez. 2021. Locally Private Graph
Neural Networ...

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


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

Output:
安全论文分析：

title:Route flap damping exacerbates internet routing convergence
author:Zhuoqing Morley Mao and
Ramesh Govindan and
George Varghese and
Randy H. Katz
Route Flap Damping Exacerbates Internet Routing
Convergence
Zhuoqing Morley Mao Ramesh Govindan George Varghese Randy H. Katz
UC Berkeley
ICSI
UC San Diego
UC Berkeley
zmao@cs.berkeley.edu
ramesh@icsi.berkeley.edu
varghese@cs.ucsd.edu
randy@cs.berkeley.edu
ABSTRACT
Route ﬂap damping is considered to be a widely deployed mecha-
nism in core routers that limits the widespread propagation of un-
stable BGP routing information. Originally designed to suppress
route changes caused by link ﬂaps, ﬂap damping attempts to dis-
tinguish persistently unstable routes from routes that occasionally
fail. It is considered to be a major contributor to the stability of the
Internet routing system.
We show in this paper that, surprisingly, route ﬂap damping can
signiﬁcantly exacerbate the convergence times of relatively stable
routes. For example, a route to a preﬁx that is withdrawn exactly
once and re-announced can be suppressed for up to an hour (using
the current RIPE recommended damping parameters). We show
that such abnormal behavior fundamentally arises from the interac-
tion of ﬂap damping with BGP path exploration during route with-
drawal. We study this interaction using a simple analytical model
and understand the impact of various BGP parameters on its occur-
rence using simulations. Finally, we outline a preliminary proposal
to modify route ﬂap damping scheme that removes the undesired
interaction in all the topologies we studied.
Categories and Subject Descriptors
C.2.2 [Computer-Communication Networks]: Network Proto-
cols—Routing Protocols
General Terms
Performance, experimentation
Keywords
BGP, border gateway protocol, interdomain routing protocol, route
ﬂap damping, routing convergence, routing dynamics
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted witho...


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

Input:
title:Route flap damping exacerbates internet routing convergence
author:Zhuoqing Morley Mao and
Ramesh Govindan and
George Varghese and
Randy H. Katz
Route Flap Damping Exacerbates Internet Routing
Convergence
Zhuoqing Morley Mao Ramesh Govindan George Varghese Randy H. Katz
UC Berkeley
ICSI
UC San Diego
UC Berkeley
zmao@cs.berkeley.edu
ramesh@icsi.berkeley.edu
varghese@cs.ucsd.edu
randy@cs.berkeley.edu
ABSTRACT
Route ﬂap damping is considered to be a widely deployed mecha-
nism in core routers that limits the widespread propagation of un-
stable BGP routing information. Originally designed to suppress
route changes caused by link ﬂaps, ﬂap damping attempts to dis-
tinguish persistently unstable routes from routes that occasionally
fail. It is considered to be a major contributor to the stability of the
Internet routing system.
We show in this paper that, surprisingly, route ﬂap damping can
signiﬁcantly exacerbate the convergence times of relatively stable
routes. For example, a route to a preﬁx that is withdrawn exactly
once and re-announced can be suppressed for up to an hour (using
the current RIPE recommended damping parameters). We show
that such abnormal behavior fundamentally arises from the interac-
tion of ﬂap damping with BGP path exploration during route with-
drawal. We study this interaction using a simple analytical model
and understand the impact of various BGP parameters on its occur-
rence using simulations. Finally, we outline a preliminary proposal
to modify route ﬂap damping scheme that removes the undesired
interaction in all the topologies we studied.
Categories and Subject Descriptors
C.2.2 [Computer-Communication Networks]: Network Proto-
cols—Routing Protocols
General Terms
Performance, experimentation
Keywords
BGP, border gateway protocol, interdomain routing protocol, route
ﬂap damping, routing convergence, routing dynamics
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted witho...

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


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

Output:
安全论文分析：

title:When the Differences in Frequency Domain are Compensated: Understanding
and Defeating Modulated Replay Attacks on Automatic Speech Recognition
author:Shu Wang and
Jiahao Cao and
Xu He and
Kun Sun and
Qi Li
Automatic Speech Recognition
Shu Wang1, Jiahao Cao1,2, Xu He1, Kun Sun1, Qi Li2
1Department of Information Sciences and Technology, CSIS, George Mason University
2Institute for Network Sciences and Cyberspace, Tsinghua University
When the Differences in Frequency Domain are Compensated:
Understanding and Defeating Modulated Replay Attacks on
{swang47,xhe6,ksun3}@gmu.edu,caojh15@mails.tsinghua.edu.cn,qli01@tsinghua.edu.cn
ABSTRACT
Automatic speech recognition (ASR) systems have been widely
deployed in modern smart devices to provide convenient and di-
verse voice-controlled services. Since ASR systems are vulnerable
to audio replay attacks that can spoof and mislead ASR systems, a
number of defense systems have been proposed to identify replayed
audio signals based on the speakers’ unique acoustic features in the
frequency domain. In this paper, we uncover a new type of replay
attack called modulated replay attack, which can bypass the existing
frequency domain based defense systems. The basic idea is to com-
pensate for the frequency distortion of a given electronic speaker
using an inverse filter that is customized to the speaker’s transform
characteristics. Our experiments on real smart devices confirm the
modulated replay attacks can successfully escape the existing detec-
tion mechanisms that rely on identifying suspicious features in the
frequency domain. To defeat modulated replay attacks, we design
and implement a countermeasure named DualGuard. We discover
and formally prove that no matter how the replay audio signals
could be modulated, the replay attacks will either leave ringing
artifacts in the time domain or cause spectrum distortion in the fre-
quency domain. Therefore, by jointly checking suspicious features
in both frequency and time domains,...


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

Input:
title:When the Differences in Frequency Domain are Compensated: Understanding
and Defeating Modulated Replay Attacks on Automatic Speech Recognition
author:Shu Wang and
Jiahao Cao and
Xu He and
Kun Sun and
Qi Li
Automatic Speech Recognition
Shu Wang1, Jiahao Cao1,2, Xu He1, Kun Sun1, Qi Li2
1Department of Information Sciences and Technology, CSIS, George Mason University
2Institute for Network Sciences and Cyberspace, Tsinghua University
When the Differences in Frequency Domain are Compensated:
Understanding and Defeating Modulated Replay Attacks on
{swang47,xhe6,ksun3}@gmu.edu,caojh15@mails.tsinghua.edu.cn,qli01@tsinghua.edu.cn
ABSTRACT
Automatic speech recognition (ASR) systems have been widely
deployed in modern smart devices to provide convenient and di-
verse voice-controlled services. Since ASR systems are vulnerable
to audio replay attacks that can spoof and mislead ASR systems, a
number of defense systems have been proposed to identify replayed
audio signals based on the speakers’ unique acoustic features in the
frequency domain. In this paper, we uncover a new type of replay
attack called modulated replay attack, which can bypass the existing
frequency domain based defense systems. The basic idea is to com-
pensate for the frequency distortion of a given electronic speaker
using an inverse filter that is customized to the speaker’s transform
characteristics. Our experiments on real smart devices confirm the
modulated replay attacks can successfully escape the existing detec-
tion mechanisms that rely on identifying suspicious features in the
frequency domain. To defeat modulated replay attacks, we design
and implement a countermeasure named DualGuard. We discover
and formally prove that no matter how the replay audio signals
could be modulated, the replay attacks will either leave ringing
artifacts in the time domain or cause spectrum distortion in the fre-
quency domain. Therefore, by jointly checking suspicious features
in both frequency and time domains,...

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


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

Output:
安全论文分析：

title:Routers with a single stage of buffering
author:Sundar Iyer and
Rui Zhang and
Nick McKeown
Routers with a Single Stage of Buffering*
Sundar Iyer, Rui Zhang, Nick McKeown
Computer Systems Laboratory, Stanford University,
Ph: (650)-725 9077, Fax: (650)-725 6949
Stanford, CA 94305-9030
{sundaes, rzhang, nickm}@stanford.edu
ABSTRACT
Most high performance routers today use combined input and out-
put queueing (CIOQ). The CIOQ router is also frequently used as
an abstract model for routers: at one extreme is input queueing, at
the other extreme is output queueing, and in-between there is a
continuum of performance as the speedup is increased from 1 to N
(where N is the number of linecards). The model includes architec-
tures in which a switch fabric is sandwiched between two stages of
buffering. There is a rich and growing theory for CIOQ routers,
including algorithms,
throughput results and conditions under
which delays can be guaranteed. But there is a broad class of archi-
tectures that are not captured by the CIOQ model, including rout-
ers with centralized shared memory, and load-balanced routers. In
this paper we propose an abstract model called Single-Buffered
(SB) routers that
includes these architectures. We describe a
method called Constraint Sets to analyze a number of SB router
architectures. The model helped identify previously unstudied
architectures, in particular the Distributed Shared Memory router.
Although commercially deployed, its performance is not widely
known. We find conditions under which it can emulate an ideal
shared memory router, and believe it to be a promising architec-
ture. Questions remain about its complexity, but we find that the
memory bandwidth, and potentially the power consumption of the
router is lower than for a CIOQ router.
CATEGORIES AND SUBJECT DESCRIPTORS
C.2.6 [Internetworking]: Routers
GENERAL TERMS
Algorithms, Performance, Design.
KEYWORDS
Routers, Switching, Buffers, Constraint Sets.
I. INTRODUCTION
A. Background
Th...


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

Input:
title:Routers with a single stage of buffering
author:Sundar Iyer and
Rui Zhang and
Nick McKeown
Routers with a Single Stage of Buffering*
Sundar Iyer, Rui Zhang, Nick McKeown
Computer Systems Laboratory, Stanford University,
Ph: (650)-725 9077, Fax: (650)-725 6949
Stanford, CA 94305-9030
{sundaes, rzhang, nickm}@stanford.edu
ABSTRACT
Most high performance routers today use combined input and out-
put queueing (CIOQ). The CIOQ router is also frequently used as
an abstract model for routers: at one extreme is input queueing, at
the other extreme is output queueing, and in-between there is a
continuum of performance as the speedup is increased from 1 to N
(where N is the number of linecards). The model includes architec-
tures in which a switch fabric is sandwiched between two stages of
buffering. There is a rich and growing theory for CIOQ routers,
including algorithms,
throughput results and conditions under
which delays can be guaranteed. But there is a broad class of archi-
tectures that are not captured by the CIOQ model, including rout-
ers with centralized shared memory, and load-balanced routers. In
this paper we propose an abstract model called Single-Buffered
(SB) routers that
includes these architectures. We describe a
method called Constraint Sets to analyze a number of SB router
architectures. The model helped identify previously unstudied
architectures, in particular the Distributed Shared Memory router.
Although commercially deployed, its performance is not widely
known. We find conditions under which it can emulate an ideal
shared memory router, and believe it to be a promising architec-
ture. Questions remain about its complexity, but we find that the
memory bandwidth, and potentially the power consumption of the
router is lower than for a CIOQ router.
CATEGORIES AND SUBJECT DESCRIPTORS
C.2.6 [Internetworking]: Routers
GENERAL TERMS
Algorithms, Performance, Design.
KEYWORDS
Routers, Switching, Buffers, Constraint Sets.
I. INTRODUCTION
A. Background
Th...

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


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

Output:
安全论文分析：

title:Reversible sketches for efficient and accurate change detection over
network data streams
author:Robert T. Schweller and
Ashish Gupta and
Elliot Parsons and
Yan Chen
Reversible Sketches for Efﬁcient and Accurate Change
Detection over Network Data Streams
Robert Schweller, Ashish Gupta, Elliot Parsons, Yan Chen
Department of Computer Science
Northwestern University
Evanston, IL 60201-3150, USA
fschwellerr, ashish, e-parsons, ycheng@cs.northwestern.edu
ABSTRACT
Trafﬁc anomalies such as failures and attacks are increasing in fre-
quency and severity, and thus identifying them rapidly and accu-
rately is critical for large network operators. The detection typi-
cally treats the trafﬁc as a collection of ﬂows and looks for heavy
changes in trafﬁc patterns (e.g., volume, number of connections).
However, as link speeds and the number of ﬂows increase, keeping
per-ﬂow state is not scalable. The recently proposed sketch-based
schemes [14] are among the very few that can detect heavy changes
and anomalies over massive data streams at network trafﬁc speeds.
However, sketches do not preserve the key (e.g., source IP address)
of the ﬂows. Hence, even if anomalies are detected, it is difﬁcult
to infer the culprit ﬂows, making it a big practical hurdle for online
deployment. Meanwhile, the number of keys is too large to record.
To address this challenge, we propose efﬁcient reversible hash-
ing algorithms to infer the keys of culprit ﬂows from sketches with-
out storing any explicit key information. No extra memory or mem-
ory accesses are needed for recording the streaming data. Mean-
while, the heavy change detection daemon runs in the background
with space complexity and computational time sublinear to the key
space size. This short paper describes the conceptual framework
of the reversible sketches, as well as some initial approaches for
implementation. See [23] for the optimized algorithms in details.
Evaluated with netﬂow trafﬁc traces of a large edge router, we
demons...


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

Input:
title:Reversible sketches for efficient and accurate change detection over
network data streams
author:Robert T. Schweller and
Ashish Gupta and
Elliot Parsons and
Yan Chen
Reversible Sketches for Efﬁcient and Accurate Change
Detection over Network Data Streams
Robert Schweller, Ashish Gupta, Elliot Parsons, Yan Chen
Department of Computer Science
Northwestern University
Evanston, IL 60201-3150, USA
fschwellerr, ashish, e-parsons, ycheng@cs.northwestern.edu
ABSTRACT
Trafﬁc anomalies such as failures and attacks are increasing in fre-
quency and severity, and thus identifying them rapidly and accu-
rately is critical for large network operators. The detection typi-
cally treats the trafﬁc as a collection of ﬂows and looks for heavy
changes in trafﬁc patterns (e.g., volume, number of connections).
However, as link speeds and the number of ﬂows increase, keeping
per-ﬂow state is not scalable. The recently proposed sketch-based
schemes [14] are among the very few that can detect heavy changes
and anomalies over massive data streams at network trafﬁc speeds.
However, sketches do not preserve the key (e.g., source IP address)
of the ﬂows. Hence, even if anomalies are detected, it is difﬁcult
to infer the culprit ﬂows, making it a big practical hurdle for online
deployment. Meanwhile, the number of keys is too large to record.
To address this challenge, we propose efﬁcient reversible hash-
ing algorithms to infer the keys of culprit ﬂows from sketches with-
out storing any explicit key information. No extra memory or mem-
ory accesses are needed for recording the streaming data. Mean-
while, the heavy change detection daemon runs in the background
with space complexity and computational time sublinear to the key
space size. This short paper describes the conceptual framework
of the reversible sketches, as well as some initial approaches for
implementation. See [23] for the optimized algorithms in details.
Evaluated with netﬂow trafﬁc traces of a large edge router, we
demons...

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


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

Output:
安全论文分析：

title:CAFE: A Virtualization-Based Approach to Protecting Sensitive
Cloud Application Logic Confidentiality
author:Chung Hwan Kim and
Sungjin Park and
Junghwan Rhee and
Jong-Jin Won and
Taisook Han and
Dongyan Xu
CAFE: A Virtualization-Based Approach to Protecting
Sensitive Cloud Application Logic Conﬁdentiality
†Purdue University, ‡The Attached Institute of ETRI, §NEC Laboratories America, ¶KAIST
†{chungkim,dxu}@cs.purdue.edu, ‡{taiji,wonjj}@ensec.re.kr,
Chung Hwan Kim†, Sungjin Park‡¶, Junghwan Rhee§,
Jong-Jin Won‡, Taisook Han¶, Dongyan Xu†
§rhee@nec-labs.com, ¶taisook@kaist.ac.kr
ABSTRACT
Cloud application marketplaces of modern cloud infrastruc-
tures oﬀer a new software deployment model,
integrated
with the cloud environment in its conﬁguration and policies.
However, similar to traditional software distribution which
has been suﬀering from software piracy and reverse engi-
neering, cloud marketplaces face the same challenges that
can deter the success of the evolving ecosystem of cloud soft-
ware. We present a novel system named CAFE for cloud in-
frastructures where sensitive software logic can be executed
with high secrecy protected from any piracy or reverse en-
gineering attempts in a virtual machine even when its op-
erating system kernel is compromised. The key mechanism
is the end-to-end framework for the execution of applica-
tions, which consists of the secure encryption and distri-
bution of conﬁdential application binary ﬁles, and the run-
time techniques to load, decrypt, and protect the program
logic by isolating them from tenant virtual machines based
on hypervisor-level techniques. We evaluate applications in
several software categories which are commonly oﬀered in
cloud marketplaces showing that strong conﬁdential execu-
tion can be provided with only marginal changes (around
100-220 lines of code) and minimal performance overhead.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection
Keywords
Cloud Computing Mar...


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

Input:
title:CAFE: A Virtualization-Based Approach to Protecting Sensitive
Cloud Application Logic Confidentiality
author:Chung Hwan Kim and
Sungjin Park and
Junghwan Rhee and
Jong-Jin Won and
Taisook Han and
Dongyan Xu
CAFE: A Virtualization-Based Approach to Protecting
Sensitive Cloud Application Logic Conﬁdentiality
†Purdue University, ‡The Attached Institute of ETRI, §NEC Laboratories America, ¶KAIST
†{chungkim,dxu}@cs.purdue.edu, ‡{taiji,wonjj}@ensec.re.kr,
Chung Hwan Kim†, Sungjin Park‡¶, Junghwan Rhee§,
Jong-Jin Won‡, Taisook Han¶, Dongyan Xu†
§rhee@nec-labs.com, ¶taisook@kaist.ac.kr
ABSTRACT
Cloud application marketplaces of modern cloud infrastruc-
tures oﬀer a new software deployment model,
integrated
with the cloud environment in its conﬁguration and policies.
However, similar to traditional software distribution which
has been suﬀering from software piracy and reverse engi-
neering, cloud marketplaces face the same challenges that
can deter the success of the evolving ecosystem of cloud soft-
ware. We present a novel system named CAFE for cloud in-
frastructures where sensitive software logic can be executed
with high secrecy protected from any piracy or reverse en-
gineering attempts in a virtual machine even when its op-
erating system kernel is compromised. The key mechanism
is the end-to-end framework for the execution of applica-
tions, which consists of the secure encryption and distri-
bution of conﬁdential application binary ﬁles, and the run-
time techniques to load, decrypt, and protect the program
logic by isolating them from tenant virtual machines based
on hypervisor-level techniques. We evaluate applications in
several software categories which are commonly oﬀered in
cloud marketplaces showing that strong conﬁdential execu-
tion can be provided with only marginal changes (around
100-220 lines of code) and minimal performance overhead.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection
Keywords
Cloud Computing Mar...

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


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

Output:
安全论文分析：

title:On the Feasibility of Internet-Scale Author Identification
author:Arvind Narayanan and
Hristo S. Paskov and
Neil Zhenqiang Gong and
John Bethencourt and
Emil Stefanov and
Eui Chul Richard Shin and
Dawn Song
2012 IEEE Symposium on Security and Privacy
On the Feasibility of Internet-Scale Author Identiﬁcation
Arvind Narayanan
relax@stanford.edu
Hristo Paskov
hpaskov@stanford.edu
Neil Zhenqiang Gong
neilz.gong@berkeley.edu
Emil Stefanov
emil@berkeley.edu
Eui Chul Richard Shin
ricshin@berkeley.edu
John Bethencourt
bethenco@cs.berkeley.edu
Dawn Song
dawnsong@cs.berkeley.edu
Abstract—We study techniques for identifying an anonymous
author via linguistic stylometry, i.e., comparing the writing
style against a corpus of texts of known authorship. We exper-
imentally demonstrate the effectiveness of our techniques with
as many as 100,000 candidate authors. Given the increasing
availability of writing samples online, our result has serious
implications for anonymity and free speech — an anonymous
blogger or whistleblower may be unmasked unless they take
steps to obfuscate their writing style.
While there is a huge body of literature on authorship
recognition based on writing style, almost none of it has studied
corpora of more than a few hundred authors. The problem
becomes qualitatively different at a large scale, as we show,
and techniques from prior work fail to scale, both in terms of
accuracy and performance. We study a variety of classiﬁers,
both “lazy” and “eager,” and show how to handle the huge
number of classes. We also develop novel techniques for conﬁ-
dence estimation of classiﬁer outputs. Finally, we demonstrate
stylometric authorship recognition on texts written in different
contexts.
In over 20% of cases, our classiﬁers can correctly identify
an anonymous author given a corpus of texts from 100,000
authors; in about 35% of cases the correct author is one of
the top 20 guesses. If we allow the classiﬁer the option of
not making a guess, via conﬁdence esti...


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

Input:
title:On the Feasibility of Internet-Scale Author Identification
author:Arvind Narayanan and
Hristo S. Paskov and
Neil Zhenqiang Gong and
John Bethencourt and
Emil Stefanov and
Eui Chul Richard Shin and
Dawn Song
2012 IEEE Symposium on Security and Privacy
On the Feasibility of Internet-Scale Author Identiﬁcation
Arvind Narayanan
relax@stanford.edu
Hristo Paskov
hpaskov@stanford.edu
Neil Zhenqiang Gong
neilz.gong@berkeley.edu
Emil Stefanov
emil@berkeley.edu
Eui Chul Richard Shin
ricshin@berkeley.edu
John Bethencourt
bethenco@cs.berkeley.edu
Dawn Song
dawnsong@cs.berkeley.edu
Abstract—We study techniques for identifying an anonymous
author via linguistic stylometry, i.e., comparing the writing
style against a corpus of texts of known authorship. We exper-
imentally demonstrate the effectiveness of our techniques with
as many as 100,000 candidate authors. Given the increasing
availability of writing samples online, our result has serious
implications for anonymity and free speech — an anonymous
blogger or whistleblower may be unmasked unless they take
steps to obfuscate their writing style.
While there is a huge body of literature on authorship
recognition based on writing style, almost none of it has studied
corpora of more than a few hundred authors. The problem
becomes qualitatively different at a large scale, as we show,
and techniques from prior work fail to scale, both in terms of
accuracy and performance. We study a variety of classiﬁers,
both “lazy” and “eager,” and show how to handle the huge
number of classes. We also develop novel techniques for conﬁ-
dence estimation of classiﬁer outputs. Finally, we demonstrate
stylometric authorship recognition on texts written in different
contexts.
In over 20% of cases, our classiﬁers can correctly identify
an anonymous author given a corpus of texts from 100,000
authors; in about 35% of cases the correct author is one of
the top 20 guesses. If we allow the classiﬁer the option of
not making a guess, via conﬁdence esti...

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


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

Output:
安全论文分析：

title:Exploiting Execution Context for the Detection of Anomalous System
Calls
author:Darren Mutz and
William K. Robertson and
Giovanni Vigna and
Richard A. Kemmerer
Exploiting Execution Context
for the Detection of Anomalous System Calls
Darren Mutz, William Robertson, Giovanni Vigna, and Richard Kemmerer
Computer Security Group
Department of Computer Science
University of California, Santa Barbara
{dhm,wkr,vigna,kemm}@cs.ucsb.edu
Abstract. Attacks against privileged applications can be detected by
analyzing the stream of system calls issued during process execution.
In the last few years, several approaches have been proposed to detect
anomalous system calls. These approaches are mostly based on modeling
acceptable system call sequences. Unfortunately, the techniques proposed
so far are either vulnerable to certain evasion attacks or are too expensive
to be practical. This paper presents a novel approach to the analysis of
system calls that uses a composition of dynamic analysis and learning
techniques to characterize anomalous system call invocations in terms
of both the invocation context and the parameters passed to the system
calls. Our technique provides a more precise detection model with respect
to solutions proposed previously, and, in addition, it is able to detect
data modiﬁcation attacks, which cannot be detected using only system
call sequence analysis.
Keywords: Intrusion Detection, System Call Argument Analysis, Exe-
cution Context.
1 Introduction
A recent thrust of intrusion detection research has considered model-based de-
tection of attacks at the application level. Model-based systems operate by com-
paring the observed behavior of an application to models of normal behavior,
which may be derived automatically via static analysis [8,23] or learned by ana-
lyzing the run-time behavior of applications [3,5,12,18,15]. In each case, attacks
are detected when observed behavior diverges in some respect from the normal
behavior captured by the model. In...


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

Input:
title:Exploiting Execution Context for the Detection of Anomalous System
Calls
author:Darren Mutz and
William K. Robertson and
Giovanni Vigna and
Richard A. Kemmerer
Exploiting Execution Context
for the Detection of Anomalous System Calls
Darren Mutz, William Robertson, Giovanni Vigna, and Richard Kemmerer
Computer Security Group
Department of Computer Science
University of California, Santa Barbara
{dhm,wkr,vigna,kemm}@cs.ucsb.edu
Abstract. Attacks against privileged applications can be detected by
analyzing the stream of system calls issued during process execution.
In the last few years, several approaches have been proposed to detect
anomalous system calls. These approaches are mostly based on modeling
acceptable system call sequences. Unfortunately, the techniques proposed
so far are either vulnerable to certain evasion attacks or are too expensive
to be practical. This paper presents a novel approach to the analysis of
system calls that uses a composition of dynamic analysis and learning
techniques to characterize anomalous system call invocations in terms
of both the invocation context and the parameters passed to the system
calls. Our technique provides a more precise detection model with respect
to solutions proposed previously, and, in addition, it is able to detect
data modiﬁcation attacks, which cannot be detected using only system
call sequence analysis.
Keywords: Intrusion Detection, System Call Argument Analysis, Exe-
cution Context.
1 Introduction
A recent thrust of intrusion detection research has considered model-based de-
tection of attacks at the application level. Model-based systems operate by com-
paring the observed behavior of an application to models of normal behavior,
which may be derived automatically via static analysis [8,23] or learned by ana-
lyzing the run-time behavior of applications [3,5,12,18,15]. In each case, attacks
are detected when observed behavior diverges in some respect from the normal
behavior captured by the model. In...

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


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

Output:
安全论文分析：

title:The Blind Stone Tablet: Outsourcing Durability to Untrusted Parties
author:Peter Williams and
Radu Sion and
Dennis E. Shasha
The Blind Stone Tablet: Outsourcing Durability to Untrusted Parties
Peter Williams, Radu Sion ∗
Dennis Shasha †
Network Security and Applied Cryptography Lab
Department of Computer Science
Stony Brook University
{petertw,sion}@cs.stonybrook.edu
New York University
shasha@cs.nyu.edu
Abstract
We introduce a new paradigm for outsourcing the dura-
bility property of a multi-client transactional database to
an untrusted service provider. Speciﬁcally, we enable un-
trusted service providers to support transaction serializa-
tion, backup and recovery for clients, with full data conﬁ-
dentiality and correctness. Moreover, providers learn noth-
ing about transactions (except their size and timing), thus
achieving read and write access pattern privacy.
We build a proof-of-concept implementation of this pro-
tocol for the MySQL database management system, achiev-
ing tens of transactions per second in a two-client scenario
with full transaction privacy and guaranteed correctness.
This shows the method is ready for production use, creating
a novel class of secure database outsourcing models.
1 Introduction
Increasingly, data management is outsourced to third par-
ties. This trend is driven by growth and advances in cheap,
high-speed communication infrastructures as well as by the
fact that the total cost of data management is 5–10 times
higher than the initial acquisition costs [26].
Outsourcing has the potential
to minimize client-
side management overheads and beneﬁt from a service
provider’s global expertise consolidation and bulk pricing.
Providers such as Yahoo [10], Amazon [1–3], Google [4],
Sun [9] and others – ranging from corporate-level services
such as IBM Data Center Outsourcing Services [5] to per-
sonal level database hosting [6, 8] – are rushing to offer in-
creasingly complex storage and computation services.
∗The authors are support...


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

Input:
title:The Blind Stone Tablet: Outsourcing Durability to Untrusted Parties
author:Peter Williams and
Radu Sion and
Dennis E. Shasha
The Blind Stone Tablet: Outsourcing Durability to Untrusted Parties
Peter Williams, Radu Sion ∗
Dennis Shasha †
Network Security and Applied Cryptography Lab
Department of Computer Science
Stony Brook University
{petertw,sion}@cs.stonybrook.edu
New York University
shasha@cs.nyu.edu
Abstract
We introduce a new paradigm for outsourcing the dura-
bility property of a multi-client transactional database to
an untrusted service provider. Speciﬁcally, we enable un-
trusted service providers to support transaction serializa-
tion, backup and recovery for clients, with full data conﬁ-
dentiality and correctness. Moreover, providers learn noth-
ing about transactions (except their size and timing), thus
achieving read and write access pattern privacy.
We build a proof-of-concept implementation of this pro-
tocol for the MySQL database management system, achiev-
ing tens of transactions per second in a two-client scenario
with full transaction privacy and guaranteed correctness.
This shows the method is ready for production use, creating
a novel class of secure database outsourcing models.
1 Introduction
Increasingly, data management is outsourced to third par-
ties. This trend is driven by growth and advances in cheap,
high-speed communication infrastructures as well as by the
fact that the total cost of data management is 5–10 times
higher than the initial acquisition costs [26].
Outsourcing has the potential
to minimize client-
side management overheads and beneﬁt from a service
provider’s global expertise consolidation and bulk pricing.
Providers such as Yahoo [10], Amazon [1–3], Google [4],
Sun [9] and others – ranging from corporate-level services
such as IBM Data Center Outsourcing Services [5] to per-
sonal level database hosting [6, 8] – are rushing to offer in-
creasingly complex storage and computation services.
∗The authors are support...

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


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

Output:
安全论文分析：

title:Geographic Locality of IP Prefixes
author:Michael J. Freedman and
Mythili Vutukuru and
Nick Feamster and
Hari Balakrishnan
Geographic Locality of IP Preﬁxes
Michael J. Freedman
New York University
mfreed@cs.nyu.edu
Mythili Vutukuru, Nick Feamster, Hari Balakrishnan
Massachusetts Institute of Technology
{mythili,feamster,hari}@csail.mit.edu
ABSTRACT
Information about the geographic locality of IP preﬁxes
can be useful for understanding the issues related to IP
address allocation, aggregation, and BGP routing table
growth.
In this paper, we use traceroute data and geo-
graphic mappings of IP addresses to study the geographic
properties of IP preﬁxes and their implications on Internet
routing. We ﬁnd that (1) IP preﬁxes may be too coarse-
grained for expressing routing policies, (2) address allo-
cation policies and the granularity of routing contribute
signiﬁcantly to routing table size, and (3) not considering
the geographic diversity of contiguous preﬁxes may result
in overestimating the opportunities for aggregation in the
BGP routing table.
1.
Introduction
Today’s Internet routing infrastructure achieves scalabil-
ity by expressing reachability for large groups of IP ad-
dresses using a single IP preﬁx in a route advertisement.
Today’s largest Internet routing tables provide reachability
to hundreds of millions of end hosts with nearly 200,000
routes [5]. IP addresses that are nearby in IP space may
be geographically or topologically diverse, and vice versa.
This paper quantiﬁes this lack of correspondence. Infor-
mation about the geographic location of hosts within IP
preﬁxes can also help us better understand many issues
related to IP address aggregation and allocation and their
effect on BGP routing table growth.
Our study uses extensive traceroutes and leverages IP-
to-geographic mapping techniques to examine the geo-
graphic properties of multiple destinations within a single
preﬁx. Our dataset includes traceroutes to at least 4 IP ad-
dresses within ea...


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

Input:
title:Geographic Locality of IP Prefixes
author:Michael J. Freedman and
Mythili Vutukuru and
Nick Feamster and
Hari Balakrishnan
Geographic Locality of IP Preﬁxes
Michael J. Freedman
New York University
mfreed@cs.nyu.edu
Mythili Vutukuru, Nick Feamster, Hari Balakrishnan
Massachusetts Institute of Technology
{mythili,feamster,hari}@csail.mit.edu
ABSTRACT
Information about the geographic locality of IP preﬁxes
can be useful for understanding the issues related to IP
address allocation, aggregation, and BGP routing table
growth.
In this paper, we use traceroute data and geo-
graphic mappings of IP addresses to study the geographic
properties of IP preﬁxes and their implications on Internet
routing. We ﬁnd that (1) IP preﬁxes may be too coarse-
grained for expressing routing policies, (2) address allo-
cation policies and the granularity of routing contribute
signiﬁcantly to routing table size, and (3) not considering
the geographic diversity of contiguous preﬁxes may result
in overestimating the opportunities for aggregation in the
BGP routing table.
1.
Introduction
Today’s Internet routing infrastructure achieves scalabil-
ity by expressing reachability for large groups of IP ad-
dresses using a single IP preﬁx in a route advertisement.
Today’s largest Internet routing tables provide reachability
to hundreds of millions of end hosts with nearly 200,000
routes [5]. IP addresses that are nearby in IP space may
be geographically or topologically diverse, and vice versa.
This paper quantiﬁes this lack of correspondence. Infor-
mation about the geographic location of hosts within IP
preﬁxes can also help us better understand many issues
related to IP address aggregation and allocation and their
effect on BGP routing table growth.
Our study uses extensive traceroutes and leverages IP-
to-geographic mapping techniques to examine the geo-
graphic properties of multiple destinations within a single
preﬁx. Our dataset includes traceroutes to at least 4 IP ad-
dresses within ea...

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


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

Output:
安全论文分析：

title:Gait-Based Wi-Fi Signatures for Privacy-Preserving
author:Yan Li and
Ting Zhu
Gait-Based Wi-Fi Signatures for Privacy-Preserving
Dept of Computer Science & Electrical Eng
University of Maryland, Baltimore County
Dept of Computer Science & Electrical Eng
University of Maryland Baltimore County
Ting Zhu
zt@umbc.edu
Yan Li
Johns Hopkins University
li@jhu.edu
ABSTRACT
With the advent of the Internet of Things (IoT) and big
data, high ﬁdelity localization and tracking systems that
employ cameras, RFIDs, and attached sensors intrude on
personal privacy. However, the beneﬁt of localization in-
formation sharing enables trend forecasting and automa-
tion. To address this challenge, we introduce Wobly, an
attribute based signature (ABS) that measures gait. Wobly
passively receives Wi-Fi beacons and produces human sig-
natures based on the Doppler Eﬀect and multipath signals
without attached devices and out of direct line-of-sight. Be-
cause signatures are speciﬁc to antenna placement and room
conﬁguration and do not require sensor attachments, the
identities of the individuals can remain anonymous. How-
ever, the gait based signatures are still unique, and thus
Wobly is able to track individuals in a building or home.
Wobly uses the physical layer channel and the unique human
gait as a means of encoding a person’s identity. We imple-
mented Wobly on a National Instruments Radio Frequency
(RF) test bed. Using a simple naive Bayes classiﬁer, the
correct identiﬁcation rate was 87% with line-of-sight (LoS)
and 77% with non-line-of-sight (NLoS).
Categories and Subject Descriptors
Biometrics [Cognitive radios]: Privacy-enhancing technol-
ogy; Cyber-physical security [Intrusion detection]:
[RF
localization, human signature]
Keywords
Wi-Fi RF localization, signature, gait, biometrics
1.
INTRODUCTION
The ability to protect privacy while tracking individuals’
locations is critical, especially in public areas, as these lo-
cations are bound by laws, restricting image captures or
...


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

Input:
title:Gait-Based Wi-Fi Signatures for Privacy-Preserving
author:Yan Li and
Ting Zhu
Gait-Based Wi-Fi Signatures for Privacy-Preserving
Dept of Computer Science & Electrical Eng
University of Maryland, Baltimore County
Dept of Computer Science & Electrical Eng
University of Maryland Baltimore County
Ting Zhu
zt@umbc.edu
Yan Li
Johns Hopkins University
li@jhu.edu
ABSTRACT
With the advent of the Internet of Things (IoT) and big
data, high ﬁdelity localization and tracking systems that
employ cameras, RFIDs, and attached sensors intrude on
personal privacy. However, the beneﬁt of localization in-
formation sharing enables trend forecasting and automa-
tion. To address this challenge, we introduce Wobly, an
attribute based signature (ABS) that measures gait. Wobly
passively receives Wi-Fi beacons and produces human sig-
natures based on the Doppler Eﬀect and multipath signals
without attached devices and out of direct line-of-sight. Be-
cause signatures are speciﬁc to antenna placement and room
conﬁguration and do not require sensor attachments, the
identities of the individuals can remain anonymous. How-
ever, the gait based signatures are still unique, and thus
Wobly is able to track individuals in a building or home.
Wobly uses the physical layer channel and the unique human
gait as a means of encoding a person’s identity. We imple-
mented Wobly on a National Instruments Radio Frequency
(RF) test bed. Using a simple naive Bayes classiﬁer, the
correct identiﬁcation rate was 87% with line-of-sight (LoS)
and 77% with non-line-of-sight (NLoS).
Categories and Subject Descriptors
Biometrics [Cognitive radios]: Privacy-enhancing technol-
ogy; Cyber-physical security [Intrusion detection]:
[RF
localization, human signature]
Keywords
Wi-Fi RF localization, signature, gait, biometrics
1.
INTRODUCTION
The ability to protect privacy while tracking individuals’
locations is critical, especially in public areas, as these lo-
cations are bound by laws, restricting image captures or
...

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


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

Output:
安全论文分析：

title:ProTracer: Towards Practical Provenance Tracing by Alternating Between
Logging and Tainting
author:Shiqing Ma and
Xiangyu Zhang and
Dongyan Xu
ProTracer: Towards Practical Provenance Tracing by
Alternating Between Logging and Tainting
Shiqing Ma
Purdue University
Xiangyu Zhang
Purdue University
shiqingma@purdue.edu
xyzhang@cs.purdue.edu
Dongyan Xu
Purdue University
dxu@cs.purdue.edu
Abstract—Provenance tracing is a very important approach
to Advanced Persistent Threat (APT) attack detection and in-
vestigation. Existing techniques either suffer from the depen-
dence explosion problem or have non-trivial space and run-
time overhead, which hinder their application in practice. We
propose ProTracer, a lightweight provenance tracing system that
alternates between system event logging and unit level taint
propagation. The technique is built on an on-the-ﬂy system event
processing infrastructure that features a very lightweight kernel
module and a sophisticated user space daemon that performs
concurrent and out-of-order event processing. The evaluation
with different realistic system workloads and a number of attack
cases show that ProTracer only produces 13MB log data per
day, and 0.84GB(Server)/2.32GB(Client) in 3 months without
losing any important information. The space consumption is
only < 1.28% of the state-of-the-art, 7 times smaller than an
off-line garbage collection technique. The run-time overhead
averages <7% for servers and <5% for regular applications.
The generated attack causal graphs are a few times smaller than
those by existing techniques while they are equally informative.
I.
INTRODUCTION
There is an increasing need of detecting and investigating
APT attacks in an enterprise environment. A very important
approach to addressing this problem is provenance tracking.
According to previous works [17], [32], provenance captures
multiple aspects of information about an entity in a system:
what the entity’s origin is; how the entity is derived; and whe...


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

Input:
title:ProTracer: Towards Practical Provenance Tracing by Alternating Between
Logging and Tainting
author:Shiqing Ma and
Xiangyu Zhang and
Dongyan Xu
ProTracer: Towards Practical Provenance Tracing by
Alternating Between Logging and Tainting
Shiqing Ma
Purdue University
Xiangyu Zhang
Purdue University
shiqingma@purdue.edu
xyzhang@cs.purdue.edu
Dongyan Xu
Purdue University
dxu@cs.purdue.edu
Abstract—Provenance tracing is a very important approach
to Advanced Persistent Threat (APT) attack detection and in-
vestigation. Existing techniques either suffer from the depen-
dence explosion problem or have non-trivial space and run-
time overhead, which hinder their application in practice. We
propose ProTracer, a lightweight provenance tracing system that
alternates between system event logging and unit level taint
propagation. The technique is built on an on-the-ﬂy system event
processing infrastructure that features a very lightweight kernel
module and a sophisticated user space daemon that performs
concurrent and out-of-order event processing. The evaluation
with different realistic system workloads and a number of attack
cases show that ProTracer only produces 13MB log data per
day, and 0.84GB(Server)/2.32GB(Client) in 3 months without
losing any important information. The space consumption is
only < 1.28% of the state-of-the-art, 7 times smaller than an
off-line garbage collection technique. The run-time overhead
averages <7% for servers and <5% for regular applications.
The generated attack causal graphs are a few times smaller than
those by existing techniques while they are equally informative.
I.
INTRODUCTION
There is an increasing need of detecting and investigating
APT attacks in an enterprise environment. A very important
approach to addressing this problem is provenance tracking.
According to previous works [17], [32], provenance captures
multiple aspects of information about an entity in a system:
what the entity’s origin is; how the entity is derived; and whe...

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


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

Output:
安全论文分析：

title:On the Security of Two-Round Multi-Signatures
author:Manu Drijvers and
Kasra Edalatnejad and
Bryan Ford and
Eike Kiltz and
Julian Loss and
Gregory Neven and
Igors Stepanovs
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
On the Security of Two-Round Multi-Signatures
, Julian Loss
§
∗
, Gregory Neven
Ruhr-Universit¨at Bochum,
UCSD.
¶
, Igors Stepanovs
¶
Manu Drijvers
, Kasra Edalatnejad
∗†
∗
DFINITY,
‡
‡
, Bryan Ford
‡
EPFL,
ETH Zurich,
†
§
, Eike Kiltz
§
Abstract—A multi-signature scheme allows a group of signers
to collaboratively sign a message, creating a single signature that
convinces a veriﬁer that every individual signer approved the
message. The increased interest in technologies to decentralize
trust has triggered the proposal of highly efﬁcient two-round
Schnorr-based multi-signature schemes designed to scale up to
thousands of signers, namely BCJ by Bagherzandi et al. (CCS
2008), MWLD by Ma et al. (DCC 2010), CoSi by Syta et al. (S&P
2016), and MuSig by Maxwell et al. (ePrint 2018). In this work,
we point out serious security issues in all currently known
two-round multi-signature schemes (without pairings). First, we
prove that none of the schemes can be proved secure without
radically departing from currently known techniques. Namely,
we show that if the one-more discrete-logarithm problem is
hard, then no algebraic reduction exists that proves any of
these schemes secure under the discrete-logarithm or one-more
discrete-logarithm problem. We point out subtle ﬂaws in the
published security proofs of the above schemes (except CoSi,
which was not proved secure) to clarify the contradiction between
our result and the existing proofs. Next, we describe practical sub...


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

Input:
title:On the Security of Two-Round Multi-Signatures
author:Manu Drijvers and
Kasra Edalatnejad and
Bryan Ford and
Eike Kiltz and
Julian Loss and
Gregory Neven and
Igors Stepanovs
(cid:19)(cid:17)(cid:18)(cid:26)(cid:1)(cid:42)(cid:38)(cid:38)(cid:38)(cid:1)(cid:52)(cid:90)(cid:78)(cid:81)(cid:80)(cid:84)(cid:74)(cid:86)(cid:78)(cid:1)(cid:80)(cid:79)(cid:1)(cid:52)(cid:70)(cid:68)(cid:86)(cid:83)(cid:74)(cid:85)(cid:90)(cid:1)(cid:66)(cid:79)(cid:69)(cid:1)(cid:49)(cid:83)(cid:74)(cid:87)(cid:66)(cid:68)(cid:90)
On the Security of Two-Round Multi-Signatures
, Julian Loss
§
∗
, Gregory Neven
Ruhr-Universit¨at Bochum,
UCSD.
¶
, Igors Stepanovs
¶
Manu Drijvers
, Kasra Edalatnejad
∗†
∗
DFINITY,
‡
‡
, Bryan Ford
‡
EPFL,
ETH Zurich,
†
§
, Eike Kiltz
§
Abstract—A multi-signature scheme allows a group of signers
to collaboratively sign a message, creating a single signature that
convinces a veriﬁer that every individual signer approved the
message. The increased interest in technologies to decentralize
trust has triggered the proposal of highly efﬁcient two-round
Schnorr-based multi-signature schemes designed to scale up to
thousands of signers, namely BCJ by Bagherzandi et al. (CCS
2008), MWLD by Ma et al. (DCC 2010), CoSi by Syta et al. (S&P
2016), and MuSig by Maxwell et al. (ePrint 2018). In this work,
we point out serious security issues in all currently known
two-round multi-signature schemes (without pairings). First, we
prove that none of the schemes can be proved secure without
radically departing from currently known techniques. Namely,
we show that if the one-more discrete-logarithm problem is
hard, then no algebraic reduction exists that proves any of
these schemes secure under the discrete-logarithm or one-more
discrete-logarithm problem. We point out subtle ﬂaws in the
published security proofs of the above schemes (except CoSi,
which was not proved secure) to clarify the contradiction between
our result and the existing proofs. Next, we describe practical sub...

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


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

Output:
安全论文分析：

title:V0LTpwn: Attacking x86 Processor Integrity from Software
author:Zijo Kenjar and
Tommaso Frassetto and
David Gens and
Michael Franz and
Ahmad-Reza Sadeghi
V0LTpwn: Attacking x86 Processor Integrity
from Software
Zijo Kenjar and Tommaso Frassetto, Technische Universität Darmstadt;
David Gens and Michael Franz, University of California, Irvine;
Ahmad-Reza Sadeghi, Technische Universität Darmstadt
https://www.usenix.org/conference/usenixsecurity20/presentation/kenjar
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.V0LTpwn: Attacking x86 Processor Integrity from Software
Zijo Kenjar1, Tommaso Frassetto1, David Gens2, Michael Franz2, and Ahmad-Reza Sadeghi1
1Technical University of Darmstadt, Germany
{zijo.kenjar,tommaso.frassetto,ahmad.sadeghi}@trust.tu-darmstadt.de
2University of California, Irvine
{dgens,franz}@uci.edu
Abstract
Fault-injection attacks have been proven in the past to
be a reliable way of bypassing hardware-based security
measures, such as cryptographic hashes, privilege and
access permission enforcement, and trusted execution
environments. However, traditional fault-injection at-
tacks require physical presence, and hence, were often
considered out of scope in many real-world adversary
settings.
In this paper we show this assumption may no longer
be justiﬁed on x86. We present V0LTpwn, a novel
hardware-oriented but software-controlled attack that
aﬀects the integrity of computation in virtually any ex-
ecution mode on modern x86 processors. To the best
of our knowledge, this represents the ﬁrst attack on
the integrity of the x86 platform from software. The
key idea behind our attack is to undervolt a physical
core to force non-recoverable hardware faults. Under
a V0LTpwn attack, CPU instructions will continue to
execute with erroneous results and without crashes, al-
lowing for exploitat...


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

Input:
title:V0LTpwn: Attacking x86 Processor Integrity from Software
author:Zijo Kenjar and
Tommaso Frassetto and
David Gens and
Michael Franz and
Ahmad-Reza Sadeghi
V0LTpwn: Attacking x86 Processor Integrity
from Software
Zijo Kenjar and Tommaso Frassetto, Technische Universität Darmstadt;
David Gens and Michael Franz, University of California, Irvine;
Ahmad-Reza Sadeghi, Technische Universität Darmstadt
https://www.usenix.org/conference/usenixsecurity20/presentation/kenjar
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.V0LTpwn: Attacking x86 Processor Integrity from Software
Zijo Kenjar1, Tommaso Frassetto1, David Gens2, Michael Franz2, and Ahmad-Reza Sadeghi1
1Technical University of Darmstadt, Germany
{zijo.kenjar,tommaso.frassetto,ahmad.sadeghi}@trust.tu-darmstadt.de
2University of California, Irvine
{dgens,franz}@uci.edu
Abstract
Fault-injection attacks have been proven in the past to
be a reliable way of bypassing hardware-based security
measures, such as cryptographic hashes, privilege and
access permission enforcement, and trusted execution
environments. However, traditional fault-injection at-
tacks require physical presence, and hence, were often
considered out of scope in many real-world adversary
settings.
In this paper we show this assumption may no longer
be justiﬁed on x86. We present V0LTpwn, a novel
hardware-oriented but software-controlled attack that
aﬀects the integrity of computation in virtually any ex-
ecution mode on modern x86 processors. To the best
of our knowledge, this represents the ﬁrst attack on
the integrity of the x86 platform from software. The
key idea behind our attack is to undervolt a physical
core to force non-recoverable hardware faults. Under
a V0LTpwn attack, CPU instructions will continue to
execute with erroneous results and without crashes, al-
lowing for exploitat...

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


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

Output:
安全论文分析：

title:Hardware Performance Counters Can Detect Malware: Myth or Fact?
author:Boyou Zhou and
Anmol Gupta and
Rasoul Jahanshahi and
Manuel Egele and
Ajay Joshi
Hardware Performance Counters Can Detect Malware:
Myth or Fact?
Boyou Zhou, Anmol Gupta, Rasoul Jahanshahi, Manuel Egele, Ajay Joshi
{bobzhou,anmol.gupta1005,rasoulj,megele,joshi}@bu.edu
Eletrical and Computer Engineering Department, Boston University
ABSTRACT
The ever-increasing prevalence of malware has led to the explo-
rations of various detection mechanisms. Several recent works
propose to use Hardware Performance Counters (HPCs) values
with machine learning classiication models for malware detection.
HPCs are hardware units that record low-level micro-architectural
behavior, such as cache hits/misses, branch (mis)prediction, and
load/store operations. However, this information does not reliably
capture the nature of the application, i.e. whether it is benign or
malicious. In this paper, we claim and experimentally support that
using the micro-architectural level information obtained from HPCs
cannot distinguish between benignware and malware. We eval-
uate the idelity of malware detection using HPCs. We perform
quantitative analysis using Principal Component Analysis (PCA) to
systematically select micro-architectural events that have the most
predictive powers. We then run 1,924 programs, 962 benignware
and 962 malware, on our experimental setups. We achieve 83.39%,
84.84%, 83.59%, 75.01%, 78.75%, and 14.32% F1-score (a metric of
detection rates) of Decision Tree (DT), Random Forest (RF), K Near-
est Neighbors (KNN), Adaboost, Neural Net (NN), and Naive Bayes,
respectively. We cross-validate our models 1,000 times to show
the distributions of detection rates in various models. Our cross-
validation analysis shows that many of the experiments produce
low F1-scores. The F1-score of models in DT, RF, KNN, Adaboost,
NN, and Naive Bayes is 80.22%, 81.29%, 80.22%, 70.32%, 35.66%,
and 9.903%, respectively. To fu...


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

Input:
title:Hardware Performance Counters Can Detect Malware: Myth or Fact?
author:Boyou Zhou and
Anmol Gupta and
Rasoul Jahanshahi and
Manuel Egele and
Ajay Joshi
Hardware Performance Counters Can Detect Malware:
Myth or Fact?
Boyou Zhou, Anmol Gupta, Rasoul Jahanshahi, Manuel Egele, Ajay Joshi
{bobzhou,anmol.gupta1005,rasoulj,megele,joshi}@bu.edu
Eletrical and Computer Engineering Department, Boston University
ABSTRACT
The ever-increasing prevalence of malware has led to the explo-
rations of various detection mechanisms. Several recent works
propose to use Hardware Performance Counters (HPCs) values
with machine learning classiication models for malware detection.
HPCs are hardware units that record low-level micro-architectural
behavior, such as cache hits/misses, branch (mis)prediction, and
load/store operations. However, this information does not reliably
capture the nature of the application, i.e. whether it is benign or
malicious. In this paper, we claim and experimentally support that
using the micro-architectural level information obtained from HPCs
cannot distinguish between benignware and malware. We eval-
uate the idelity of malware detection using HPCs. We perform
quantitative analysis using Principal Component Analysis (PCA) to
systematically select micro-architectural events that have the most
predictive powers. We then run 1,924 programs, 962 benignware
and 962 malware, on our experimental setups. We achieve 83.39%,
84.84%, 83.59%, 75.01%, 78.75%, and 14.32% F1-score (a metric of
detection rates) of Decision Tree (DT), Random Forest (RF), K Near-
est Neighbors (KNN), Adaboost, Neural Net (NN), and Naive Bayes,
respectively. We cross-validate our models 1,000 times to show
the distributions of detection rates in various models. Our cross-
validation analysis shows that many of the experiments produce
low F1-scores. The F1-score of models in DT, RF, KNN, Adaboost,
NN, and Naive Bayes is 80.22%, 81.29%, 80.22%, 70.32%, 35.66%,
and 9.903%, respectively. To fu...

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


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

Output:
安全论文分析：

title:Protecting Intellectual Property of Deep Neural Networks with Watermarking
author:Jialong Zhang and
Zhongshu Gu and
Jiyong Jang and
Hui Wu and
Marc Ph. Stoecklin and
Heqing Huang and
Ian Molloy
Protecting Intellectual Property of Deep Neural
Networks with Watermarking
Jialong Zhang, Zhongshu Gu, Jiyong Jang, Hui Wu, Marc Ph. Stoecklin, Heqing Huang, Ian Molloy
jialong.zhang@ibm.com,{zgu,jjang,wuhu,mpstoeck,hhung,molloyim}@us.ibm.com
IBM Research
ABSTRACT
Deep learning technologies, which are the key components of state-
of-the-art Artificial Intelligence (AI) services, have shown great
success in providing human-level capabilities for a variety of tasks,
such as visual analysis, speech recognition, and natural language
processing and etc. Building a production-level deep learning model
is a non-trivial task, which requires a large amount of training data,
powerful computing resources, and human expertises. Therefore,
illegitimate reproducing, distribution, and the derivation of propri-
etary deep learning models can lead to copyright infringement and
economic harm to model creators. Therefore, it is essential to devise
a technique to protect the intellectual property of deep learning
models and enable external verification of the model ownership.
In this paper, we generalize the “digital watermarking” concept
from multimedia ownership verification to deep neural network
(DNNs) models. We investigate three DNN-applicable watermark
generation algorithms, propose a watermark implanting approach
to infuse watermark into deep learning models, and design a remote
verification mechanism to determine the model ownership. By ex-
tending the intrinsic generalization and memorization capabilities
of deep neural networks, we enable the models to learn specially
crafted watermarks at training and activate with pre-specified pre-
dictions when observing the watermark patterns at inference. We
evaluate our approach with two image recognition benchmark
datasets. Our framework...


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

Input:
title:Protecting Intellectual Property of Deep Neural Networks with Watermarking
author:Jialong Zhang and
Zhongshu Gu and
Jiyong Jang and
Hui Wu and
Marc Ph. Stoecklin and
Heqing Huang and
Ian Molloy
Protecting Intellectual Property of Deep Neural
Networks with Watermarking
Jialong Zhang, Zhongshu Gu, Jiyong Jang, Hui Wu, Marc Ph. Stoecklin, Heqing Huang, Ian Molloy
jialong.zhang@ibm.com,{zgu,jjang,wuhu,mpstoeck,hhung,molloyim}@us.ibm.com
IBM Research
ABSTRACT
Deep learning technologies, which are the key components of state-
of-the-art Artificial Intelligence (AI) services, have shown great
success in providing human-level capabilities for a variety of tasks,
such as visual analysis, speech recognition, and natural language
processing and etc. Building a production-level deep learning model
is a non-trivial task, which requires a large amount of training data,
powerful computing resources, and human expertises. Therefore,
illegitimate reproducing, distribution, and the derivation of propri-
etary deep learning models can lead to copyright infringement and
economic harm to model creators. Therefore, it is essential to devise
a technique to protect the intellectual property of deep learning
models and enable external verification of the model ownership.
In this paper, we generalize the “digital watermarking” concept
from multimedia ownership verification to deep neural network
(DNNs) models. We investigate three DNN-applicable watermark
generation algorithms, propose a watermark implanting approach
to infuse watermark into deep learning models, and design a remote
verification mechanism to determine the model ownership. By ex-
tending the intrinsic generalization and memorization capabilities
of deep neural networks, we enable the models to learn specially
crafted watermarks at training and activate with pre-specified pre-
dictions when observing the watermark patterns at inference. We
evaluate our approach with two image recognition benchmark
datasets. Our framework...

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


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

Output:
安全论文分析：

title:IntScope: Automatically Detecting Integer Overflow Vulnerability in
X86 Binary Using Symbolic Execution
author:Tielei Wang and
Tao Wei and
Zhiqiang Lin and
Wei Zou
IntScope: Automatically Detecting Integer Overﬂow Vulnerability in X86 Binary
Using Symbolic Execution
Tielei Wang†, Tao Wei†∗, Zhiqiang Lin‡, Wei Zou†
†Key Laboratory of Network and Software Security Assurance
Institute of Computer Science and Technology, Peking University
{wangtielei, weitao, zouwei}@icst.pku.edu.cn
‡Department of Computer Science
Purdue University
zlin@cs.purdue.edu
Abstract
The number of identiﬁed integer overﬂow vulnerabilities
has been increasing rapidly in recent years. In this paper,
we present a system, IntScope, which can automatically de-
tect integer overﬂow vulnerabilities in x86 binaries before
an attacker does, with the goal of ﬁnally eliminating the vul-
nerabilities. IntScope ﬁrst translates the disassembled code
into our own intermediate representation (IR), and then per-
forms a path sensitive data ﬂow analysis on the IR by lever-
aging symbolic execution and taint analysis to identify the
vulnerable point of integer overﬂow. Compared with other
approaches, IntScope does not run the binary directly, and
is scalable to large software as it can just symbolically ex-
ecute the interesting program paths. Experimental results
show IntScope is quite encouraging: it has detected more
than 20 zero-day integer overﬂows (e.g., CVE-2008-4201,
FrSIRT/ADV-2008-2919) in widely-used software such as
QEMU, Xen and Xine.
1. Introduction
Primitive types, including integers, typically have a ﬁxed
size (e.g., 32 bits) for a particular machine architecture.
Thus, variables of these types have a maximum value (e.g.,
232). Operations that result in a value greater than this max-
imum can cause the value to wrap-around: this well-known
condition is called overﬂow. Integer overﬂows are particu-
larly insidious: while the overﬂow itself is usually not ex-
ploitable, it often leads to other...


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

Input:
title:IntScope: Automatically Detecting Integer Overflow Vulnerability in
X86 Binary Using Symbolic Execution
author:Tielei Wang and
Tao Wei and
Zhiqiang Lin and
Wei Zou
IntScope: Automatically Detecting Integer Overﬂow Vulnerability in X86 Binary
Using Symbolic Execution
Tielei Wang†, Tao Wei†∗, Zhiqiang Lin‡, Wei Zou†
†Key Laboratory of Network and Software Security Assurance
Institute of Computer Science and Technology, Peking University
{wangtielei, weitao, zouwei}@icst.pku.edu.cn
‡Department of Computer Science
Purdue University
zlin@cs.purdue.edu
Abstract
The number of identiﬁed integer overﬂow vulnerabilities
has been increasing rapidly in recent years. In this paper,
we present a system, IntScope, which can automatically de-
tect integer overﬂow vulnerabilities in x86 binaries before
an attacker does, with the goal of ﬁnally eliminating the vul-
nerabilities. IntScope ﬁrst translates the disassembled code
into our own intermediate representation (IR), and then per-
forms a path sensitive data ﬂow analysis on the IR by lever-
aging symbolic execution and taint analysis to identify the
vulnerable point of integer overﬂow. Compared with other
approaches, IntScope does not run the binary directly, and
is scalable to large software as it can just symbolically ex-
ecute the interesting program paths. Experimental results
show IntScope is quite encouraging: it has detected more
than 20 zero-day integer overﬂows (e.g., CVE-2008-4201,
FrSIRT/ADV-2008-2919) in widely-used software such as
QEMU, Xen and Xine.
1. Introduction
Primitive types, including integers, typically have a ﬁxed
size (e.g., 32 bits) for a particular machine architecture.
Thus, variables of these types have a maximum value (e.g.,
232). Operations that result in a value greater than this max-
imum can cause the value to wrap-around: this well-known
condition is called overﬂow. Integer overﬂows are particu-
larly insidious: while the overﬂow itself is usually not ex-
ploitable, it often leads to other...

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


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

Output:
安全论文分析：

title:Practical Anonymous Password Authentication and TLS with Anonymous
Client Authentication
author:Zhenfeng Zhang and
Kang Yang and
Xuexian Hu and
Yuchen Wang
Practical Anonymous Password Authentication and TLS
with Anonymous Client Authentication ∗
Zhenfeng Zhang
Trusted Computing and Information Assurance
Laboratory, SKLCS, Institute of Software,
Chinese Academy of Sciences
zfzhang@tca.iscas.ac.cn
Xuexian Hu
Institute of Software, Chinese Academy of
Sciences & State Key Lab of Mathematical
Engineering and Advanced Computing
xuexian_hu@hotmail.com
†
Kang Yang
Trusted Computing and Information Assurance
Laboratory, Institute of Software,
Chinese Academy of Sciences
yangkang@tca.iscas.ac.cn
Yuchen Wang
Trusted Computing and Information Assurance
Laboratory, Institute of Software,
Chinese Academy of Sciences
wangyuchen@tca.iscas.ac.cn
ABSTRACT
Anonymous authentication allows one to authenticate her-
self without revealing her identity, and becomes an impor-
tant technique for constructing privacy-preserving Internet
connections. Anonymous password authentication is high-
ly desirable as it enables a client to authenticate herself
by a human-memorable password while preserving her pri-
vacy.
In this paper, we introduce a novel approach for
designing anonymous password-authenticated key exchange
(APAKE) protocols using algebraic message authentication
codes (MACs), where an algebraic MAC wrapped by a pass-
word is used by a client for anonymous authentication, and
a server issues algebraic MACs to clients and acts as the
veriﬁer of login protocols. Our APAKE construction is se-
cure provided that the algebraic MAC is strongly existential-
ly unforgeable under random message and chosen veriﬁca-
tion queries attack (suf-rmva), weak pseudorandom and tag-
randomization simulatable, and has simulation-sound ex-
tractable non-interactive zero-knowledge proofs (SE-NIZKs).
To design practical APAKE protocols, we instantiate an
algebraic MAC based on the q-SDH assumption whic...


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

Input:
title:Practical Anonymous Password Authentication and TLS with Anonymous
Client Authentication
author:Zhenfeng Zhang and
Kang Yang and
Xuexian Hu and
Yuchen Wang
Practical Anonymous Password Authentication and TLS
with Anonymous Client Authentication ∗
Zhenfeng Zhang
Trusted Computing and Information Assurance
Laboratory, SKLCS, Institute of Software,
Chinese Academy of Sciences
zfzhang@tca.iscas.ac.cn
Xuexian Hu
Institute of Software, Chinese Academy of
Sciences & State Key Lab of Mathematical
Engineering and Advanced Computing
xuexian_hu@hotmail.com
†
Kang Yang
Trusted Computing and Information Assurance
Laboratory, Institute of Software,
Chinese Academy of Sciences
yangkang@tca.iscas.ac.cn
Yuchen Wang
Trusted Computing and Information Assurance
Laboratory, Institute of Software,
Chinese Academy of Sciences
wangyuchen@tca.iscas.ac.cn
ABSTRACT
Anonymous authentication allows one to authenticate her-
self without revealing her identity, and becomes an impor-
tant technique for constructing privacy-preserving Internet
connections. Anonymous password authentication is high-
ly desirable as it enables a client to authenticate herself
by a human-memorable password while preserving her pri-
vacy.
In this paper, we introduce a novel approach for
designing anonymous password-authenticated key exchange
(APAKE) protocols using algebraic message authentication
codes (MACs), where an algebraic MAC wrapped by a pass-
word is used by a client for anonymous authentication, and
a server issues algebraic MACs to clients and acts as the
veriﬁer of login protocols. Our APAKE construction is se-
cure provided that the algebraic MAC is strongly existential-
ly unforgeable under random message and chosen veriﬁca-
tion queries attack (suf-rmva), weak pseudorandom and tag-
randomization simulatable, and has simulation-sound ex-
tractable non-interactive zero-knowledge proofs (SE-NIZKs).
To design practical APAKE protocols, we instantiate an
algebraic MAC based on the q-SDH assumption whic...

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


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

Output:
安全论文分析：

title:Towards practical biometric key generation with randomized biometric
templates
author:Lucas Ballard and
Seny Kamara and
Fabian Monrose and
Michael K. Reiter
Towards Practical Biometric Key Generation
with Randomized Biometric Templates
∗
Lucas Ballard
Google, Inc.
lucasballard@google.com
∗
Seny Kamara
Microsoft Research
senyk@microsoft.com
∗
Fabian Monrose
UNC Chapel Hill
fabian@cs.unc.edu
Michael K. Reiter
UNC Chapel Hill
reiter@cs.unc.edu
ABSTRACT
Although biometrics have garnered signiﬁcant interest as a source
of entropy for cryptographic key generation, recent studies indicate
that many biometric modalities may not actually offer enough un-
certainty for this purpose. In this paper, we exploit a novel source
of entropy that can be used with any biometric modality but that
has yet to be utilized for key generation, namely associating uncer-
tainty with the way in which the biometric input is measured. Our
construction poses only a modest requirement on a user: the abil-
ity to remember a low-entropy password. We identify the technical
challenges of this approach, and develop novel techniques to over-
come these difﬁculties. Our analysis of this approach indicates that
it may offer the potential to generate stronger keys: In our experi-
ments, 40% of the users are able to generate keys that are at least
230 times stronger than passwords alone.
Categories and Subject Descriptors
E.3 [Data Encryption]; H.1 [Models and Principles]: User/Machine
Systems
General Terms
Security, Design
Keywords
Biometrics, Cryptographic Keys
1.
INTRODUCTION
Humans are unable to generate and remember strong secrets, and
thus have difﬁculty managing cryptographic keys [1, 10]. To ad-
dress this problem, numerous proposals have been suggested to en-
able people to reliably generate high-entropy cryptographic keys
∗
Research conducted at Johns Hopkins University, Baltimore, MD.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is gran...


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

Input:
title:Towards practical biometric key generation with randomized biometric
templates
author:Lucas Ballard and
Seny Kamara and
Fabian Monrose and
Michael K. Reiter
Towards Practical Biometric Key Generation
with Randomized Biometric Templates
∗
Lucas Ballard
Google, Inc.
lucasballard@google.com
∗
Seny Kamara
Microsoft Research
senyk@microsoft.com
∗
Fabian Monrose
UNC Chapel Hill
fabian@cs.unc.edu
Michael K. Reiter
UNC Chapel Hill
reiter@cs.unc.edu
ABSTRACT
Although biometrics have garnered signiﬁcant interest as a source
of entropy for cryptographic key generation, recent studies indicate
that many biometric modalities may not actually offer enough un-
certainty for this purpose. In this paper, we exploit a novel source
of entropy that can be used with any biometric modality but that
has yet to be utilized for key generation, namely associating uncer-
tainty with the way in which the biometric input is measured. Our
construction poses only a modest requirement on a user: the abil-
ity to remember a low-entropy password. We identify the technical
challenges of this approach, and develop novel techniques to over-
come these difﬁculties. Our analysis of this approach indicates that
it may offer the potential to generate stronger keys: In our experi-
ments, 40% of the users are able to generate keys that are at least
230 times stronger than passwords alone.
Categories and Subject Descriptors
E.3 [Data Encryption]; H.1 [Models and Principles]: User/Machine
Systems
General Terms
Security, Design
Keywords
Biometrics, Cryptographic Keys
1.
INTRODUCTION
Humans are unable to generate and remember strong secrets, and
thus have difﬁculty managing cryptographic keys [1, 10]. To ad-
dress this problem, numerous proposals have been suggested to en-
able people to reliably generate high-entropy cryptographic keys
∗
Research conducted at Johns Hopkins University, Baltimore, MD.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is gran...

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


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

Output:
安全论文分析：

title:Inferring regional access network topologies: methods and applications
author:Zesen Zhang and
Alexander Marder and
Ricky K. P. Mok and
Bradley Huffaker and
Matthew Luckie and
Kimberly C. Claffy and
Aaron Schulman
Inferring Regional Access Network Topologies:
Methods and Applications
Alexander Marder
CAIDA, UC San Diego
amarder@caida.org
CAIDA, UC San Diego
cskpmok@caida.org
Ricky Mok
Bradley Huffaker
CAIDA, UC San Diego
bradley@caida.org
Zesen Zhang
UC San Diego
zez003@eng.ucsd.edu
Matthew Luckie
University of Waikato
mjl@wand.net.nz
KC Claffy
CAIDA, UC San Diego
kc@caida.org
Aaron Schulman
UC San Diego
schulman@cs.ucsd.edu
ABSTRACT
Using a toolbox of Internet cartography methods, and new ways
of applying them, we have undertaken a comprehensive active
measurement-driven study of the topology of U.S. regional access
ISPs. We used state-of-the-art approaches in various combinations
to accommodate the geographic scope, scale, and architectural rich-
ness of U.S. regional access ISPs. In addition to vantage points from
research platforms, we used public WiFi hotspots and public transit
of mobile devices to acquire the visibility needed to thoroughly
map access networks across regions. We observed many different
approaches to aggregation and redundancy, across links, nodes,
buildings, and at different levels of the hierarchy. One result is sub-
stantial disparity in latency from some Edge COs to their backbone
COs, with implications for end users of cloud services. Our meth-
ods and results can inform future analysis of critical infrastructure,
including resilience to disasters, persistence of the digital divide,
and challenges for the future of 5G and edge computing.
CCS CONCEPTS
• Networks → Public Internet; Logical / virtual topologies;
Physical topologies; Network measurement.
KEYWORDS
Internet topology, Access networks, Mobile networks, Traceroute
ACM Reference Format:
Zesen Zhang, Alexander Marder, Ricky Mok, Bradley Huffaker, Matthew
Luckie, KC Claffy, and ...


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

Input:
title:Inferring regional access network topologies: methods and applications
author:Zesen Zhang and
Alexander Marder and
Ricky K. P. Mok and
Bradley Huffaker and
Matthew Luckie and
Kimberly C. Claffy and
Aaron Schulman
Inferring Regional Access Network Topologies:
Methods and Applications
Alexander Marder
CAIDA, UC San Diego
amarder@caida.org
CAIDA, UC San Diego
cskpmok@caida.org
Ricky Mok
Bradley Huffaker
CAIDA, UC San Diego
bradley@caida.org
Zesen Zhang
UC San Diego
zez003@eng.ucsd.edu
Matthew Luckie
University of Waikato
mjl@wand.net.nz
KC Claffy
CAIDA, UC San Diego
kc@caida.org
Aaron Schulman
UC San Diego
schulman@cs.ucsd.edu
ABSTRACT
Using a toolbox of Internet cartography methods, and new ways
of applying them, we have undertaken a comprehensive active
measurement-driven study of the topology of U.S. regional access
ISPs. We used state-of-the-art approaches in various combinations
to accommodate the geographic scope, scale, and architectural rich-
ness of U.S. regional access ISPs. In addition to vantage points from
research platforms, we used public WiFi hotspots and public transit
of mobile devices to acquire the visibility needed to thoroughly
map access networks across regions. We observed many different
approaches to aggregation and redundancy, across links, nodes,
buildings, and at different levels of the hierarchy. One result is sub-
stantial disparity in latency from some Edge COs to their backbone
COs, with implications for end users of cloud services. Our meth-
ods and results can inform future analysis of critical infrastructure,
including resilience to disasters, persistence of the digital divide,
and challenges for the future of 5G and edge computing.
CCS CONCEPTS
• Networks → Public Internet; Logical / virtual topologies;
Physical topologies; Network measurement.
KEYWORDS
Internet topology, Access networks, Mobile networks, Traceroute
ACM Reference Format:
Zesen Zhang, Alexander Marder, Ricky Mok, Bradley Huffaker, Matthew
Luckie, KC Claffy, and ...

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


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

Output:
安全论文分析：

title:BUFFing signature schemes beyond unforgeability and the case of post-quantum
signatures
author:Cas Cremers and
Samed D"uzl"u and
Rune Fiedler and
Marc Fischlin and
Christian Janson
2021 IEEE Symposium on Security and Privacy (SP)
BUFFing signature schemes beyond unforgeability
and the case of post-quantum signatures
Cas Cremers∗, Samed Düzlü†, Rune Fiedler‡, Marc Fischlin‡, and Christian Janson‡
∗CISPA Helmholtz Center for Information Security, Germany
‡Cryptoplexity, Technische Universität Darmstadt, Germany
†QPC, Technische Universität Darmstadt, Germany
3
9
0
0
0
.
1
2
0
2
.
1
0
0
0
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
1
2
0
2
©
0
0
.
1
3
$
/
1
2
/
5
-
4
3
9
8
-
1
8
2
7
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
1
2
0
2
Abstract—Modern digital signature schemes can provide more
guarantees than the standard notion of (strong) unforgeability,
such as offering security even in the presence of maliciously
generated keys, or requiring to know a message to produce
a signature for it. The use of signature schemes that lack
these properties has previously enabled attacks on real-world
protocols. In this work we revisit several of these notions beyond
unforgeability, establish relations among them, provide the ﬁrst
formal deﬁnition of non re-signability, and a transformation that
can provide these properties for a given signature scheme in a
provable and efﬁcient way.
Our results are not only relevant for established schemes:
for example, the ongoing NIST PQC competition towards stan-
dardizing post-quantum signature schemes has six ﬁnalists in its
third round. We perform an in-depth analysis of the candidates
with respect to their security properties beyond unforgeability.
We show that many of them do not yet offer these stronger
guarantees, which implies that the security guarantees of these
post-quantum schemes are not strictly stronger than, but instead
incomparable to, classical signature schemes. We sho...


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

Input:
title:BUFFing signature schemes beyond unforgeability and the case of post-quantum
signatures
author:Cas Cremers and
Samed D"uzl"u and
Rune Fiedler and
Marc Fischlin and
Christian Janson
2021 IEEE Symposium on Security and Privacy (SP)
BUFFing signature schemes beyond unforgeability
and the case of post-quantum signatures
Cas Cremers∗, Samed Düzlü†, Rune Fiedler‡, Marc Fischlin‡, and Christian Janson‡
∗CISPA Helmholtz Center for Information Security, Germany
‡Cryptoplexity, Technische Universität Darmstadt, Germany
†QPC, Technische Universität Darmstadt, Germany
3
9
0
0
0
.
1
2
0
2
.
1
0
0
0
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
1
2
0
2
©
0
0
.
1
3
$
/
1
2
/
5
-
4
3
9
8
-
1
8
2
7
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
1
2
0
2
Abstract—Modern digital signature schemes can provide more
guarantees than the standard notion of (strong) unforgeability,
such as offering security even in the presence of maliciously
generated keys, or requiring to know a message to produce
a signature for it. The use of signature schemes that lack
these properties has previously enabled attacks on real-world
protocols. In this work we revisit several of these notions beyond
unforgeability, establish relations among them, provide the ﬁrst
formal deﬁnition of non re-signability, and a transformation that
can provide these properties for a given signature scheme in a
provable and efﬁcient way.
Our results are not only relevant for established schemes:
for example, the ongoing NIST PQC competition towards stan-
dardizing post-quantum signature schemes has six ﬁnalists in its
third round. We perform an in-depth analysis of the candidates
with respect to their security properties beyond unforgeability.
We show that many of them do not yet offer these stronger
guarantees, which implies that the security guarantees of these
post-quantum schemes are not strictly stronger than, but instead
incomparable to, classical signature schemes. We sho...

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