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

Output:
安全论文分析：

title:Reverse-Engineering a Cryptographic RFID Tag
author:Karsten Nohl and
David Evans and
Starbug and
Henryk Pl"otz
Reverse-Engineering a Cryptographic RFID Tag
Karsten Nohl and David Evans
University of Virginia
Department of Computer Science
{nohl,evans}@cs.virginia.edu
Starbug and Henryk Pl¨otz
Chaos Computer Club
Berlin
starbug@ccc.de, henryk@ploetzli.ch
Abstract
The security of embedded devices often relies on the secrecy of proprietary cryptographic algorithms. These
algorithms and their weaknesses are frequently disclosed through reverse-engineering software, but it is
commonly thought to be too expensive to reconstruct designs from a hardware implementation alone. This
paper challenges that belief by presenting an approach to reverse-engineering a cipher from a silicon imple-
mentation. Using this mostly automated approach, we reveal a cipher from an RFID tag that is not known
to have a software or micro-code implementation. We reconstruct the cipher from the widely used Mifare
Classic RFID tag by using a combination of image analysis of circuits and protocol analysis. Our analysis re-
veals that the security of the tag is even below the level that its 48-bit key length suggests due to a number of
design ﬂaws. Weak random numbers and a weakness in the authentication protocol allow for pre-computed
rainbow tables to be used to ﬁnd any key in a matter of seconds. Our approach of deducing functional-
ity from circuit images is mostly automated, hence it is also feasible for large chips. The assumption that
algorithms can be kept secret should therefore to be avoided for any type of silicon chip.
Il faut qu’il n’exige pas le secret, et qu’il puisse sans inconv´enient tomber entre les mains de l’ennemi.
([A cipher] must not depend on secrecy, and it must not matter if it falls into enemy hands.)
August Kerckhoffs, La Cryptographie Militaire, January 1883 [13]
1
Introduction
It has long been recognized that security-through-obscur-
ity does not work. However...


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

Input:
title:Reverse-Engineering a Cryptographic RFID Tag
author:Karsten Nohl and
David Evans and
Starbug and
Henryk Pl"otz
Reverse-Engineering a Cryptographic RFID Tag
Karsten Nohl and David Evans
University of Virginia
Department of Computer Science
{nohl,evans}@cs.virginia.edu
Starbug and Henryk Pl¨otz
Chaos Computer Club
Berlin
starbug@ccc.de, henryk@ploetzli.ch
Abstract
The security of embedded devices often relies on the secrecy of proprietary cryptographic algorithms. These
algorithms and their weaknesses are frequently disclosed through reverse-engineering software, but it is
commonly thought to be too expensive to reconstruct designs from a hardware implementation alone. This
paper challenges that belief by presenting an approach to reverse-engineering a cipher from a silicon imple-
mentation. Using this mostly automated approach, we reveal a cipher from an RFID tag that is not known
to have a software or micro-code implementation. We reconstruct the cipher from the widely used Mifare
Classic RFID tag by using a combination of image analysis of circuits and protocol analysis. Our analysis re-
veals that the security of the tag is even below the level that its 48-bit key length suggests due to a number of
design ﬂaws. Weak random numbers and a weakness in the authentication protocol allow for pre-computed
rainbow tables to be used to ﬁnd any key in a matter of seconds. Our approach of deducing functional-
ity from circuit images is mostly automated, hence it is also feasible for large chips. The assumption that
algorithms can be kept secret should therefore to be avoided for any type of silicon chip.
Il faut qu’il n’exige pas le secret, et qu’il puisse sans inconv´enient tomber entre les mains de l’ennemi.
([A cipher] must not depend on secrecy, and it must not matter if it falls into enemy hands.)
August Kerckhoffs, La Cryptographie Militaire, January 1883 [13]
1
Introduction
It has long been recognized that security-through-obscur-
ity does not work. However...

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


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

Output:
安全论文分析：

title:CFI CaRE: Hardware-Supported Call and Return Enforcement for Commercial
Microcontrollers
author:Thomas Nyman and
Jan-Erik Ekberg and
Lucas Davi and
N. Asokan
CFI CaRE: Hardware-Supported Call
and Return Enforcement for Commercial
Microcontrollers
Thomas Nyman1,2(B), Jan-Erik Ekberg2, Lucas Davi3, and N. Asokan1
1 Aalto University, Espoo, Finland
thomas.nyman@aalto.fi, n.asokan@acm.org
2 Trustonic, Helsinki, Finland
{thomas.nyman,jee}@trustonic.com
3 University of Duisburg-Essen, Duisburg, Germany
lucas.davi@wiwinf.uni-due.de
Abstract. With the increasing scale of deployment of Internet of Things
(IoT), concerns about IoT security have become more urgent. In par-
ticular, memory corruption attacks play a predominant role as they
allow remote compromise of IoT devices. Control-ﬂow integrity (CFI)
is a promising and generic defense technique against these attacks. How-
ever, given the nature of IoT deployments, existing protection mecha-
nisms for traditional computing environments (including CFI) need to
be adapted to the IoT setting. In this paper, we describe the challenges
of enabling CFI on microcontroller (MCU) based IoT devices. We then
present CaRE, the ﬁrst interrupt-aware CFI scheme for low-end MCUs.
CaRE uses a novel way of protecting the CFI metadata by leveraging
TrustZone-M security extensions introduced in the ARMv8-M architec-
ture. Its binary instrumentation approach preserves the memory layout
of the target MCU software, allowing pre-built bare-metal binary code to
be protected by CaRE. We describe our implementation on a Cortex-M
Prototyping System and demonstrate that CaRE is secure while impos-
ing acceptable performance and memory impact.
1 Introduction
Cyber-Physical Systems (CPS) are becoming pervasive across many applica-
tion areas ranging from industrial applications (manufacturing), transport, and
smart cities to consumer products. Internet of Things (IoT) refers to systems
incorporating such devices with (typically always-on) communic...


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

Input:
title:CFI CaRE: Hardware-Supported Call and Return Enforcement for Commercial
Microcontrollers
author:Thomas Nyman and
Jan-Erik Ekberg and
Lucas Davi and
N. Asokan
CFI CaRE: Hardware-Supported Call
and Return Enforcement for Commercial
Microcontrollers
Thomas Nyman1,2(B), Jan-Erik Ekberg2, Lucas Davi3, and N. Asokan1
1 Aalto University, Espoo, Finland
thomas.nyman@aalto.fi, n.asokan@acm.org
2 Trustonic, Helsinki, Finland
{thomas.nyman,jee}@trustonic.com
3 University of Duisburg-Essen, Duisburg, Germany
lucas.davi@wiwinf.uni-due.de
Abstract. With the increasing scale of deployment of Internet of Things
(IoT), concerns about IoT security have become more urgent. In par-
ticular, memory corruption attacks play a predominant role as they
allow remote compromise of IoT devices. Control-ﬂow integrity (CFI)
is a promising and generic defense technique against these attacks. How-
ever, given the nature of IoT deployments, existing protection mecha-
nisms for traditional computing environments (including CFI) need to
be adapted to the IoT setting. In this paper, we describe the challenges
of enabling CFI on microcontroller (MCU) based IoT devices. We then
present CaRE, the ﬁrst interrupt-aware CFI scheme for low-end MCUs.
CaRE uses a novel way of protecting the CFI metadata by leveraging
TrustZone-M security extensions introduced in the ARMv8-M architec-
ture. Its binary instrumentation approach preserves the memory layout
of the target MCU software, allowing pre-built bare-metal binary code to
be protected by CaRE. We describe our implementation on a Cortex-M
Prototyping System and demonstrate that CaRE is secure while impos-
ing acceptable performance and memory impact.
1 Introduction
Cyber-Physical Systems (CPS) are becoming pervasive across many applica-
tion areas ranging from industrial applications (manufacturing), transport, and
smart cities to consumer products. Internet of Things (IoT) refers to systems
incorporating such devices with (typically always-on) communic...

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


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

Output:
安全论文分析：

title:Cryptographic primitives for building secure and privacy respecting
protocols
author:Jan Camenisch
Cryptographic Primitives for Building Secure and Privacy
Respecting Protocols
Keynote – 2010 ACM SIGSAC Outstanding Innovation Award
Jan Camenisch
IBM Research – Zurich
jca@zurich.ibm.com
ABSTRACT
Using the Internet and other electronic media for our daily
tasks has become common. Thereby a lot of sensitive infor-
mation is exchanged, processed, and stored at many diﬀer-
ent places. Once released, controlling the dispersal of this
information is virtually impossible. Worse, the press reports
daily on incidents where sensitive information has been lost,
stolen, or misused - often involving large and reputable orga-
nizations. Privacy-enhancing technologies can help to min-
imize the amount of information that needs to be revealed
in transactions, on the one hand, and to limit the disper-
sal, on the other hand. Many of these technologies build on
common cryptographic primitives that allow for data to be
authenticated and encrypted in such a way that it is possi-
ble to eﬃciently prove possession and/or properties of data
revealing the data or side-information about it. Proving
such statements is of course possible for any signature and
encryption scheme. However, if the result is to be practi-
cal, special cryptographic primitives and proof protocols are
needed.
In this talk we will ﬁrst consider a few example scenarios
and motivate the need for such cryptograph building block
before we then present and discuss these. We start with
eﬃcient discrete logarithms based proof protocols often re-
ferred to as generalized Schnorr proofs. They allow one to
prove knowledge of diﬀerent discrete logarithms (exponents)
and relations among them. Now, to be able to prove posses-
sion of a (valid) signature and a message with generalized
Schnorr proofs, it is necessary that the signature and the
message signed are exponents and that no hash-function is
used in the signature veri...


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

Input:
title:Cryptographic primitives for building secure and privacy respecting
protocols
author:Jan Camenisch
Cryptographic Primitives for Building Secure and Privacy
Respecting Protocols
Keynote – 2010 ACM SIGSAC Outstanding Innovation Award
Jan Camenisch
IBM Research – Zurich
jca@zurich.ibm.com
ABSTRACT
Using the Internet and other electronic media for our daily
tasks has become common. Thereby a lot of sensitive infor-
mation is exchanged, processed, and stored at many diﬀer-
ent places. Once released, controlling the dispersal of this
information is virtually impossible. Worse, the press reports
daily on incidents where sensitive information has been lost,
stolen, or misused - often involving large and reputable orga-
nizations. Privacy-enhancing technologies can help to min-
imize the amount of information that needs to be revealed
in transactions, on the one hand, and to limit the disper-
sal, on the other hand. Many of these technologies build on
common cryptographic primitives that allow for data to be
authenticated and encrypted in such a way that it is possi-
ble to eﬃciently prove possession and/or properties of data
revealing the data or side-information about it. Proving
such statements is of course possible for any signature and
encryption scheme. However, if the result is to be practi-
cal, special cryptographic primitives and proof protocols are
needed.
In this talk we will ﬁrst consider a few example scenarios
and motivate the need for such cryptograph building block
before we then present and discuss these. We start with
eﬃcient discrete logarithms based proof protocols often re-
ferred to as generalized Schnorr proofs. They allow one to
prove knowledge of diﬀerent discrete logarithms (exponents)
and relations among them. Now, to be able to prove posses-
sion of a (valid) signature and a message with generalized
Schnorr proofs, it is necessary that the signature and the
message signed are exponents and that no hash-function is
used in the signature veri...

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


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

Output:
安全论文分析：

title:Twin signatures: an alternative to the hash-and-sign paradigm
author:David Naccache and
David Pointcheval and
Jacques Stern
Twin Signatures: an Alternative
to the Hash-and-Sign Paradigm
David Naccache
Gemplus Card International
34, rue Guynemer
92447 Issy-les-Moulineaux, France
david.naccache@gemplus.com
David Pointcheval
Jacques Stern
´Ecole Normale Sup´erieure
45, rue d’Ulm
75230 Paris cedex 05, France
{david.pointcheval,jacques.stern}@ens.fr
ABSTRACT
This paper introduces a simple alternative to the hash-and-
sign paradigm, from the security point of view but for sign-
ing short messages, called twinning. A twin signature is
obtained by signing twice a short message by a signature
scheme. Analysis of the concept in diﬀerent settings yields
the following results:
• We prove that no generic algorithm can eﬃciently forge
a twin DSA signature. Although generic algorithms
oﬀer a less stringent form of security than computa-
tional reductions in the standard model, such success-
ful proofs still produce positive evidence in favor of the
correctness of the new paradigm.
• We prove in standard model an equivalence between
the hardness of producing existential forgeries (even
under adaptively chosen message attacks) of a twin
version of a signature scheme proposed by Gennaro,
Halevi and Rabin and the Flexible RSA Problem.
We consequently regard twinning as an interesting alter-
native to hash functions for eradicating existential forgery
in signature schemes.
Keywords
Digital Signatures, Provable Security, Discrete Logarithm,
Generic Model, Flexible RSA Problem, Standard Model.
1.
INTRODUCTION
The well-known hash and sign paradigm has two distinct
goals:
increasing performance by reducing the size of the
signed message and improving security by preventing exis-
tential forgeries. As a corollary, hashing remains mandatory
even for short messages.
From the conceptual standpoint, the use of hash functions
comes at the cost of extra assumptions such as the conjec-
ture ...


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

Input:
title:Twin signatures: an alternative to the hash-and-sign paradigm
author:David Naccache and
David Pointcheval and
Jacques Stern
Twin Signatures: an Alternative
to the Hash-and-Sign Paradigm
David Naccache
Gemplus Card International
34, rue Guynemer
92447 Issy-les-Moulineaux, France
david.naccache@gemplus.com
David Pointcheval
Jacques Stern
´Ecole Normale Sup´erieure
45, rue d’Ulm
75230 Paris cedex 05, France
{david.pointcheval,jacques.stern}@ens.fr
ABSTRACT
This paper introduces a simple alternative to the hash-and-
sign paradigm, from the security point of view but for sign-
ing short messages, called twinning. A twin signature is
obtained by signing twice a short message by a signature
scheme. Analysis of the concept in diﬀerent settings yields
the following results:
• We prove that no generic algorithm can eﬃciently forge
a twin DSA signature. Although generic algorithms
oﬀer a less stringent form of security than computa-
tional reductions in the standard model, such success-
ful proofs still produce positive evidence in favor of the
correctness of the new paradigm.
• We prove in standard model an equivalence between
the hardness of producing existential forgeries (even
under adaptively chosen message attacks) of a twin
version of a signature scheme proposed by Gennaro,
Halevi and Rabin and the Flexible RSA Problem.
We consequently regard twinning as an interesting alter-
native to hash functions for eradicating existential forgery
in signature schemes.
Keywords
Digital Signatures, Provable Security, Discrete Logarithm,
Generic Model, Flexible RSA Problem, Standard Model.
1.
INTRODUCTION
The well-known hash and sign paradigm has two distinct
goals:
increasing performance by reducing the size of the
signed message and improving security by preventing exis-
tential forgeries. As a corollary, hashing remains mandatory
even for short messages.
From the conceptual standpoint, the use of hash functions
comes at the cost of extra assumptions such as the conjec-
ture ...

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


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

Output:
安全论文分析：

title:PacketShader: a GPU-accelerated software router
author:Sangjin Han and
Keon Jang and
KyoungSoo Park and
Sue B. Moon
PacketShader: A GPU-Accelerated Software Router
Sangjin Han†
Keon Jang†
KyoungSoo Park‡
Sue Moon†
†Department of Computer Science, KAIST, Korea
{sangjin, keonjang}@an.kaist.ac.kr, sbmoon@kaist.edu
‡Department of Electrical Engineering, KAIST, Korea
kyoungsoo@ee.kaist.ac.kr
ABSTRACT
We present PacketShader, a high-performance software router frame-
work for general packet processing with Graphics Processing Unit
(GPU) acceleration. PacketShader exploits the massively-parallel
processing power of GPU to address the CPU bottleneck in current
software routers. Combined with our high-performance packet I/O
engine, PacketShader outperforms existing software routers by more
than a factor of four, forwarding 64B IPv4 packets at 39 Gbps on
a single commodity PC. We have implemented IPv4 and IPv6 for-
warding, OpenFlow switching, and IPsec tunneling to demonstrate
the ﬂexibility and performance advantage of PacketShader. The eval-
uation results show that GPU brings signiﬁcantly higher throughput
over the CPU-only implementation, conﬁrming the effectiveness of
GPU for computation and memory-intensive operations in packet
processing.
Categories and Subject Descriptors
C.2.1 [Network Architecture and Design]: Network communica-
tions; C.2.6 [Internetworking]: Routers
General Terms
Design, experimentation, performance
Keywords
Software router, CUDA, GPU
1.
INTRODUCTION
PC-based software routers provide a cost-effective packet process-
ing platform with easy extensibility and programmability. Familiar
programming environments on general-purpose operating systems
allow ﬂexible composition of router applications that meet today’s
complex trafﬁc engineering demand. Adding to that, modern inno-
vation in commodity hardware continues to drive down the cost per
performance, realizing off-the-shelf programmable routers.
While programmability and low cost are the two ...


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

Input:
title:PacketShader: a GPU-accelerated software router
author:Sangjin Han and
Keon Jang and
KyoungSoo Park and
Sue B. Moon
PacketShader: A GPU-Accelerated Software Router
Sangjin Han†
Keon Jang†
KyoungSoo Park‡
Sue Moon†
†Department of Computer Science, KAIST, Korea
{sangjin, keonjang}@an.kaist.ac.kr, sbmoon@kaist.edu
‡Department of Electrical Engineering, KAIST, Korea
kyoungsoo@ee.kaist.ac.kr
ABSTRACT
We present PacketShader, a high-performance software router frame-
work for general packet processing with Graphics Processing Unit
(GPU) acceleration. PacketShader exploits the massively-parallel
processing power of GPU to address the CPU bottleneck in current
software routers. Combined with our high-performance packet I/O
engine, PacketShader outperforms existing software routers by more
than a factor of four, forwarding 64B IPv4 packets at 39 Gbps on
a single commodity PC. We have implemented IPv4 and IPv6 for-
warding, OpenFlow switching, and IPsec tunneling to demonstrate
the ﬂexibility and performance advantage of PacketShader. The eval-
uation results show that GPU brings signiﬁcantly higher throughput
over the CPU-only implementation, conﬁrming the effectiveness of
GPU for computation and memory-intensive operations in packet
processing.
Categories and Subject Descriptors
C.2.1 [Network Architecture and Design]: Network communica-
tions; C.2.6 [Internetworking]: Routers
General Terms
Design, experimentation, performance
Keywords
Software router, CUDA, GPU
1.
INTRODUCTION
PC-based software routers provide a cost-effective packet process-
ing platform with easy extensibility and programmability. Familiar
programming environments on general-purpose operating systems
allow ﬂexible composition of router applications that meet today’s
complex trafﬁc engineering demand. Adding to that, modern inno-
vation in commodity hardware continues to drive down the cost per
performance, realizing off-the-shelf programmable routers.
While programmability and low cost are the two ...

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


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

Output:
安全论文分析：

title:A Comprehensive Quality Evaluation of Security and Privacy Advice
on the Web
author:Elissa M. Redmiles and
Noel Warford and
Amritha Jayanti and
Aravind Koneru and
Sean Kross and
Miraida Morales and
Rock Stevens and
Michelle L. Mazurek
A Comprehensive Quality Evaluation of
Security and Privacy Advice on the Web
Elissa M. Redmiles, Noel Warford, Amritha Jayanti, and Aravind Koneru,
University of Maryland; Sean Kross, University of California, San Diego;
Miraida Morales, Rutgers University; Rock Stevens and Michelle L. Mazurek,
University of Maryland
https://www.usenix.org/conference/usenixsecurity20/presentation/redmiles
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.A Comprehensive Quality Evaluation
of Security and Privacy Advice on the Web
Elissa M. Redmiles1, Noel Warford1, Amritha Jayanti1, Aravind Koneru1,
Sean Kross2, Miraida Morales3, Rock Stevens1, Michelle L. Mazurek1
1University of Maryland
2University of California San Diego
3Rutgers University
Abstract
End users learn defensive security behaviors from a variety of
channels, including a plethora of security advice given in on-
line articles. A great deal of eﬀort is devoted to getting users to
follow this advice. Surprisingly then, little is known about the
quality of this advice: Is it comprehensible? Is it actionable?
Is it eﬀective? To answer these questions, we ﬁrst conduct a
large-scale, user-driven measurement study to identify 374
unique recommended behaviors contained within 1,264 doc-
uments of online security and privacy advice. Second, we
develop and validate measurement approaches for evaluating
the quality – comprehensibility, perceived actionability, and
perceived eﬃcacy – of security advice. Third, we deploy these
measurement approaches to evaluate the 374 unique pieces
of security advice in a user-study with 1,586 users an...


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

Input:
title:A Comprehensive Quality Evaluation of Security and Privacy Advice
on the Web
author:Elissa M. Redmiles and
Noel Warford and
Amritha Jayanti and
Aravind Koneru and
Sean Kross and
Miraida Morales and
Rock Stevens and
Michelle L. Mazurek
A Comprehensive Quality Evaluation of
Security and Privacy Advice on the Web
Elissa M. Redmiles, Noel Warford, Amritha Jayanti, and Aravind Koneru,
University of Maryland; Sean Kross, University of California, San Diego;
Miraida Morales, Rutgers University; Rock Stevens and Michelle L. Mazurek,
University of Maryland
https://www.usenix.org/conference/usenixsecurity20/presentation/redmiles
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.A Comprehensive Quality Evaluation
of Security and Privacy Advice on the Web
Elissa M. Redmiles1, Noel Warford1, Amritha Jayanti1, Aravind Koneru1,
Sean Kross2, Miraida Morales3, Rock Stevens1, Michelle L. Mazurek1
1University of Maryland
2University of California San Diego
3Rutgers University
Abstract
End users learn defensive security behaviors from a variety of
channels, including a plethora of security advice given in on-
line articles. A great deal of eﬀort is devoted to getting users to
follow this advice. Surprisingly then, little is known about the
quality of this advice: Is it comprehensible? Is it actionable?
Is it eﬀective? To answer these questions, we ﬁrst conduct a
large-scale, user-driven measurement study to identify 374
unique recommended behaviors contained within 1,264 doc-
uments of online security and privacy advice. Second, we
develop and validate measurement approaches for evaluating
the quality – comprehensibility, perceived actionability, and
perceived eﬃcacy – of security advice. Third, we deploy these
measurement approaches to evaluate the 374 unique pieces
of security advice in a user-study with 1,586 users an...

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


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

Output:
安全论文分析：

title:Perspectives on network calculus: no free lunch, but still good value
author:Florin Ciucu and
Jens B. Schmitt
Perspectives on Network Calculus –
No Free Lunch, but Still Good Value
Florin Ciucu
T-Labs / TU Berlin
Jens Schmitt
University of Kaiserslautern
ABSTRACT
ACM Sigcomm 2006 published a paper [26] which was per-
ceived to unify the deterministic and stochastic branches
of the network calculus (abbreviated throughout as DNC
and SNC) [39]. Unfortunately, this seemingly fundamental
uniﬁcation—which has raised the hope of a straightforward
transfer of all results from DNC to SNC—is invalid. To
substantiate this claim, we demonstrate that for the class of
stationary and ergodic processes, which is prevalent in traﬃc
modelling, the probabilistic arrival model from [26] is quasi-
deterministic,
i.e., the underlying probabilities are either
zero or one. Thus, the probabilistic framework from [26] is
unable to account for statistical multiplexing gain, which is
in fact the raison d’ˆetre of packet-switched networks. Other
previous formulations of SNC can capture statistical multi-
plexing gain, yet require additional assumptions [12, 22] or
are more involved [14, 9, 28], and do not allow for a straight-
forward transfer of results from DNC. So, in essence, there
is no free lunch in this endeavor.
Our intention in this paper is to go beyond presenting a
negative result by providing a comprehensive perspective on
network calculus. To that end, we attempt to illustrate the
fundamental concepts and features of network calculus in a
systematic way, and also to rigorously clarify some key facts
as well as misconceptions. We touch in particular on the re-
lationship between linear systems, classical queueing theory,
and network calculus, and on the lingering issue of tight-
ness of network calculus bounds. We give a rigorous result
illustrating that the statistical multiplexing gain scales as
Ω(√N ), as long as some small violations of system perfor-
mance constraints ar...


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

Input:
title:Perspectives on network calculus: no free lunch, but still good value
author:Florin Ciucu and
Jens B. Schmitt
Perspectives on Network Calculus –
No Free Lunch, but Still Good Value
Florin Ciucu
T-Labs / TU Berlin
Jens Schmitt
University of Kaiserslautern
ABSTRACT
ACM Sigcomm 2006 published a paper [26] which was per-
ceived to unify the deterministic and stochastic branches
of the network calculus (abbreviated throughout as DNC
and SNC) [39]. Unfortunately, this seemingly fundamental
uniﬁcation—which has raised the hope of a straightforward
transfer of all results from DNC to SNC—is invalid. To
substantiate this claim, we demonstrate that for the class of
stationary and ergodic processes, which is prevalent in traﬃc
modelling, the probabilistic arrival model from [26] is quasi-
deterministic,
i.e., the underlying probabilities are either
zero or one. Thus, the probabilistic framework from [26] is
unable to account for statistical multiplexing gain, which is
in fact the raison d’ˆetre of packet-switched networks. Other
previous formulations of SNC can capture statistical multi-
plexing gain, yet require additional assumptions [12, 22] or
are more involved [14, 9, 28], and do not allow for a straight-
forward transfer of results from DNC. So, in essence, there
is no free lunch in this endeavor.
Our intention in this paper is to go beyond presenting a
negative result by providing a comprehensive perspective on
network calculus. To that end, we attempt to illustrate the
fundamental concepts and features of network calculus in a
systematic way, and also to rigorously clarify some key facts
as well as misconceptions. We touch in particular on the re-
lationship between linear systems, classical queueing theory,
and network calculus, and on the lingering issue of tight-
ness of network calculus bounds. We give a rigorous result
illustrating that the statistical multiplexing gain scales as
Ω(√N ), as long as some small violations of system perfor-
mance constraints ar...

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


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

Output:
安全论文分析：

title:HexType: Efficient Detection of Type Confusion Errors for C++
author:Yuseok Jeon and
Priyam Biswas and
Scott A. Carr and
Byoungyoung Lee and
Mathias Payer
764
valve  made  of  closely  knitted  teflon  stiffened  with
polyurethane.  The  prosthesis  is  fashioned  in  the
operating-theatre from a standard crimped woven teflon
tube; it is sutured to the base of the aortic cusps and to
the aortic wall once the diseased valve has been excised.
The advantage of this type of prosthesis is that it can be
adapted to the type of cusp deformity found, the artificial
cusps replacing the shrivelled cusps of valves which have
been freely  regurgitant.  7 patients  with stenosis  and
regurgitation  have  undergone  this  operation,  and  in
each the absence of an aortic  diastolic  murmur post-
operatively  indicated  relief  of incompetence  by  the
prosthesis.  3 patients died in the first twenty-four hours
from causes other than failure of the valve.  KAY et al.12
use two types of artificial valve for the relief of aortic-
valvular  disease.  In  patients  with  regurgitation  in
whom part of the valvular tissue is  preserved, plastic
prostheses consisting of three leaflets  of the same size
and shape are fashioned in the theatre to the individual
requirements and then sutured in position.  When the
patient’s valve has to be completely excised (as often in
severe  calcific  stenosis),  the  three  leaflets  have  to  be
deeper and are then buttressed with teflon felt.  This
procedure  has  been  used  in  28  patients  with  aortic
regurgitation and in 8 with calcific stenosis; 4 in the first
group died, and 3 in the second. Careful follow-up has
shown  effective  function  of  the  prosthetic  valves.
HARKEN et a1.13 have employed a caged ball-valve in the
treatment of 6 patients with aortic-valve disease.  4 died,
but in the other 2 the valve was functioning satisfactorily
several months after the operation.
Although these reports  are promising, much clearly
remains ...


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

Input:
title:HexType: Efficient Detection of Type Confusion Errors for C++
author:Yuseok Jeon and
Priyam Biswas and
Scott A. Carr and
Byoungyoung Lee and
Mathias Payer
764
valve  made  of  closely  knitted  teflon  stiffened  with
polyurethane.  The  prosthesis  is  fashioned  in  the
operating-theatre from a standard crimped woven teflon
tube; it is sutured to the base of the aortic cusps and to
the aortic wall once the diseased valve has been excised.
The advantage of this type of prosthesis is that it can be
adapted to the type of cusp deformity found, the artificial
cusps replacing the shrivelled cusps of valves which have
been freely  regurgitant.  7 patients  with stenosis  and
regurgitation  have  undergone  this  operation,  and  in
each the absence of an aortic  diastolic  murmur post-
operatively  indicated  relief  of incompetence  by  the
prosthesis.  3 patients died in the first twenty-four hours
from causes other than failure of the valve.  KAY et al.12
use two types of artificial valve for the relief of aortic-
valvular  disease.  In  patients  with  regurgitation  in
whom part of the valvular tissue is  preserved, plastic
prostheses consisting of three leaflets  of the same size
and shape are fashioned in the theatre to the individual
requirements and then sutured in position.  When the
patient’s valve has to be completely excised (as often in
severe  calcific  stenosis),  the  three  leaflets  have  to  be
deeper and are then buttressed with teflon felt.  This
procedure  has  been  used  in  28  patients  with  aortic
regurgitation and in 8 with calcific stenosis; 4 in the first
group died, and 3 in the second. Careful follow-up has
shown  effective  function  of  the  prosthetic  valves.
HARKEN et a1.13 have employed a caged ball-valve in the
treatment of 6 patients with aortic-valve disease.  4 died,
but in the other 2 the valve was functioning satisfactorily
several months after the operation.
Although these reports  are promising, much clearly
remains ...

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


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

Output:
安全论文分析：

title:Redactable Blockchain in the Permissionless Setting
author:Dominic Deuber and
Bernardo Magri and
Sri Aravinda Krishnan Thyagarajan
(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)
Redactable Blockchain in the Permissionless Setting
∗
†
, Bernardo Magri
∗
and Sri Aravinda Krishnan Thyagarajan
Friedrich-Alexander University Erlangen-N¨urnberg, Germany
E-mail: {deuber, thyagarajan}@cs.fau.de
Dominic Deuber
∗
†
Aarhus University, Denmark
E-mail: magri@cs.au.dk
Abstract—Bitcoin is an immutable permissionless blockchain
system that has been extensively used as a public bulletin
board by many different applications that heavily relies on its
immutability. However, Bitcoin’s immutability is not without its
fair share of demerits. Interpol exposed the existence of harmful
and potentially illegal documents, images and links in the Bitcoin
blockchain, and since then there have been several qualitative
and quantitative analysis on the types of data currently residing
in the Bitcoin blockchain. Although there is a lot of attention
on blockchains, surprisingly the previous solutions proposed for
data redaction in the permissionless setting are far from feasible,
and require additional trust assumptions. Hence, the problem of
harmful data still poses a huge challenge for law enforcement
agencies like Interpol (Tziakouris, IEEE S&P’18).
We propose the ﬁrst efﬁcient redactable blockchain for the
permissionless setting that
is easily integrable into Bitcoin,
and that does not rely on heavy cryptographic tools or trust
assumptions. Our protocol uses a consensus-based voting and
is parameterised by a policy that dictates the requirements and
constraints for the redactions; if a redaction gathers...


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

Input:
title:Redactable Blockchain in the Permissionless Setting
author:Dominic Deuber and
Bernardo Magri and
Sri Aravinda Krishnan Thyagarajan
(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)
Redactable Blockchain in the Permissionless Setting
∗
†
, Bernardo Magri
∗
and Sri Aravinda Krishnan Thyagarajan
Friedrich-Alexander University Erlangen-N¨urnberg, Germany
E-mail: {deuber, thyagarajan}@cs.fau.de
Dominic Deuber
∗
†
Aarhus University, Denmark
E-mail: magri@cs.au.dk
Abstract—Bitcoin is an immutable permissionless blockchain
system that has been extensively used as a public bulletin
board by many different applications that heavily relies on its
immutability. However, Bitcoin’s immutability is not without its
fair share of demerits. Interpol exposed the existence of harmful
and potentially illegal documents, images and links in the Bitcoin
blockchain, and since then there have been several qualitative
and quantitative analysis on the types of data currently residing
in the Bitcoin blockchain. Although there is a lot of attention
on blockchains, surprisingly the previous solutions proposed for
data redaction in the permissionless setting are far from feasible,
and require additional trust assumptions. Hence, the problem of
harmful data still poses a huge challenge for law enforcement
agencies like Interpol (Tziakouris, IEEE S&P’18).
We propose the ﬁrst efﬁcient redactable blockchain for the
permissionless setting that
is easily integrable into Bitcoin,
and that does not rely on heavy cryptographic tools or trust
assumptions. Our protocol uses a consensus-based voting and
is parameterised by a policy that dictates the requirements and
constraints for the redactions; if a redaction gathers...

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


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

Output:
安全论文分析：

title:Secure In-Band Wireless Pairing
author:Shyamnath Gollakota and
Nabeel Ahmed and
Nickolai Zeldovich and
Dina Katabi
Secure In-Band Wireless Pairing
Shyamnath Gollakota, Nabeel Ahmed, Nickolai Zeldovich, and Dina Katabi
Massachusetts Institute of Technology
ABSTRACT
This paper presents the ﬁrst wireless pairing protocol
that works in-band, with no pre-shared keys, and protects
against MITM attacks. The main innovation is a new key
exchange message constructed in a manner that ensures
an adversary can neither hide the fact that a message was
transmitted, nor alter its payload without being detected.
Thus, any attempt by an adversary to interfere with the
key exchange translates into the pairing devices detect-
ing either invalid pairing messages or an unacceptable
increase in the number of such messages. We analytically
prove that our design is secure against MITM attacks,
and show that our protocol is practical by implementing a
prototype using off-the-shelf 802.11 cards. An evaluation
of our protocol on two busy wireless networks (MIT’s
campus network and a reproduction of the SIGCOMM
2010 network using traces) shows that it can effectively
implement key exchange in a real-world environment.
1
INTRODUCTION
Recent trends in the security of home WiFi networks are
driven by two phenomena: ordinary users often strug-
gle with the security setup of their home networks [14],
and, as a result, some of them end up skipping security
activation [19, 26]. Simultaneously, there is a prolifera-
tion of WiFi gadgets and sensors that do not support an
interface for entering a key. These include WiFi sound
systems, medical sensors, USB keys, light and tempera-
ture sensors, motion detectors and surveillance sensors,
home appliances, and game consoles. Even new models
of these devices are unlikely to support a keypad because
of limitations on their form factor, style, cost, or func-
tionality. Responding to these two requirements—easing
security setup for home users, and securi...


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

Input:
title:Secure In-Band Wireless Pairing
author:Shyamnath Gollakota and
Nabeel Ahmed and
Nickolai Zeldovich and
Dina Katabi
Secure In-Band Wireless Pairing
Shyamnath Gollakota, Nabeel Ahmed, Nickolai Zeldovich, and Dina Katabi
Massachusetts Institute of Technology
ABSTRACT
This paper presents the ﬁrst wireless pairing protocol
that works in-band, with no pre-shared keys, and protects
against MITM attacks. The main innovation is a new key
exchange message constructed in a manner that ensures
an adversary can neither hide the fact that a message was
transmitted, nor alter its payload without being detected.
Thus, any attempt by an adversary to interfere with the
key exchange translates into the pairing devices detect-
ing either invalid pairing messages or an unacceptable
increase in the number of such messages. We analytically
prove that our design is secure against MITM attacks,
and show that our protocol is practical by implementing a
prototype using off-the-shelf 802.11 cards. An evaluation
of our protocol on two busy wireless networks (MIT’s
campus network and a reproduction of the SIGCOMM
2010 network using traces) shows that it can effectively
implement key exchange in a real-world environment.
1
INTRODUCTION
Recent trends in the security of home WiFi networks are
driven by two phenomena: ordinary users often strug-
gle with the security setup of their home networks [14],
and, as a result, some of them end up skipping security
activation [19, 26]. Simultaneously, there is a prolifera-
tion of WiFi gadgets and sensors that do not support an
interface for entering a key. These include WiFi sound
systems, medical sensors, USB keys, light and tempera-
ture sensors, motion detectors and surveillance sensors,
home appliances, and game consoles. Even new models
of these devices are unlikely to support a keypad because
of limitations on their form factor, style, cost, or func-
tionality. Responding to these two requirements—easing
security setup for home users, and securi...

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


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

Output:
安全论文分析：

title:Analysing the Performance of Security Solutions to Reduce Vulnerability
Exposure Window
author:Yolanta Beres and
Jonathan Griffin and
Simon Shiu and
Max Heitman and
David Markle and
Peter Ventura
2008 Annual Computer Security Applications Conference
2008 Annual Computer Security Applications Conference
Analysing the Performance of Security Solutions to Reduce Vulnerability
Yolanta Beres, Jonathan Griffin, Simon Shiu
Max Heitman, David Markle, Peter Ventura
yolanta.beres, jonathan.griffin, simon.shiu
max.heitman, david.markle, peter.ventura
Exposure Window
CITI
@citi.com
HP Labs
@hp.com
Abstract
In this paper we present a novel approach of using
mathematical  models  and  stochastic  simulations  to
guide  and  inform  security  investment  and  policy
change  decisions.
investigate
vulnerability  management  policies,  and  explore  how
effective  standard  patch  management  and  emergency
escalation  based  policies  are,  and  how  they  can  be
combined with earlier, pre-patch mitigation measures
to reduce the potential exposure window.
In  particular,  we
The  paper  describes  the  model  we  constructed  to
represent typical vulnerability  management  processes
in  large  organizations,  which captures  the  external
threat environment and the internal security processes
and decision  points.  We  also  present  the  results  from
the  experimental  simulations,  and  show  how  changes
in security solutions and policies, such as speeding up
patch  deployment  and  investing  in  early  mitigation
measures, affect the overall exposure window in terms
of the time it takes to reduce the potential risk.
We believe that this type of mathematical modelling
and  simulation-based  approach  provides  a  novel  and
useful  way  of  considering
investment
decisions, which is quite distinct from traditional risk
analysis.
1. Introduction
security
security  operations
typical
organization  has  a  number  of  security  co...


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

Input:
title:Analysing the Performance of Security Solutions to Reduce Vulnerability
Exposure Window
author:Yolanta Beres and
Jonathan Griffin and
Simon Shiu and
Max Heitman and
David Markle and
Peter Ventura
2008 Annual Computer Security Applications Conference
2008 Annual Computer Security Applications Conference
Analysing the Performance of Security Solutions to Reduce Vulnerability
Yolanta Beres, Jonathan Griffin, Simon Shiu
Max Heitman, David Markle, Peter Ventura
yolanta.beres, jonathan.griffin, simon.shiu
max.heitman, david.markle, peter.ventura
Exposure Window
CITI
@citi.com
HP Labs
@hp.com
Abstract
In this paper we present a novel approach of using
mathematical  models  and  stochastic  simulations  to
guide  and  inform  security  investment  and  policy
change  decisions.
investigate
vulnerability  management  policies,  and  explore  how
effective  standard  patch  management  and  emergency
escalation  based  policies  are,  and  how  they  can  be
combined with earlier, pre-patch mitigation measures
to reduce the potential exposure window.
In  particular,  we
The  paper  describes  the  model  we  constructed  to
represent typical vulnerability  management  processes
in  large  organizations,  which captures  the  external
threat environment and the internal security processes
and decision  points.  We  also  present  the  results  from
the  experimental  simulations,  and  show  how  changes
in security solutions and policies, such as speeding up
patch  deployment  and  investing  in  early  mitigation
measures, affect the overall exposure window in terms
of the time it takes to reduce the potential risk.
We believe that this type of mathematical modelling
and  simulation-based  approach  provides  a  novel  and
useful  way  of  considering
investment
decisions, which is quite distinct from traditional risk
analysis.
1. Introduction
security
security  operations
typical
organization  has  a  number  of  security  co...

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


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

Output:
安全论文分析：

title:Unleashing the Tiger: Inference Attacks on Split Learning
author:Dario Pasquini and
Giuseppe Ateniese and
Massimo Bernaschi
Unleashing the Tiger: Inference Attacks on Split Learning
Dario Pasquini
Sapienza University of Rome
Institute of Applied Computing, CNR
Rome, Italy
Rome, Italy
pasquini@di.uniroma1.it
Giuseppe Ateniese
George Mason University
Fairfax, Virginia, USA
ateniese@gmu.edu
Massimo Bernaschi
Institute of Applied Computing, CNR
Rome, Italy
massimo.bernaschi@cnr.it
ABSTRACT
We investigate the security of split learning—a novel collaborative
machine learning framework that enables peak performance by
requiring minimal resource consumption. In the present paper, we
expose vulnerabilities of the protocol and demonstrate its inherent
insecurity by introducing general attack strategies targeting the
reconstruction of clients’ private training sets. More prominently,
we show that a malicious server can actively hijack the learning
process of the distributed model and bring it into an insecure state
that enables inference attacks on clients’ data. We implement differ-
ent adaptations of the attack and test them on various datasets as
well as within realistic threat scenarios. We demonstrate that our
attack can overcome recently proposed defensive techniques aimed
at enhancing the security of the split learning protocol. Finally, we
also illustrate the protocol’s insecurity against malicious clients by
extending previously devised attacks for Federated Learning.
CCS CONCEPTS
• Security and privacy → Software and application security;
Privacy-preserving protocols; Distributed systems security.
KEYWORDS
Collaborative learning; ML Security; Deep Learning
ACM Reference Format:
Dario Pasquini, Giuseppe Ateniese, and Massimo Bernaschi. 2021. Unleash-
ing the Tiger: Inference Attacks on Split Learning. In Proceedings of the 2021
ACM SIGSAC Conference on Computer and Communications Security (CCS
’21), November 15–19, 2021, Virtual Event, Republic of Korea. ACM, Ne...


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

Input:
title:Unleashing the Tiger: Inference Attacks on Split Learning
author:Dario Pasquini and
Giuseppe Ateniese and
Massimo Bernaschi
Unleashing the Tiger: Inference Attacks on Split Learning
Dario Pasquini
Sapienza University of Rome
Institute of Applied Computing, CNR
Rome, Italy
Rome, Italy
pasquini@di.uniroma1.it
Giuseppe Ateniese
George Mason University
Fairfax, Virginia, USA
ateniese@gmu.edu
Massimo Bernaschi
Institute of Applied Computing, CNR
Rome, Italy
massimo.bernaschi@cnr.it
ABSTRACT
We investigate the security of split learning—a novel collaborative
machine learning framework that enables peak performance by
requiring minimal resource consumption. In the present paper, we
expose vulnerabilities of the protocol and demonstrate its inherent
insecurity by introducing general attack strategies targeting the
reconstruction of clients’ private training sets. More prominently,
we show that a malicious server can actively hijack the learning
process of the distributed model and bring it into an insecure state
that enables inference attacks on clients’ data. We implement differ-
ent adaptations of the attack and test them on various datasets as
well as within realistic threat scenarios. We demonstrate that our
attack can overcome recently proposed defensive techniques aimed
at enhancing the security of the split learning protocol. Finally, we
also illustrate the protocol’s insecurity against malicious clients by
extending previously devised attacks for Federated Learning.
CCS CONCEPTS
• Security and privacy → Software and application security;
Privacy-preserving protocols; Distributed systems security.
KEYWORDS
Collaborative learning; ML Security; Deep Learning
ACM Reference Format:
Dario Pasquini, Giuseppe Ateniese, and Massimo Bernaschi. 2021. Unleash-
ing the Tiger: Inference Attacks on Split Learning. In Proceedings of the 2021
ACM SIGSAC Conference on Computer and Communications Security (CCS
’21), November 15–19, 2021, Virtual Event, Republic of Korea. ACM, Ne...

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


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

Output:
安全论文分析：

title:Poster: Attacking Malware Classifiers by Crafting Gradient-Attacks
that Preserve Functionality
author:Raphael Labaca Castro and
Battista Biggio and
Gabi Dreo Rodosek
Poster: Attacking Malware Classifiers by Crafting
Gradient-Attacks that Preserve Functionality
Raphael Labaca-Castro
Research Institute CODE
Bundeswehr University Munich
Munich, Germany
raphael.labaca@unibw.de
Battista Biggio
Dept. of Electrical and Electronic
Engineering
University of Cagliari
Cagliari, Italy
battista.biggio@unica.it
Gabi Dreo Rodosek
Research Institute CODE
Bundeswehr University Munich
Munich, Germany
gabi.dreo@unibw.de
ABSTRACT
Machine learning has proved to be a promising technology to deter-
mine whether a piece of software is malicious or benign. However,
the accuracy of this approach comes sometimes at the expense of its
robustness and probing these systems against adversarial examples
is not always a priority. In this work, we present a gradient-based
approach that can carefully generate valid executable malicious
files that are classified as benign by state-of-the-art detectors. Initial
results demonstrate that our approach is able to automatically find
optimal adversarial examples in a more efficient way, which can
provide a good support for building more robust models in the
future.
CCS CONCEPTS
• Security and privacy → Malware and its mitigation; Soft-
ware reverse engineering; • Computing methodologies → Neu-
ral networks.
ACM Reference Format:
Raphael Labaca-Castro, Battista Biggio, and Gabi Dreo Rodosek. 2019. Poster:
Attacking Malware Classifiers by Crafting Gradient-Attacks that Preserve
Functionality. In 2019 ACM SIGSAC Conference on Computer and Communi-
cations Security (CCS ’19), November 11–15, 2019, London, United Kingdom.
ACM, New York, NY, USA, 3 pages. https://doi.org/10.1145/3319535.3363257
1 INTRODUCTION
Deep neural networks have been widely implemented for malware
classification [4, 7, 10]. Yet, problems still persist when they are
confronted to advers...


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

Input:
title:Poster: Attacking Malware Classifiers by Crafting Gradient-Attacks
that Preserve Functionality
author:Raphael Labaca Castro and
Battista Biggio and
Gabi Dreo Rodosek
Poster: Attacking Malware Classifiers by Crafting
Gradient-Attacks that Preserve Functionality
Raphael Labaca-Castro
Research Institute CODE
Bundeswehr University Munich
Munich, Germany
raphael.labaca@unibw.de
Battista Biggio
Dept. of Electrical and Electronic
Engineering
University of Cagliari
Cagliari, Italy
battista.biggio@unica.it
Gabi Dreo Rodosek
Research Institute CODE
Bundeswehr University Munich
Munich, Germany
gabi.dreo@unibw.de
ABSTRACT
Machine learning has proved to be a promising technology to deter-
mine whether a piece of software is malicious or benign. However,
the accuracy of this approach comes sometimes at the expense of its
robustness and probing these systems against adversarial examples
is not always a priority. In this work, we present a gradient-based
approach that can carefully generate valid executable malicious
files that are classified as benign by state-of-the-art detectors. Initial
results demonstrate that our approach is able to automatically find
optimal adversarial examples in a more efficient way, which can
provide a good support for building more robust models in the
future.
CCS CONCEPTS
• Security and privacy → Malware and its mitigation; Soft-
ware reverse engineering; • Computing methodologies → Neu-
ral networks.
ACM Reference Format:
Raphael Labaca-Castro, Battista Biggio, and Gabi Dreo Rodosek. 2019. Poster:
Attacking Malware Classifiers by Crafting Gradient-Attacks that Preserve
Functionality. In 2019 ACM SIGSAC Conference on Computer and Communi-
cations Security (CCS ’19), November 11–15, 2019, London, United Kingdom.
ACM, New York, NY, USA, 3 pages. https://doi.org/10.1145/3319535.3363257
1 INTRODUCTION
Deep neural networks have been widely implemented for malware
classification [4, 7, 10]. Yet, problems still persist when they are
confronted to advers...

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


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

Output:
安全论文分析：

title:Connected Colors: Unveiling the Structure of Criminal Networks
author:Yacin Nadji and
Manos Antonakakis and
Roberto Perdisci and
Wenke Lee
Connected Colors:
Unveiling the Structure of Criminal Networks
Yacin Nadji1, Manos Antonakakis2, Roberto Perdisci3, and Wenke Lee1
1 College of Computing, Georgia Institute of Technology
{yacin.nadji, wenke}@cc.gatech.edu
2 Damballa, Inc.
manos@damballa.com
3 Department of Computer Science, University of Georgia
perdisci@cs.uga.edu
Abstract. In this paper we study the structure of criminal networks,
groups of related malicious infrastructures that work in concert to pro-
vide hosting for criminal activities. We develop a method to construct a
graph of relationships between malicious hosts and identify the under-
lying criminal networks, using historic assignments in the DNS. We also
develop methods to analyze these networks to identify general structural
trends and devise strategies for eﬀective remediation through takedowns.
We then apply these graph construction and analysis algorithms to study
the general threat landscape, as well as four cases of sophisticated crimi-
nal networks. Our results indicate that in many cases, criminal networks
can be taken down by de-registering as few as ﬁve domain names, re-
moving critical communication links. In cases of sophisticated criminal
networks, we show that our analysis techniques can identify hosts that
are critical to the network’s functionality and estimate the impact of
performing network takedowns in remediating the threats. In one case,
disabling 20% of a criminal network’s hosts would reduce the overall
volume of successful DNS lookups to the criminal network by as much
as 70%. This measure can be interpreted as an estimate of the decrease
in the number of potential victims reaching the criminal network that
would be caused by such a takedown strategy.
1
Introduction
Many of today’s cyber-security threats make use of globally reachable network
hosts that support cyber-cri...


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

Input:
title:Connected Colors: Unveiling the Structure of Criminal Networks
author:Yacin Nadji and
Manos Antonakakis and
Roberto Perdisci and
Wenke Lee
Connected Colors:
Unveiling the Structure of Criminal Networks
Yacin Nadji1, Manos Antonakakis2, Roberto Perdisci3, and Wenke Lee1
1 College of Computing, Georgia Institute of Technology
{yacin.nadji, wenke}@cc.gatech.edu
2 Damballa, Inc.
manos@damballa.com
3 Department of Computer Science, University of Georgia
perdisci@cs.uga.edu
Abstract. In this paper we study the structure of criminal networks,
groups of related malicious infrastructures that work in concert to pro-
vide hosting for criminal activities. We develop a method to construct a
graph of relationships between malicious hosts and identify the under-
lying criminal networks, using historic assignments in the DNS. We also
develop methods to analyze these networks to identify general structural
trends and devise strategies for eﬀective remediation through takedowns.
We then apply these graph construction and analysis algorithms to study
the general threat landscape, as well as four cases of sophisticated crimi-
nal networks. Our results indicate that in many cases, criminal networks
can be taken down by de-registering as few as ﬁve domain names, re-
moving critical communication links. In cases of sophisticated criminal
networks, we show that our analysis techniques can identify hosts that
are critical to the network’s functionality and estimate the impact of
performing network takedowns in remediating the threats. In one case,
disabling 20% of a criminal network’s hosts would reduce the overall
volume of successful DNS lookups to the criminal network by as much
as 70%. This measure can be interpreted as an estimate of the decrease
in the number of potential victims reaching the criminal network that
would be caused by such a takedown strategy.
1
Introduction
Many of today’s cyber-security threats make use of globally reachable network
hosts that support cyber-cri...

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


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

Output:
安全论文分析：

title:POSTER: Attacks to Federated Learning: Responsive Web User Interface
to Recover Training Data from User Gradients
author:Hans Albert Lianto and
Yang Zhao and
Jun Zhao
POSTER: Attacks to Federated Learning: Responsive Web User
Interface to Recover Training Data from User Gradients
Nanyang Technological University
Nanyang Technological University
Nanyang Technological University
Jun Zhao
Singapore
junzhao@ntu.edu.sg
Hans Albert Lianto∗
Singapore
HANS0032@e.ntu.edu.sg
Yang Zhao∗†
Singapore
S180049@e.ntu.edu.sg
ABSTRACT
Local differential privacy (LDP) is an emerging privacy standard to
protect individual user data. One scenario where LDP can be applied
is federated learning, where each user sends his/her user gradients
to an aggregator who uses these gradients to perform stochastic
gradient descent. In a case where the aggregator is untrusted and
LDP is not applied to each user gradient, the aggregator can recover
sensitive user data from these gradients. In this paper, we present an
interactive web demo showcasing the power of LDP by visualizing
federated learning with LDP. Moreover, the live demo shows how
LDP can prevent untrusted aggregators from recovering sensitive
training data. A measure called the exp-hamming recovery is also
created to show the extent of how much data the aggregator can
recover.
CCS CONCEPTS
• Security and privacy → Distributed systems security; • Com-
puting methodologies → Supervised learning by classification;
Supervised learning by regression.
KEYWORDS
Local differential privacy, Machine learning, Federated learning,
Linear regression, Stochastic gradient decent.
ACM Reference Format:
Hans Albert Lianto, Yang Zhao, and Jun Zhao. 2020. POSTER: Attacks to
Federated Learning: Responsive Web User Interface to Recover Training
Data from User Gradients. In Proceedings of the 15th ACM Asia Conference
on Computer and Communications Security (ASIA CCS ’20), October 5–9, 2020,
Taipei, Taiwan. ACM, New York, NY, USA, 3 pages. https://doi.org/1...


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

Input:
title:POSTER: Attacks to Federated Learning: Responsive Web User Interface
to Recover Training Data from User Gradients
author:Hans Albert Lianto and
Yang Zhao and
Jun Zhao
POSTER: Attacks to Federated Learning: Responsive Web User
Interface to Recover Training Data from User Gradients
Nanyang Technological University
Nanyang Technological University
Nanyang Technological University
Jun Zhao
Singapore
junzhao@ntu.edu.sg
Hans Albert Lianto∗
Singapore
HANS0032@e.ntu.edu.sg
Yang Zhao∗†
Singapore
S180049@e.ntu.edu.sg
ABSTRACT
Local differential privacy (LDP) is an emerging privacy standard to
protect individual user data. One scenario where LDP can be applied
is federated learning, where each user sends his/her user gradients
to an aggregator who uses these gradients to perform stochastic
gradient descent. In a case where the aggregator is untrusted and
LDP is not applied to each user gradient, the aggregator can recover
sensitive user data from these gradients. In this paper, we present an
interactive web demo showcasing the power of LDP by visualizing
federated learning with LDP. Moreover, the live demo shows how
LDP can prevent untrusted aggregators from recovering sensitive
training data. A measure called the exp-hamming recovery is also
created to show the extent of how much data the aggregator can
recover.
CCS CONCEPTS
• Security and privacy → Distributed systems security; • Com-
puting methodologies → Supervised learning by classification;
Supervised learning by regression.
KEYWORDS
Local differential privacy, Machine learning, Federated learning,
Linear regression, Stochastic gradient decent.
ACM Reference Format:
Hans Albert Lianto, Yang Zhao, and Jun Zhao. 2020. POSTER: Attacks to
Federated Learning: Responsive Web User Interface to Recover Training
Data from User Gradients. In Proceedings of the 15th ACM Asia Conference
on Computer and Communications Security (ASIA CCS ’20), October 5–9, 2020,
Taipei, Taiwan. ACM, New York, NY, USA, 3 pages. https://doi.org/1...

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


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

Output:
安全论文分析：

title:Using Throughput-Centric Byzantine Broadcast to Tolerate Malicious
Majority in Blockchains
author:Ruomu Hou and
Haifeng Yu and
Prateek Saxena
7
1
6
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
Using Throughput-Centric Byzantine Broadcast
to Tolerate Malicious Majority in Blockchains
Ruomu Hou
Haifeng Yu
Prateek Saxena
National University of Singapore
National University of Singapore
National University of Singapore
houruomu@comp.nus.edu.sg
haifeng@comp.nus.edu.sg
prateeks@comp.nus.edu.sg
Abstract—Fault tolerance of a blockchain is often character-
ized by the fraction f of “adversarial power” that it can tolerate
in the system. Despite the fast progress in blockchain designs in
recent years, existing blockchain systems can still only tolerate f
below 0.5. Can practically usable blockchains tolerate a malicious
majority, i.e., f above 0.5?
This work presents a positive answer to this question. We ﬁrst
note that the well-known impossibility of byzantine consensus
for f above 0.5 does not carry over to blockchains. To tolerate
f above 0.5, we use byzantine broadcast, instead of byzantine
consensus, as the core of the blockchain. A major obstacle in
doing so, however, is that the resulting blockchain may have
extremely low throughput. To overcome this central technical
challenge, we propose a novel byzantine broadcast protocol
OVERLAYBB, that can tolerate f above 0.5 while achieving
good throughput. Using OVERLAYBB as the core, we present
the design, implementation, and evaluation of a novel Proof-of-
Stake blockchain called BCUBE. BCUBE can tolerate a malicious
majority, while achieving practically usable transaction through-
put and conﬁrmation latency in our experiments with 10000
nodes and under f = 0.7. To our knowledge, BCUBE is the ﬁrst
bloc...


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

Input:
title:Using Throughput-Centric Byzantine Broadcast to Tolerate Malicious
Majority in Blockchains
author:Ruomu Hou and
Haifeng Yu and
Prateek Saxena
7
1
6
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
Using Throughput-Centric Byzantine Broadcast
to Tolerate Malicious Majority in Blockchains
Ruomu Hou
Haifeng Yu
Prateek Saxena
National University of Singapore
National University of Singapore
National University of Singapore
houruomu@comp.nus.edu.sg
haifeng@comp.nus.edu.sg
prateeks@comp.nus.edu.sg
Abstract—Fault tolerance of a blockchain is often character-
ized by the fraction f of “adversarial power” that it can tolerate
in the system. Despite the fast progress in blockchain designs in
recent years, existing blockchain systems can still only tolerate f
below 0.5. Can practically usable blockchains tolerate a malicious
majority, i.e., f above 0.5?
This work presents a positive answer to this question. We ﬁrst
note that the well-known impossibility of byzantine consensus
for f above 0.5 does not carry over to blockchains. To tolerate
f above 0.5, we use byzantine broadcast, instead of byzantine
consensus, as the core of the blockchain. A major obstacle in
doing so, however, is that the resulting blockchain may have
extremely low throughput. To overcome this central technical
challenge, we propose a novel byzantine broadcast protocol
OVERLAYBB, that can tolerate f above 0.5 while achieving
good throughput. Using OVERLAYBB as the core, we present
the design, implementation, and evaluation of a novel Proof-of-
Stake blockchain called BCUBE. BCUBE can tolerate a malicious
majority, while achieving practically usable transaction through-
put and conﬁrmation latency in our experiments with 10000
nodes and under f = 0.7. To our knowledge, BCUBE is the ﬁrst
bloc...

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


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

Output:
安全论文分析：

title:SoK: Towards Grounding Censorship Circumvention in Empiricism
author:Michael Carl Tschantz and
Sadia Afroz and
anonymous and
Vern Paxson
2016 IEEE Symposium on Security and Privacy
2016 IEEE Symposium on Security and Privacy
SoK: Towards Grounding Censorship
Circumvention in Empiricism
Michael Carl Tschantz∗, Sadia Afroz∗, Anonymous‡, and Vern Paxson∗†
∗International Computer Science Institute
†University of California, Berkeley
Abstract—Eﬀective evaluations of approaches to circumventing
government Internet censorship require incorporating perspec-
tives of how censors operate in practice. We undertake an
extensive examination of real censors by surveying prior mea-
surement studies and analyzing ﬁeld reports and bug tickets from
practitioners. We assess both deployed circumvention approaches
and research proposals to consider the criteria employed in their
evaluations and compare these to the observed behaviors of real
censors, identifying areas where evaluations could more faithfully
and eﬀectively incorporate the practices of modern censors. These
observations lead to an agenda realigning research with the
predominant problems of today.
I. Introduction
Censorship circumvention research seeks to develop ap-
proaches for facilitating access to banned Internet resources, a
domain with a fundamentally adversarial nature arising from
the ongoing interactions between circumventors and censors.
Both parties ﬁnd themselves locked in an arms race where each
side must manage tradeoﬀs between eﬃcacy and expenditure.
These tradeoﬀs continually evolve in subtle ways as new
technologies change the costs of various approaches.
Given this complexity, undertaking sound evaluation of
potential circumvention approaches proves both crucial and
diﬃcult. Sound evaluation is crucial since, due to limited
resources, the developers of circumvention approaches cannot
implement and deploy every prospective approach; they need
criteria for selecting the most promising. It is diﬃcult,...


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

Input:
title:SoK: Towards Grounding Censorship Circumvention in Empiricism
author:Michael Carl Tschantz and
Sadia Afroz and
anonymous and
Vern Paxson
2016 IEEE Symposium on Security and Privacy
2016 IEEE Symposium on Security and Privacy
SoK: Towards Grounding Censorship
Circumvention in Empiricism
Michael Carl Tschantz∗, Sadia Afroz∗, Anonymous‡, and Vern Paxson∗†
∗International Computer Science Institute
†University of California, Berkeley
Abstract—Eﬀective evaluations of approaches to circumventing
government Internet censorship require incorporating perspec-
tives of how censors operate in practice. We undertake an
extensive examination of real censors by surveying prior mea-
surement studies and analyzing ﬁeld reports and bug tickets from
practitioners. We assess both deployed circumvention approaches
and research proposals to consider the criteria employed in their
evaluations and compare these to the observed behaviors of real
censors, identifying areas where evaluations could more faithfully
and eﬀectively incorporate the practices of modern censors. These
observations lead to an agenda realigning research with the
predominant problems of today.
I. Introduction
Censorship circumvention research seeks to develop ap-
proaches for facilitating access to banned Internet resources, a
domain with a fundamentally adversarial nature arising from
the ongoing interactions between circumventors and censors.
Both parties ﬁnd themselves locked in an arms race where each
side must manage tradeoﬀs between eﬃcacy and expenditure.
These tradeoﬀs continually evolve in subtle ways as new
technologies change the costs of various approaches.
Given this complexity, undertaking sound evaluation of
potential circumvention approaches proves both crucial and
diﬃcult. Sound evaluation is crucial since, due to limited
resources, the developers of circumvention approaches cannot
implement and deploy every prospective approach; they need
criteria for selecting the most promising. It is diﬃcult,...

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


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

Input:
title:Time-Window Based Group-Behavior Supported Method for Accurate Detection
of Anomalous Users
author:Lun-Pin Yuan and
Euijin Choo and
Ting Yu and
Issa Khalil and
Sencun Zhu
8
3
0
0
0
.
1
2
0
2
.
7
8
9
8
4
N
S
D
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
1
2
0
2
©
0
0
.
1
3
$
/
1
2
/
7
-
2
7
5
3
-
4
5
6
6
-
1
-
8
7
9
|
)
N
S
D
(
s
k
r
o
w
t
e
N
d
n
a
s
m
e
t
s
y
S
e
l
b
a
d
n
e
p
e
D
n
o
e
c
n
e
r
e
f
n
o
C
l
a
n
o
i
t
a
n
r
e
t
n
I
P
I
F
I
/
E
E
E
I
l
a
u
n
n
A
t
s
1
5
1
2
0
2
2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
Time-Window Based Group-Behavior Supported Method for Accurate Detection of
Anomalous Users
Lun-Pin Yuan
Euijin Choo
Ting Yu
Pennsylvania State University
Qatar Computing Research Institute
Qatar Computing Research Institute
lunpin@psu.edu
echoo@hbku.edu.qa
tyu@hbku.edu.qa
Issa Khalil
Qatar Computing Research Institute
ikhalil@hbku.edu.qa
Sencun Zhu
Pennsylvania State University
sxz16@psu.edu
Abstract—Autoencoder-based anomaly detection methods
have been used in identifying anomalous users from large-
scale enterprise logs with the assumption that adversarial
activities do not follow past habitual patterns. Most existing
approaches typically build models by reconstructing single-
day and individual-user behaviors. However, without capturing
long-term signals and group-correlation signals, the models
cannot identify low-signal yet long-lasting threats, and will
wrongly report many normal users as anomalies on busy
days, which, in turn, lead to high false positive rate. In this
paper, we propose ACOBE, anAnomaly detection method
based on COmpound BEhavior, which takes into consideration
long-term patterns and group behaviors. ACOBE leverages
a novel behavior representation and an ensemble of deep
autoencoders and produces an ordered investigation list. Our
evaluation shows that ACOBE outperforms prior work by a
large margin in terms of precision and recall, and our case
study demonstrates that ACOBE is applic...

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


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

Output:
安全论文分析：

title:OpenNF: enabling innovation in network function control
author:Aaron Gember-Jacobson and
Raajay Viswanathan and
Chaithan Prakash and
Robert Grandl and
Junaid Khalid and
Sourav Das and
Aditya Akella
OpenNF: Enabling Innovation in Network Function Control
Aaron Gember-Jacobson, Raajay Viswanathan, Chaithan Prakash, Robert Grandl,
Junaid Khalid, Sourav Das, and Aditya Akella
University of Wisconsin-Madison
{agember,raajay,cprakash,rgrandl,junaid,souravd,akella}@cs.wisc.edu
http://opennf.cs.wisc.edu
ABSTRACT
Network functions virtualization (NFV) together with software-
deﬁned networking (SDN) has the potential to help operators sat-
isfy tight service level agreements, accurately monitor and manipu-
late network trafﬁc, and minimize operating expenses. However, in
scenarios that require packet processing to be redistributed across
a collection of network function (NF) instances, simultaneously
achieving all three goals requires a framework that provides efﬁ-
cient, coordinated control of both internal NF state and network
forwarding state. To this end, we design a control plane called
OpenNF. We use carefully designed APIs and a clever combina-
tion of events and forwarding updates to address race conditions,
bound overhead, and accommodate a variety of NFs. Our evalua-
tion shows that OpenNF offers efﬁcient state control without com-
promising ﬂexibility, and requires modest additions to NFs.
Categories and Subject Descriptors
C.2.1 [Computer Communication Networks]: Network Archi-
tecture and Design; C.2.3 [Computer Communication Networks]:
Network Operations
Keywords
Network functions, middleboxes, software-deﬁned networking
1.
INTRODUCTION
Network functions (NFs), or middleboxes, are systems that ex-
amine and modify packets and ﬂows in sophisticated ways: e.g.,
intrusion detection systems (IDSs), load balancers, caching prox-
ies, etc. NFs play a critical role in ensuring security, improving
performance, and providing other novel network functionality [37].
...


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

Input:
title:OpenNF: enabling innovation in network function control
author:Aaron Gember-Jacobson and
Raajay Viswanathan and
Chaithan Prakash and
Robert Grandl and
Junaid Khalid and
Sourav Das and
Aditya Akella
OpenNF: Enabling Innovation in Network Function Control
Aaron Gember-Jacobson, Raajay Viswanathan, Chaithan Prakash, Robert Grandl,
Junaid Khalid, Sourav Das, and Aditya Akella
University of Wisconsin-Madison
{agember,raajay,cprakash,rgrandl,junaid,souravd,akella}@cs.wisc.edu
http://opennf.cs.wisc.edu
ABSTRACT
Network functions virtualization (NFV) together with software-
deﬁned networking (SDN) has the potential to help operators sat-
isfy tight service level agreements, accurately monitor and manipu-
late network trafﬁc, and minimize operating expenses. However, in
scenarios that require packet processing to be redistributed across
a collection of network function (NF) instances, simultaneously
achieving all three goals requires a framework that provides efﬁ-
cient, coordinated control of both internal NF state and network
forwarding state. To this end, we design a control plane called
OpenNF. We use carefully designed APIs and a clever combina-
tion of events and forwarding updates to address race conditions,
bound overhead, and accommodate a variety of NFs. Our evalua-
tion shows that OpenNF offers efﬁcient state control without com-
promising ﬂexibility, and requires modest additions to NFs.
Categories and Subject Descriptors
C.2.1 [Computer Communication Networks]: Network Archi-
tecture and Design; C.2.3 [Computer Communication Networks]:
Network Operations
Keywords
Network functions, middleboxes, software-deﬁned networking
1.
INTRODUCTION
Network functions (NFs), or middleboxes, are systems that ex-
amine and modify packets and ﬂows in sophisticated ways: e.g.,
intrusion detection systems (IDSs), load balancers, caching prox-
ies, etc. NFs play a critical role in ensuring security, improving
performance, and providing other novel network functionality [37].
...

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


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

Output:
安全论文分析：

title:Active Credential Leakage for Observing Web-Based Attack Cycle
author:Mitsuaki Akiyama and
Takeshi Yagi and
Kazufumi Aoki and
Takeo Hariu and
Youki Kadobayashi
TRAFFIC DIRECTION
SYSTEMS AS MALWARE
DISTRIBUTION TOOLS
g
Maxim Goncharov
A 2011 Trend Micro Research Paper
absTRacT
Directing traffic to cash in on referrals is a
common and legitimate method of making
money on the Internet. It should not, therefore,
be surprising for the same to be true in the
illegitimate world of cybercrime. So-called
traffic direction systems (TDSs) have
reached a high level of sophistication.
This research paper will show how such
systems work, how these are utilized by
cybercriminals, and what the security
industry can do about this.
First, we will take a look at how TDSs work by looking at HTTP header redirection.
Then we will look at and compare how TDSs use iframes and Flash-based applications
to distribute malware.
Cybercriminals try to maximize the effectiveness of TDSs in order to profit as much as
possible from their exploits. This paper will also show how time, region, and installed
software influence TDSs by looking at the various tools that are currently available in
the market.
Cybercriminals strongly utilize TDSs to determine traffic type, which will aid them in
directing users to certain malicious sites and in determining what malicious payloads
to execute on particular systems. Some malware may also be the end result of a
particular TDS’s series of redirections, making it a malware infection vector.
What then can we do as part of the security industry?
TDSs present several challenges with regard to malware sample sourcing and
malicious URL detection, as these are capable of detecting the use of security
tools and often initiate avoidance tactics. A naïve approach to looking at TDSs may,
therefore, result in bogus findings and possible damage to the systems of innocent
users. This paper will show how we can protect users by actively...


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

Input:
title:Active Credential Leakage for Observing Web-Based Attack Cycle
author:Mitsuaki Akiyama and
Takeshi Yagi and
Kazufumi Aoki and
Takeo Hariu and
Youki Kadobayashi
TRAFFIC DIRECTION
SYSTEMS AS MALWARE
DISTRIBUTION TOOLS
g
Maxim Goncharov
A 2011 Trend Micro Research Paper
absTRacT
Directing traffic to cash in on referrals is a
common and legitimate method of making
money on the Internet. It should not, therefore,
be surprising for the same to be true in the
illegitimate world of cybercrime. So-called
traffic direction systems (TDSs) have
reached a high level of sophistication.
This research paper will show how such
systems work, how these are utilized by
cybercriminals, and what the security
industry can do about this.
First, we will take a look at how TDSs work by looking at HTTP header redirection.
Then we will look at and compare how TDSs use iframes and Flash-based applications
to distribute malware.
Cybercriminals try to maximize the effectiveness of TDSs in order to profit as much as
possible from their exploits. This paper will also show how time, region, and installed
software influence TDSs by looking at the various tools that are currently available in
the market.
Cybercriminals strongly utilize TDSs to determine traffic type, which will aid them in
directing users to certain malicious sites and in determining what malicious payloads
to execute on particular systems. Some malware may also be the end result of a
particular TDS’s series of redirections, making it a malware infection vector.
What then can we do as part of the security industry?
TDSs present several challenges with regard to malware sample sourcing and
malicious URL detection, as these are capable of detecting the use of security
tools and often initiate avoidance tactics. A naïve approach to looking at TDSs may,
therefore, result in bogus findings and possible damage to the systems of innocent
users. This paper will show how we can protect users by actively...

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


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

Output:
安全论文分析：

title:Stepwise Construction and Refinement of Dependability Models
author:Cl'audia Betous-Almeida and
Karama Kanoun
Stepwise Construction and Reﬁnement
of Dependability Models
Cl´audia Betous-Almeida and Karama Kanoun
LAAS-CNRS
7, Avenue du Colonel Roche
31077 Toulouse Cedex 4 - France
E-mail: falmeida,kanoung@laas.fr
Abstract
This paper presents a stepwise approach for depend-
ability modeling, based on Generalized Stochastic Petri
Nets (GSPNs). The ﬁrst-step model called functional-level
model, can be built as early as system functional speciﬁca-
tions and then completed by the structural model as soon
as the system architecture is known, even at a very high
level. The latter can be reﬁned according to three differ-
ent aspects: Component decomposition, state and event
ﬁne-tuning and distribution adjustment to take into account
increasing event rates. We deﬁne speciﬁc rules to make
the successive transformations as easy and systematic as
possible. This approach allows the various dependencies
to be taken into account at the right level of abstraction:
Functional dependency, structural dependency and those
induced by non-exponential distributions. A part of the ap-
proach is applied to an instrumentation and control system
(I&C) in power plants.
1. Introduction
Dependability evaluation plays an important role in criti-
cal systems’ deﬁnition, design and development. Modeling
can start as early as system functional speciﬁcations, from
which a high-level model can be derived to help in analyz-
ing dependencies between the various functions. However
the information that can be obtained from dependability
modeling and evaluation becomes more accurate as more
knowledge about the system’s implementation is incorpo-
rated into the models.
The starting point of our work was to help (based on de-
pendability evaluation) a stakeholder of an I&C system in
selecting and reﬁning systems proposed by various contrac-
tors in response to a Call for Tenders. To this end, we ha...


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

Input:
title:Stepwise Construction and Refinement of Dependability Models
author:Cl'audia Betous-Almeida and
Karama Kanoun
Stepwise Construction and Reﬁnement
of Dependability Models
Cl´audia Betous-Almeida and Karama Kanoun
LAAS-CNRS
7, Avenue du Colonel Roche
31077 Toulouse Cedex 4 - France
E-mail: falmeida,kanoung@laas.fr
Abstract
This paper presents a stepwise approach for depend-
ability modeling, based on Generalized Stochastic Petri
Nets (GSPNs). The ﬁrst-step model called functional-level
model, can be built as early as system functional speciﬁca-
tions and then completed by the structural model as soon
as the system architecture is known, even at a very high
level. The latter can be reﬁned according to three differ-
ent aspects: Component decomposition, state and event
ﬁne-tuning and distribution adjustment to take into account
increasing event rates. We deﬁne speciﬁc rules to make
the successive transformations as easy and systematic as
possible. This approach allows the various dependencies
to be taken into account at the right level of abstraction:
Functional dependency, structural dependency and those
induced by non-exponential distributions. A part of the ap-
proach is applied to an instrumentation and control system
(I&C) in power plants.
1. Introduction
Dependability evaluation plays an important role in criti-
cal systems’ deﬁnition, design and development. Modeling
can start as early as system functional speciﬁcations, from
which a high-level model can be derived to help in analyz-
ing dependencies between the various functions. However
the information that can be obtained from dependability
modeling and evaluation becomes more accurate as more
knowledge about the system’s implementation is incorpo-
rated into the models.
The starting point of our work was to help (based on de-
pendability evaluation) a stakeholder of an I&C system in
selecting and reﬁning systems proposed by various contrac-
tors in response to a Call for Tenders. To this end, we ha...

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


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

Output:
安全论文分析：

title:Exploiting smart-phone USB connectivity for fun and profit
author:Zhaohui Wang and
Angelos Stavrou
Exploiting Smart-Phone USB Connectivity
For Fun And Proﬁt
Zhaohui Wang
Department of Computer Science
George Mason University, Fairfax, VA
zwange@gmu.edu
Angelos Stavrou
Department of Computer Science
George Mason University, Fairfax, VA
astavrou@gmu.edu
ABSTRACT
The Universal Serial Bus (USB) connection has become the
de-facto standard for both charging and data transfers for
smart phone devices including Google’s Android and Ap-
ple’s iPhone. To further enhance their functionality, smart
phones are equipped with programmable USB hardware and
open source operating systems that empower them to al-
ter the default behavior of the end-to-end USB communi-
cations. Unfortunately, these new capabilities coupled with
the inherent trust that users place on the USB physical con-
nectivity and the lack of any protection mechanisms render
USB a insecure link, prone to exploitation. To demonstrate
this new avenue of exploitation, we introduce novel attack
strategies that exploit the functional capabilities of the USB
physical link. In addition, we detail how a sophisticated ad-
versary who has under his control one of the connected de-
vices can subvert the other. This includes attacks where a
compromised smart phone poses as a Human Interface De-
vice (HID) and sends keystrokes in order to control the vic-
tim host. Moreover, we explain how to boot a smart phone
device into USB host mode and take over another phone
using a specially crafted cable. Finally, we point out the un-
derlying reasons behind USB exploits and propose potential
defense mechanisms that would limit or even prevent such
USB borne attacks.
1.
INTRODUCTION
Recent advances in the hardware capabilities of the mo-
bile hand-held devices have fostered the development of open
source operating systems for mobile phones. These new gen-
eration of smart phones such as iPhone and Google Android
phone are powerful...


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

Input:
title:Exploiting smart-phone USB connectivity for fun and profit
author:Zhaohui Wang and
Angelos Stavrou
Exploiting Smart-Phone USB Connectivity
For Fun And Proﬁt
Zhaohui Wang
Department of Computer Science
George Mason University, Fairfax, VA
zwange@gmu.edu
Angelos Stavrou
Department of Computer Science
George Mason University, Fairfax, VA
astavrou@gmu.edu
ABSTRACT
The Universal Serial Bus (USB) connection has become the
de-facto standard for both charging and data transfers for
smart phone devices including Google’s Android and Ap-
ple’s iPhone. To further enhance their functionality, smart
phones are equipped with programmable USB hardware and
open source operating systems that empower them to al-
ter the default behavior of the end-to-end USB communi-
cations. Unfortunately, these new capabilities coupled with
the inherent trust that users place on the USB physical con-
nectivity and the lack of any protection mechanisms render
USB a insecure link, prone to exploitation. To demonstrate
this new avenue of exploitation, we introduce novel attack
strategies that exploit the functional capabilities of the USB
physical link. In addition, we detail how a sophisticated ad-
versary who has under his control one of the connected de-
vices can subvert the other. This includes attacks where a
compromised smart phone poses as a Human Interface De-
vice (HID) and sends keystrokes in order to control the vic-
tim host. Moreover, we explain how to boot a smart phone
device into USB host mode and take over another phone
using a specially crafted cable. Finally, we point out the un-
derlying reasons behind USB exploits and propose potential
defense mechanisms that would limit or even prevent such
USB borne attacks.
1.
INTRODUCTION
Recent advances in the hardware capabilities of the mo-
bile hand-held devices have fostered the development of open
source operating systems for mobile phones. These new gen-
eration of smart phones such as iPhone and Google Android
phone are powerful...

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


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

Output:
安全论文分析：

title:Throttling Tor Bandwidth Parasites
author:Rob Jansen and
Paul F. Syverson and
Nicholas Hopper
Throttling Tor Bandwidth Parasites
Rob Jansen
Paul Syverson
U.S. Naval Research Laboratory
{rob.g.jansen, paul.syverson}@nrl.navy.mil
Nicholas Hopper
University of Minnesota
hopper@cs.umn.edu
Abstract
Tor is vulnerable to network congestion and performance
problems due to bulk data transfers. A large fraction of
the available network capacity is consumed by a small
percentage of Tor users, resulting in severe service degra-
dation for the majority. Bulk users continuously drain
relays of excess bandwidth, creating new network bot-
tlenecks and exacerbating the effects of existing ones.
While this problem may currently be attributed to ratio-
nal users utilizing the network, it may also be exploited
by a relatively low-resource adversary using similar tech-
niques to contribute to a network denial of service (DoS)
attack. Degraded service discourages the use of Tor, af-
fecting both Tor’s client diversity and anonymity.
Equipped with mechanisms from communication net-
works, we design and implement three Tor-speciﬁc al-
gorithms that throttle bulk transfers to reduce network
congestion and increase network responsiveness. Unlike
existing techniques, our algorithms adapt to network dy-
namics using only information local to a relay. We exper-
iment with full-network deployments of our algorithms
under a range of light to heavy network loads. We ﬁnd
that throttling results in signiﬁcant improvements to web
client performance while mitigating the negative effects
of bulk transfers. We also analyze how throttling affects
anonymity and compare the security of our algorithms
under adversarial attack. We ﬁnd that throttling reduces
information leakage compared to unthrottled Tor while
improving anonymity against realistic adversaries.
1
Introduction
The Tor [19] anonymity network was developed in an
attempt to improve anonymity on the Internet. Onion
Routing [23,48] serves as...


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

Input:
title:Throttling Tor Bandwidth Parasites
author:Rob Jansen and
Paul F. Syverson and
Nicholas Hopper
Throttling Tor Bandwidth Parasites
Rob Jansen
Paul Syverson
U.S. Naval Research Laboratory
{rob.g.jansen, paul.syverson}@nrl.navy.mil
Nicholas Hopper
University of Minnesota
hopper@cs.umn.edu
Abstract
Tor is vulnerable to network congestion and performance
problems due to bulk data transfers. A large fraction of
the available network capacity is consumed by a small
percentage of Tor users, resulting in severe service degra-
dation for the majority. Bulk users continuously drain
relays of excess bandwidth, creating new network bot-
tlenecks and exacerbating the effects of existing ones.
While this problem may currently be attributed to ratio-
nal users utilizing the network, it may also be exploited
by a relatively low-resource adversary using similar tech-
niques to contribute to a network denial of service (DoS)
attack. Degraded service discourages the use of Tor, af-
fecting both Tor’s client diversity and anonymity.
Equipped with mechanisms from communication net-
works, we design and implement three Tor-speciﬁc al-
gorithms that throttle bulk transfers to reduce network
congestion and increase network responsiveness. Unlike
existing techniques, our algorithms adapt to network dy-
namics using only information local to a relay. We exper-
iment with full-network deployments of our algorithms
under a range of light to heavy network loads. We ﬁnd
that throttling results in signiﬁcant improvements to web
client performance while mitigating the negative effects
of bulk transfers. We also analyze how throttling affects
anonymity and compare the security of our algorithms
under adversarial attack. We ﬁnd that throttling reduces
information leakage compared to unthrottled Tor while
improving anonymity against realistic adversaries.
1
Introduction
The Tor [19] anonymity network was developed in an
attempt to improve anonymity on the Internet. Onion
Routing [23,48] serves as...

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


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

Output:
安全论文分析：

title:The Request for Better Measurement: A Comparative Evaluation of
Two-Factor Authentication Schemes
author:Ding Wang and
Qianchen Gu and
Haibo Cheng and
Ping Wang
The Request for Better Measurement: A Comparative
Evaluation of Two-Factor Authentication Schemes
Ding Wang†, Qianchen Gu†, Haibo Cheng†, Ping Wang†‡
†School of EECS, Peking University, Beijing 100871, China
‡National Research Center for Software Engineering, Beijing 100871, China
{wangdingg,qcgu,chenghaibo,pwang}@pku.edu.cn
ABSTRACT
Despite over two decades of continuous eﬀorts, how to de-
sign a secure and eﬃcient two-factor authentication scheme
remains an open issue. Hundreds of new schemes have wave
upon wave been proposed, yet most of them are shortly
found unable to achieve some important security goals (e.g.,
truly two-factor security) and desirable properties (e.g.,
user anonymity), falling into the unsatisfactory “break-ﬁx-
break-ﬁx” cycle.
In this vicious cycle, protocol designers
often advocate the superiorities of their improved scheme,
but do not illustrate (or unconsciously overlooking) the
aspects on which their scheme performs poorly.
In this paper, we ﬁrst use a series of “improved schemes”
over Xu et al.’s 2009 scheme as case studies to high-
light that, if there are no improved measurements, more
“improved schemes” generally would not mean more ad-
vancements. To ﬁgure out why the measurement of ex-
isting schemes is invariably insuﬃcient, we further in-
vestigate into the state-of-the-art evaluation criteria set
(i.e., Madhusudhan-Mittal’s set). Besides reporting its
ambiguities and redundancies, we propose viable ﬁxes and
reﬁnements. To the best of our knowledge, we for the ﬁrst
time demonstrate that there are at least seven diﬀerent
attacking scenarios that may lead to the failure of a scheme
in achieving truly two-factor security. Finally, we conduct
a large-scale comparative evaluation of 34 representative
two-factor schemes, and our results outline the request for
better measu...


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

Input:
title:The Request for Better Measurement: A Comparative Evaluation of
Two-Factor Authentication Schemes
author:Ding Wang and
Qianchen Gu and
Haibo Cheng and
Ping Wang
The Request for Better Measurement: A Comparative
Evaluation of Two-Factor Authentication Schemes
Ding Wang†, Qianchen Gu†, Haibo Cheng†, Ping Wang†‡
†School of EECS, Peking University, Beijing 100871, China
‡National Research Center for Software Engineering, Beijing 100871, China
{wangdingg,qcgu,chenghaibo,pwang}@pku.edu.cn
ABSTRACT
Despite over two decades of continuous eﬀorts, how to de-
sign a secure and eﬃcient two-factor authentication scheme
remains an open issue. Hundreds of new schemes have wave
upon wave been proposed, yet most of them are shortly
found unable to achieve some important security goals (e.g.,
truly two-factor security) and desirable properties (e.g.,
user anonymity), falling into the unsatisfactory “break-ﬁx-
break-ﬁx” cycle.
In this vicious cycle, protocol designers
often advocate the superiorities of their improved scheme,
but do not illustrate (or unconsciously overlooking) the
aspects on which their scheme performs poorly.
In this paper, we ﬁrst use a series of “improved schemes”
over Xu et al.’s 2009 scheme as case studies to high-
light that, if there are no improved measurements, more
“improved schemes” generally would not mean more ad-
vancements. To ﬁgure out why the measurement of ex-
isting schemes is invariably insuﬃcient, we further in-
vestigate into the state-of-the-art evaluation criteria set
(i.e., Madhusudhan-Mittal’s set). Besides reporting its
ambiguities and redundancies, we propose viable ﬁxes and
reﬁnements. To the best of our knowledge, we for the ﬁrst
time demonstrate that there are at least seven diﬀerent
attacking scenarios that may lead to the failure of a scheme
in achieving truly two-factor security. Finally, we conduct
a large-scale comparative evaluation of 34 representative
two-factor schemes, and our results outline the request for
better measu...

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


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

Output:
安全论文分析：

title:Model Orthogonalization: Class Distance Hardening in Neural Networks
for Better Security
author:Guanhong Tao and
Yingqi Liu and
Guangyu Shen and
Qiuling Xu and
Shengwei An and
Zhuo Zhang and
Xiangyu Zhang
8
8
6
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
Model Orthogonalization: Class Distance Hardening
in Neural Networks for Better Security
Guanhong Tao, Yingqi Liu, Guangyu Shen, Qiuling Xu, Shengwei An, Zhuo Zhang, Xiangyu Zhang
Email: {taog, liu1751, shen447, xu1230, an93, zhan3299, xyzhang}@cs.purdue.edu
Department of Computer Science, Purdue University
Abstract—The distance between two classes for a deep learning
classifier can be measured by the level of difficulty in flipping
all (or majority of) samples in a class to the other. The class
distances of many pre-trained models in the wild are very
small and do not align well with humans’ intuition (e.g., classes
turtle and bird have smaller distance than classes cat and
dog), making the models vulnerable to backdoor attacks, which
aim to cause misclassification by stamping a specific pattern to
inputs. We propose a novel model hardening technique called
model orthogonalization which is an add-on training step to
pretrained models,
including clean models, poisoned models,
and adversarially trained models. It can substantially enlarge
class distances with reasonable training cost and without much
accuracy degradation. Our evaluation on 5 datasets with 22
model structures show that our technique can enlarge class
distances by 177.63% on average with less than 1% accuracy loss,
outperforming existing hardening techniques such as adversarial
training, universal adversarial perturbation, and directly using
generated backdoors. It reduces 80% false positives for a state-
of-the-art backdoor scan...