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

Input:
title:SoftCast: one-size-fits-all wireless video
author:Szymon Jakubczak and
Dina Katabi
SoftCast: One-Size-Fits-All Wireless Video
Szymon Jakubczak
Massachusetts Institute of Technology
szym@mit.edu
Massachusetts Institute of Technology
Dina Katabi
dk@mit.edu
ABSTRACT
The focus of this demonstration is the performance of stream-
ing video over the mobile wireless channel. We compare two
schemes: the standard approach to video which transmits
H.264/AVC-encoded stream over 802.11-like PHY, and Soft-
Cast – a clean-slate design for wireless video where the source
transmits one video stream that each receiver decodes to a
video quality commensurate with its speciﬁc instantaneous
channel quality.
Categories and Subject Descriptors: C.2 Computer-
Communication Networks : Miscellaneous
General Terms: Algorithms, Design, Performance, Theory
Keywords: wireless networks, scalable video communica-
tions, joint source-channel coding
1.
INTRODUCTION
Mobile video broadcast presents a signiﬁcant challenge
to conventional wireless design. With mobility, the chan-
nel quality can exhibit fast unpredictable variations [3,9].
Video codecs however operate over groups of pictures (GOP)
and hence cannot instantaneously adapt the video rate to
the channel bit rate. As a result, a mobile receiver suﬀers
from video glitches and stales [2]. With multicast, diﬀerent
receivers experience diﬀerent channel qualities (SNRs) and
hence support diﬀerent bit rates. The transmitter however
has to pick a single transmission bit rate. As a result, the
transmitter has to send at the lowest bit rate supported by
all multicast receivers, which reduces everyone to the video
quality of the worst multicast receiver.
This demo advocates SoftCast, an alternative design for
wireless video streaming. SoftCast uses a novel encoding tech-
nique that allows it to broadcast a single stream from which
each receiver can decode a video quality commensurate with
its instantaneous channel quality. Thus, a mobile receiver...

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


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

Output:
安全论文分析：

title:Computationally complete symbolic attacker and key exchange
author:Gergei Bana and
Koji Hasebe and
Mitsuhiro Okada
Computationally Complete Symbolic Attacker and Key
Exchange
Gergei Bana∗
INRIA, Paris, France
bana@math.upenn.edu
Graduate School of Systems and Information Engineering, University of Tsukuba
Koji Hasebe†
Tsukuba, Japan
hasebe@iit.tsukuba.ac.jp
Mitsuhiro Okada‡
Department of Philosophy, Keio University, Tokyo, Japan
mitsu@abelard.ﬂet.keio.ac.jp
ABSTRACT
Recently, Bana and Comon-Lundh [7] introduced the notion of
computationally complete symbolic attacker to deliver uncondi-
tional computational soundness to symbolic protocol veriﬁcation.
First we explain the relationship between their technique and Fit-
ting’s embedding of classical logic into S4 [23]. Then, based on
predicates for “key usability”, we provide an axiomatic system in
their framework to handle secure encryption when keys are allowed
to be sent. We examine both IND-CCA2 and KDM-CCA2 encryp-
tions, both symmetric and asymmetric situations. For unforgeabil-
ity, we consider INT-CTXT encryptions. This technique does not
require the usual limitations of computational soundness such as
the absence of dynamic corruption, the absence of key-cycles or
unambiguous parsing of bit strings. In particular, if a key-cycle pos-
sibly corrupts CCA2 encryption, our technique delivers an attack.
If it does not endanger security, the security proof goes through.
We illustrate how our notions can be applied in protocol proofs.
Categories and Subject Descriptors
C.2.2 [Computer CommunicationNetworks]: Network Protocols
–Protocol Veriﬁcation
∗Partially supported by the ANR project ProSe ANR-2010-
VERS-004-01 and FCT project ComFormCrypt PTDC/EIA-
CCO/113033/2009. The work completed while this author was at
MSR-INRIA.
†Partially supported by JSPS KAKENHI Grant Number 24700022
‡Partially supported by Grant-in-Aid for Scientiﬁc Research
(MEXT-JSPS) #23120002 and #30224025, as well as by Program
for the Strate...


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

Input:
title:Computationally complete symbolic attacker and key exchange
author:Gergei Bana and
Koji Hasebe and
Mitsuhiro Okada
Computationally Complete Symbolic Attacker and Key
Exchange
Gergei Bana∗
INRIA, Paris, France
bana@math.upenn.edu
Graduate School of Systems and Information Engineering, University of Tsukuba
Koji Hasebe†
Tsukuba, Japan
hasebe@iit.tsukuba.ac.jp
Mitsuhiro Okada‡
Department of Philosophy, Keio University, Tokyo, Japan
mitsu@abelard.ﬂet.keio.ac.jp
ABSTRACT
Recently, Bana and Comon-Lundh [7] introduced the notion of
computationally complete symbolic attacker to deliver uncondi-
tional computational soundness to symbolic protocol veriﬁcation.
First we explain the relationship between their technique and Fit-
ting’s embedding of classical logic into S4 [23]. Then, based on
predicates for “key usability”, we provide an axiomatic system in
their framework to handle secure encryption when keys are allowed
to be sent. We examine both IND-CCA2 and KDM-CCA2 encryp-
tions, both symmetric and asymmetric situations. For unforgeabil-
ity, we consider INT-CTXT encryptions. This technique does not
require the usual limitations of computational soundness such as
the absence of dynamic corruption, the absence of key-cycles or
unambiguous parsing of bit strings. In particular, if a key-cycle pos-
sibly corrupts CCA2 encryption, our technique delivers an attack.
If it does not endanger security, the security proof goes through.
We illustrate how our notions can be applied in protocol proofs.
Categories and Subject Descriptors
C.2.2 [Computer CommunicationNetworks]: Network Protocols
–Protocol Veriﬁcation
∗Partially supported by the ANR project ProSe ANR-2010-
VERS-004-01 and FCT project ComFormCrypt PTDC/EIA-
CCO/113033/2009. The work completed while this author was at
MSR-INRIA.
†Partially supported by JSPS KAKENHI Grant Number 24700022
‡Partially supported by Grant-in-Aid for Scientiﬁc Research
(MEXT-JSPS) #23120002 and #30224025, as well as by Program
for the Strate...

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


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

Output:
安全论文分析：

title:Using automatic speech recognition for attacking acoustic CAPTCHAs:
the trade-off between usability and security
author:Hendrik Meutzner and
Viet-Hung Nguyen and
Thorsten Holz and
Dorothea Kolossa
Using Automatic Speech Recognition for Attacking
Acoustic CAPTCHAs: The Trade-off between Usability and
Security
Hendrik Meutzner, Viet-Hung Nguyen, Thorsten Holz, Dorothea Kolossa
Horst Görtz Institute for IT-Security (HGI), Ruhr-University Bochum
{hendrik.meutzner, viet.nguyen-c7k, thorsten.holz, dorothea.kolossa}@rub.de
ABSTRACT
A common method to prevent automated abuses of Internet
services is utilizing challenge-response tests that distinguish
human users from machines. These tests are known as CAP-
TCHAs (Completely Automated Public Turing Tests to Tell
Computers and Humans Apart) and should represent a task
that is easy to solve for humans, but diﬃcult for fraudulent
programs. To enable access for visually impaired people,
an acoustic CAPTCHA is typically provided in addition to
the better-known visual CAPTCHAs. Recent security stud-
ies show that most acoustic CAPTCHAs, albeit diﬃcult to
solve for humans, can be broken via machine learning.
In this work, we suggest using speech recognition rather
than generic classiﬁcation methods for better analyzing the
security of acoustic CAPTCHAs. We show that our attack
based on an automatic speech recognition system can suc-
cessfully defeat reCAPTCHA with a signiﬁcantly higher suc-
cess rate than reported in previous studies.
A major diﬃculty in designing CAPTCHAs arises from
the trade-oﬀ between human usability and robustness against
automated attacks. We present and analyze an alternative
CAPTCHA design that exploits speciﬁc capabilities of the
human auditory system, i.e., auditory streaming and toler-
ance to reverberation. Since state-of-the-art speech recog-
nition technology still does not provide these capabilities,
the resulting CAPTCHA is hard to solve automatically. A
detailed analysis of the proposed CAPTC...


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

Input:
title:Using automatic speech recognition for attacking acoustic CAPTCHAs:
the trade-off between usability and security
author:Hendrik Meutzner and
Viet-Hung Nguyen and
Thorsten Holz and
Dorothea Kolossa
Using Automatic Speech Recognition for Attacking
Acoustic CAPTCHAs: The Trade-off between Usability and
Security
Hendrik Meutzner, Viet-Hung Nguyen, Thorsten Holz, Dorothea Kolossa
Horst Görtz Institute for IT-Security (HGI), Ruhr-University Bochum
{hendrik.meutzner, viet.nguyen-c7k, thorsten.holz, dorothea.kolossa}@rub.de
ABSTRACT
A common method to prevent automated abuses of Internet
services is utilizing challenge-response tests that distinguish
human users from machines. These tests are known as CAP-
TCHAs (Completely Automated Public Turing Tests to Tell
Computers and Humans Apart) and should represent a task
that is easy to solve for humans, but diﬃcult for fraudulent
programs. To enable access for visually impaired people,
an acoustic CAPTCHA is typically provided in addition to
the better-known visual CAPTCHAs. Recent security stud-
ies show that most acoustic CAPTCHAs, albeit diﬃcult to
solve for humans, can be broken via machine learning.
In this work, we suggest using speech recognition rather
than generic classiﬁcation methods for better analyzing the
security of acoustic CAPTCHAs. We show that our attack
based on an automatic speech recognition system can suc-
cessfully defeat reCAPTCHA with a signiﬁcantly higher suc-
cess rate than reported in previous studies.
A major diﬃculty in designing CAPTCHAs arises from
the trade-oﬀ between human usability and robustness against
automated attacks. We present and analyze an alternative
CAPTCHA design that exploits speciﬁc capabilities of the
human auditory system, i.e., auditory streaming and toler-
ance to reverberation. Since state-of-the-art speech recog-
nition technology still does not provide these capabilities,
the resulting CAPTCHA is hard to solve automatically. A
detailed analysis of the proposed CAPTC...

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


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

Output:
安全论文分析：

title:Inherent Time Redundancy (ITR): Using Program Repetition for Low-Overhead
Fault Tolerance
author:Vimal K. Reddy and
Eric Rotenberg
Inherent Time Redundancy (ITR):
Using Program Repetition for Low-Overhead Fault Tolerance
Center for Efficient, Secure and Reliable Computing, ECE, North Carolina State University
Vimal Reddy, Eric Rotenberg
{vkreddy, ericro}@ece.ncsu.edu
Abstract
to  provide
in  programs
A new approach is proposed that exploits repetition
inherent
low-overhead
transient  fault  protection  in  a  processor.  Programs
repeatedly  execute  the  same  instructions  within  close
time periods. This can be viewed as a time redundant
re-execution of a program, except that inputs to these
inherent
instructions  vary.
Nevertheless,  certain  microarchitectural  events  in  the
processor  are  independent  of  the  input  and  only
depend  on  the  program  instructions.  Such  events  can
be  recorded  and  confirmed  when  ITR  instructions
repeat.
time  redundant  (ITR)
In this paper, we use ITR to detect transient faults
in the fetch and decode units of a processor pipeline,
avoiding costly approaches like structural duplication
or explicit time redundant execution.
1. Introduction
to
Technology
scaling  makes
transistors  more
susceptible  to  transient  faults.  As  a  result,  it  is
becoming
incorporate
transient fault tolerance in future processors.
increasingly
important
Traditional  transient  fault  tolerance  approaches
duplicate  in  time  or  space  for  robust  fault  tolerance,
but  are  expensive  in  terms  of  performance,  area,  and
power,  counteracting  the  very  benefits  of  technology
scaling. To make fault tolerance viable for commodity
processors, unconventional techniques are needed that
provide  significant  fault  protection  in  an  efficient
manner. In this spirit, we are pursuing a new approach
to fault tolerance based on microarchitecture insights.
The  idea  is  to  engage...


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

Input:
title:Inherent Time Redundancy (ITR): Using Program Repetition for Low-Overhead
Fault Tolerance
author:Vimal K. Reddy and
Eric Rotenberg
Inherent Time Redundancy (ITR):
Using Program Repetition for Low-Overhead Fault Tolerance
Center for Efficient, Secure and Reliable Computing, ECE, North Carolina State University
Vimal Reddy, Eric Rotenberg
{vkreddy, ericro}@ece.ncsu.edu
Abstract
to  provide
in  programs
A new approach is proposed that exploits repetition
inherent
low-overhead
transient  fault  protection  in  a  processor.  Programs
repeatedly  execute  the  same  instructions  within  close
time periods. This can be viewed as a time redundant
re-execution of a program, except that inputs to these
inherent
instructions  vary.
Nevertheless,  certain  microarchitectural  events  in  the
processor  are  independent  of  the  input  and  only
depend  on  the  program  instructions.  Such  events  can
be  recorded  and  confirmed  when  ITR  instructions
repeat.
time  redundant  (ITR)
In this paper, we use ITR to detect transient faults
in the fetch and decode units of a processor pipeline,
avoiding costly approaches like structural duplication
or explicit time redundant execution.
1. Introduction
to
Technology
scaling  makes
transistors  more
susceptible  to  transient  faults.  As  a  result,  it  is
becoming
incorporate
transient fault tolerance in future processors.
increasingly
important
Traditional  transient  fault  tolerance  approaches
duplicate  in  time  or  space  for  robust  fault  tolerance,
but  are  expensive  in  terms  of  performance,  area,  and
power,  counteracting  the  very  benefits  of  technology
scaling. To make fault tolerance viable for commodity
processors, unconventional techniques are needed that
provide  significant  fault  protection  in  an  efficient
manner. In this spirit, we are pursuing a new approach
to fault tolerance based on microarchitecture insights.
The  idea  is  to  engage...

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


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

Output:
安全论文分析：

title:Improving Computer Security Using Extended Static Checking
author:Brian Chess
Improving Computer Security using Extended Static Checking
Brian V. Chess
Department of Computer Engineering
University of California, Santa Cruz
Abstract
We describe a method for ﬁnding security ﬂaws in
source code by way of static analysis. The method is no-
table because it allows a user to specify a wide range
of security properties while also leveraging a set of pre-
deﬁned common ﬂaws. It works by using an automated
theorem prover to analyze veriﬁcation conditions gen-
erated from C source code and a set of speciﬁcations
that deﬁne security properties. We demonstrate that the
method can be used to identify real vulnerabilities in real
programs.
1 Introduction
A large percentage of the documented vulnerabilities
in computer systems have been introduced by program-
mers as they created or modiﬁed the source code for var-
ious system components [17]. A majority of these ﬂaws
fall into one of only a few major categories, with array
bounds errors and race conditions being among the most
common.
The primary contribution of this paper is to demon-
strate that many common types of security ﬂaws can
be detected through the application of extended static
checking [7], a technique developed for the general
problem of ﬁnding errors in source code at compile-
time. We have created a prototype checker, named
Eau Claire, capable of analyzing source code written in
C. (Previous extended static checkers have analyzed pro-
grams written in Modula-3 [7] and Java [20].) In order to
evaluate the source code, Eau Claire reads speciﬁcations
that deﬁne security properties. Eau Claire represents the
ﬁrst application of extended static checking to the spe-
ciﬁc problem of identifying security vulnerabilities.
Eau Claire is ﬂexible enough that an experienced user
can specify a wide variety of properties. At the same
time, a novice user could ﬁnd a number of common se-
curity ﬂaws by making use of a libra...


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

Input:
title:Improving Computer Security Using Extended Static Checking
author:Brian Chess
Improving Computer Security using Extended Static Checking
Brian V. Chess
Department of Computer Engineering
University of California, Santa Cruz
Abstract
We describe a method for ﬁnding security ﬂaws in
source code by way of static analysis. The method is no-
table because it allows a user to specify a wide range
of security properties while also leveraging a set of pre-
deﬁned common ﬂaws. It works by using an automated
theorem prover to analyze veriﬁcation conditions gen-
erated from C source code and a set of speciﬁcations
that deﬁne security properties. We demonstrate that the
method can be used to identify real vulnerabilities in real
programs.
1 Introduction
A large percentage of the documented vulnerabilities
in computer systems have been introduced by program-
mers as they created or modiﬁed the source code for var-
ious system components [17]. A majority of these ﬂaws
fall into one of only a few major categories, with array
bounds errors and race conditions being among the most
common.
The primary contribution of this paper is to demon-
strate that many common types of security ﬂaws can
be detected through the application of extended static
checking [7], a technique developed for the general
problem of ﬁnding errors in source code at compile-
time. We have created a prototype checker, named
Eau Claire, capable of analyzing source code written in
C. (Previous extended static checkers have analyzed pro-
grams written in Modula-3 [7] and Java [20].) In order to
evaluate the source code, Eau Claire reads speciﬁcations
that deﬁne security properties. Eau Claire represents the
ﬁrst application of extended static checking to the spe-
ciﬁc problem of identifying security vulnerabilities.
Eau Claire is ﬂexible enough that an experienced user
can specify a wide variety of properties. At the same
time, a novice user could ﬁnd a number of common se-
curity ﬂaws by making use of a libra...

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


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

Output:
安全论文分析：

title:Alice in Warningland: A Large-Scale Field Study of Browser Security
Warning Effectiveness
author:Devdatta Akhawe and
Adrienne Porter Felt
Alice in Warningland: A Large-Scale Field Study
of Browser Security Warning Effectiveness
Devdatta Akhawe, University of California, Berkeley; Adrienne Porter Felt, Google, Inc.
Open access to the Proceedings of the 22nd USENIX Security Symposium is sponsored by USENIXThis paper is included in the Proceedings of the 22nd USENIX Security Symposium.August 14–16, 2013 • Washington, D.C., USAISBN 978-1-931971-03-4A Large-Scale Field Study of Browser Security Warning Effectiveness
Alice in Warningland:
Devdatta Akhawe
University of California, Berkeley∗
devdatta@cs.berkeley.edu
Adrienne Porter Felt
Google, Inc.
felt@google.com
Abstract
We empirically assess whether browser security warn-
ings are as ineffective as suggested by popular opinion
and previous literature. We used Mozilla Firefox and
Google Chrome’s in-browser telemetry to observe over
25 million warning impressions in situ. During our ﬁeld
study, users continued through a tenth of Mozilla Fire-
fox’s malware and phishing warnings, a quarter of Google
Chrome’s malware and phishing warnings, and a third of
Mozilla Firefox’s SSL warnings. This demonstrates that
security warnings can be effective in practice; security
experts and system architects should not dismiss the goal
of communicating security information to end users. We
also ﬁnd that user behavior varies across warnings. In con-
trast to the other warnings, users continued through 70.2%
of Google Chrome’s SSL warnings. This indicates that
the user experience of a warning can have a signiﬁcant
impact on user behavior. Based on our ﬁndings, we make
recommendations for warning designers and researchers.
1
Introduction
An oft-repeated maxim in the security community is the
futility of relying on end users to make security decisions.
Felten and McGraw famously wrote, “Given a choice
between dancing pigs and securit...


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

Input:
title:Alice in Warningland: A Large-Scale Field Study of Browser Security
Warning Effectiveness
author:Devdatta Akhawe and
Adrienne Porter Felt
Alice in Warningland: A Large-Scale Field Study
of Browser Security Warning Effectiveness
Devdatta Akhawe, University of California, Berkeley; Adrienne Porter Felt, Google, Inc.
Open access to the Proceedings of the 22nd USENIX Security Symposium is sponsored by USENIXThis paper is included in the Proceedings of the 22nd USENIX Security Symposium.August 14–16, 2013 • Washington, D.C., USAISBN 978-1-931971-03-4A Large-Scale Field Study of Browser Security Warning Effectiveness
Alice in Warningland:
Devdatta Akhawe
University of California, Berkeley∗
devdatta@cs.berkeley.edu
Adrienne Porter Felt
Google, Inc.
felt@google.com
Abstract
We empirically assess whether browser security warn-
ings are as ineffective as suggested by popular opinion
and previous literature. We used Mozilla Firefox and
Google Chrome’s in-browser telemetry to observe over
25 million warning impressions in situ. During our ﬁeld
study, users continued through a tenth of Mozilla Fire-
fox’s malware and phishing warnings, a quarter of Google
Chrome’s malware and phishing warnings, and a third of
Mozilla Firefox’s SSL warnings. This demonstrates that
security warnings can be effective in practice; security
experts and system architects should not dismiss the goal
of communicating security information to end users. We
also ﬁnd that user behavior varies across warnings. In con-
trast to the other warnings, users continued through 70.2%
of Google Chrome’s SSL warnings. This indicates that
the user experience of a warning can have a signiﬁcant
impact on user behavior. Based on our ﬁndings, we make
recommendations for warning designers and researchers.
1
Introduction
An oft-repeated maxim in the security community is the
futility of relying on end users to make security decisions.
Felten and McGraw famously wrote, “Given a choice
between dancing pigs and securit...

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


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

Output:
安全论文分析：

title:Leveraging Context-Triggered Measurements to Characterize LTE Handover
Performance
author:Shichang Xu and
Ashkan Nikravesh and
Z. Morley Mao
Leveraging Context-Triggered
Measurements to Characterize LTE
Handover Performance
Shichang Xu(B), Ashkan Nikravesh, and Z. Morley Mao
University of Michigan, Ann Arbor, USA
{xsc,ashnik,zmao}@umich.edu
Abstract. In cellular networks, handover plays a vital role in supporting
mobility and connectivity. Traditionally, handovers in a cellular network
focus on maintaining continuous connectivity for legacy voice calls. How-
ever, there is a poor understanding of how today’s handover strategies
impact the network performance, especially for applications that require
reliable Internet connectivity.
In this work, using a newly designed context-triggered measurement
framework, we carry out the ﬁrst comprehensive measurement study in
LTE networks on how handover decisions implemented by carriers impact
network layer performance. We ﬁnd that the interruption in connectivity
during handover is minimal, but in 43% of cases the end-to-end through-
put degrades after the handover. The cause is that the deployed handover
policy uses statically conﬁgured signal strength threshold as the key fac-
tor to decide handover and focuses on improving signal strength which by
itself is an imperfect metric for performance. We propose that handover
decision strategies trigger handover based on predicted performance con-
sidering factors such as cell load along with application preference.
1 Introduction
Mobile devices rely on cellular networks to get network access to support data
services. Since the coverage of each cell1 is limited, handover between cells is
essential for ensuring continuous connectivity and mobility. In addition, when
the device is in the coverage of multiple cells, a proper policy should handover
the mobile device to a cell that provides good performance.
There has been little work to understand how the deployed cellular networ...


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

Input:
title:Leveraging Context-Triggered Measurements to Characterize LTE Handover
Performance
author:Shichang Xu and
Ashkan Nikravesh and
Z. Morley Mao
Leveraging Context-Triggered
Measurements to Characterize LTE
Handover Performance
Shichang Xu(B), Ashkan Nikravesh, and Z. Morley Mao
University of Michigan, Ann Arbor, USA
{xsc,ashnik,zmao}@umich.edu
Abstract. In cellular networks, handover plays a vital role in supporting
mobility and connectivity. Traditionally, handovers in a cellular network
focus on maintaining continuous connectivity for legacy voice calls. How-
ever, there is a poor understanding of how today’s handover strategies
impact the network performance, especially for applications that require
reliable Internet connectivity.
In this work, using a newly designed context-triggered measurement
framework, we carry out the ﬁrst comprehensive measurement study in
LTE networks on how handover decisions implemented by carriers impact
network layer performance. We ﬁnd that the interruption in connectivity
during handover is minimal, but in 43% of cases the end-to-end through-
put degrades after the handover. The cause is that the deployed handover
policy uses statically conﬁgured signal strength threshold as the key fac-
tor to decide handover and focuses on improving signal strength which by
itself is an imperfect metric for performance. We propose that handover
decision strategies trigger handover based on predicted performance con-
sidering factors such as cell load along with application preference.
1 Introduction
Mobile devices rely on cellular networks to get network access to support data
services. Since the coverage of each cell1 is limited, handover between cells is
essential for ensuring continuous connectivity and mobility. In addition, when
the device is in the coverage of multiple cells, a proper policy should handover
the mobile device to a cell that provides good performance.
There has been little work to understand how the deployed cellular networ...

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


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

Output:
安全论文分析：

title:PLAS'20: 15th Workshop on Programming Languages and Analysis for Security
author:Alley Stoughton and
Marco Vassena
PLAS’20: 15th Workshop on Programming Languages and
Analysis for Security
Alley Stoughton
Boston University
stough@bu.edu
ABSTRACT
The 15th ACM SIGSAC Workshop on Programming Languages and
Analysis for Security (PLAS 2020) is co-located with the 27th ACM
Conference on Computer and Communications Security (ACM
CCS 2020). Over its now more than ten-year history, PLAS has
provided a unique forum for researchers and practitioners to ex-
change ideas about programming language and program analysis
techniques with the goal of improving the security of software
systems. Strongly encouraged are proposals of new, speculative
ideas, evaluations of new or known techniques in practical settings,
and discussions of emerging threats and important problems.
CCS CONCEPTS
• Security and privacy → Software and application security;
KEYWORDS
programming languages; security
ACM Reference Format:
Alley Stoughton and Marco Vassena. 2020. PLAS’20: 15th Workshop on
Programming Languages and Analysis for Security. In Proceedings of the
2020 ACM SIGSAC Conference on Computer and Communications Security
(CCS ’20), November 9–13, 2020, Virtual Event, USA. ACM, New York, NY,
USA, 2 pages. https://doi.org/10.1145/3372297.3416252
1 INTRODUCTION
PLAS aims to provide a forum for exploring and evaluating ideas
on the use of programming language and program analysis tech-
niques to improve the security of software systems. Strongly en-
couraged are proposals of new, speculative ideas, evaluations of
new or known techniques in practical settings, and discussions of
emerging threats and important problems. We are especially inter-
ested in position papers that are radical, forward-looking, and likely
to lead to lively and insightful discussions that will influence future
research that lies at the intersection of programming languages and
security.
2 SCOPE
The scope of PLAS includes, ...


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

Input:
title:PLAS'20: 15th Workshop on Programming Languages and Analysis for Security
author:Alley Stoughton and
Marco Vassena
PLAS’20: 15th Workshop on Programming Languages and
Analysis for Security
Alley Stoughton
Boston University
stough@bu.edu
ABSTRACT
The 15th ACM SIGSAC Workshop on Programming Languages and
Analysis for Security (PLAS 2020) is co-located with the 27th ACM
Conference on Computer and Communications Security (ACM
CCS 2020). Over its now more than ten-year history, PLAS has
provided a unique forum for researchers and practitioners to ex-
change ideas about programming language and program analysis
techniques with the goal of improving the security of software
systems. Strongly encouraged are proposals of new, speculative
ideas, evaluations of new or known techniques in practical settings,
and discussions of emerging threats and important problems.
CCS CONCEPTS
• Security and privacy → Software and application security;
KEYWORDS
programming languages; security
ACM Reference Format:
Alley Stoughton and Marco Vassena. 2020. PLAS’20: 15th Workshop on
Programming Languages and Analysis for Security. In Proceedings of the
2020 ACM SIGSAC Conference on Computer and Communications Security
(CCS ’20), November 9–13, 2020, Virtual Event, USA. ACM, New York, NY,
USA, 2 pages. https://doi.org/10.1145/3372297.3416252
1 INTRODUCTION
PLAS aims to provide a forum for exploring and evaluating ideas
on the use of programming language and program analysis tech-
niques to improve the security of software systems. Strongly en-
couraged are proposals of new, speculative ideas, evaluations of
new or known techniques in practical settings, and discussions of
emerging threats and important problems. We are especially inter-
ested in position papers that are radical, forward-looking, and likely
to lead to lively and insightful discussions that will influence future
research that lies at the intersection of programming languages and
security.
2 SCOPE
The scope of PLAS includes, ...

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


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

Output:
安全论文分析：

title:Assessing the Impact of Dynamic Power Management on the Functionality
and the Performance of Battery-Powered Appliances
author:Andrea Acquaviva and
Alessandro Aldini and
Marco Bernardo and
Alessandro Bogliolo and
Edoardo Bontà and
Emanuele Lattanzi
Assessing the Impact of Dynamic Power Management on
the Functionality and the Performance of Battery-Powered Appliances
A. Acquaviva, A. Aldini, M. Bernardo, A. Bogliolo, E. Bont`a, E. Lattanzi
Universit`a di Urbino “Carlo Bo”
Istituto di Scienze e Tecnologie dell’Informazione
Piazza della Repubblica 13, 61029 Urbino, Italy
Abstract
In this paper we provide an incremental methodology to as-
sess the effect of the introduction of a dynamic power man-
ager in a mobile embedded computing device. The method-
ology consists of two phases. In the ﬁrst phase, we verify
whether the introduction of the dynamic power manager al-
ters the functionality of the system. We show that this can
be accomplished by employing standard techniques based
on equivalence checking for noninterference analysis. In the
second phase, we quantify the effectiveness of the introduc-
tion of the dynamic power manager in terms of power con-
sumption and overall system efﬁciency. This is carried out
by enriching the functional model of the system with infor-
mation about the performance aspects of the system, and
by comparing the values of the power consumption and the
overall system efﬁciency obtained from the solution of the
performance model with and without dynamic power man-
ager. To this purpose, ﬁrst we employ a more abstract per-
formance model based on the Markovian assumption, then
we use a more realistic performance model – to be validated
against the Markovian one – where general probability dis-
tributions are considered. The methodology is illustrated by
means of its application to the study of a remote procedure
call mechanism – through which a battery-powered device
is used by some application requesting information – and
of a streami...


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

Input:
title:Assessing the Impact of Dynamic Power Management on the Functionality
and the Performance of Battery-Powered Appliances
author:Andrea Acquaviva and
Alessandro Aldini and
Marco Bernardo and
Alessandro Bogliolo and
Edoardo Bontà and
Emanuele Lattanzi
Assessing the Impact of Dynamic Power Management on
the Functionality and the Performance of Battery-Powered Appliances
A. Acquaviva, A. Aldini, M. Bernardo, A. Bogliolo, E. Bont`a, E. Lattanzi
Universit`a di Urbino “Carlo Bo”
Istituto di Scienze e Tecnologie dell’Informazione
Piazza della Repubblica 13, 61029 Urbino, Italy
Abstract
In this paper we provide an incremental methodology to as-
sess the effect of the introduction of a dynamic power man-
ager in a mobile embedded computing device. The method-
ology consists of two phases. In the ﬁrst phase, we verify
whether the introduction of the dynamic power manager al-
ters the functionality of the system. We show that this can
be accomplished by employing standard techniques based
on equivalence checking for noninterference analysis. In the
second phase, we quantify the effectiveness of the introduc-
tion of the dynamic power manager in terms of power con-
sumption and overall system efﬁciency. This is carried out
by enriching the functional model of the system with infor-
mation about the performance aspects of the system, and
by comparing the values of the power consumption and the
overall system efﬁciency obtained from the solution of the
performance model with and without dynamic power man-
ager. To this purpose, ﬁrst we employ a more abstract per-
formance model based on the Markovian assumption, then
we use a more realistic performance model – to be validated
against the Markovian one – where general probability dis-
tributions are considered. The methodology is illustrated by
means of its application to the study of a remote procedure
call mechanism – through which a battery-powered device
is used by some application requesting information – and
of a streami...

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


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

Output:
安全论文分析：

title:Risky Business? Investigating the Security Practices of Vendors on
an Online Anonymous Market using Ground-Truth Data
author:Jochem van de Laarschot and
Rolf van Wegberg
Risky Business? Investigating the Security Practices
of Vendors on an Online Anonymous Market using
Ground-Truth Data
Jochem van de Laarschot and Rolf van Wegberg, Delft University of Technology
https://www.usenix.org/conference/usenixsecurity21/presentation/van-de-laarschot
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.Risky Business? Investigating the Security Practices of Vendors on an Online
Anonymous Market using Ground-Truth Data
Jochem van de Laarschot
Delft University of Technology
Rolf van Wegberg
Delft University of Technology
Abstract
Cybercriminal entrepreneurs on online anonymous markets
rely on security mechanisms to thwart investigators in at-
tributing their illicit activities. Earlier work indicates that –
despite the high-risk criminal context – cybercriminals may
turn to poor security practices due to competing business
incentives. This claim has not yet been supported through
empirical, quantitative analysis on ground-truth data. In this
paper, we investigate the security practices on Hansa Mar-
ket (2015-2017) and measure the prevalence of poor security
practices across the vendor population (n = 1,733).
We create ‘vendor types’ based on latent proﬁle analysis,
clustering vendors that are similar regarding their experience,
activity on other markets, and the amount of physical and dig-
ital items sold. We then analyze how these types of vendors
differ in their security practices. To that end, we capture their
password strength and password uniqueness, 2FA usage, PGP
adoption and key strength, PGP-key reuse and the traceability
of their cash-out. We ﬁnd that insecure practices are prevalent
across all types of ve...


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

Input:
title:Risky Business? Investigating the Security Practices of Vendors on
an Online Anonymous Market using Ground-Truth Data
author:Jochem van de Laarschot and
Rolf van Wegberg
Risky Business? Investigating the Security Practices
of Vendors on an Online Anonymous Market using
Ground-Truth Data
Jochem van de Laarschot and Rolf van Wegberg, Delft University of Technology
https://www.usenix.org/conference/usenixsecurity21/presentation/van-de-laarschot
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.Risky Business? Investigating the Security Practices of Vendors on an Online
Anonymous Market using Ground-Truth Data
Jochem van de Laarschot
Delft University of Technology
Rolf van Wegberg
Delft University of Technology
Abstract
Cybercriminal entrepreneurs on online anonymous markets
rely on security mechanisms to thwart investigators in at-
tributing their illicit activities. Earlier work indicates that –
despite the high-risk criminal context – cybercriminals may
turn to poor security practices due to competing business
incentives. This claim has not yet been supported through
empirical, quantitative analysis on ground-truth data. In this
paper, we investigate the security practices on Hansa Mar-
ket (2015-2017) and measure the prevalence of poor security
practices across the vendor population (n = 1,733).
We create ‘vendor types’ based on latent proﬁle analysis,
clustering vendors that are similar regarding their experience,
activity on other markets, and the amount of physical and dig-
ital items sold. We then analyze how these types of vendors
differ in their security practices. To that end, we capture their
password strength and password uniqueness, 2FA usage, PGP
adoption and key strength, PGP-key reuse and the traceability
of their cash-out. We ﬁnd that insecure practices are prevalent
across all types of ve...

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


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

Output:
安全论文分析：

title:An identity authentication protocol in online social networks
author:Lingjun Li and
Xinxin Zhao and
Guoliang Xue
SECURITY AND COMMUNICATION NETWORKS
Security Comm. Networks (2012)
Published online in Wiley Online Library (wileyonlinelibrary.com). DOI: 10.1002/sec.412
SPECIAL ISSUE PAPER
Efﬁcient identity-based hierarchical access
authentication protocol for mobile network
He Liu and Mangui Liang*
Institute of Information Science, Beijing Jiaotong university, Beijing 100044, China
ABSTRACT
This paper presents a secure and efﬁcient hierarchical identity-based access authentication protocol for mobile network.
First, a new mobile scheme is constructed to improve the registration performance by the port-based vector switching;
especially when there are multihops and bandwidth between the user and home network, the registration delay is greatly
reduced. Second, an access authentication protocol is proposed by combining the designed mobile proposal with hierarchical
identity-based signature. It has the characteristics of identity based, local veriﬁcation, concurrency and hierarchy. The whole
authenticating process is divided into two phrases to precompute some time-consuming parameters, which are important to
decrease the effects of the signing/verifying. Besides, a new access router selection algorithm is given for the mobile user
to choose optimal access point in this paper. The theoretical analysis and simulating results show that the proposed
authentication protocol outperforms the previous ones in terms of the handover delay integrating the authentication with
its security enhanced. For example, the falling speed of the new protocol’s total latency is reduced about 50% and 83%,
respectively, compared with the existing identity-based-signature-based and Rivest–Shamir–Adleman-based schemes.
Copyright © 2012 John Wiley & Sons, Ltd.
KEYWORDS
access authentication; HIBS; registration; hierarchical identity-based
*Correspondence
Mangui Liang, Institute of Information...


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

Input:
title:An identity authentication protocol in online social networks
author:Lingjun Li and
Xinxin Zhao and
Guoliang Xue
SECURITY AND COMMUNICATION NETWORKS
Security Comm. Networks (2012)
Published online in Wiley Online Library (wileyonlinelibrary.com). DOI: 10.1002/sec.412
SPECIAL ISSUE PAPER
Efﬁcient identity-based hierarchical access
authentication protocol for mobile network
He Liu and Mangui Liang*
Institute of Information Science, Beijing Jiaotong university, Beijing 100044, China
ABSTRACT
This paper presents a secure and efﬁcient hierarchical identity-based access authentication protocol for mobile network.
First, a new mobile scheme is constructed to improve the registration performance by the port-based vector switching;
especially when there are multihops and bandwidth between the user and home network, the registration delay is greatly
reduced. Second, an access authentication protocol is proposed by combining the designed mobile proposal with hierarchical
identity-based signature. It has the characteristics of identity based, local veriﬁcation, concurrency and hierarchy. The whole
authenticating process is divided into two phrases to precompute some time-consuming parameters, which are important to
decrease the effects of the signing/verifying. Besides, a new access router selection algorithm is given for the mobile user
to choose optimal access point in this paper. The theoretical analysis and simulating results show that the proposed
authentication protocol outperforms the previous ones in terms of the handover delay integrating the authentication with
its security enhanced. For example, the falling speed of the new protocol’s total latency is reduced about 50% and 83%,
respectively, compared with the existing identity-based-signature-based and Rivest–Shamir–Adleman-based schemes.
Copyright © 2012 John Wiley & Sons, Ltd.
KEYWORDS
access authentication; HIBS; registration; hierarchical identity-based
*Correspondence
Mangui Liang, Institute of Information...

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


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

Output:
安全论文分析：

title:A Comprehensive Symbolic Analysis of TLS 1.3
author:Cas Cremers and
Marko Horvat and
Jonathan Hoyland and
Sam Scott and
Thyla van der Merwe
A Comprehensive Symbolic Analysis of TLS 1.3
Cas Cremers
Jonathan Hoyland
Marko Horvat
MPI-SWS, Germany
University of Oxford, UK
Royal Holloway, University of
London, UK
Royal Holloway, University of
Sam Scott
London, UK
Thyla van der Merwe
Royal Holloway, University of
London, UK
ABSTRACT
The TLS protocol is intended to enable secure end-to-end commu-
nication over insecure networks, including the Internet. Unfortu-
nately, this goal has been thwarted a number of times throughout
the protocol’s tumultuous lifetime, resulting in the need for a new
version of the protocol, namely TLS 1.3. Over the past three years, in
an unprecedented joint design effort with the academic community,
the TLS Working Group has been working tirelessly to enhance
the security of TLS.
We further this effort by constructing the most comprehensive,
faithful, and modular symbolic model of the TLS 1.3 draft 21 release
candidate, and use the Tamarin prover to verify the claimed TLS 1.3
security requirements, as laid out in draft 21 of the specification. In
particular, our model covers all handshake modes of TLS 1.3.
Our analysis reveals an unexpected behaviour, which we expect
will inhibit strong authentication guarantees in some implementa-
tions of the protocol. In contrast to previous models, we provide
a novel way of making the relation between the TLS specification
and our model explicit: we provide a fully annotated version of
the specification that clarifies what protocol elements we modelled,
and precisely how we modelled these elements. We anticipate this
model artifact to be of great benefit to the academic community
and the TLS Working Group alike.
KEYWORDS
symbolic verification, authenticated key exchange, TLS 1.3
1 INTRODUCTION
The Transport Layer Security (TLS) protocol is the de facto means
for securing communications on the World Wide...


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

Input:
title:A Comprehensive Symbolic Analysis of TLS 1.3
author:Cas Cremers and
Marko Horvat and
Jonathan Hoyland and
Sam Scott and
Thyla van der Merwe
A Comprehensive Symbolic Analysis of TLS 1.3
Cas Cremers
Jonathan Hoyland
Marko Horvat
MPI-SWS, Germany
University of Oxford, UK
Royal Holloway, University of
London, UK
Royal Holloway, University of
Sam Scott
London, UK
Thyla van der Merwe
Royal Holloway, University of
London, UK
ABSTRACT
The TLS protocol is intended to enable secure end-to-end commu-
nication over insecure networks, including the Internet. Unfortu-
nately, this goal has been thwarted a number of times throughout
the protocol’s tumultuous lifetime, resulting in the need for a new
version of the protocol, namely TLS 1.3. Over the past three years, in
an unprecedented joint design effort with the academic community,
the TLS Working Group has been working tirelessly to enhance
the security of TLS.
We further this effort by constructing the most comprehensive,
faithful, and modular symbolic model of the TLS 1.3 draft 21 release
candidate, and use the Tamarin prover to verify the claimed TLS 1.3
security requirements, as laid out in draft 21 of the specification. In
particular, our model covers all handshake modes of TLS 1.3.
Our analysis reveals an unexpected behaviour, which we expect
will inhibit strong authentication guarantees in some implementa-
tions of the protocol. In contrast to previous models, we provide
a novel way of making the relation between the TLS specification
and our model explicit: we provide a fully annotated version of
the specification that clarifies what protocol elements we modelled,
and precisely how we modelled these elements. We anticipate this
model artifact to be of great benefit to the academic community
and the TLS Working Group alike.
KEYWORDS
symbolic verification, authenticated key exchange, TLS 1.3
1 INTRODUCTION
The Transport Layer Security (TLS) protocol is the de facto means
for securing communications on the World Wide...

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


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

Output:
安全论文分析：

title:Workshop on Recent Advances in the DependabIlity AssessmeNt of Complex
systEms (RADIANCE)
author:Ariadne M. B. R. Carvalho and
Nuno Antunes and
Andrea Ceccarelli and
Andr'as Zentai
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Recent Advances in the DependabIlity AssessmeNt
of Complex systEms (RADIANCE)
Ariadne M. B. R. Carvalho∗, Nuno Antunes†, Andrea Ceccarelli‡ and Andras Zentai§
∗Institute of Computing, University of Campinas, Campinas, SP, Brazil
†CISUC, Department of Informatics Engineering, University of Coimbra, Portugal
ariadne@ic.unicamp.br
‡Department of Mathematics and Informatics, CINI-University of Florence, Florence, Italy
nmsa@dei.uc.pt
andrea.ceccarelli@uniﬁ.it
§Prolan Co., Budakalasz, Hungary
zentai.andras@prolan.hu
Keywords—dependability assessment; complex systems; fault
injection; dynamic systems
I. MOTIVATION AND GOALS
Critical systems are becoming more and more complex
and heterogeneous, integrating previously separated systems
and including design solutions ranging from the introduction
of software Off-The-Shelf (OTS) to the adoption of loosely-
integrated and composable services. Innovative dependabil-
ity assessment solutions and certiﬁcation processes are thus
needed to deal with such complexity, calling for new solutions
for the efﬁcient, automated, and possibly continuous assess-
ment and certiﬁcation.
The workshop on Recent Advances in the DependabIlity
AssessmeNt of Complex systEms (RADIANCE),
in its
ﬁrst edition, aims to discuss novel dependability assessment
approaches for complex systems and to promote their adoption
in real-world settings through industrial and academic research.
The main objective is to promote and foster discussion on
novel ideas, constituting a forum where researchers can share
both real problems and innovative solutions for the assessment
of complex systems.
The workshop foc...


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

Input:
title:Workshop on Recent Advances in the DependabIlity AssessmeNt of Complex
systEms (RADIANCE)
author:Ariadne M. B. R. Carvalho and
Nuno Antunes and
Andrea Ceccarelli and
Andr'as Zentai
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Recent Advances in the DependabIlity AssessmeNt
of Complex systEms (RADIANCE)
Ariadne M. B. R. Carvalho∗, Nuno Antunes†, Andrea Ceccarelli‡ and Andras Zentai§
∗Institute of Computing, University of Campinas, Campinas, SP, Brazil
†CISUC, Department of Informatics Engineering, University of Coimbra, Portugal
ariadne@ic.unicamp.br
‡Department of Mathematics and Informatics, CINI-University of Florence, Florence, Italy
nmsa@dei.uc.pt
andrea.ceccarelli@uniﬁ.it
§Prolan Co., Budakalasz, Hungary
zentai.andras@prolan.hu
Keywords—dependability assessment; complex systems; fault
injection; dynamic systems
I. MOTIVATION AND GOALS
Critical systems are becoming more and more complex
and heterogeneous, integrating previously separated systems
and including design solutions ranging from the introduction
of software Off-The-Shelf (OTS) to the adoption of loosely-
integrated and composable services. Innovative dependabil-
ity assessment solutions and certiﬁcation processes are thus
needed to deal with such complexity, calling for new solutions
for the efﬁcient, automated, and possibly continuous assess-
ment and certiﬁcation.
The workshop on Recent Advances in the DependabIlity
AssessmeNt of Complex systEms (RADIANCE),
in its
ﬁrst edition, aims to discuss novel dependability assessment
approaches for complex systems and to promote their adoption
in real-world settings through industrial and academic research.
The main objective is to promote and foster discussion on
novel ideas, constituting a forum where researchers can share
both real problems and innovative solutions for the assessment
of complex systems.
The workshop foc...

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


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

Output:
安全论文分析：

title:Known/Chosen Key Attacks against Software Instruction Set Randomization
author:Yoav Weiss and
Elena Gabriela Barrantes
Known/Chosen key attacks against
software Instruction Set Randomization
Discretix Technologies Ltd.
Yoav Weiss
POB 8718
Kefar Netter, Israel
YoavW@discretix.com
Abstract
Instruction Set Randomization (ISR) has been proposed as
a form of defense against binary code injection into an ex-
ecuting program. One proof-of-concept implementation is
Randomized Instruction Set Emulator (RISE), based on the
open-source Valgrind IA-32 to IA-32 binary translator. Al-
though RISE is effective against attacks that are not RISE-
aware, it is vulnerable to pure data and hybrid data-code
attacks that target its data, as well to some classes of brute-
force guessing.
In order to enable the design of a pro-
duction version, we describe implementation-speciﬁc and
generic vulnerabilities that can be used to overcome RISE
in its current form. We present and discuss attacks and so-
lutions in three categories: known-key attacks that rely on
the key being leaked and then used to pre-scramble the at-
tacking code; chosen-key attacks that use implementation
weaknesses to allow the attacker to deﬁne its own key,or
otherwise affect key generation; and key-guessing (“brute-
force”) attacks, about which we explore the design of mini-
malistic loaders which can be used to minimize the number
of mask bytes required for a successful key-guessing attack.
All the described attacks were tested in real-world scenar-
ios.
1. Introduction
Instruction Set Randomization (ISR) is a security approach
that scrambles the instruction set, making it harder to inject
meaningful code into a process [1, 10]. This approach imi-
tates the protection afforded by the genetic diversity found
in nature. Although theoretically sound against its threat
model, any software ISR implementation (via emulation),
will suffer from vulnerabilities related to the lack of hard-
ware support, and the complexity ...


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

Input:
title:Known/Chosen Key Attacks against Software Instruction Set Randomization
author:Yoav Weiss and
Elena Gabriela Barrantes
Known/Chosen key attacks against
software Instruction Set Randomization
Discretix Technologies Ltd.
Yoav Weiss
POB 8718
Kefar Netter, Israel
YoavW@discretix.com
Abstract
Instruction Set Randomization (ISR) has been proposed as
a form of defense against binary code injection into an ex-
ecuting program. One proof-of-concept implementation is
Randomized Instruction Set Emulator (RISE), based on the
open-source Valgrind IA-32 to IA-32 binary translator. Al-
though RISE is effective against attacks that are not RISE-
aware, it is vulnerable to pure data and hybrid data-code
attacks that target its data, as well to some classes of brute-
force guessing.
In order to enable the design of a pro-
duction version, we describe implementation-speciﬁc and
generic vulnerabilities that can be used to overcome RISE
in its current form. We present and discuss attacks and so-
lutions in three categories: known-key attacks that rely on
the key being leaked and then used to pre-scramble the at-
tacking code; chosen-key attacks that use implementation
weaknesses to allow the attacker to deﬁne its own key,or
otherwise affect key generation; and key-guessing (“brute-
force”) attacks, about which we explore the design of mini-
malistic loaders which can be used to minimize the number
of mask bytes required for a successful key-guessing attack.
All the described attacks were tested in real-world scenar-
ios.
1. Introduction
Instruction Set Randomization (ISR) is a security approach
that scrambles the instruction set, making it harder to inject
meaningful code into a process [1, 10]. This approach imi-
tates the protection afforded by the genetic diversity found
in nature. Although theoretically sound against its threat
model, any software ISR implementation (via emulation),
will suffer from vulnerabilities related to the lack of hard-
ware support, and the complexity ...

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


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

Output:
安全论文分析：

title:Extended privilege inheritance in RBAC
author:M. A. C. Dekker and
J. G. Cederquist and
Jason Crampton and
Sandro Etalle
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/221609664
Extended privilege inheritance in RBAC
Conference Paper · January 2007
DOI: 10.1145/1229285.1229335 · Source: DBLP
CITATIONS
5
4 authors:
Mendie Dekker
Windesheim University
13 PUBLICATIONS   232 CITATIONS
SEE PROFILE
Jason Crampton
Royal Holloway, University of London
97 PUBLICATIONS   2,160 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Towards an Internet of Secure Things (INTERSECT) View project
Cryptographic Enforcement of Information Flow Policies View project
READS
51
Jan Cederquist
Technical University of Lisbon
18 PUBLICATIONS   265 CITATIONS
SEE PROFILE
Sandro Etalle
Eindhoven University of Technology
228 PUBLICATIONS   2,502 CITATIONS
SEE PROFILE
All content following this page was uploaded by Sandro Etalle on 22 May 2014.
The user has requested enhancement of the downloaded file.
Extended Privilege Inheritance in RBAC∗
M.A.C. Dekker†
J. Cederquist‡
J. Crampton§
S. Etalle¶
December 20, 2006
Abstract
In existing RBAC literature, administrative privileges are inherited
just like ordinary user privileges. We argue that from a security view-
point this is too restrictive, and we believe that a more ﬂexible approach
can be very useful in practice. We deﬁne an ordering on the set of adminis-
trative privileges, enabling us to extend the standard privilege inheritance
relation in a natural way. This means that if a user has a particular ad-
ministrative privilege, then she is also implicitly authorized for weaker
administrative privileges. We prove the non-trivial result that it is possi-
ble to decide whether one administrative privilege is weaker than another
and show how this result can be used to decide administrative requests in
an RBAC security...


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

Input:
title:Extended privilege inheritance in RBAC
author:M. A. C. Dekker and
J. G. Cederquist and
Jason Crampton and
Sandro Etalle
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/221609664
Extended privilege inheritance in RBAC
Conference Paper · January 2007
DOI: 10.1145/1229285.1229335 · Source: DBLP
CITATIONS
5
4 authors:
Mendie Dekker
Windesheim University
13 PUBLICATIONS   232 CITATIONS
SEE PROFILE
Jason Crampton
Royal Holloway, University of London
97 PUBLICATIONS   2,160 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Towards an Internet of Secure Things (INTERSECT) View project
Cryptographic Enforcement of Information Flow Policies View project
READS
51
Jan Cederquist
Technical University of Lisbon
18 PUBLICATIONS   265 CITATIONS
SEE PROFILE
Sandro Etalle
Eindhoven University of Technology
228 PUBLICATIONS   2,502 CITATIONS
SEE PROFILE
All content following this page was uploaded by Sandro Etalle on 22 May 2014.
The user has requested enhancement of the downloaded file.
Extended Privilege Inheritance in RBAC∗
M.A.C. Dekker†
J. Cederquist‡
J. Crampton§
S. Etalle¶
December 20, 2006
Abstract
In existing RBAC literature, administrative privileges are inherited
just like ordinary user privileges. We argue that from a security view-
point this is too restrictive, and we believe that a more ﬂexible approach
can be very useful in practice. We deﬁne an ordering on the set of adminis-
trative privileges, enabling us to extend the standard privilege inheritance
relation in a natural way. This means that if a user has a particular ad-
ministrative privilege, then she is also implicitly authorized for weaker
administrative privileges. We prove the non-trivial result that it is possi-
ble to decide whether one administrative privilege is weaker than another
and show how this result can be used to decide administrative requests in
an RBAC security...

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


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

Output:
安全论文分析：

title:Workshop on Multimedia Privacy and Security
author:Roger Hallman and
Kurt Rohloff and
Victor Chang
Workshop on Multimedia Privacy and Security*
Roger Hallman
Kurt Rohloff
Victor Chang
US Navy SPAWAR Systems Center
New Jersey Institute of Technology
Xian Jiaotong Liverpool University
Pacific
San Diego, California
roger.hallman@navy.mil
Newark, New Jersey
rohloff@njit.edu
Suzhou, China
ic.victor.chang@gmail.com
CCS CONCEPTS
 Security and privacy  Information accountability and
usage control ; Software security engineering;
KEYWORDS
Security,Privacy,Multimedia
This workshop addresses the technical challenges arising from
our current interconnected society. Multitudes of devices and
people can be connected to each other by intelligent algo-
rithms, apps, social networks, and the infrastructure set by
Internet of Things (IoT). As more people and their devices
are connected without much restriction, the issues of security,
privacy, and trust remain a challenge. Multimedia in IoT
services should provide a robust and resilient security plat-
forms and solutions against any unauthorized access. Recent
literature shows increased concerns about hacking, security
breaches, data manipulation, social engineering, and new
attack methods. Malware can be hidden within multimedia
files and visiting infected websites can trigger its download to
victims machines. There are a multitude of techniques to steal
personal information and other sensitive media for unautho-
rized dissemination; imposters/identity thefts are common
in social networks. In order to demonstrate the effectiveness
of resilient security and privacy solutions, methods such as
new standards, advance cryptography, improved algorithms
for intrusion detection, personalized privacy, and isolation of
questionable or malicious files can be used independently or
all together to minimize the threats.
Multimedia has expanded beyond the scope its original
definition. With the rise of social media, large quantities of
mul...


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

Input:
title:Workshop on Multimedia Privacy and Security
author:Roger Hallman and
Kurt Rohloff and
Victor Chang
Workshop on Multimedia Privacy and Security*
Roger Hallman
Kurt Rohloff
Victor Chang
US Navy SPAWAR Systems Center
New Jersey Institute of Technology
Xian Jiaotong Liverpool University
Pacific
San Diego, California
roger.hallman@navy.mil
Newark, New Jersey
rohloff@njit.edu
Suzhou, China
ic.victor.chang@gmail.com
CCS CONCEPTS
 Security and privacy  Information accountability and
usage control ; Software security engineering;
KEYWORDS
Security,Privacy,Multimedia
This workshop addresses the technical challenges arising from
our current interconnected society. Multitudes of devices and
people can be connected to each other by intelligent algo-
rithms, apps, social networks, and the infrastructure set by
Internet of Things (IoT). As more people and their devices
are connected without much restriction, the issues of security,
privacy, and trust remain a challenge. Multimedia in IoT
services should provide a robust and resilient security plat-
forms and solutions against any unauthorized access. Recent
literature shows increased concerns about hacking, security
breaches, data manipulation, social engineering, and new
attack methods. Malware can be hidden within multimedia
files and visiting infected websites can trigger its download to
victims machines. There are a multitude of techniques to steal
personal information and other sensitive media for unautho-
rized dissemination; imposters/identity thefts are common
in social networks. In order to demonstrate the effectiveness
of resilient security and privacy solutions, methods such as
new standards, advance cryptography, improved algorithms
for intrusion detection, personalized privacy, and isolation of
questionable or malicious files can be used independently or
all together to minimize the threats.
Multimedia has expanded beyond the scope its original
definition. With the rise of social media, large quantities of
mul...

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


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

Output:
安全论文分析：

title:Deadline-Aware Multipath Communication: An Optimization Problem
author:Laurent Chuat and
Adrian Perrig and
Yih-Chun Hu
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Deadline-Aware Multipath Communication:
An Optimization Problem
Laurent Chuat∗, Adrian Perrig∗, Yih-Chun Hu†
∗Department of Computer Science, ETH Zurich, Switzerland
†Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA
rates (which depend on distance and other environmental
conditions) and lower bandwidth.
Abstract—Multipath communication not only allows im-
proved throughput but can also be used to leverage different
path characteristics to best fulﬁll each application’s objective.
In particular, certain delay-sensitive applications, such as real-
time voice and video communications, can usually withstand
packet loss and aim to maximize throughput while keeping
latency at a reasonable level. In such a context, one hard
problem is to determine along which path the data should
be transmitted or retransmitted. In this paper, we formulate
this problem as a linear optimization, show bounds on the
performance that can be obtained in a multipath paradigm,
and show that path diversity is a strong asset for improving
network performance. We also discuss how these theoretical
limits can be approached in practice and present simulation
results.
I. INTRODUCTION
Looking back in history, many computer systems were
initially designed to use only a single resource of each
type (e.g., processor, memory, display) at once. Over time,
to increase the performance of these systems, we have seen
the development of better components (in terms of speed,
capacity, or size) and more efﬁcient algorithms; but these
options are limited by the laws of physics, the ingenuity
of researchers, and the nature of the problem. Parallelism
emerged as the other options faced barriers (as illustrated
by the development of multicore processors, for exa...


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

Input:
title:Deadline-Aware Multipath Communication: An Optimization Problem
author:Laurent Chuat and
Adrian Perrig and
Yih-Chun Hu
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Deadline-Aware Multipath Communication:
An Optimization Problem
Laurent Chuat∗, Adrian Perrig∗, Yih-Chun Hu†
∗Department of Computer Science, ETH Zurich, Switzerland
†Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA
rates (which depend on distance and other environmental
conditions) and lower bandwidth.
Abstract—Multipath communication not only allows im-
proved throughput but can also be used to leverage different
path characteristics to best fulﬁll each application’s objective.
In particular, certain delay-sensitive applications, such as real-
time voice and video communications, can usually withstand
packet loss and aim to maximize throughput while keeping
latency at a reasonable level. In such a context, one hard
problem is to determine along which path the data should
be transmitted or retransmitted. In this paper, we formulate
this problem as a linear optimization, show bounds on the
performance that can be obtained in a multipath paradigm,
and show that path diversity is a strong asset for improving
network performance. We also discuss how these theoretical
limits can be approached in practice and present simulation
results.
I. INTRODUCTION
Looking back in history, many computer systems were
initially designed to use only a single resource of each
type (e.g., processor, memory, display) at once. Over time,
to increase the performance of these systems, we have seen
the development of better components (in terms of speed,
capacity, or size) and more efﬁcient algorithms; but these
options are limited by the laws of physics, the ingenuity
of researchers, and the nature of the problem. Parallelism
emerged as the other options faced barriers (as illustrated
by the development of multicore processors, for exa...

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


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

Output:
安全论文分析：

title:Exploiting a Thermal Side Channel for Power Attacks in Multi-Tenant
Data Centers
author:Mohammad A. Islam and
Shaolei Ren and
Adam Wierman
A First Look at Power Attacks in Multi-Tenant Data Centers
[Extended Abstract]
Mohammad A. Islam
University of California, Riverside
Shaolei Ren
University of California, Riverside
Adam Wierman
California Institute of Technology
ABSTRACT
Oversubscription increases the utilization of expensive power in-
frastructure in multi-tenant data centers, but it can create dangerous
emergencies and outages if the designed power capacity is exceeded.
Despite the safeguards in place today to prevent power outages,
this extended abstract demonstrates that multi-tenant data centers
are vulnerable to well-timed power attacks launched by a malicious
tenant (i.e., attacker). Further, we show that there is a physical side
channel — a thermal side channel due to hot air recirculation —
that contains information about the benign tenants’ runtime power
usage. We develop a state-augmented Kalman filter that guides an
attacker to precisely time its power attacks at moments that coin-
cide with the benign tenants’ high power demand, thus overloading
the designed power capacity. Our experimental results show that
an attacker can capture 53% of all attack opportunities, significantly
compromising the data center availability.
1 INTRODUCTION
Multi-tenant data centers are shared data center facilities where
tenants house their physical servers while the data center operator
is responsible for managing the non-IT support systems such as
power distribution and cooling. They are a very important segment
of data centers and adopted widely by many industry sectors. For
example, Apple has 25% of its servers in multi-tenant data centers.
As of today, there are nearly 2,000 multi-tenant data centers in the
U.S., consuming five times the energy of Google-type data centers
altogether.
To accommodate the fast growing Internet and cloud-based ser-
vices, multi-ten...


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

Input:
title:Exploiting a Thermal Side Channel for Power Attacks in Multi-Tenant
Data Centers
author:Mohammad A. Islam and
Shaolei Ren and
Adam Wierman
A First Look at Power Attacks in Multi-Tenant Data Centers
[Extended Abstract]
Mohammad A. Islam
University of California, Riverside
Shaolei Ren
University of California, Riverside
Adam Wierman
California Institute of Technology
ABSTRACT
Oversubscription increases the utilization of expensive power in-
frastructure in multi-tenant data centers, but it can create dangerous
emergencies and outages if the designed power capacity is exceeded.
Despite the safeguards in place today to prevent power outages,
this extended abstract demonstrates that multi-tenant data centers
are vulnerable to well-timed power attacks launched by a malicious
tenant (i.e., attacker). Further, we show that there is a physical side
channel — a thermal side channel due to hot air recirculation —
that contains information about the benign tenants’ runtime power
usage. We develop a state-augmented Kalman filter that guides an
attacker to precisely time its power attacks at moments that coin-
cide with the benign tenants’ high power demand, thus overloading
the designed power capacity. Our experimental results show that
an attacker can capture 53% of all attack opportunities, significantly
compromising the data center availability.
1 INTRODUCTION
Multi-tenant data centers are shared data center facilities where
tenants house their physical servers while the data center operator
is responsible for managing the non-IT support systems such as
power distribution and cooling. They are a very important segment
of data centers and adopted widely by many industry sectors. For
example, Apple has 25% of its servers in multi-tenant data centers.
As of today, there are nearly 2,000 multi-tenant data centers in the
U.S., consuming five times the energy of Google-type data centers
altogether.
To accommodate the fast growing Internet and cloud-based ser-
vices, multi-ten...

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


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

Output:
安全论文分析：

title:Self Destructing Exploit Executions via Input Perturbation
author:Yonghwi Kwon and
Brendan Saltaformaggio and
I Luk Kim and
Kyu Hyung Lee and
Xiangyu Zhang and
Dongyan Xu
A2C: Self Destructing Exploit Executions via Input Perturbation
Yonghwi Kwon*, Brendan Saltaformaggio*, I Luk Kim*, Kyu Hyung Lee†, Xiangyu Zhang*, and Dongyan Xu*
*Department of Computer Science, Purdue University
{kwon58, bsaltafo, kim1634, xyzhang, dxu}@cs.purdue.edu
†Department of Computer Science, University of Georgia
kyuhlee@cs.uga.edu
Abstract—Malicious payload injection attacks have been a
serious threat to software for decades. Unfortunately, protec-
tion against these attacks remains challenging due to the ever
increasing diversity and sophistication of payload injection and
triggering mechanisms used by adversaries. In this paper, we
develop A2C, a system that provides general protection against
payload injection attacks. A2C is based on the observation that
payloads are highly fragile and thus any mutation would likely
break their functionalities. Therefore, A2C mutates inputs from
untrusted sources. Malicious payloads that reside in these inputs
are hence mutated and broken. To assure that the program
continues to function correctly when benign inputs are provided,
A2C divides the state space into exploitable and post-exploitable
sub-spaces, where the latter is much larger than the former, and
decodes the mutated values only when they are transmitted from
the former to the latter. A2C does not rely on any knowledge of
malicious payloads or their injection and triggering mechanisms.
Hence, its protection is general. We evaluate A2C with 30 real-
world applications, including apache on a real-world work-load,
and our results show that A2C effectively prevents a variety of
payload injection attacks on these programs with reasonably low
overhead (6.94%).
I.
INTRODUCTION
Attacks which exploit software vulnerabilities are among
the most prevalent cyber-security threats to date. This i...


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

Input:
title:Self Destructing Exploit Executions via Input Perturbation
author:Yonghwi Kwon and
Brendan Saltaformaggio and
I Luk Kim and
Kyu Hyung Lee and
Xiangyu Zhang and
Dongyan Xu
A2C: Self Destructing Exploit Executions via Input Perturbation
Yonghwi Kwon*, Brendan Saltaformaggio*, I Luk Kim*, Kyu Hyung Lee†, Xiangyu Zhang*, and Dongyan Xu*
*Department of Computer Science, Purdue University
{kwon58, bsaltafo, kim1634, xyzhang, dxu}@cs.purdue.edu
†Department of Computer Science, University of Georgia
kyuhlee@cs.uga.edu
Abstract—Malicious payload injection attacks have been a
serious threat to software for decades. Unfortunately, protec-
tion against these attacks remains challenging due to the ever
increasing diversity and sophistication of payload injection and
triggering mechanisms used by adversaries. In this paper, we
develop A2C, a system that provides general protection against
payload injection attacks. A2C is based on the observation that
payloads are highly fragile and thus any mutation would likely
break their functionalities. Therefore, A2C mutates inputs from
untrusted sources. Malicious payloads that reside in these inputs
are hence mutated and broken. To assure that the program
continues to function correctly when benign inputs are provided,
A2C divides the state space into exploitable and post-exploitable
sub-spaces, where the latter is much larger than the former, and
decodes the mutated values only when they are transmitted from
the former to the latter. A2C does not rely on any knowledge of
malicious payloads or their injection and triggering mechanisms.
Hence, its protection is general. We evaluate A2C with 30 real-
world applications, including apache on a real-world work-load,
and our results show that A2C effectively prevents a variety of
payload injection attacks on these programs with reasonably low
overhead (6.94%).
I.
INTRODUCTION
Attacks which exploit software vulnerabilities are among
the most prevalent cyber-security threats to date. This i...

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


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

Output:
安全论文分析：

title:Speeding up Consensus by Chasing Fast Decisions
author:Balaji Arun and
Sebastiano Peluso and
Roberto Palmieri and
Giuliano Losa and
Binoy Ravindran
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Speeding up Consensus by Chasing Fast Decisions
Balaji Arun, Sebastiano Peluso, Roberto Palmieri, Giuliano Losa, Binoy Ravindran
{balajia,peluso,robertop,giuliano.losa,binoy}@vt.edu
ECE, Virginia Tech, USA
Abstract—This paper proposes CAESAR, a novel multi-leader
Generalized Consensus protocol for geographically replicated
sites. The main goal of CAESAR is to overcome one of the
major limitations of existing approaches, which is the signiﬁcant
performance degradation when application workload produces
conﬂicting requests. CAESAR does that by changing the way a
fast decision is taken: its ordering protocol does not reject a fast
decision for a client request if a quorum of nodes reply with
different dependency sets for that request. The effectiveness of
CAESAR is demonstrated through an evaluation study performed
on Amazon’s EC2 infrastructure using 5 geo-replicated sites.
CAESAR outperforms other multi-leader (e.g., EPaxos) competi-
tors by as much as 1.7x in the presence of 30% conﬂicting
requests, and single-leader (e.g., Multi-Paxos) by up to 3.5x.
Keywords-Consensus, Geo-Replication, Paxos
I. INTRODUCTION
Geographically replicated (geo-scale)
services, namely
those where actors are spread across geographic locations and
operate on the same shared database, can be implemented in an
easy manner by exploiting underlying synchronization mecha-
nisms that provide strong consistency guarantees. These mech-
anisms ultimately rely on implementations of Consensus [1]
to globally agree on sequences of operations to be executed.
Paxos [2], [3] is a popular algorithm for solving Consensus
among participants interconnected by asynchronous networks,
even in presence of faults, and it can be leveraged for building
such robust services [4], ...


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

Input:
title:Speeding up Consensus by Chasing Fast Decisions
author:Balaji Arun and
Sebastiano Peluso and
Roberto Palmieri and
Giuliano Losa and
Binoy Ravindran
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Speeding up Consensus by Chasing Fast Decisions
Balaji Arun, Sebastiano Peluso, Roberto Palmieri, Giuliano Losa, Binoy Ravindran
{balajia,peluso,robertop,giuliano.losa,binoy}@vt.edu
ECE, Virginia Tech, USA
Abstract—This paper proposes CAESAR, a novel multi-leader
Generalized Consensus protocol for geographically replicated
sites. The main goal of CAESAR is to overcome one of the
major limitations of existing approaches, which is the signiﬁcant
performance degradation when application workload produces
conﬂicting requests. CAESAR does that by changing the way a
fast decision is taken: its ordering protocol does not reject a fast
decision for a client request if a quorum of nodes reply with
different dependency sets for that request. The effectiveness of
CAESAR is demonstrated through an evaluation study performed
on Amazon’s EC2 infrastructure using 5 geo-replicated sites.
CAESAR outperforms other multi-leader (e.g., EPaxos) competi-
tors by as much as 1.7x in the presence of 30% conﬂicting
requests, and single-leader (e.g., Multi-Paxos) by up to 3.5x.
Keywords-Consensus, Geo-Replication, Paxos
I. INTRODUCTION
Geographically replicated (geo-scale)
services, namely
those where actors are spread across geographic locations and
operate on the same shared database, can be implemented in an
easy manner by exploiting underlying synchronization mecha-
nisms that provide strong consistency guarantees. These mech-
anisms ultimately rely on implementations of Consensus [1]
to globally agree on sequences of operations to be executed.
Paxos [2], [3] is a popular algorithm for solving Consensus
among participants interconnected by asynchronous networks,
even in presence of faults, and it can be leveraged for building
such robust services [4], ...

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


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

Output:
安全论文分析：

title:Detecting Duplex Mismatch on Ethernet
author:Stanislav Shalunov and
Richard Carlson
Detecting Duplex Mismatch on Ethernet
Stanislav Shalunov and Richard Carlson(cid:1)
{shalunov, rcarlson}@internet2.edu
Abstract. IEEE 802.3 Ethernet networks, a standard LAN environ-
ment, provide a way to auto-negotiate the settings of capacity (10, 100,
or 1000 Mb/s) and duplex (full- or half-). Under certain conditions de-
scribed below, the auto-negotiation protocol fails to work properly. The
resultant conﬁguration problem, duplex mismatch, appears to be com-
mon; when this problem occurs, the connectivity is impaired, but not
completely removed. This can result in performance problems that are
hard to locate.
This paper describes a work in progress aimed at (i) studying the con-
dition of duplex mismatch in IEEE 802.3 Ethernet networks, (ii) produc-
ing an analytical model of duplex mismatch, (iii) validating the model,
(iv) studying the eﬀects of duplex mismatch on TCP throughput, (v) de-
signing an algorithm for duplex mismatch detection using data from
active testing, and (vi) incorporating the detection algorithm into an
existing open-source network troubleshooting tool (NDT).
1
Introduction
Ethernet duplex mismatch is a condition that occurs when two devices commu-
nicating over an IEEE 802.3 Ethernet link (typically, a host and a switch) do
not agree on the duplex mode of the direct Ethernet connection between them;
the switch might operate as if the connection were full-duplex with the host
operating in half-duplex mode, or vice versa (section 2 describes the condition
in more detail). Duplex mismatch causes some packets to be lost (see section 3)
and, in many cases, leads to serious performance degradation (see section 4.2).
Section 5 discusses soft failures similar to duplex mismatch. Section 6 describes
an algorithm to detect a duplex mismatch condition by observing the behavior of
the network when test traﬃc is injected, and describes integrating the detection
...


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

Input:
title:Detecting Duplex Mismatch on Ethernet
author:Stanislav Shalunov and
Richard Carlson
Detecting Duplex Mismatch on Ethernet
Stanislav Shalunov and Richard Carlson(cid:1)
{shalunov, rcarlson}@internet2.edu
Abstract. IEEE 802.3 Ethernet networks, a standard LAN environ-
ment, provide a way to auto-negotiate the settings of capacity (10, 100,
or 1000 Mb/s) and duplex (full- or half-). Under certain conditions de-
scribed below, the auto-negotiation protocol fails to work properly. The
resultant conﬁguration problem, duplex mismatch, appears to be com-
mon; when this problem occurs, the connectivity is impaired, but not
completely removed. This can result in performance problems that are
hard to locate.
This paper describes a work in progress aimed at (i) studying the con-
dition of duplex mismatch in IEEE 802.3 Ethernet networks, (ii) produc-
ing an analytical model of duplex mismatch, (iii) validating the model,
(iv) studying the eﬀects of duplex mismatch on TCP throughput, (v) de-
signing an algorithm for duplex mismatch detection using data from
active testing, and (vi) incorporating the detection algorithm into an
existing open-source network troubleshooting tool (NDT).
1
Introduction
Ethernet duplex mismatch is a condition that occurs when two devices commu-
nicating over an IEEE 802.3 Ethernet link (typically, a host and a switch) do
not agree on the duplex mode of the direct Ethernet connection between them;
the switch might operate as if the connection were full-duplex with the host
operating in half-duplex mode, or vice versa (section 2 describes the condition
in more detail). Duplex mismatch causes some packets to be lost (see section 3)
and, in many cases, leads to serious performance degradation (see section 4.2).
Section 5 discusses soft failures similar to duplex mismatch. Section 6 describes
an algorithm to detect a duplex mismatch condition by observing the behavior of
the network when test traﬃc is injected, and describes integrating the detection
...

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


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

Output:
安全论文分析：

title:On Random-Inspection-Based Intrusion Detection
author:Simon P. Chung and
Aloysius K. Mok
On Random-Inspection-Based
Intrusion Detection
Simon P. Chung and Aloysius K. Mok(cid:1)
University of Texas at Austin, Austin TX 78712, USA
Department of Computer Sciences,
{phchung, mok}@cs.utexas.edu
Abstract. Monitoring at the system-call-level interface has been an im-
portant tool in intrusion detection. In this paper, we identify the pre-
dictable nature of this monitoring mechanism as one root cause that
makes system-call-based intrusion detection systems vulnerable to
mimicry attacks. We propose random inspection as a complementary
monitoring mechanism to overcome this weakness. We demonstrate that
random-inspection-based intrusion detection is
inherently eﬀective
against mimicry attacks targeted at system-call-based systems. Further-
more, random-inspection-based intrusion detection systems are also very
strong stand-alone IDS systems. Our proposed approach is particularly
suitable for implementation on the Windows operating system that is
known to pose various implementation diﬃculties for system-call-based
systems. To demonstrate the usefulness of random inspection, we have
built a working prototype tool: the WindRain IDS. WindRain detects
code injection attacks based on information collected at random-
inspection points with acceptably low overhead. Our experiments show
that WindRain is very eﬀective in detecting several popular attacks
against Windows. The performance overhead of WindRain compares fa-
vorably to many other intrusion detection systems.
Keywords: Mimicry attacks, intrusion detection, computer security,
random inspection.
1 Introduction
Ever since they were ﬁrst introduced in [9, 15], system-call-based anomaly-
detection systems have been considered to be an eﬀective approach to achieve
intrusion detection in computer security, but there are also weaknesses in this
approach. In particular, system-call-based anomaly-detection systems have been
fo...


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

Input:
title:On Random-Inspection-Based Intrusion Detection
author:Simon P. Chung and
Aloysius K. Mok
On Random-Inspection-Based
Intrusion Detection
Simon P. Chung and Aloysius K. Mok(cid:1)
University of Texas at Austin, Austin TX 78712, USA
Department of Computer Sciences,
{phchung, mok}@cs.utexas.edu
Abstract. Monitoring at the system-call-level interface has been an im-
portant tool in intrusion detection. In this paper, we identify the pre-
dictable nature of this monitoring mechanism as one root cause that
makes system-call-based intrusion detection systems vulnerable to
mimicry attacks. We propose random inspection as a complementary
monitoring mechanism to overcome this weakness. We demonstrate that
random-inspection-based intrusion detection is
inherently eﬀective
against mimicry attacks targeted at system-call-based systems. Further-
more, random-inspection-based intrusion detection systems are also very
strong stand-alone IDS systems. Our proposed approach is particularly
suitable for implementation on the Windows operating system that is
known to pose various implementation diﬃculties for system-call-based
systems. To demonstrate the usefulness of random inspection, we have
built a working prototype tool: the WindRain IDS. WindRain detects
code injection attacks based on information collected at random-
inspection points with acceptably low overhead. Our experiments show
that WindRain is very eﬀective in detecting several popular attacks
against Windows. The performance overhead of WindRain compares fa-
vorably to many other intrusion detection systems.
Keywords: Mimicry attacks, intrusion detection, computer security,
random inspection.
1 Introduction
Ever since they were ﬁrst introduced in [9, 15], system-call-based anomaly-
detection systems have been considered to be an eﬀective approach to achieve
intrusion detection in computer security, but there are also weaknesses in this
approach. In particular, system-call-based anomaly-detection systems have been
fo...

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


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

Output:
安全论文分析：

title:ETMCC: Model Checking Performability Properties of Markov Chains
author:Holger Hermanns and
Joost-Pieter Katoen and
Joachim Meyer-Kayser and
Markus Siegle
ETMCC: Model Checking Performability Properties of Markov Chains
Holger Hermannsab, Joost-Pieter Katoenb, Joachim Meyer-Kayserc, Markus Sieglec
aDept. of Computer Science, Universit¨at des Saarlandes, Germany
bFormal Methods and Tools Group, University of Twente, The Netherlands
cDept. of Computer Science, Universit¨at Erlangen-N¨urnberg, Germany
Model Checking Markov Chains
Markov chains are widely used for modelling the behaviour
of computer and communication systems. A common goal
of modelling is the estimation of performance and depend-
ability measures of the system under study, such as through-
put, buffer occupancy or mean time to failure. With model
checking, the angle is somewhat different: Instead of con-
ducting an analysis whose aim it is to derive measures, one
ﬁrst speciﬁes requirements (with the help of a temporal
logic) which are then checked automatically. Model check-
ing of stochastic systems has developed into an active area
of research. The logic PCTL, an extension of CTL, and the
associated model checking algorithms allow one to spec-
ify and verify properties of DTMCs and Markov decision
processes.
In the continuous time setting, the logic CSL
[1, 2] has been developed for model checking properties of
CTMCs. While PCTL and CSL are based on the labelling
of states with elementary properties (atomic propositions),
the logic aCSL [3] is based on action-labelled transitions,
which is advantageous if used in the context of modelling
formalisms such as stochastic process algebra where the ba-
sic unit of behaviour is that of a named action.
The Erlangen-Twente Markov chain checker (ETMCC)
is a software tool which supports the automatic checking of
performability properties given as CSL or aCSL formulas.
The model to be checked is a ﬁnite CTMC labelled with
atomic propositions and/or transiti...


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

Input:
title:ETMCC: Model Checking Performability Properties of Markov Chains
author:Holger Hermanns and
Joost-Pieter Katoen and
Joachim Meyer-Kayser and
Markus Siegle
ETMCC: Model Checking Performability Properties of Markov Chains
Holger Hermannsab, Joost-Pieter Katoenb, Joachim Meyer-Kayserc, Markus Sieglec
aDept. of Computer Science, Universit¨at des Saarlandes, Germany
bFormal Methods and Tools Group, University of Twente, The Netherlands
cDept. of Computer Science, Universit¨at Erlangen-N¨urnberg, Germany
Model Checking Markov Chains
Markov chains are widely used for modelling the behaviour
of computer and communication systems. A common goal
of modelling is the estimation of performance and depend-
ability measures of the system under study, such as through-
put, buffer occupancy or mean time to failure. With model
checking, the angle is somewhat different: Instead of con-
ducting an analysis whose aim it is to derive measures, one
ﬁrst speciﬁes requirements (with the help of a temporal
logic) which are then checked automatically. Model check-
ing of stochastic systems has developed into an active area
of research. The logic PCTL, an extension of CTL, and the
associated model checking algorithms allow one to spec-
ify and verify properties of DTMCs and Markov decision
processes.
In the continuous time setting, the logic CSL
[1, 2] has been developed for model checking properties of
CTMCs. While PCTL and CSL are based on the labelling
of states with elementary properties (atomic propositions),
the logic aCSL [3] is based on action-labelled transitions,
which is advantageous if used in the context of modelling
formalisms such as stochastic process algebra where the ba-
sic unit of behaviour is that of a named action.
The Erlangen-Twente Markov chain checker (ETMCC)
is a software tool which supports the automatic checking of
performability properties given as CSL or aCSL formulas.
The model to be checked is a ﬁnite CTMC labelled with
atomic propositions and/or transiti...

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


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

Output:
安全论文分析：

title:Akamai DNS: Providing Authoritative Answers to the World's Queries
author:Kyle Schomp and
Onkar Bhardwaj and
Eymen Kurdoglu and
Mashooq Muhaimen and
Ramesh K. Sitaraman
Akamai DNS: Providing Authoritative Answers to the World’s
Queries
Kyle Schomp†, Onkar Bhardwaj†, Eymen Kurdoglu†, Mashooq Muhaimen†, Ramesh K. Sitaraman†‡
kschomp,obhardwa,ekurdogl,mmuhaime,ramesh@akamai.com
‡University of Massachusetts Amherst
†Akamai Technologies
ramesh@cs.umass.edu
ABSTRACT
We present Akamai DNS, one of the largest authoritative DNS
infrastructures in the world, that supports the Akamai content de-
livery network (CDN) as well as authoritative DNS hosting and
DNS-based load balancing services for many enterprises. As the
starting point for a significant fraction of the world’s Internet in-
teractions, Akamai DNS serves millions of queries each second
and must be resilient to avoid disrupting myriad online services,
scalable to meet the ever increasing volume of DNS queries, per-
formant to prevent user-perceivable performance degradation, and
reconfigurable to react quickly to shifts in network conditions and
attacks. We outline the design principles and architecture used to
achieve Akamai DNS’s goals, relating the design choices to the
system workload and quantifying the effectiveness of those designs.
Further, we convey insights from operating the production system
that are of value to the broader research community.
CCS CONCEPTS
• Networks → Application layer protocols; Naming and ad-
dressing;
KEYWORDS
DNS, Distributed Systems
ACM Reference Format:
Kyle Schomp, Onkar Bhardwaj, Eymen Kurdoglu, Mashooq Muhaimen,
and Ramesh K. Sitaraman. 2020. Akamai DNS: Providing Authoritative
Answers to the World’s Queries. In Annual conference of the ACM Special
Interest Group on Data Communication on the applications, technologies,
architectures, and protocols for computer communication (SIGCOMM ’20),
August 10–14, 2020, Virtual Event, NY, USA. ACM, New York, NY, USA,
14 pages. https:...


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

Input:
title:Akamai DNS: Providing Authoritative Answers to the World's Queries
author:Kyle Schomp and
Onkar Bhardwaj and
Eymen Kurdoglu and
Mashooq Muhaimen and
Ramesh K. Sitaraman
Akamai DNS: Providing Authoritative Answers to the World’s
Queries
Kyle Schomp†, Onkar Bhardwaj†, Eymen Kurdoglu†, Mashooq Muhaimen†, Ramesh K. Sitaraman†‡
kschomp,obhardwa,ekurdogl,mmuhaime,ramesh@akamai.com
‡University of Massachusetts Amherst
†Akamai Technologies
ramesh@cs.umass.edu
ABSTRACT
We present Akamai DNS, one of the largest authoritative DNS
infrastructures in the world, that supports the Akamai content de-
livery network (CDN) as well as authoritative DNS hosting and
DNS-based load balancing services for many enterprises. As the
starting point for a significant fraction of the world’s Internet in-
teractions, Akamai DNS serves millions of queries each second
and must be resilient to avoid disrupting myriad online services,
scalable to meet the ever increasing volume of DNS queries, per-
formant to prevent user-perceivable performance degradation, and
reconfigurable to react quickly to shifts in network conditions and
attacks. We outline the design principles and architecture used to
achieve Akamai DNS’s goals, relating the design choices to the
system workload and quantifying the effectiveness of those designs.
Further, we convey insights from operating the production system
that are of value to the broader research community.
CCS CONCEPTS
• Networks → Application layer protocols; Naming and ad-
dressing;
KEYWORDS
DNS, Distributed Systems
ACM Reference Format:
Kyle Schomp, Onkar Bhardwaj, Eymen Kurdoglu, Mashooq Muhaimen,
and Ramesh K. Sitaraman. 2020. Akamai DNS: Providing Authoritative
Answers to the World’s Queries. In Annual conference of the ACM Special
Interest Group on Data Communication on the applications, technologies,
architectures, and protocols for computer communication (SIGCOMM ’20),
August 10–14, 2020, Virtual Event, NY, USA. ACM, New York, NY, USA,
14 pages. https:...

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


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

Output:
安全论文分析：

title:User Interface Dependability through Goal-Error Prevention
author:Robert W. Reeder and
Roy A. Maxion
User Interface Dependability through Goal-Error Prevention
Robert W. Reeder and Roy A. Maxion
reeder@cs.cmu.edu and maxion@cs.cmu.edu
Dependable Systems Laboratory
Computer Science Department
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213 / USA
Abstract
User interfaces form a critical coupling between humans
and computers. When the interface fails, the user fails, and
the mission is lost. For example, in computer security appli-
cations, human-made conﬁguration errors can expose en-
tire systems to various forms of attack.
To avoid interaction failures, a dependable user inter-
face must facilitate the speedy and accurate completion of
user tasks. Defects in the interface cause user errors (e.g.,
goal, plan, action and perception errors), which impinge on
speed and accuracy goals, and can lead to mission failure.
One source of user error is poor information represen-
tation in the interface. This can cause users to commit a
speciﬁc class of errors – goal errors. A design principle
(anchor-based subgoaling) for mitigating this cause was
formulated. The principle was evaluated in the domain of
setting Windows ﬁle permissions. The native Windows XP
ﬁle permissions interface, which did not support anchor-
based subgoaling, was compared to an alternative, called
Salmon, which did. In an experiment with 24 users, Salmon
achieved as much as a four-fold increase in accuracy for a
representative task and a 94% reduction in the number of
goal errors committed, compared to the XP interface.
1
Introduction
One locus of vulnerability in a computer system is the
user interface. Undependable interfaces are those that do
not meet their speciﬁcations in terms of the speed and ac-
curacy with which users should complete tasks. One rea-
son why some user interfaces fail to meet their speed and
accuracy speciﬁcations is human error. Researchers have
long recognized that...