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

Output:
安全论文分析：

title:Securing Self-Virtualizing Ethernet Devices
author:Igor Smolyar and
Muli Ben-Yehuda and
Dan Tsafrir
Securing Self-Virtualizing Ethernet Devices
Igor Smolyar, Muli Ben-Yehuda, and Dan Tsafrir, Technion—Israel Institute of Technology
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/smolyar
This paper is included in the Proceedings of the 24th USENIX Security SymposiumAugust 12–14, 2015 • Washington, D.C.ISBN 978-1-939133-11-3Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXSecuring Self-Virtualizing Ethernet Devices
Igor Smolyar
Muli Ben-Yehuda
Technion – Israel Institute of Technology
{igors,muli,dan}@cs.technion.ac.il
Dan Tsafrir
Abstract
I/O virtualization (SRIOV)
Single root
is a hard-
ware/software interface that allows devices to “self virtu-
alize” and thereby remove the host from the critical I/O
path. SRIOV thus brings near bare-metal performance to
untrusted guest virtual machines (VMs) in public clouds,
enterprise data centers, and high-performance comput-
ing setups. We identify a design ﬂaw in current Ethernet
SRIOV NIC deployments that enables untrusted VMs to
completely control the throughput and latency of other,
unrelated VMs. The attack exploits Ethernet ”pause”
frames, which enable network ﬂow control functional-
ity. We experimentally launch the attack across sev-
eral NIC models and ﬁnd that it is effective and highly
accurate, with substantial consequences if left unmiti-
gated:
(1) to be safe, NIC vendors will have to mod-
ify their NICs so as to ﬁlter pause frames originating
from SRIOV instances; (2) in the meantime, administra-
tors will have to either trust their VMs, or conﬁgure their
switches to ignore pause frames, thus relinquishing ﬂow
control, which might severely degrade networking per-
formance. We present the Virtualization-Aware Network
Flow Controller (VANFC), a software-based SRIOV NIC
prototype that overcomes the attack. VANFC ﬁlters pause
frames...


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

Input:
title:Securing Self-Virtualizing Ethernet Devices
author:Igor Smolyar and
Muli Ben-Yehuda and
Dan Tsafrir
Securing Self-Virtualizing Ethernet Devices
Igor Smolyar, Muli Ben-Yehuda, and Dan Tsafrir, Technion—Israel Institute of Technology
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/smolyar
This paper is included in the Proceedings of the 24th USENIX Security SymposiumAugust 12–14, 2015 • Washington, D.C.ISBN 978-1-939133-11-3Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXSecuring Self-Virtualizing Ethernet Devices
Igor Smolyar
Muli Ben-Yehuda
Technion – Israel Institute of Technology
{igors,muli,dan}@cs.technion.ac.il
Dan Tsafrir
Abstract
I/O virtualization (SRIOV)
Single root
is a hard-
ware/software interface that allows devices to “self virtu-
alize” and thereby remove the host from the critical I/O
path. SRIOV thus brings near bare-metal performance to
untrusted guest virtual machines (VMs) in public clouds,
enterprise data centers, and high-performance comput-
ing setups. We identify a design ﬂaw in current Ethernet
SRIOV NIC deployments that enables untrusted VMs to
completely control the throughput and latency of other,
unrelated VMs. The attack exploits Ethernet ”pause”
frames, which enable network ﬂow control functional-
ity. We experimentally launch the attack across sev-
eral NIC models and ﬁnd that it is effective and highly
accurate, with substantial consequences if left unmiti-
gated:
(1) to be safe, NIC vendors will have to mod-
ify their NICs so as to ﬁlter pause frames originating
from SRIOV instances; (2) in the meantime, administra-
tors will have to either trust their VMs, or conﬁgure their
switches to ignore pause frames, thus relinquishing ﬂow
control, which might severely degrade networking per-
formance. We present the Virtualization-Aware Network
Flow Controller (VANFC), a software-based SRIOV NIC
prototype that overcomes the attack. VANFC ﬁlters pause
frames...

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


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

Output:
安全论文分析：

title:Proximity Breeds Danger: Emerging Threats in Metro-area Wireless Networks
author:Periklis Akritidis and
Wee-Yung Chin and
Vinh The Lam and
Stelios Sidiroglou and
Kostas G. Anagnostakis
Proximity Breeds Danger:
Emerging Threats in Metro-area Wireless Networks
P. Akritidis
∗
, W.Y. Chin
•
, V.T. Lam
†
, S. Sidiroglou
‡
, K.G. Anagnostakis
•
• Systems and Security Department
Institute for Infocomm Research (I2R), Singapore
{kostas,wychin}@s3g.i2r.a-star.edu.sg
‡ Computer Science Department
Columbia University, USA
stelios@cs.columbia.edu
? Computer Laboratory
Cambridge University, UK
Periklis.Akritidis@cl.cam.ac.uk
† Dept. of Comp. Science and Engineering
University of California San Diego, USA
vtlam@cs.ucsd.edu
Abstract
1 Introduction
The growing popularity of wireless networks and mo-
bile devices is starting to attract unwanted attention
especially as potential targets for malicious activities
reach critical mass.
In this study, we try to quantify
the threat from large-scale distributed attacks on wireless
networks, and, more speciﬁcally, wiﬁ networks in densely
populated metropolitan areas. We focus on three likely
attack scenarios: “wildﬁre” worms that can spread con-
tagiously over and across wireless LANs, coordinated
citywide phishing campaigns based on wireless spooﬁng,
and rogue systems for compromising location privacy in
a coordinated fashion. The ﬁrst attack illustrates how
dense wiﬁ deployment may provide opportunities for at-
tackers who want to quickly compromise large numbers
of machines. The last two attacks illustrate how botnets
can amplify wiﬁ vulnerabilities, and how botnet power is
ampliﬁed by wireless connectivity.
To quantify these threats, we rely on real-world data
extracted from wiﬁ maps of large metropolitan areas in
the States and Singapore. Our results suggest that a care-
fully crafted wireless worm can infect up to 80% of all
wiﬁ connected hosts in some metropolitan areas within
20 minutes, and that an attacker can launch phishing...


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

Input:
title:Proximity Breeds Danger: Emerging Threats in Metro-area Wireless Networks
author:Periklis Akritidis and
Wee-Yung Chin and
Vinh The Lam and
Stelios Sidiroglou and
Kostas G. Anagnostakis
Proximity Breeds Danger:
Emerging Threats in Metro-area Wireless Networks
P. Akritidis
∗
, W.Y. Chin
•
, V.T. Lam
†
, S. Sidiroglou
‡
, K.G. Anagnostakis
•
• Systems and Security Department
Institute for Infocomm Research (I2R), Singapore
{kostas,wychin}@s3g.i2r.a-star.edu.sg
‡ Computer Science Department
Columbia University, USA
stelios@cs.columbia.edu
? Computer Laboratory
Cambridge University, UK
Periklis.Akritidis@cl.cam.ac.uk
† Dept. of Comp. Science and Engineering
University of California San Diego, USA
vtlam@cs.ucsd.edu
Abstract
1 Introduction
The growing popularity of wireless networks and mo-
bile devices is starting to attract unwanted attention
especially as potential targets for malicious activities
reach critical mass.
In this study, we try to quantify
the threat from large-scale distributed attacks on wireless
networks, and, more speciﬁcally, wiﬁ networks in densely
populated metropolitan areas. We focus on three likely
attack scenarios: “wildﬁre” worms that can spread con-
tagiously over and across wireless LANs, coordinated
citywide phishing campaigns based on wireless spooﬁng,
and rogue systems for compromising location privacy in
a coordinated fashion. The ﬁrst attack illustrates how
dense wiﬁ deployment may provide opportunities for at-
tackers who want to quickly compromise large numbers
of machines. The last two attacks illustrate how botnets
can amplify wiﬁ vulnerabilities, and how botnet power is
ampliﬁed by wireless connectivity.
To quantify these threats, we rely on real-world data
extracted from wiﬁ maps of large metropolitan areas in
the States and Singapore. Our results suggest that a care-
fully crafted wireless worm can infect up to 80% of all
wiﬁ connected hosts in some metropolitan areas within
20 minutes, and that an attacker can launch phishing...

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


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

Output:
安全论文分析：

title:Can they hear me now?: a case for a client-assisted approach to monitoring
wide-area wireless networks
author:Sayandeep Sen and
Jongwon Yoon and
Joshua Hare and
Justin Ormont and
Suman Banerjee
Can They Hear Me Now?: A Case for a Client-assisted
Approach to Monitoring Wide-area Wireless Networks
Sayandeep Sen∗, Jongwon Yoon∗, Joshua Hare∗, Justin Ormont, Suman Banerjee
University of Wisconsin-Madison
{sdsen, yoonj, hare, ormont, suman}@cs.wisc.edu
ABSTRACT
We present WiScape, a framework for measuring and under-
standing the behavior of wide-area wireless networks, e.g.,
city-wide or nation-wide cellular data networks using active
participation from clients. The goal of WiScape is to provide
a coarse-grained view of a wide-area wireless landscape that
allows operators and users to understand broad performance
characteristics of the network. In this approach a central-
ized controller instructs clients to collect measurement sam-
ples over time and space in an opportunistic manner. To
limit the overheads of this measurement framework, WiS-
cape partitions the world into zones, contiguous areas with
relatively similar user experiences, and partitions time into
zone-speciﬁc epochs over which network statistics are rela-
tively stable. For each epoch in each zone, WiScape takes
a minimalistic view — it attempts to collect a small num-
ber of measurement samples to adequately characterize the
client experience in that zone and epoch, thereby limiting
the bandwidth and energy overheads at client devices. For
this eﬀort, we have collected ground truth measurements
for up to three diﬀerent commercial cellular wireless net-
works across (i) an area of more than 155 square kilometer
in and around Madison, WI, in the USA, (ii) a road stretch
of more than 240 kilometers between Madison and Chicago,
and (iii) locations in New Brunswick and Princeton, New
Jersey, USA, for a period of more than 1 year. We jus-
tify various design choices of WiScape through this data,
demonst...


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

Input:
title:Can they hear me now?: a case for a client-assisted approach to monitoring
wide-area wireless networks
author:Sayandeep Sen and
Jongwon Yoon and
Joshua Hare and
Justin Ormont and
Suman Banerjee
Can They Hear Me Now?: A Case for a Client-assisted
Approach to Monitoring Wide-area Wireless Networks
Sayandeep Sen∗, Jongwon Yoon∗, Joshua Hare∗, Justin Ormont, Suman Banerjee
University of Wisconsin-Madison
{sdsen, yoonj, hare, ormont, suman}@cs.wisc.edu
ABSTRACT
We present WiScape, a framework for measuring and under-
standing the behavior of wide-area wireless networks, e.g.,
city-wide or nation-wide cellular data networks using active
participation from clients. The goal of WiScape is to provide
a coarse-grained view of a wide-area wireless landscape that
allows operators and users to understand broad performance
characteristics of the network. In this approach a central-
ized controller instructs clients to collect measurement sam-
ples over time and space in an opportunistic manner. To
limit the overheads of this measurement framework, WiS-
cape partitions the world into zones, contiguous areas with
relatively similar user experiences, and partitions time into
zone-speciﬁc epochs over which network statistics are rela-
tively stable. For each epoch in each zone, WiScape takes
a minimalistic view — it attempts to collect a small num-
ber of measurement samples to adequately characterize the
client experience in that zone and epoch, thereby limiting
the bandwidth and energy overheads at client devices. For
this eﬀort, we have collected ground truth measurements
for up to three diﬀerent commercial cellular wireless net-
works across (i) an area of more than 155 square kilometer
in and around Madison, WI, in the USA, (ii) a road stretch
of more than 240 kilometers between Madison and Chicago,
and (iii) locations in New Brunswick and Princeton, New
Jersey, USA, for a period of more than 1 year. We jus-
tify various design choices of WiScape through this data,
demonst...

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


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

Output:
安全论文分析：

title:A First Look at the Misuse and Abuse of the IPv4 Transfer Market
author:Vasileios Giotsas and
Ioana Livadariu and
Petros Gigis
A First Look at the Misuse and Abuse
of the IPv4 Transfer Market
Vasileios Giotsas1(B), Ioana Livadariu2, and Petros Gigis3,4
1 Lancaster University, Lancaster, UK
v.giotsas@lancaster.ac.uk
2 Simula Metropolitan, Oslo, Norway
3 University College London, London, UK
4 Foundation for Research and Technology-Hellas (FORTH-ICS), Patras, Greece
Abstract. The depletion of the unallocated IPv4 addresses and the slow
pace of IPv6 deployment have given rise to the IPv4 transfer market,
the trading of allocated IPv4 preﬁxes between organizations. Despite
the policies established by RIRs to regulate the IPv4 transfer market,
IPv4 transfers pose an opportunity for malicious networks, such as spam-
mers and bulletproof ASes, to bypass reputational penalties by obtaining
“clean” IPv4 address space or by oﬄoading blacklisted addresses. Addi-
tionally, IP transfers create a window of uncertainty about the legitimate
ownership of preﬁxes, which leads to inconsistencies in WHOIS records
and routing advertisements. In this paper we provide the ﬁrst detailed
study of how transferred IPv4 preﬁxes are misused in the wild, by syn-
thesizing an array of longitudinal IP blacklists, honeypot data, and AS
reputation lists. Our ﬁndings yield evidence that transferred IPv4 address
blocks are used by malicious networks to address botnets and fraudulent
sites in much higher rates compared to non-transferred addresses, while
the timing of the attacks indicate eﬀorts to evade ﬁltering mechanisms.
Keywords: IPv4 transfers · Routing · BGP · Blacklists
1 Introduction
The depletion of the unallocated IPv4 addresses combined with the slow tran-
sition to IPv6 has led to the emergence of a secondary market for ownership
transfers of IPv4 addresses. However, the IPv4 market has been poorly reg-
ulated due to the lack of widely adopted IP preﬁx ownership authentication
mechan...


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

Input:
title:A First Look at the Misuse and Abuse of the IPv4 Transfer Market
author:Vasileios Giotsas and
Ioana Livadariu and
Petros Gigis
A First Look at the Misuse and Abuse
of the IPv4 Transfer Market
Vasileios Giotsas1(B), Ioana Livadariu2, and Petros Gigis3,4
1 Lancaster University, Lancaster, UK
v.giotsas@lancaster.ac.uk
2 Simula Metropolitan, Oslo, Norway
3 University College London, London, UK
4 Foundation for Research and Technology-Hellas (FORTH-ICS), Patras, Greece
Abstract. The depletion of the unallocated IPv4 addresses and the slow
pace of IPv6 deployment have given rise to the IPv4 transfer market,
the trading of allocated IPv4 preﬁxes between organizations. Despite
the policies established by RIRs to regulate the IPv4 transfer market,
IPv4 transfers pose an opportunity for malicious networks, such as spam-
mers and bulletproof ASes, to bypass reputational penalties by obtaining
“clean” IPv4 address space or by oﬄoading blacklisted addresses. Addi-
tionally, IP transfers create a window of uncertainty about the legitimate
ownership of preﬁxes, which leads to inconsistencies in WHOIS records
and routing advertisements. In this paper we provide the ﬁrst detailed
study of how transferred IPv4 preﬁxes are misused in the wild, by syn-
thesizing an array of longitudinal IP blacklists, honeypot data, and AS
reputation lists. Our ﬁndings yield evidence that transferred IPv4 address
blocks are used by malicious networks to address botnets and fraudulent
sites in much higher rates compared to non-transferred addresses, while
the timing of the attacks indicate eﬀorts to evade ﬁltering mechanisms.
Keywords: IPv4 transfers · Routing · BGP · Blacklists
1 Introduction
The depletion of the unallocated IPv4 addresses combined with the slow tran-
sition to IPv6 has led to the emergence of a secondary market for ownership
transfers of IPv4 addresses. However, the IPv4 market has been poorly reg-
ulated due to the lack of widely adopted IP preﬁx ownership authentication
mechan...

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


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

Input:
title:An energy efficient circuit level technique to protect register file
from MBUs and SETs in embedded processors
author:Mahdi Fazeli and
Alireza Namazi and
Seyed Ghassem Miremadi
978-1-4244-4421-2/09/$25.00 c(cid:13)2009 IEEE
195
Authorized licensed use limited to: Tsinghua University. Downloaded on March 20,2021 at 09:56:57 UTC from IEEE Xplore.  Restrictions apply.
 An Energy Efficient Circuit Level Technique to protect Register File from MBUs and SETs in Embedded Processors  M. Fazeli, A. Namazi, S.G. Miremadi Department of Computer Engineering, Sharif University of Technology, Tehran, Iran {m_fazeli, namazi}@ce.sharif.edu, miremadi@sharif.edu    Abstract  This paper presents a circuit level soft error-tolerant-technique, called RRC (Robust Register Caching), for the register file of embedded processors. The basic idea behind the RRC is to effectively cache the most vulnerable registers in a small highly robust register cache built by circuit level SEU and SET protected memory cells. To decide which cache entry should be replaced, the average number of read operations during a register ACE time is used as a criterion to judge. In fact, the victim cache entry is one which has the maximum read count. To minimize the power overhead of the RRC, the clock gating technique is efficiently exploited for the main register file resulting in significantly low power consumption. The RRC is able to protect the register file not only against Single Bit Upsets (SBUs) but also against Multiple Bit Upsets (MBUs) and Single Event Transients (SETs). The RRC is experimentally evaluated using the LEON processor. The experimental results show that, if the cache size is selected properly, the Architectural Vulnerability Factor (AVF) of the register file becomes about 1% while it imposes low power, area and performance overheads to the processor.   1. Introduction High energy particle strikes have severely challenged the reliability of today’s embedded processors [19][20]. Until re...

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


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

Output:
安全论文分析：

title:Measurement methods for fast and accurate blackhole identification
with binary tomography
author:'Italo Cunha and
Renata Teixeira and
Nick Feamster and
Christophe Diot
Measurement Methods for Fast and Accurate Blackhole
Identiﬁcation with Binary Tomography
Ítalo Cunha
Thomson / UPMC Paris
Universitas
Renata Teixeira
CNRS / UPMC Paris
Universitas
Nick Feamster
Georgia Tech
Christophe Diot
Thomson
feamster@cc.gatech.edu
christophe.diot@thomson.net
italo.cunha@thomson.net
renata.teixeira@lip6.fr
ABSTRACT
Binary tomography—the process of identifying faulty net-
work links through coordinated end-to-end probes—is a
promising method for detecting failures that the network
does not automatically mask (e.g., network “blackholes”).
Because tomography is sensitive to the quality of the input,
however, na¨ıve end-to-end measurements can introduce in-
accuracies. This paper develops two methods for generating
inputs to binary tomography algorithms that improve their
inference speed and accuracy. Failure conﬁrmation is a per-
path probing technique to distinguish packet losses caused
by congestion from persistent link or node failures. Aggrega-
tion strategies combine path measurements from unsynchro-
nized monitors into a set of consistent observations. When
used in conjunction with existing binary tomography algo-
rithms, our methods identify all failures that are longer than
two measurement cycles, while inducing relatively few false
alarms. In two wide-area networks, our techniques decrease
the number of alarms by as much as two orders of magni-
tude. Compared to the state of the art in binary tomogra-
phy, our techniques increase the identiﬁcation rate and avoid
hundreds of false alarms.
Categories and Subject Descriptors
C.2.3 [Computer Systems Organization]: Computer
Communication Networks—Network Monitoring
General Terms
Design, Experimentation, Measurement
Keywords
Network Tomography, Troubleshooting, Diagnosis
1.
INTRODUCTION
Binary tomography refers to the ...


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

Input:
title:Measurement methods for fast and accurate blackhole identification
with binary tomography
author:'Italo Cunha and
Renata Teixeira and
Nick Feamster and
Christophe Diot
Measurement Methods for Fast and Accurate Blackhole
Identiﬁcation with Binary Tomography
Ítalo Cunha
Thomson / UPMC Paris
Universitas
Renata Teixeira
CNRS / UPMC Paris
Universitas
Nick Feamster
Georgia Tech
Christophe Diot
Thomson
feamster@cc.gatech.edu
christophe.diot@thomson.net
italo.cunha@thomson.net
renata.teixeira@lip6.fr
ABSTRACT
Binary tomography—the process of identifying faulty net-
work links through coordinated end-to-end probes—is a
promising method for detecting failures that the network
does not automatically mask (e.g., network “blackholes”).
Because tomography is sensitive to the quality of the input,
however, na¨ıve end-to-end measurements can introduce in-
accuracies. This paper develops two methods for generating
inputs to binary tomography algorithms that improve their
inference speed and accuracy. Failure conﬁrmation is a per-
path probing technique to distinguish packet losses caused
by congestion from persistent link or node failures. Aggrega-
tion strategies combine path measurements from unsynchro-
nized monitors into a set of consistent observations. When
used in conjunction with existing binary tomography algo-
rithms, our methods identify all failures that are longer than
two measurement cycles, while inducing relatively few false
alarms. In two wide-area networks, our techniques decrease
the number of alarms by as much as two orders of magni-
tude. Compared to the state of the art in binary tomogra-
phy, our techniques increase the identiﬁcation rate and avoid
hundreds of false alarms.
Categories and Subject Descriptors
C.2.3 [Computer Systems Organization]: Computer
Communication Networks—Network Monitoring
General Terms
Design, Experimentation, Measurement
Keywords
Network Tomography, Troubleshooting, Diagnosis
1.
INTRODUCTION
Binary tomography refers to the ...

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


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

Output:
安全论文分析：

title:Paranoid Android: versatile protection for smartphones
author:Georgios Portokalidis and
Philip Homburg and
Kostas Anagnostakis and
Herbert Bos
Paranoid Android: Versatile Protection For Smartphones
Georgios Portokalidis∗
Network Security Lab
Dept. of Computer Science
Columbia University, NY, USA
porto@cs.columbia.edu
Philip Homburg
Dept. of Computer Science
Amsterdam, The Netherlands
Vrije Universiteit
philip@cs.vu.nl
Kostas Anagnostakis
Niometris R&D
Singapore
kostas@niometrics.com
Herbert Bos
Dept. of Computer Science
Vrije Universiteit
Amsterdam, The Netherlands
herbertb@cs.vu.nl
ABSTRACT
Smartphone usage has been continuously increasing in re-
cent years. Moreover, smartphones are often used for privacy-
sensitive tasks, becoming highly valuable targets for attack-
ers. They are also quite diﬀerent from PCs, so that PC-
oriented solutions are not always applicable, or do not oﬀer
comprehensive security. We propose an alternative solution,
where security checks are applied on remote security servers
that host exact replicas of the phones in virtual environ-
ments. The servers are not subject to the same constraints,
allowing us to apply multiple detection techniques simulta-
neously. We implemented a prototype of this security model
for Android phones, and show that it is both practical and
scalable: we generate no more than 2KiB/s and 64B/s of
trace data for high-loads and idle operation respectively, and
are able to support more than a hundred replicas running
on a single server.
Categories and Subject Descriptors
D.2.0 [General]: Protection mechanisms
General Terms
Design, Security, Reliability
Keywords
Decoupled security; Smartphones; Android
1.
INTRODUCTION
Smartphones have come to resemble general-purpose com-
puters:
in addition to traditional telephony stacks, calen-
∗This work was done while the author was in Vrije Univer-
siteit Amsterdam.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is grante...


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

Input:
title:Paranoid Android: versatile protection for smartphones
author:Georgios Portokalidis and
Philip Homburg and
Kostas Anagnostakis and
Herbert Bos
Paranoid Android: Versatile Protection For Smartphones
Georgios Portokalidis∗
Network Security Lab
Dept. of Computer Science
Columbia University, NY, USA
porto@cs.columbia.edu
Philip Homburg
Dept. of Computer Science
Amsterdam, The Netherlands
Vrije Universiteit
philip@cs.vu.nl
Kostas Anagnostakis
Niometris R&D
Singapore
kostas@niometrics.com
Herbert Bos
Dept. of Computer Science
Vrije Universiteit
Amsterdam, The Netherlands
herbertb@cs.vu.nl
ABSTRACT
Smartphone usage has been continuously increasing in re-
cent years. Moreover, smartphones are often used for privacy-
sensitive tasks, becoming highly valuable targets for attack-
ers. They are also quite diﬀerent from PCs, so that PC-
oriented solutions are not always applicable, or do not oﬀer
comprehensive security. We propose an alternative solution,
where security checks are applied on remote security servers
that host exact replicas of the phones in virtual environ-
ments. The servers are not subject to the same constraints,
allowing us to apply multiple detection techniques simulta-
neously. We implemented a prototype of this security model
for Android phones, and show that it is both practical and
scalable: we generate no more than 2KiB/s and 64B/s of
trace data for high-loads and idle operation respectively, and
are able to support more than a hundred replicas running
on a single server.
Categories and Subject Descriptors
D.2.0 [General]: Protection mechanisms
General Terms
Design, Security, Reliability
Keywords
Decoupled security; Smartphones; Android
1.
INTRODUCTION
Smartphones have come to resemble general-purpose com-
puters:
in addition to traditional telephony stacks, calen-
∗This work was done while the author was in Vrije Univer-
siteit Amsterdam.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is grante...

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


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

Output:
安全论文分析：

title:SAINTDroid: Scalable, Automated Incompatibility Detection for Android
author:Bruno Vieira Resende e Silva and
Clay Stevens and
Niloofar Mansoor and
Witawas Srisa-an and
Tingting Yu and
Hamid Bagheri
University of Nebraska - Lincoln
DigitalCommons@University of Nebraska - Lincoln
Computer Science and Engineering: Theses,
Dissertations, and Student Research
Computer Science and Engineering, Department of
4-2019
GAINDroid: General Automated Incompatibility
Notifier for Android Applications
Bruno Vieira Resende e Silva
University of Nebraska-Lincoln, bvrsilva1@gmail.com
Follow this and additional works at: https://digitalcommons.unl.edu/computerscidiss
Part of the Computer Engineering Commons, and the Computer Sciences Commons
Vieira Resende e Silva, Bruno, "GAINDroid: General Automated Incompatibility Notifier for Android Applications" (2019).
Computer Science and Engineering: Theses, Dissertations, and Student Research. 167.
https://digitalcommons.unl.edu/computerscidiss/167
This Article is brought to you for free and open access by the Computer Science and Engineering, Department of at DigitalCommons@University of
Nebraska - Lincoln. It has been accepted for inclusion in Computer Science and Engineering: Theses, Dissertations, and Student Research by an
authorized administrator of DigitalCommons@University of Nebraska - Lincoln.
GAINDROID: GENERAL AUTOMATED INCOMPATIBILITY NOTIFIER FOR
ANDROID APPLICATIONS
by
Bruno Vieira Resende e Silva
A THESIS
Presented to the Faculty of
The Graduate College at the University of Nebraska
In Partial Fulﬁlment of Requirements
For the Degree of Master of Science
Major: Computer Science
Under the Supervision of Hamid Bagheri
Lincoln, Nebraska
April, 2019
GAINDROID: GENERAL AUTOMATED INCOMPATIBILITY NOTIFIER FOR
ANDROID APPLICATIONS
Bruno Vieira Resende e Silva, M.S.
University of Nebraska, 2019
Adviser: Hamid Bagheri
With the ever-increasing popularity of mobile devices over the last decade,
mobile apps and the frameworks upon...


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

Input:
title:SAINTDroid: Scalable, Automated Incompatibility Detection for Android
author:Bruno Vieira Resende e Silva and
Clay Stevens and
Niloofar Mansoor and
Witawas Srisa-an and
Tingting Yu and
Hamid Bagheri
University of Nebraska - Lincoln
DigitalCommons@University of Nebraska - Lincoln
Computer Science and Engineering: Theses,
Dissertations, and Student Research
Computer Science and Engineering, Department of
4-2019
GAINDroid: General Automated Incompatibility
Notifier for Android Applications
Bruno Vieira Resende e Silva
University of Nebraska-Lincoln, bvrsilva1@gmail.com
Follow this and additional works at: https://digitalcommons.unl.edu/computerscidiss
Part of the Computer Engineering Commons, and the Computer Sciences Commons
Vieira Resende e Silva, Bruno, "GAINDroid: General Automated Incompatibility Notifier for Android Applications" (2019).
Computer Science and Engineering: Theses, Dissertations, and Student Research. 167.
https://digitalcommons.unl.edu/computerscidiss/167
This Article is brought to you for free and open access by the Computer Science and Engineering, Department of at DigitalCommons@University of
Nebraska - Lincoln. It has been accepted for inclusion in Computer Science and Engineering: Theses, Dissertations, and Student Research by an
authorized administrator of DigitalCommons@University of Nebraska - Lincoln.
GAINDROID: GENERAL AUTOMATED INCOMPATIBILITY NOTIFIER FOR
ANDROID APPLICATIONS
by
Bruno Vieira Resende e Silva
A THESIS
Presented to the Faculty of
The Graduate College at the University of Nebraska
In Partial Fulﬁlment of Requirements
For the Degree of Master of Science
Major: Computer Science
Under the Supervision of Hamid Bagheri
Lincoln, Nebraska
April, 2019
GAINDROID: GENERAL AUTOMATED INCOMPATIBILITY NOTIFIER FOR
ANDROID APPLICATIONS
Bruno Vieira Resende e Silva, M.S.
University of Nebraska, 2019
Adviser: Hamid Bagheri
With the ever-increasing popularity of mobile devices over the last decade,
mobile apps and the frameworks upon...

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


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

Output:
安全论文分析：

title:From WHOIS to WHOWAS: A Large-Scale Measurement Study of Domain
Registration Privacy under the GDPR
author:Chaoyi Lu and
Baojun Liu and
Yiming Zhang and
Zhou Li and
Fenglu Zhang and
Haixin Duan and
Ying Liu and
Joann Qiongna Chen and
Jinjin Liang and
Zaifeng Zhang and
Shuang Hao and
Min Yang
From WHOIS to WHOWAS: A Large-Scale
Measurement Study of Domain Registration Privacy
under the GDPR
Chaoyi Lu∗†, Baojun Liu∗†¶(cid:66), Yiming Zhang∗†, Zhou Li§, Fenglu Zhang∗, Haixin Duan∗¶(cid:66),
Ying Liu∗, Joann Qiongna Chen§, Jinjin Liang, Zaifeng Zhang, Shuang Hao∗∗ and Min Yang††
∗Tsinghua University, †Beijing National Research Center for Information Science and Technology,
∗∗University of Texas at Dallas, shao@utdallas.edu, ††Fudan University, m yang@fudan.edu.cn
¶Qi An Xin Group, 360 Netlab, {liangjinjin, zhangzaifeng}@360.cn,
{lcy17, zhangyim17, zﬂ20}@mails.tsinghua.edu.cn, {lbj, duanhx}@mail.tsinghua.edu.cn, liuying@cernet.edu.cn
§University of California, Irvine, {zhou.li, joann.chen}@uci.edu,
Abstract—When a domain is registered, information about the
registrants  and  other  related  personnel  is  recorded  by  WHOIS
databases  owned  by  registrars  or  registries  (called  WHOIS
providers  jointly),  which  are  open  to  public  inquiries.  However,
due  to  the  enforcement  of  the  European  Union’s  General  Data
Protection  Regulation  (GDPR),  certain  WHOIS  data  (i.e.,  the
records about EEA, or the European Economic Area, registrants)
needs  to  be  redacted  before  being  released  to  the  public.  Anec-
dotally,  it  was  reported  that  actions  have  been  taken  by  some
WHOIS  providers.  Yet,  so  far  there  is  no  systematic  study  to
quantify the changes made by the WHOIS providers in response
to  the  GDPR,  their  strategies  for  data  redaction  and  impact  on
other  applications  relying  on  WHOIS  data.
In  this  study,  we  report  the  ﬁrst  large-scale  measurement
study to answer these questions, in hope...


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

Input:
title:From WHOIS to WHOWAS: A Large-Scale Measurement Study of Domain
Registration Privacy under the GDPR
author:Chaoyi Lu and
Baojun Liu and
Yiming Zhang and
Zhou Li and
Fenglu Zhang and
Haixin Duan and
Ying Liu and
Joann Qiongna Chen and
Jinjin Liang and
Zaifeng Zhang and
Shuang Hao and
Min Yang
From WHOIS to WHOWAS: A Large-Scale
Measurement Study of Domain Registration Privacy
under the GDPR
Chaoyi Lu∗†, Baojun Liu∗†¶(cid:66), Yiming Zhang∗†, Zhou Li§, Fenglu Zhang∗, Haixin Duan∗¶(cid:66),
Ying Liu∗, Joann Qiongna Chen§, Jinjin Liang, Zaifeng Zhang, Shuang Hao∗∗ and Min Yang††
∗Tsinghua University, †Beijing National Research Center for Information Science and Technology,
∗∗University of Texas at Dallas, shao@utdallas.edu, ††Fudan University, m yang@fudan.edu.cn
¶Qi An Xin Group, 360 Netlab, {liangjinjin, zhangzaifeng}@360.cn,
{lcy17, zhangyim17, zﬂ20}@mails.tsinghua.edu.cn, {lbj, duanhx}@mail.tsinghua.edu.cn, liuying@cernet.edu.cn
§University of California, Irvine, {zhou.li, joann.chen}@uci.edu,
Abstract—When a domain is registered, information about the
registrants  and  other  related  personnel  is  recorded  by  WHOIS
databases  owned  by  registrars  or  registries  (called  WHOIS
providers  jointly),  which  are  open  to  public  inquiries.  However,
due  to  the  enforcement  of  the  European  Union’s  General  Data
Protection  Regulation  (GDPR),  certain  WHOIS  data  (i.e.,  the
records about EEA, or the European Economic Area, registrants)
needs  to  be  redacted  before  being  released  to  the  public.  Anec-
dotally,  it  was  reported  that  actions  have  been  taken  by  some
WHOIS  providers.  Yet,  so  far  there  is  no  systematic  study  to
quantify the changes made by the WHOIS providers in response
to  the  GDPR,  their  strategies  for  data  redaction  and  impact  on
other  applications  relying  on  WHOIS  data.
In  this  study,  we  report  the  ﬁrst  large-scale  measurement
study to answer these questions, in hope...

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


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

Output:
安全论文分析：

title:ILR: Where'd My Gadgets Go?
author:Jason Hiser and
Anh Nguyen-Tuong and
Michele Co and
Matthew Hall and
Jack W. Davidson
2012 IEEE Symposium on Security and Privacy
ILR: Where’d My Gadgets Go?
Jason Hiser, Anh Nguyen-Tuong, Michele Co, Matthew Hall, Jack W. Davidson
University of Virginia, Department of Computer Science
Charlottesville, VA
{hiser,an7s,mc2zk,mh,jwd}@virginia.edu
Abstract—Through randomization of the memory space and
the conﬁnement of code to non-data pages, computer security
researchers have made a wide range of attacks against program
binaries more difﬁcult. However, attacks have evolved to exploit
weaknesses in these defenses.
To thwart these attacks, we introduce a novel technique
called Instruction Location Randomization (ILR). Conceptu-
ally, ILR randomizes the location of every instruction in a
program, thwarting an attacker’s ability to re-use program
functionality (e.g., arc-injection attacks and return-oriented
programming attacks).
ILR operates on arbitrary executable programs, requires
no compiler support, and requires no user interaction. Thus,
it can be automatically applied post-deployment, allowing easy
and frequent re-randomization.
Our preliminary prototype, working on 32-bit x86 Linux
ELF binaries, provides a high degree of entropy. Individual
instructions are randomly placed within a 31-bit address
space. Thus, attacks that rely on a priori knowledge of the
location of code or derandomization are not feasible. We
demonstrated ILR’s defensive capabilities by defeating attacks
against programs with vulnerabilities, including Adobe’s PDF
viewer, acroread, which had an in-the-wild vulnerability.
Additionally, using an industry-standard CPU performance
benchmark suite, we compared the run time of prototype
ILR-protected executables to that of native executables. The
average run-time overhead of ILR was 13% with more than
half the programs having effectively no overhead (15 out of 29),
indicating that ILR is a realistic and cost-ef...


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

Input:
title:ILR: Where'd My Gadgets Go?
author:Jason Hiser and
Anh Nguyen-Tuong and
Michele Co and
Matthew Hall and
Jack W. Davidson
2012 IEEE Symposium on Security and Privacy
ILR: Where’d My Gadgets Go?
Jason Hiser, Anh Nguyen-Tuong, Michele Co, Matthew Hall, Jack W. Davidson
University of Virginia, Department of Computer Science
Charlottesville, VA
{hiser,an7s,mc2zk,mh,jwd}@virginia.edu
Abstract—Through randomization of the memory space and
the conﬁnement of code to non-data pages, computer security
researchers have made a wide range of attacks against program
binaries more difﬁcult. However, attacks have evolved to exploit
weaknesses in these defenses.
To thwart these attacks, we introduce a novel technique
called Instruction Location Randomization (ILR). Conceptu-
ally, ILR randomizes the location of every instruction in a
program, thwarting an attacker’s ability to re-use program
functionality (e.g., arc-injection attacks and return-oriented
programming attacks).
ILR operates on arbitrary executable programs, requires
no compiler support, and requires no user interaction. Thus,
it can be automatically applied post-deployment, allowing easy
and frequent re-randomization.
Our preliminary prototype, working on 32-bit x86 Linux
ELF binaries, provides a high degree of entropy. Individual
instructions are randomly placed within a 31-bit address
space. Thus, attacks that rely on a priori knowledge of the
location of code or derandomization are not feasible. We
demonstrated ILR’s defensive capabilities by defeating attacks
against programs with vulnerabilities, including Adobe’s PDF
viewer, acroread, which had an in-the-wild vulnerability.
Additionally, using an industry-standard CPU performance
benchmark suite, we compared the run time of prototype
ILR-protected executables to that of native executables. The
average run-time overhead of ILR was 13% with more than
half the programs having effectively no overhead (15 out of 29),
indicating that ILR is a realistic and cost-ef...

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


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

Output:
安全论文分析：

title:Fragment and Forge: Breaking Wi-Fi Through Frame Aggregation and Fragmentation
author:Mathy Vanhoef
Fragment and Forge: Breaking Wi-Fi Through
Frame Aggregation and Fragmentation
Mathy Vanhoef, New York University Abu Dhabi
https://www.usenix.org/conference/usenixsecurity21/presentation/vanhoef
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.Fragment and Forge: Breaking Wi-Fi Through
Frame Aggregation and Fragmentation
Mathy Vanhoef
New York University Abu Dhabi
mathy.vanhoef@nyu.edu
Abstract
In this paper, we present three design ﬂaws in the 802.11
standard that underpins Wi-Fi. One design ﬂaw is in the frame
aggregation functionality, and another two are in the frame
fragmentation functionality. These design ﬂaws enable an
adversary to forge encrypted frames in various ways, which in
turn enables exﬁltration of sensitive data. We also discovered
common implementation ﬂaws related to aggregation and
fragmentation, which further worsen the impact of our attacks.
Our results affect all protected Wi-Fi networks, ranging from
WEP all the way to WPA3, meaning the discovered ﬂaws
have been part of Wi-Fi since its release in 1997. In our
experiments, all devices were vulnerable to one or more of our
attacks, conﬁrming that all Wi-Fi devices are likely affected.
Finally, we present a tool to test whether devices are affected
by any of the vulnerabilities, and we discuss countermeasures
to prevent our attacks.
1 Introduction
In the last few years, major improvements have been made to
the security of Wi-Fi. Most notably this includes the discov-
ery and prevention of key reinstallation in WPA2 [18, 57, 58],
and the standardization of WPA3 which, among other things,
prevents ofﬂine dictionary attacks [60]. Additionally, extra
defenses have been standardized, such as operating channel
validation and beacon protec...


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

Input:
title:Fragment and Forge: Breaking Wi-Fi Through Frame Aggregation and Fragmentation
author:Mathy Vanhoef
Fragment and Forge: Breaking Wi-Fi Through
Frame Aggregation and Fragmentation
Mathy Vanhoef, New York University Abu Dhabi
https://www.usenix.org/conference/usenixsecurity21/presentation/vanhoef
This paper is included in the Proceedings of the 30th USENIX Security Symposium.August 11–13, 2021978-1-939133-24-3Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX.Fragment and Forge: Breaking Wi-Fi Through
Frame Aggregation and Fragmentation
Mathy Vanhoef
New York University Abu Dhabi
mathy.vanhoef@nyu.edu
Abstract
In this paper, we present three design ﬂaws in the 802.11
standard that underpins Wi-Fi. One design ﬂaw is in the frame
aggregation functionality, and another two are in the frame
fragmentation functionality. These design ﬂaws enable an
adversary to forge encrypted frames in various ways, which in
turn enables exﬁltration of sensitive data. We also discovered
common implementation ﬂaws related to aggregation and
fragmentation, which further worsen the impact of our attacks.
Our results affect all protected Wi-Fi networks, ranging from
WEP all the way to WPA3, meaning the discovered ﬂaws
have been part of Wi-Fi since its release in 1997. In our
experiments, all devices were vulnerable to one or more of our
attacks, conﬁrming that all Wi-Fi devices are likely affected.
Finally, we present a tool to test whether devices are affected
by any of the vulnerabilities, and we discuss countermeasures
to prevent our attacks.
1 Introduction
In the last few years, major improvements have been made to
the security of Wi-Fi. Most notably this includes the discov-
ery and prevention of key reinstallation in WPA2 [18, 57, 58],
and the standardization of WPA3 which, among other things,
prevents ofﬂine dictionary attacks [60]. Additionally, extra
defenses have been standardized, such as operating channel
validation and beacon protec...

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


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

Output:
安全论文分析：

title:Improving secure server performance by re-balancing SSL/TLS handshakes
author:Claude Castelluccia and
Einar Mykletun and
Gene Tsudik
Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes
Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes
Claude Castelluccia
Zirst - 655 avenue de l’Europe
38334 Saint Ismier Cedex
INRIA
France
Einar Mykletun, Gene Tsudik
Computer Science
University of California, Irvine
Irvine, CA 92697-3425
USA
Claude.Castelluccia@inria.fr
{mykletun,gts}@ics.uci.edu
ABSTRACT
Much of today’s distributed computing takes place in a client
/server model. Despite advances in fault tolerance – in par-
ticular, replication and load distribution – server overload
remains to be a major problem. In the Web context, one
of the main overload factors is the direct consequence of ex-
pensive Public Key operations performed by servers as part
of each SSL handshake. Since most SSL-enabled servers
use RSA, the burden of performing many costly decryption
operations can be very detrimental to server performance.
This paper examines a promising technique for re-balancing
RSA-based client/server handshakes. This technique facil-
itates more favorable load distribution by requiring clients
to perform more work (as part of encryption) and servers to
perform commensurately less work, thus resulting in better
SSL throughput. Proposed techniques are based on careful
adaptation of variants of Server-Aided RSA originally
constructed by Matsumoto, et al.
[1]. Experimental re-
sults demonstrate that suggested methods (termed Client-
Aided RSA) can speed up processing of RSA private key
operations by a factor of between 11 to 19, depending on the
RSA key size. This represents a considerable improvement.
Furthermore, proposed techniques can be a useful compan-
ion tool for SSL Client Puzzles in defense against DoS and
DDoS attacks.
Keywords: Load-balancing, Server-Aided RSA, Denial-of-
Service, Server-Aided Secure Computation, Client Puzzl...


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

Input:
title:Improving secure server performance by re-balancing SSL/TLS handshakes
author:Claude Castelluccia and
Einar Mykletun and
Gene Tsudik
Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes
Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes
Claude Castelluccia
Zirst - 655 avenue de l’Europe
38334 Saint Ismier Cedex
INRIA
France
Einar Mykletun, Gene Tsudik
Computer Science
University of California, Irvine
Irvine, CA 92697-3425
USA
Claude.Castelluccia@inria.fr
{mykletun,gts}@ics.uci.edu
ABSTRACT
Much of today’s distributed computing takes place in a client
/server model. Despite advances in fault tolerance – in par-
ticular, replication and load distribution – server overload
remains to be a major problem. In the Web context, one
of the main overload factors is the direct consequence of ex-
pensive Public Key operations performed by servers as part
of each SSL handshake. Since most SSL-enabled servers
use RSA, the burden of performing many costly decryption
operations can be very detrimental to server performance.
This paper examines a promising technique for re-balancing
RSA-based client/server handshakes. This technique facil-
itates more favorable load distribution by requiring clients
to perform more work (as part of encryption) and servers to
perform commensurately less work, thus resulting in better
SSL throughput. Proposed techniques are based on careful
adaptation of variants of Server-Aided RSA originally
constructed by Matsumoto, et al.
[1]. Experimental re-
sults demonstrate that suggested methods (termed Client-
Aided RSA) can speed up processing of RSA private key
operations by a factor of between 11 to 19, depending on the
RSA key size. This represents a considerable improvement.
Furthermore, proposed techniques can be a useful compan-
ion tool for SSL Client Puzzles in defense against DoS and
DDoS attacks.
Keywords: Load-balancing, Server-Aided RSA, Denial-of-
Service, Server-Aided Secure Computation, Client Puzzl...

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


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

Output:
安全论文分析：

title:Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive
Streams by Exploiting Maximum Tolerable Delay
author:David L. Donoho and
Ana Georgina Flesia and
Umesh Shankar and
Vern Paxson and
Jason Coit and
Stuart Staniford
Multiscale Stepping-Stone Detection:
Detecting Pairs of Jittered Interactive Streams
by Exploiting Maximum Tolerable Delay
David L. Donoho1, Ana Georgina Flesia1, Umesh Shankar2, Vern Paxson3,
Jason Coit4, and Stuart Staniford4
1 Department of Statistics, Stanford University
Sequoia Hall, 390 Serra Mall, Stanford, CA 94305-4065 USA
{donoho,flesia}@stanford.edu
2 Department of Computer Science, University of California at Berkeley
567 Soda Hall, Berkeley, CA 94704
ushankar@cs.berkeley.edu
3 International Computer Science Institute
1947 Center St. suite 600, Berkeley, CA 94704-1198
vern@icir.org
4 Silicon Defense
203 F Street, suit E, Davis, CA95616, USA
{stuart,jasonc}@silicondefense.com
Abstract. Computer attackers frequently relay their attacks through a
compromised host at an innocent site, thereby obscuring the true origin
of the attack. There is a growing literature on ways to detect that an
interactive connection into a site and another outbound from the site
give evidence of such a “stepping stone.” This has been done based on
monitoring the access link connecting the site to the Internet (Eg. [7,11,
8]). The earliest work was based on connection content comparisons but
more recent work has relied on timing information in order to compare
encrypted connections.
Past work on this problem has not yet attempted to cope with the
ways in which intruders might attempt to modify their traﬃc to defeat
stepping stone detection. In this paper we give the ﬁrst consideration
to constraining such intruder evasion. We present some unexpected
results that show there are theoretical limits on the ability of attackers
to disguise their traﬃc in this way for suﬃciently long connections.
We consider evasions that consist of local jitteri...


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

Input:
title:Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive
Streams by Exploiting Maximum Tolerable Delay
author:David L. Donoho and
Ana Georgina Flesia and
Umesh Shankar and
Vern Paxson and
Jason Coit and
Stuart Staniford
Multiscale Stepping-Stone Detection:
Detecting Pairs of Jittered Interactive Streams
by Exploiting Maximum Tolerable Delay
David L. Donoho1, Ana Georgina Flesia1, Umesh Shankar2, Vern Paxson3,
Jason Coit4, and Stuart Staniford4
1 Department of Statistics, Stanford University
Sequoia Hall, 390 Serra Mall, Stanford, CA 94305-4065 USA
{donoho,flesia}@stanford.edu
2 Department of Computer Science, University of California at Berkeley
567 Soda Hall, Berkeley, CA 94704
ushankar@cs.berkeley.edu
3 International Computer Science Institute
1947 Center St. suite 600, Berkeley, CA 94704-1198
vern@icir.org
4 Silicon Defense
203 F Street, suit E, Davis, CA95616, USA
{stuart,jasonc}@silicondefense.com
Abstract. Computer attackers frequently relay their attacks through a
compromised host at an innocent site, thereby obscuring the true origin
of the attack. There is a growing literature on ways to detect that an
interactive connection into a site and another outbound from the site
give evidence of such a “stepping stone.” This has been done based on
monitoring the access link connecting the site to the Internet (Eg. [7,11,
8]). The earliest work was based on connection content comparisons but
more recent work has relied on timing information in order to compare
encrypted connections.
Past work on this problem has not yet attempted to cope with the
ways in which intruders might attempt to modify their traﬃc to defeat
stepping stone detection. In this paper we give the ﬁrst consideration
to constraining such intruder evasion. We present some unexpected
results that show there are theoretical limits on the ability of attackers
to disguise their traﬃc in this way for suﬃciently long connections.
We consider evasions that consist of local jitteri...

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


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

Output:
安全论文分析：

title:Compromising Security of Economic Dispatch in Power System Operations
author:Devendra Shelar and
Pengfei Sun and
Saurabh Amin and
Saman A. Zonouz
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Compromising Security of Economic Dispatch
in Power System Operations
Devendra Shelar:, Pengfei Sun˚, Saurabh Amin: and Saman Zonouz˚
Civil and Environmental Engineering, ˚Electrical and Computer Engineering
:Massachusetts Institute of Technology, ˚Rutgers University
{shelard, amins}@mit.edu, {pengfei.sun, saman.zonouz}@rutgers.edu
Abstract—Power grid operations rely on the trustworthy op-
eration of critical control center functionalities, including the so-
called Economic Dispatch (ED) problem. The ED problem is a
large-scale optimization problem that is periodically solved by the
system operator to ensure the balance of supply and load while
maintaining reliability constraints. In this paper, we propose a
semantics-based attack generation and implementation approach
to study the security of the ED problem.1 Firstly, we generate
optimal attack vectors to transmission line ratings to induce
maximum congestion in the critical lines, resulting in the violation
of capacity limits. We formulate a bilevel optimization problem in
which the attacker chooses manipulations of line capacity ratings
to maximinimize the percentage line capacity violations under
linear power ﬂows. We reformulate the bilevel problem as a mixed
integer linear program that can be solved efﬁciently. Secondly,
we describe how the optimal attack vectors can be implemented
in commercial energy management systems (EMSs). The attack
explores the dynamic memory space of the EMS, and replaces
the true line capacity ratings stored in data regions with the
optimal attack vectors. In contrast to the well-known false data
injection attacks to control systems that require compromising
distributed sensors, our approach directly implements attacks to
the control center server. ...


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

Input:
title:Compromising Security of Economic Dispatch in Power System Operations
author:Devendra Shelar and
Pengfei Sun and
Saurabh Amin and
Saman A. Zonouz
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Compromising Security of Economic Dispatch
in Power System Operations
Devendra Shelar:, Pengfei Sun˚, Saurabh Amin: and Saman Zonouz˚
Civil and Environmental Engineering, ˚Electrical and Computer Engineering
:Massachusetts Institute of Technology, ˚Rutgers University
{shelard, amins}@mit.edu, {pengfei.sun, saman.zonouz}@rutgers.edu
Abstract—Power grid operations rely on the trustworthy op-
eration of critical control center functionalities, including the so-
called Economic Dispatch (ED) problem. The ED problem is a
large-scale optimization problem that is periodically solved by the
system operator to ensure the balance of supply and load while
maintaining reliability constraints. In this paper, we propose a
semantics-based attack generation and implementation approach
to study the security of the ED problem.1 Firstly, we generate
optimal attack vectors to transmission line ratings to induce
maximum congestion in the critical lines, resulting in the violation
of capacity limits. We formulate a bilevel optimization problem in
which the attacker chooses manipulations of line capacity ratings
to maximinimize the percentage line capacity violations under
linear power ﬂows. We reformulate the bilevel problem as a mixed
integer linear program that can be solved efﬁciently. Secondly,
we describe how the optimal attack vectors can be implemented
in commercial energy management systems (EMSs). The attack
explores the dynamic memory space of the EMS, and replaces
the true line capacity ratings stored in data regions with the
optimal attack vectors. In contrast to the well-known false data
injection attacks to control systems that require compromising
distributed sensors, our approach directly implements attacks to
the control center server. ...

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


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

Output:
安全论文分析：

title:Vetting Single Sign-On SDK Implementations via Symbolic Reasoning
author:Ronghai Yang and
Wing Cheong Lau and
Jiongyi Chen and
Kehuan Zhang
Vetting Single Sign-On SDK Implementations
via Symbolic Reasoning
Ronghai Yang, The Chinese University of Hong Kong, Sangfor Technologies Inc.;
 Wing Cheong Lau, Jiongyi Chen, and Kehuan Zhang, The Chinese University of Hong Kong
https://www.usenix.org/conference/usenixsecurity18/presentation/yang
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.Vetting Single Sign-On SDK Implementations via Symbolic Reasoning
Ronghai Yang1,2, Wing Cheong Lau1, Jiongyi Chen1, and Kehuan Zhang1
1The Chinese University of Hong Kong,
2Sangfor Technologies Inc.
Abstract
Encouraged by the rapid adoption of Single Sign-On
(SSO) technology in web services, mainstream identity
providers, such as Facebook and Google, have devel-
oped Software Development Kits (SDKs) to facilitate
the implementation of SSO for 3rd-party application de-
velopers. These SDKs have become a critical foun-
dation for web services. Despite its importance, little
effort has been devoted to a systematic testing on the
implementations of SSO SDKs, especially in the pub-
lic domain.
In this paper, we design and implement
S3KVetter (Single-Sign-on SdK Vetter), an automated,
efﬁcient testing tool, to check the logical correctness and
identify vulnerabilities of SSO SDKs. To demonstrate
the efﬁcacy of S3KVetter, we apply it to test ten popular
SSO SDKs which enjoy millions of downloads by ap-
plication developers. Among these carefully engineered
SDKs, S3KVetter has surprisingly discovered 7 classes
of logic ﬂaws, 4 of which were previously unknown.
These vulnerabilities can lead to severe consequences,
ranging from the snifﬁng of user activities to the hijack-
ing of user accounts.
1
Introductio...


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

Input:
title:Vetting Single Sign-On SDK Implementations via Symbolic Reasoning
author:Ronghai Yang and
Wing Cheong Lau and
Jiongyi Chen and
Kehuan Zhang
Vetting Single Sign-On SDK Implementations
via Symbolic Reasoning
Ronghai Yang, The Chinese University of Hong Kong, Sangfor Technologies Inc.;
 Wing Cheong Lau, Jiongyi Chen, and Kehuan Zhang, The Chinese University of Hong Kong
https://www.usenix.org/conference/usenixsecurity18/presentation/yang
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.Vetting Single Sign-On SDK Implementations via Symbolic Reasoning
Ronghai Yang1,2, Wing Cheong Lau1, Jiongyi Chen1, and Kehuan Zhang1
1The Chinese University of Hong Kong,
2Sangfor Technologies Inc.
Abstract
Encouraged by the rapid adoption of Single Sign-On
(SSO) technology in web services, mainstream identity
providers, such as Facebook and Google, have devel-
oped Software Development Kits (SDKs) to facilitate
the implementation of SSO for 3rd-party application de-
velopers. These SDKs have become a critical foun-
dation for web services. Despite its importance, little
effort has been devoted to a systematic testing on the
implementations of SSO SDKs, especially in the pub-
lic domain.
In this paper, we design and implement
S3KVetter (Single-Sign-on SdK Vetter), an automated,
efﬁcient testing tool, to check the logical correctness and
identify vulnerabilities of SSO SDKs. To demonstrate
the efﬁcacy of S3KVetter, we apply it to test ten popular
SSO SDKs which enjoy millions of downloads by ap-
plication developers. Among these carefully engineered
SDKs, S3KVetter has surprisingly discovered 7 classes
of logic ﬂaws, 4 of which were previously unknown.
These vulnerabilities can lead to severe consequences,
ranging from the snifﬁng of user activities to the hijack-
ing of user accounts.
1
Introductio...

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


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

Output:
安全论文分析：

title:RAPTOR: Routing Attacks on Privacy in Tor
author:Yixin Sun and
Anne Edmundson and
Laurent Vanbever and
Oscar Li and
Jennifer Rexford and
Mung Chiang and
Prateek Mittal
RAPTOR: Routing Attacks on Privacy in Tor
Yixin Sun and Anne Edmundson, Princeton University; Laurent Vanbever, ETH Zürich;
Oscar Li, Jennifer Rexford, Mung Chiang, and Prateek Mittal, Princeton University
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/sun
This paper is included in the Proceedings of the 24th USENIX Security SymposiumAugust 12–14, 2015 • Washington, D.C.ISBN 978-1-939133-11-3Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXRAPTOR: Routing Attacks on Privacy in Tor
Yixin Sun
Princeton University
Anne Edmundson
Princeton University
Laurent Vanbever
ETH Zurich
Oscar Li
Princeton University
Jennifer Rexford
Princeton University
Mung Chiang
Princeton University
Prateek Mittal
Princeton University
Abstract
The Tor network is a widely used system for anony-
mous communication. However, Tor is known to be
vulnerable to attackers who can observe trafﬁc at both
ends of the communication path. In this paper, we show
that prior attacks are just the tip of the iceberg. We
present a suite of new attacks, called Raptor, that can
be launched by Autonomous Systems (ASes) to com-
promise user anonymity. First, AS-level adversaries can
exploit the asymmetric nature of Internet routing to in-
crease the chance of observing at least one direction of
user trafﬁc at both ends of the communication. Second,
AS-level adversaries can exploit natural churn in Inter-
net routing to lie on the BGP paths for more users over
time. Third, strategic adversaries can manipulate Inter-
net routing via BGP hijacks (to discover the users using
speciﬁc Tor guard nodes) and interceptions (to perform
trafﬁc analysis). We demonstrate the feasibility of Rap-
tor attacks by analyzing historical BGP data and Tracer-
oute data as well as perfor...


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

Input:
title:RAPTOR: Routing Attacks on Privacy in Tor
author:Yixin Sun and
Anne Edmundson and
Laurent Vanbever and
Oscar Li and
Jennifer Rexford and
Mung Chiang and
Prateek Mittal
RAPTOR: Routing Attacks on Privacy in Tor
Yixin Sun and Anne Edmundson, Princeton University; Laurent Vanbever, ETH Zürich;
Oscar Li, Jennifer Rexford, Mung Chiang, and Prateek Mittal, Princeton University
https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/sun
This paper is included in the Proceedings of the 24th USENIX Security SymposiumAugust 12–14, 2015 • Washington, D.C.ISBN 978-1-939133-11-3Open access to the Proceedings of  the 24th USENIX Security Symposium is sponsored by USENIXRAPTOR: Routing Attacks on Privacy in Tor
Yixin Sun
Princeton University
Anne Edmundson
Princeton University
Laurent Vanbever
ETH Zurich
Oscar Li
Princeton University
Jennifer Rexford
Princeton University
Mung Chiang
Princeton University
Prateek Mittal
Princeton University
Abstract
The Tor network is a widely used system for anony-
mous communication. However, Tor is known to be
vulnerable to attackers who can observe trafﬁc at both
ends of the communication path. In this paper, we show
that prior attacks are just the tip of the iceberg. We
present a suite of new attacks, called Raptor, that can
be launched by Autonomous Systems (ASes) to com-
promise user anonymity. First, AS-level adversaries can
exploit the asymmetric nature of Internet routing to in-
crease the chance of observing at least one direction of
user trafﬁc at both ends of the communication. Second,
AS-level adversaries can exploit natural churn in Inter-
net routing to lie on the BGP paths for more users over
time. Third, strategic adversaries can manipulate Inter-
net routing via BGP hijacks (to discover the users using
speciﬁc Tor guard nodes) and interceptions (to perform
trafﬁc analysis). We demonstrate the feasibility of Rap-
tor attacks by analyzing historical BGP data and Tracer-
oute data as well as perfor...

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


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

Output:
安全论文分析：

title:TEA: Enabling State-Intensive Network Functions on Programmable
Switches
author:Daehyeok Kim and
Zaoxing Liu and
Yibo Zhu and
Changhoon Kim and
Jeongkeun Lee and
Vyas Sekar and
Srinivasan Seshan
TEA: Enabling State-Intensive Network Functions on
Programmable Switches
Yibo Zhu
Zaoxing Liu
ByteDance Inc.
Carnegie Mellon University
and Boston University
Daehyeok Kim
Carnegie Mellon University
and Microsoft Research
Changhoon Kim
Intel, Barefoot Switch
Division
Jeongkeun Lee
Intel, Barefoot Switch
Division
Vyas Sekar
Carnegie Mellon University
Srinivasan Seshan
Carnegie Mellon University
Abstract
Programmable switches have been touted as an attractive alterna-
tive for deploying network functions (NFs) such as network address
translators (NATs), load balancers, and firewalls. However, their
limited memory capacity has been a major stumbling block that has
stymied their adoption for supporting state-intensive NFs such as
cloud-scale NATs and load balancers that maintain millions of flow-
table entries. In this paper, we explore a new approach that leverages
DRAM on servers available in typical NFV clusters. Our new system
architecture, called TEA (Table Extension Architecture), provides a
virtual table abstraction that allows NFs on programmable switches
to look up large virtual tables built on external DRAM. Our ap-
proach enables switch ASICs to access external DRAM purely in
the data plane without involving CPUs on servers. We address
key design and implementation challenges in realizing this idea.
We demonstrate its feasibility and practicality with our implemen-
tation on a Tofino-based programmable switch. Our evaluation
shows that NFs built with TEA can look up table entries on exter-
nal DRAM with low and predictable latency (1.8–2.2 µs) and the
lookup throughput can be linearly scaled with additional servers
(138 million lookups per seconds with 8 servers).
CCS Concepts
• Networks → Programmable networks; In-network process-
ing; • Hardware → Emerging tech...


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

Input:
title:TEA: Enabling State-Intensive Network Functions on Programmable
Switches
author:Daehyeok Kim and
Zaoxing Liu and
Yibo Zhu and
Changhoon Kim and
Jeongkeun Lee and
Vyas Sekar and
Srinivasan Seshan
TEA: Enabling State-Intensive Network Functions on
Programmable Switches
Yibo Zhu
Zaoxing Liu
ByteDance Inc.
Carnegie Mellon University
and Boston University
Daehyeok Kim
Carnegie Mellon University
and Microsoft Research
Changhoon Kim
Intel, Barefoot Switch
Division
Jeongkeun Lee
Intel, Barefoot Switch
Division
Vyas Sekar
Carnegie Mellon University
Srinivasan Seshan
Carnegie Mellon University
Abstract
Programmable switches have been touted as an attractive alterna-
tive for deploying network functions (NFs) such as network address
translators (NATs), load balancers, and firewalls. However, their
limited memory capacity has been a major stumbling block that has
stymied their adoption for supporting state-intensive NFs such as
cloud-scale NATs and load balancers that maintain millions of flow-
table entries. In this paper, we explore a new approach that leverages
DRAM on servers available in typical NFV clusters. Our new system
architecture, called TEA (Table Extension Architecture), provides a
virtual table abstraction that allows NFs on programmable switches
to look up large virtual tables built on external DRAM. Our ap-
proach enables switch ASICs to access external DRAM purely in
the data plane without involving CPUs on servers. We address
key design and implementation challenges in realizing this idea.
We demonstrate its feasibility and practicality with our implemen-
tation on a Tofino-based programmable switch. Our evaluation
shows that NFs built with TEA can look up table entries on exter-
nal DRAM with low and predictable latency (1.8–2.2 µs) and the
lookup throughput can be linearly scaled with additional servers
(138 million lookups per seconds with 8 servers).
CCS Concepts
• Networks → Programmable networks; In-network process-
ing; • Hardware → Emerging tech...

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


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

Output:
安全论文分析：

title:Central Control Over Distributed Routing
author:Stefano Vissicchio and
Olivier Tilmans and
Laurent Vanbever and
Jennifer Rexford
Central Control Over Distributed Routing
http://fibbing.net
Stefano Vissicchio∗∗, Olivier Tilmans∗, Laurent Vanbever†, Jennifer Rexford‡
∗ Université catholique de Louvain, † ETH Zurich, ‡ Princeton University
∗ name.surname@uclouvain.be, †lvanbever@ethz.ch, ‡jrex@cs.princeton.edu
ABSTRACT
Centralizing routing decisions oﬀers tremendous ﬂexi-
bility, but sacriﬁces the robustness of distributed proto-
cols. In this paper, we present Fibbing, an architecture
that achieves both ﬂexibility and robustness through
central control over distributed routing. Fibbing in-
troduces fake nodes and links into an underlying link-
state routing protocol, so that routers compute their
own forwarding tables based on the augmented topol-
ogy. Fibbing is expressive, and readily supports ﬂexible
load balancing, traﬃc engineering, and backup routes.
Based on high-level forwarding requirements, the Fib-
bing controller computes a compact augmented topol-
ogy and injects the fake components through standard
routing-protocol messages. Fibbing works with any un-
modiﬁed routers speaking OSPF. Our experiments also
show that it can scale to large networks with many
forwarding requirements, introduces minimal overhead,
and quickly reacts to network and controller failures.
CCS Concepts
•Networks → Routing protocols; Network architec-
tures; Programmable networks; Network management;
Keywords
Fibbing; SDN; link-state routing
1.
INTRODUCTION
Consider a large IP network with hundreds of devices,
including the components shown in Fig. 1a. A set of
IP addresses (D1) see a sudden surge of traﬃc, from
multiple entry points (A, D, and E), that congests a
∗S. Vissicchio is a postdoctoral researcher of F.R.S.-FNRS.
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or...


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

Input:
title:Central Control Over Distributed Routing
author:Stefano Vissicchio and
Olivier Tilmans and
Laurent Vanbever and
Jennifer Rexford
Central Control Over Distributed Routing
http://fibbing.net
Stefano Vissicchio∗∗, Olivier Tilmans∗, Laurent Vanbever†, Jennifer Rexford‡
∗ Université catholique de Louvain, † ETH Zurich, ‡ Princeton University
∗ name.surname@uclouvain.be, †lvanbever@ethz.ch, ‡jrex@cs.princeton.edu
ABSTRACT
Centralizing routing decisions oﬀers tremendous ﬂexi-
bility, but sacriﬁces the robustness of distributed proto-
cols. In this paper, we present Fibbing, an architecture
that achieves both ﬂexibility and robustness through
central control over distributed routing. Fibbing in-
troduces fake nodes and links into an underlying link-
state routing protocol, so that routers compute their
own forwarding tables based on the augmented topol-
ogy. Fibbing is expressive, and readily supports ﬂexible
load balancing, traﬃc engineering, and backup routes.
Based on high-level forwarding requirements, the Fib-
bing controller computes a compact augmented topol-
ogy and injects the fake components through standard
routing-protocol messages. Fibbing works with any un-
modiﬁed routers speaking OSPF. Our experiments also
show that it can scale to large networks with many
forwarding requirements, introduces minimal overhead,
and quickly reacts to network and controller failures.
CCS Concepts
•Networks → Routing protocols; Network architec-
tures; Programmable networks; Network management;
Keywords
Fibbing; SDN; link-state routing
1.
INTRODUCTION
Consider a large IP network with hundreds of devices,
including the components shown in Fig. 1a. A set of
IP addresses (D1) see a sudden surge of traﬃc, from
multiple entry points (A, D, and E), that congests a
∗S. Vissicchio is a postdoctoral researcher of F.R.S.-FNRS.
Permission to make digital or hard copies of all or part of this work for personal
or classroom use is granted without fee provided that copies are not made or...

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


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

Output:
安全论文分析：

title:Secure and Efficient Key Derivation in Portfolio Authentication Schemes
Using Blakley Secret Sharing
author:Peter Mayer and
Melanie Volkamer
Secure and Efficient Key Derivation in
Portfolio Authentication Schemes
Using Blakley Secret Sharing
Peter Mayer, Melanie Volkamer
Usable Security  Lab
Crypto Lab
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
Peter Mayer, Melanie Volkamer
e1
e2
e3
e5
e1
P
a
s
s
w
o
r
d
e1
e2
e3
e4
e5
e6
e7
c1
c2
c3
c4
…
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
e2
e4
e5
e1
e2
e5
e6
e1
e3
e4
e5
.
.
.
.
.
.
.
.
.
.
.
.
e4
e5
e6
e7
e2
e4
e5
e6
e2
e5
e6
e7
e3
e4
e6
e7
Common  Secret
Stored  Information
(Hash)
Password
Verification
...
1 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
2 | Peter Mayer | ACSAC 2015 | 11.12.2015
Why portfolio authentication?
<shoulder surfing image>
3 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
✓
4 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
5 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
§Naïve approach
§ Generate & store the hashes for all authorized subsets
§ Check if user input matches one of the hashes
§ Easy to implement
§ Factorial growth of number of hashes
➔ inefficient
6 | Peter Mayer | ACSAC 2015 | 11.12.2015
(t,n)-threshold verification
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
S
e
t
C
h
a
l
l
e
n
g
e
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
e1
e2
e3
e5
e1
e2
e4
e5
e1
e2
e5...


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

Input:
title:Secure and Efficient Key Derivation in Portfolio Authentication Schemes
Using Blakley Secret Sharing
author:Peter Mayer and
Melanie Volkamer
Secure and Efficient Key Derivation in
Portfolio Authentication Schemes
Using Blakley Secret Sharing
Peter Mayer, Melanie Volkamer
Usable Security  Lab
Crypto Lab
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
Peter Mayer, Melanie Volkamer
e1
e2
e3
e5
e1
P
a
s
s
w
o
r
d
e1
e2
e3
e4
e5
e6
e7
c1
c2
c3
c4
…
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
e2
e4
e5
e1
e2
e5
e6
e1
e3
e4
e5
.
.
.
.
.
.
.
.
.
.
.
.
e4
e5
e6
e7
e2
e4
e5
e6
e2
e5
e6
e7
e3
e4
e6
e7
Common  Secret
Stored  Information
(Hash)
Password
Verification
...
1 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
2 | Peter Mayer | ACSAC 2015 | 11.12.2015
Why portfolio authentication?
<shoulder surfing image>
3 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
✓
4 | Peter Mayer | ACSAC 2015 | 11.12.2015
Graphical recognition-based
portfolio authentication
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
e1'
e2'
e3'
e4'
S
e
t
C
h
a
l
l
e
n
g
e
I
n
p
u
t
U
s
e
r
Stored  Information
Password
Verification
...
5 | Peter Mayer | ACSAC 2015 | 11.12.2015
Portfolio authentication
§Naïve approach
§ Generate & store the hashes for all authorized subsets
§ Check if user input matches one of the hashes
§ Easy to implement
§ Factorial growth of number of hashes
➔ inefficient
6 | Peter Mayer | ACSAC 2015 | 11.12.2015
(t,n)-threshold verification
e1
e2
e3
e4
e5
e6
e7
P
a
s
s
w
o
r
d
c1
c2
c3
c4
S
e
t
C
h
a
l
l
e
n
g
e
e1
e2
e3
e4
e1
e2
e3
e7
e1
e2
e4
e7
e1
e2
e6
e7
e1
e2
e3
e5
e1
e2
e4
e5
e1
e2
e5...

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


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

Output:
安全论文分析：

title:YouSlow: a performance analysis tool for adaptive bitrate video streaming
author:Hyunwoo Nam and
Kyung-Hwa Kim and
Doru Calin and
Henning Schulzrinne
YouSlow: A Performance Analysis Tool for Adaptive Bitrate
Video Streaming
Hyunwoo Nam, Kyung-Hwa Kim and
Henning Schulzrinne
Columbia University
New York, NY
{hn2203, kk2515, hgs10}@columbia.edu
Bell Laboratories, Alcatel-Lucent
Doru Calin
Murray Hill, NJ
doru.calin@alcatel-lucent.com
ABSTRACT
Adaptive bitrate (ABR) technologies are being widely used
in today’s popular HTTP-based video streaming such as
YouTube and Netﬂix. Such a rate-switching algorithm em-
bedded in a video player is designed to improve video quality-
of-experience (QoE) by selecting an appropriate resolution
based on the analysis of network conditions while the video is
playing. However, a bad viewing experience is often caused
by the video player having diﬃculty estimating transit or
client-side network conditions accurately. In order to ana-
lyze the ABR streaming performance, we developed YouS-
low, a web browser plug-in that can detect and report live
buﬀer stalling events to our analysis tool. Currently, YouS-
low has collected more than 20,000 of YouTube video stalling
events over 40 countries.
Categories and Subject Descriptors
D.2.8 [Software Engineering]: Metrics—performance mea-
sures
Keywords
HTTP Video Streaming; Adaptive Bitrate Streaming (ABR);
Video Quality of Experience
1.
INTRODUCTION AND CHALLENGE
Today’s over-the-top (OTT) video streaming services de-
liver video contents to clients over HTTP. In the early ver-
sion of HTTP-based video streaming, a progressive down-
load mechanism was used, where the server pushes the con-
tent as quickly as possible when a client requests a video.
However, the major drawback is that all clients must down-
load videos at the same bitrate [1], regardless of network
conditions and performance of their devices. Several ABR
technologies such as Apple HTTP Live Streaming (HLS),
Microsoft IIS Smoo...


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

Input:
title:YouSlow: a performance analysis tool for adaptive bitrate video streaming
author:Hyunwoo Nam and
Kyung-Hwa Kim and
Doru Calin and
Henning Schulzrinne
YouSlow: A Performance Analysis Tool for Adaptive Bitrate
Video Streaming
Hyunwoo Nam, Kyung-Hwa Kim and
Henning Schulzrinne
Columbia University
New York, NY
{hn2203, kk2515, hgs10}@columbia.edu
Bell Laboratories, Alcatel-Lucent
Doru Calin
Murray Hill, NJ
doru.calin@alcatel-lucent.com
ABSTRACT
Adaptive bitrate (ABR) technologies are being widely used
in today’s popular HTTP-based video streaming such as
YouTube and Netﬂix. Such a rate-switching algorithm em-
bedded in a video player is designed to improve video quality-
of-experience (QoE) by selecting an appropriate resolution
based on the analysis of network conditions while the video is
playing. However, a bad viewing experience is often caused
by the video player having diﬃculty estimating transit or
client-side network conditions accurately. In order to ana-
lyze the ABR streaming performance, we developed YouS-
low, a web browser plug-in that can detect and report live
buﬀer stalling events to our analysis tool. Currently, YouS-
low has collected more than 20,000 of YouTube video stalling
events over 40 countries.
Categories and Subject Descriptors
D.2.8 [Software Engineering]: Metrics—performance mea-
sures
Keywords
HTTP Video Streaming; Adaptive Bitrate Streaming (ABR);
Video Quality of Experience
1.
INTRODUCTION AND CHALLENGE
Today’s over-the-top (OTT) video streaming services de-
liver video contents to clients over HTTP. In the early ver-
sion of HTTP-based video streaming, a progressive down-
load mechanism was used, where the server pushes the con-
tent as quickly as possible when a client requests a video.
However, the major drawback is that all clients must down-
load videos at the same bitrate [1], regardless of network
conditions and performance of their devices. Several ABR
technologies such as Apple HTTP Live Streaming (HLS),
Microsoft IIS Smoo...

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


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

Output:
安全论文分析：

title:Enabling Network Security Through Active DNS Datasets
author:Athanasios Kountouras and
Panagiotis Kintis and
Chaz Lever and
Yizheng Chen and
Yacin Nadji and
David Dagon and
Manos Antonakakis and
Rodney Joffe
Enabling Network Security Through
Active DNS Datasets
Athanasios Kountouras1(B), Panagiotis Kintis2, Chaz Lever2, Yizheng Chen2,
Yacin Nadji2, David Dagon1, Manos Antonakakis1, and Rodney Joﬀe3
Georgia Institute of Technology, Atlanta, USA
1 School of Electrical and Computer Engineering,
{kountouras,manos}@gatech.edu, dagon@sudo.sh
{kintis,chazlever,yzchen,yacin}@gatech.edu
2 School of Computer Science, Georgia Institute of Technology, Atlanta, USA
3 Neustar, Sterling, USA
rjoffe@centergate.com
Abstract. Most modern cyber crime leverages the Domain Name Sys-
tem (DNS) to attain high levels of network agility and make detection
of Internet abuse challenging. The majority of malware, which represent
a key component of illicit Internet operations, are programmed to locate
the IP address of their command-and-control (C&C) server through DNS
lookups. To make the malicious infrastructure both agile and resilient,
malware authors often use sophisticated communication methods that
utilize DNS (i.e., domain generation algorithms) for their campaigns. In
general, Internet miscreants make extensive use of short-lived disposable
domains to promote a large variety of threats and support their criminal
network operations.
To eﬀectively combat Internet abuse, the security community needs
access to freely available and open datasets. Such datasets will enable
the development of new algorithms that can enable the early detection,
tracking, and overall lifetime of modern Internet threats. To that end, we
have created a system, Thales, that actively queries and collects records
for massive amounts of domain names from various seeds. These seeds
are collected from multiple public sources and, therefore, free of privacy
concerns. The results of this eﬀort will be opened and ma...


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

Input:
title:Enabling Network Security Through Active DNS Datasets
author:Athanasios Kountouras and
Panagiotis Kintis and
Chaz Lever and
Yizheng Chen and
Yacin Nadji and
David Dagon and
Manos Antonakakis and
Rodney Joffe
Enabling Network Security Through
Active DNS Datasets
Athanasios Kountouras1(B), Panagiotis Kintis2, Chaz Lever2, Yizheng Chen2,
Yacin Nadji2, David Dagon1, Manos Antonakakis1, and Rodney Joﬀe3
Georgia Institute of Technology, Atlanta, USA
1 School of Electrical and Computer Engineering,
{kountouras,manos}@gatech.edu, dagon@sudo.sh
{kintis,chazlever,yzchen,yacin}@gatech.edu
2 School of Computer Science, Georgia Institute of Technology, Atlanta, USA
3 Neustar, Sterling, USA
rjoffe@centergate.com
Abstract. Most modern cyber crime leverages the Domain Name Sys-
tem (DNS) to attain high levels of network agility and make detection
of Internet abuse challenging. The majority of malware, which represent
a key component of illicit Internet operations, are programmed to locate
the IP address of their command-and-control (C&C) server through DNS
lookups. To make the malicious infrastructure both agile and resilient,
malware authors often use sophisticated communication methods that
utilize DNS (i.e., domain generation algorithms) for their campaigns. In
general, Internet miscreants make extensive use of short-lived disposable
domains to promote a large variety of threats and support their criminal
network operations.
To eﬀectively combat Internet abuse, the security community needs
access to freely available and open datasets. Such datasets will enable
the development of new algorithms that can enable the early detection,
tracking, and overall lifetime of modern Internet threats. To that end, we
have created a system, Thales, that actively queries and collects records
for massive amounts of domain names from various seeds. These seeds
are collected from multiple public sources and, therefore, free of privacy
concerns. The results of this eﬀort will be opened and ma...

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


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

Output:
安全论文分析：

title:Private search in the real world
author:Vasilis Pappas and
Mariana Raykova and
Binh Vo and
Steven M. Bellovin and
Tal Malkin
Private Search in the Real World
Vasilis Pappas, Mariana Raykova, Binh Vo, Steven M. Bellovin, Tal Malkin
{vpappas, mariana, binh, smb, tal}@cs.columbia.edu
Department of Computer Science
Columbia University, New York, NY, USA
ABSTRACT
Encrypted search — performing queries on protected data — has
been explored in the past; however, its inherent inefﬁciency has
raised questions of practicality. Here, we focus on improving
the performance and extending its functionality enough to make
it practical. We do this by optimizing the system, and by stepping
back from the goal of achieving maximal privacy guarantees in an
encrypted search scenario and consider efﬁciency and functionality
as priorities.
We design and analyze the privacy implications of two prac-
tical extensions applicable to any keyword-based private search
system. We evaluate their efﬁciency by building them on top
of a private search system, called SADS. Additionally, we im-
prove SADS’ performance, privacy guaranties and functionality.
The extended SADS system offers improved efﬁciency parameters
that meet practical usability requirements in a relaxed adversarial
model. We present the experimental results and evaluate the per-
formance of the system. We also demonstrate analytically that our
scheme can meet the basic needs of a major hospital complex’s ad-
missions records. Overall, we achieve performance comparable to
a simply conﬁgured MySQL database system.
1.
INTRODUCTION
Encrypted search — querying of protected data — has come into
the foreground with growing concerns about security and privacy.
There are many variants of the problem that protect different things:
the searchable data, queries, participant identities, etc. Existing
schemes also differ in their expected operational environment. The
majority of encrypted search mechanisms concern data outsourc-
ing [4–6,8,13,...


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

Input:
title:Private search in the real world
author:Vasilis Pappas and
Mariana Raykova and
Binh Vo and
Steven M. Bellovin and
Tal Malkin
Private Search in the Real World
Vasilis Pappas, Mariana Raykova, Binh Vo, Steven M. Bellovin, Tal Malkin
{vpappas, mariana, binh, smb, tal}@cs.columbia.edu
Department of Computer Science
Columbia University, New York, NY, USA
ABSTRACT
Encrypted search — performing queries on protected data — has
been explored in the past; however, its inherent inefﬁciency has
raised questions of practicality. Here, we focus on improving
the performance and extending its functionality enough to make
it practical. We do this by optimizing the system, and by stepping
back from the goal of achieving maximal privacy guarantees in an
encrypted search scenario and consider efﬁciency and functionality
as priorities.
We design and analyze the privacy implications of two prac-
tical extensions applicable to any keyword-based private search
system. We evaluate their efﬁciency by building them on top
of a private search system, called SADS. Additionally, we im-
prove SADS’ performance, privacy guaranties and functionality.
The extended SADS system offers improved efﬁciency parameters
that meet practical usability requirements in a relaxed adversarial
model. We present the experimental results and evaluate the per-
formance of the system. We also demonstrate analytically that our
scheme can meet the basic needs of a major hospital complex’s ad-
missions records. Overall, we achieve performance comparable to
a simply conﬁgured MySQL database system.
1.
INTRODUCTION
Encrypted search — querying of protected data — has come into
the foreground with growing concerns about security and privacy.
There are many variants of the problem that protect different things:
the searchable data, queries, participant identities, etc. Existing
schemes also differ in their expected operational environment. The
majority of encrypted search mechanisms concern data outsourc-
ing [4–6,8,13,...

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


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

Output:
安全论文分析：

title:Validating web content with senser
author:Jordan Wilberding and
Andrew Yates and
Micah Sherr and
Wenchao Zhou
Validating Web Content with Senser
Jordan Wilberding
Georgetown University
Andrew Yates
Georgetown University
Wenchao Zhou
Georgetown University
Micah Sherr
Georgetown University
ABSTRACT
This paper introduces Senser, a system for validating retrieved
web content. Senser does not rely on a PKI and operates even
when SSL/TLS is not supported by the web server. Senser oper-
ates as a network of proxies located at different vantage points on
the Internet. Clients query a random subset of Senser proxies for
compact descriptions of a desired web page, and apply consensus
and matching algorithms to the returned results to locally render a
“majority” web page. To ensure diverse selections of proxies (and
consequently decrease an adversary’s ability to manipulate a ma-
jority of the proxies’ requests), Senser leverages Internet mapping
systems that accurately predict AS-level paths between available
proxies and the desired web page. We demonstrate using a de-
ployment of Senser on Amazon EC2 that Senser detects and mit-
igates attempts by adversaries to manipulate web content — even
when controlling large collections of autonomous systems — while
maintaining reasonable performance overheads.
1.
INTRODUCTION
SSL/TLS is the predominant protocol used to protect web con-
tent. When used correctly, it provides strong conﬁdentiality and
authenticity guarantees. Unfortunately, while SSL/TLS is critically
important in securing many web transactions, it is often unavail-
able and too often is susceptible to implementation weaknesses.
To illustrate, Sunshine et al. [24] demonstrate that users often do
not heed browsers’ certiﬁcate warning messages. Additionally, the
2011 DigiNotar incident [26] and academic studies of SSL/TLS de-
ployment [12] bring into focus longheld concerns about the lack of
safeguards in the web’s public key infrastructure or “PKI” (cf. [8]).
Final...


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

Input:
title:Validating web content with senser
author:Jordan Wilberding and
Andrew Yates and
Micah Sherr and
Wenchao Zhou
Validating Web Content with Senser
Jordan Wilberding
Georgetown University
Andrew Yates
Georgetown University
Wenchao Zhou
Georgetown University
Micah Sherr
Georgetown University
ABSTRACT
This paper introduces Senser, a system for validating retrieved
web content. Senser does not rely on a PKI and operates even
when SSL/TLS is not supported by the web server. Senser oper-
ates as a network of proxies located at different vantage points on
the Internet. Clients query a random subset of Senser proxies for
compact descriptions of a desired web page, and apply consensus
and matching algorithms to the returned results to locally render a
“majority” web page. To ensure diverse selections of proxies (and
consequently decrease an adversary’s ability to manipulate a ma-
jority of the proxies’ requests), Senser leverages Internet mapping
systems that accurately predict AS-level paths between available
proxies and the desired web page. We demonstrate using a de-
ployment of Senser on Amazon EC2 that Senser detects and mit-
igates attempts by adversaries to manipulate web content — even
when controlling large collections of autonomous systems — while
maintaining reasonable performance overheads.
1.
INTRODUCTION
SSL/TLS is the predominant protocol used to protect web con-
tent. When used correctly, it provides strong conﬁdentiality and
authenticity guarantees. Unfortunately, while SSL/TLS is critically
important in securing many web transactions, it is often unavail-
able and too often is susceptible to implementation weaknesses.
To illustrate, Sunshine et al. [24] demonstrate that users often do
not heed browsers’ certiﬁcate warning messages. Additionally, the
2011 DigiNotar incident [26] and academic studies of SSL/TLS de-
ployment [12] bring into focus longheld concerns about the lack of
safeguards in the web’s public key infrastructure or “PKI” (cf. [8]).
Final...

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


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

Output:
安全论文分析：

title:A Merged Inline Measurement Method for Capacity and Available Bandwidth
author:Cao Le Thanh Man and
Go Hasegawa and
Masayuki Murata
A Merged Inline Measurement Method for Capacity
and Available Bandwidth
Cao Le Thanh Man, Go Hasegawa, and Masayuki Murata
Graduate School of Information Science and Technology, Osaka University
{mlt-cao, hasegawa, murata}@ist.osaka-u.ac.jp
Abstract. We have proposed a new TCP version, called ImTCP (Inline measure-
ment TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data
packets, and then utilizes the arrival intervals of ACK packets for the available
bandwidth estimation. This type of active measurement in a TCP connection (in-
line measurement) is preferred because it delivers measurement results that are as
accurate as active measurement, even though no extra probe trafﬁc is injected into
the network. In the present research, we combine a new capacity measurement
function with the currently used measurement method to enable simultaneous
measurement of both capacity and available bandwidth in ImTCP. The capacity
measurement algorithm is essentially based on the packet pair technique, but also
consider the estimated available bandwidth values for data ﬁltering or data cal-
culation, so that this algorithm promises better measurement results than current
packet-pair-based measurement algorithms.
Extended Abstract
The capacity of an end-to-end network path is the maximum possible throughput that
the network path can provide. Trafﬁc may reach this maximum throughput when there
is no other trafﬁc along the path. The available bandwidth indicates the unused band-
width of a network path, which is the maximum throughput that newly injected trafﬁc
may reach without affecting the existing trafﬁc. The two bandwidth-related values are
obviously important with respect to adaptive control of the network. In addition, these
two values are often both required at the same time. Although network transport proto-
cols optimi...


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

Input:
title:A Merged Inline Measurement Method for Capacity and Available Bandwidth
author:Cao Le Thanh Man and
Go Hasegawa and
Masayuki Murata
A Merged Inline Measurement Method for Capacity
and Available Bandwidth
Cao Le Thanh Man, Go Hasegawa, and Masayuki Murata
Graduate School of Information Science and Technology, Osaka University
{mlt-cao, hasegawa, murata}@ist.osaka-u.ac.jp
Abstract. We have proposed a new TCP version, called ImTCP (Inline measure-
ment TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data
packets, and then utilizes the arrival intervals of ACK packets for the available
bandwidth estimation. This type of active measurement in a TCP connection (in-
line measurement) is preferred because it delivers measurement results that are as
accurate as active measurement, even though no extra probe trafﬁc is injected into
the network. In the present research, we combine a new capacity measurement
function with the currently used measurement method to enable simultaneous
measurement of both capacity and available bandwidth in ImTCP. The capacity
measurement algorithm is essentially based on the packet pair technique, but also
consider the estimated available bandwidth values for data ﬁltering or data cal-
culation, so that this algorithm promises better measurement results than current
packet-pair-based measurement algorithms.
Extended Abstract
The capacity of an end-to-end network path is the maximum possible throughput that
the network path can provide. Trafﬁc may reach this maximum throughput when there
is no other trafﬁc along the path. The available bandwidth indicates the unused band-
width of a network path, which is the maximum throughput that newly injected trafﬁc
may reach without affecting the existing trafﬁc. The two bandwidth-related values are
obviously important with respect to adaptive control of the network. In addition, these
two values are often both required at the same time. Although network transport proto-
cols optimi...

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


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

Output:
安全论文分析：

title:The Security of ChaCha20-Poly1305 in the Multi-User Setting
author:Jean Paul Degabriele and
J'erôme Govinden and
Felix G"unther and
Kenneth G. Paterson
The Security of ChaCha20-Poly1305 in the Multi-User Setting
Jean Paul Degabriele
jean_paul.degabriele@tu-darmstadt.de
CNS, Technische Universität Darmstadt
Jérôme Govinden
jerome.govinden@tu-darmstadt.de
CNS, Technische Universität Darmstadt
Felix Günther
felix.guenther@inf.ethz.ch
Applied Cryptography Group, ETH Zurich
ABSTRACT
The ChaCha20-Poly1305 AEAD scheme is being increasingly wid-
ely deployed in practice. Practitioners need proven security bounds
in order to set data limits and rekeying intervals for the scheme.
But the formal security analysis of ChaCha20-Poly1305 currently
lags behind that of AES-GCM. The only extant analysis (Procter,
2014) contains a flaw and is only for the single-user setting. We
rectify this situation. We prove a multi-user security bound on the
AEAD security of ChaCha20-Poly1305 and establish the tightness
of each term in our bound through matching attacks. We show
how our bound differs both qualitatively and quantitatively from
the known bounds for AES-GCM, highlighting how subtle design
choices lead to distinctive security properties. We translate our
bound to the nonce-randomized setting employed in TLS 1.3 and
elsewhere, and we additionally improve the corresponding security
bounds for GCM. Finally, we provide a simple yet stronger variant
of ChaCha20-Poly1305 that addresses the deficiencies highlighted
by our analysis.
CCS CONCEPTS
• Security and privacy → Mathematical foundations of cryp-
tography; Block and stream ciphers; Hash functions and message
authentication codes.
KEYWORDS
ChaCha20-Poly1305; Multi-User Security; GCM; Nonce Random-
ization, AEAD; TLS 1.3; Tight Security
ACM Reference Format:
Jean Paul Degabriele, Jérôme Govinden, Felix Günther, and Kenneth G.
Paterson. 2021. The Security of ChaCha20-Poly1305 in the Multi-User Set-
ting. In Proceedings of ...