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

Output:
安全论文分析：

title:Airshark: detecting non-WiFi RF devices using commodity WiFi hardware
author:Shravan K. Rayanchu and
Ashish Patro and
Suman Banerjee
Airshark: Detecting Non-WiFi RF Devices
using Commodity WiFi Hardware
Shravan Rayanchu, Ashish Patro, Suman Banerjee
{shravan, patro, suman}@cs.wisc.edu
University of Wisconsin, Madison, USA
ABSTRACT
In this paper, we propose Airshark—a system that detects
multiple non-WiFi RF devices in real-time and using only
commodity WiFi hardware.
To motivate the need for
systems like Airshark, we start with measurement study
that characterizes the usage and prevalence of non-WiFi
devices across many locations. We then present the design and
implementation of Airshark. Airshark extracts unique features
using the functionality provided by a WiFi card to detect
multiple non-WiFi devices including ﬁxed frequency devices
(e.g., ZigBee, analog cordless phone), frequency hoppers
(e.g., Bluetooth, game controllers like Xbox), and broadband
interferers (e.g., microwave ovens). Airshark has an average
detection accuracy of 9196%, even in the presence of
multiple simultaneously active RF devices operating at a
wide range of signal strengths (80 to 30 dBm), while
maintaining a low false positive rate. Through a deployment
in two production WLANs, we show that Airshark can be
a useful tool to the WLAN administrators in understanding
non-WiFi interference.
Categories and Subject Descriptors
C.2.1 [Network Architecture and Design]: Wireless
Communication
General Terms
Design, Experimentation, Measurement, Performance
Keywords
WiFi, 802.11, Spectrum, Non-WiFi, RF Device Detection,
Interference, Wireless Network Monitoring
1.
INTRODUCTION
The unlicensed wireless spectrum continues to be home
for a large range of devices. Examples include cordless
phones, Bluetooth headsets, various types of audio and video
transmitters (security cameras and baby monitors), wireless
game controllers (Xbox and Wii), various ZigBee devices (e.g.,
Permission to make digital...


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

Input:
title:Airshark: detecting non-WiFi RF devices using commodity WiFi hardware
author:Shravan K. Rayanchu and
Ashish Patro and
Suman Banerjee
Airshark: Detecting Non-WiFi RF Devices
using Commodity WiFi Hardware
Shravan Rayanchu, Ashish Patro, Suman Banerjee
{shravan, patro, suman}@cs.wisc.edu
University of Wisconsin, Madison, USA
ABSTRACT
In this paper, we propose Airshark—a system that detects
multiple non-WiFi RF devices in real-time and using only
commodity WiFi hardware.
To motivate the need for
systems like Airshark, we start with measurement study
that characterizes the usage and prevalence of non-WiFi
devices across many locations. We then present the design and
implementation of Airshark. Airshark extracts unique features
using the functionality provided by a WiFi card to detect
multiple non-WiFi devices including ﬁxed frequency devices
(e.g., ZigBee, analog cordless phone), frequency hoppers
(e.g., Bluetooth, game controllers like Xbox), and broadband
interferers (e.g., microwave ovens). Airshark has an average
detection accuracy of 9196%, even in the presence of
multiple simultaneously active RF devices operating at a
wide range of signal strengths (80 to 30 dBm), while
maintaining a low false positive rate. Through a deployment
in two production WLANs, we show that Airshark can be
a useful tool to the WLAN administrators in understanding
non-WiFi interference.
Categories and Subject Descriptors
C.2.1 [Network Architecture and Design]: Wireless
Communication
General Terms
Design, Experimentation, Measurement, Performance
Keywords
WiFi, 802.11, Spectrum, Non-WiFi, RF Device Detection,
Interference, Wireless Network Monitoring
1.
INTRODUCTION
The unlicensed wireless spectrum continues to be home
for a large range of devices. Examples include cordless
phones, Bluetooth headsets, various types of audio and video
transmitters (security cameras and baby monitors), wireless
game controllers (Xbox and Wii), various ZigBee devices (e.g.,
Permission to make digital...

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


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

Output:
安全论文分析：

title:On the Potential for Discrimination via Composition
author:Giridhari Venkatadri and
Alan Mislove
On the Potential for Discrimination via Composition
Giridhari Venkatadri
Northeastern University
Alan Mislove
Northeastern University
ABSTRACT
The success of platforms such as Facebook and Google has been
due in no small part to features that allow advertisers to target ads
in a fine-grained manner. However, these features open up the po-
tential for discriminatory advertising when advertisers include or
exclude users of protected classes—either directly or indirectly—in
a discriminatory fashion. Despite the fact that advertisers are able
to compose various targeting features together, the existing mitiga-
tions to discriminatory targeting have focused only on individual
features; there are concerns that such composition could result in
targeting that is more discriminatory than the features individually.
In this paper, we first demonstrate how compositions of individ-
ual targeting features can yield discriminatory ad targeting even
for Facebook’s restricted targeting features for ads in special cat-
egories (meant to protect against discriminatory advertising). We
then conduct the first study of the potential for discrimination that
spans across three major advertising platforms (Facebook, Google,
and LinkedIn), showing how the potential for discriminatory adver-
tising is pervasive across these platforms. Our work further points
to the need for more careful mitigations to address the issue of
discriminatory ad targeting.
CCS CONCEPTS
• Security and privacy → Social aspects of security and pri-
vacy; • Information systems → Online advertising; Social
networks.
KEYWORDS
Targeted advertising, Advertising platforms, Discriminatory ad
targeting
ACM Reference Format:
Giridhari Venkatadri and Alan Mislove. 2020. On the Potential for Discrimi-
nation via Composition. In ACM Internet Measurement Conference (IMC ’20),
October 27–29, 2020, Virtual Event, USA. ACM, New York...


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

Input:
title:On the Potential for Discrimination via Composition
author:Giridhari Venkatadri and
Alan Mislove
On the Potential for Discrimination via Composition
Giridhari Venkatadri
Northeastern University
Alan Mislove
Northeastern University
ABSTRACT
The success of platforms such as Facebook and Google has been
due in no small part to features that allow advertisers to target ads
in a fine-grained manner. However, these features open up the po-
tential for discriminatory advertising when advertisers include or
exclude users of protected classes—either directly or indirectly—in
a discriminatory fashion. Despite the fact that advertisers are able
to compose various targeting features together, the existing mitiga-
tions to discriminatory targeting have focused only on individual
features; there are concerns that such composition could result in
targeting that is more discriminatory than the features individually.
In this paper, we first demonstrate how compositions of individ-
ual targeting features can yield discriminatory ad targeting even
for Facebook’s restricted targeting features for ads in special cat-
egories (meant to protect against discriminatory advertising). We
then conduct the first study of the potential for discrimination that
spans across three major advertising platforms (Facebook, Google,
and LinkedIn), showing how the potential for discriminatory adver-
tising is pervasive across these platforms. Our work further points
to the need for more careful mitigations to address the issue of
discriminatory ad targeting.
CCS CONCEPTS
• Security and privacy → Social aspects of security and pri-
vacy; • Information systems → Online advertising; Social
networks.
KEYWORDS
Targeted advertising, Advertising platforms, Discriminatory ad
targeting
ACM Reference Format:
Giridhari Venkatadri and Alan Mislove. 2020. On the Potential for Discrimi-
nation via Composition. In ACM Internet Measurement Conference (IMC ’20),
October 27–29, 2020, Virtual Event, USA. ACM, New York...

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


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

Output:
安全论文分析：

title:Set It and Forget It! Turnkey ECC for Instant Integration
author:Dmitry Belyavsky and
Billy Bob Brumley and
Jes'us-Javier Chi-Dom'ınguez and
Luis Rivera-Zamarripa and
Igor Ustinov
SETITANDFORGETIT!TURNKEYECCFORINSTANTINTEGRATION
AnnualComputerSecurityApplicationsConference(ACSAC2020)
December7-11
DimitryBelyavsky1,BillyBobBrumley2,Jesús-JavierChi-Domínguez2,LuisRivera-Zamarripa2,
andIgorUstinov1
{billy.brumley,jesus.chidominguez,luis.riverazamarripa}@tuni.,{beldmit,igus}@cryptocom.ru
1CryptocomLtd,Moscow,RussianFederation
2NetworkandInformationSecurityGroup(NISEC),TampereUniversity,Finland
TableofContents
Motivation
ECCKiila
Conclusions
ACSAC|2
Motivation
SomeattacksonOpenSSL’sECCimplementation.
(cid:73) BrumleyandHakala2009,therst(microarchitecture)timingattack
(cid:73) CountermeasuresbyKäsper2011,andGueronandKrasnov2015
(cid:73) AftertheformalvericationbyLiuetal.2019reporteddefects
(cid:73) CVE-2018-5407“PortSmash”byAldayaetal.2019
(cid:73) “LadderLeak”attackbyAranhaetal.2020
(cid:73) Functionalcorrectness: CVE-2011-4354istheonlyreal-worldbugattack
Someprojectsjustnarrowfeatures;thisitisnotviableoptionforprojectsmore
complete.
ACSAC|3
ECCKIILA
Alibrarythatfullyautomatestheimplementation,testing,andintegrationofECC
stacksfor OpenSSL, GOST-engine,and NSS.
ECCKIILA
op3les1
Validations
Curves
DBjson
LUTs
Makotemp Arith
OpenSSL
GOST-engine
C-code
NSS
Threatmodel: weincludedinourmodeltotimingattacks
Kiilameans wedgeinFinnish
1e.g. https://www.hyperelliptic.org/EFD/g1p/auto-code/twisted/extended/doubling/dbl-2008-hwcd.op3
ACSAC|4
CurvestestedwithECCKiila
Curve
secp192r1/ P-192
secp256r1/ P-256
secp521r1/ P-521
secp256k1
secp384r1
brainpool192t1
brainpool256t1
brainpool320t1
brainpool384t1
brainpool512t1
SM2(Chinesestandard)
X25519/ ED25519/ Wei25519
X448/ ED448/ Wei448
P-384
P-521
id_GostR3410_2001_CryptoPro_A_ParamSet
id_GostR3410_2001_CryptoPro_B_ParamSet
id_GostR3410_2001_CryptoPro_C_ParamSet
id_tc26_gost_3410_2012_512_paramSetA
id_tc26_gost_34...


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

Input:
title:Set It and Forget It! Turnkey ECC for Instant Integration
author:Dmitry Belyavsky and
Billy Bob Brumley and
Jes'us-Javier Chi-Dom'ınguez and
Luis Rivera-Zamarripa and
Igor Ustinov
SETITANDFORGETIT!TURNKEYECCFORINSTANTINTEGRATION
AnnualComputerSecurityApplicationsConference(ACSAC2020)
December7-11
DimitryBelyavsky1,BillyBobBrumley2,Jesús-JavierChi-Domínguez2,LuisRivera-Zamarripa2,
andIgorUstinov1
{billy.brumley,jesus.chidominguez,luis.riverazamarripa}@tuni.,{beldmit,igus}@cryptocom.ru
1CryptocomLtd,Moscow,RussianFederation
2NetworkandInformationSecurityGroup(NISEC),TampereUniversity,Finland
TableofContents
Motivation
ECCKiila
Conclusions
ACSAC|2
Motivation
SomeattacksonOpenSSL’sECCimplementation.
(cid:73) BrumleyandHakala2009,therst(microarchitecture)timingattack
(cid:73) CountermeasuresbyKäsper2011,andGueronandKrasnov2015
(cid:73) AftertheformalvericationbyLiuetal.2019reporteddefects
(cid:73) CVE-2018-5407“PortSmash”byAldayaetal.2019
(cid:73) “LadderLeak”attackbyAranhaetal.2020
(cid:73) Functionalcorrectness: CVE-2011-4354istheonlyreal-worldbugattack
Someprojectsjustnarrowfeatures;thisitisnotviableoptionforprojectsmore
complete.
ACSAC|3
ECCKIILA
Alibrarythatfullyautomatestheimplementation,testing,andintegrationofECC
stacksfor OpenSSL, GOST-engine,and NSS.
ECCKIILA
op3les1
Validations
Curves
DBjson
LUTs
Makotemp Arith
OpenSSL
GOST-engine
C-code
NSS
Threatmodel: weincludedinourmodeltotimingattacks
Kiilameans wedgeinFinnish
1e.g. https://www.hyperelliptic.org/EFD/g1p/auto-code/twisted/extended/doubling/dbl-2008-hwcd.op3
ACSAC|4
CurvestestedwithECCKiila
Curve
secp192r1/ P-192
secp256r1/ P-256
secp521r1/ P-521
secp256k1
secp384r1
brainpool192t1
brainpool256t1
brainpool320t1
brainpool384t1
brainpool512t1
SM2(Chinesestandard)
X25519/ ED25519/ Wei25519
X448/ ED448/ Wei448
P-384
P-521
id_GostR3410_2001_CryptoPro_A_ParamSet
id_GostR3410_2001_CryptoPro_B_ParamSet
id_GostR3410_2001_CryptoPro_C_ParamSet
id_tc26_gost_3410_2012_512_paramSetA
id_tc26_gost_34...

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


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

Output:
安全论文分析：

title:Crowdsourcing Measurements of Mobile Network Performance and Mobility
During a Large Scale Event
author:Alexander Fr"ommgen and
Jens Heuschkel and
Patrick Jahnke and
Fabio Cuozzo and
Immanuel Schweizer and
Patrick Eugster and
Max M"uhlh"auser and
Alejandro P. Buchmann
Crowdsourcing Measurements of Mobile
Network Performance and Mobility During
a Large Scale Event
Alexander Fr¨ommgen1(B), Jens Heuschkel2, Patrick Jahnke3, Fabio Cuozzo1,
Immanuel Schweizer2, Patrick Eugster3, Max M¨uhlh¨auser2,
and Alejandro Buchmann1
1 Databases and Distributed Systems, TU Darmstadt, Darmstadt, Germany
{froemmgen,cuozzo,buchmann}@dvs.tu-darmstadt.de
2 Telecooperation Lab, TU Darmstadt, Darmstadt, Germany
{jens.heuschkel,schweizer,max}@tk.informatik.tu-darmstadt.de
3 Distributed Systems Programming, TU Darmstadt, Darmstadt, Germany
{jahnke,peugster}@dsp.tu-darmstadt.de
Abstract. Cellular infrastructure in urban areas is provisioned to easily
cope with the usual daily demands. When facing shockingly high loads,
e.g., due to large scale sport or music events, users complain about perfor-
mance degradations of the mobile network. Analyzing the impact of large
scale events on the mobile network infrastructure and how users perceive
overload situations is essential to improve user experience. Therefore, a
large data set is required to get a detailed understanding of the diﬀerences
between providers, mobile devices, mobile network access technologies,
and the mobility of people.
In this paper, we present experiences and results from a crowdsourc-
ing measurement during a music festival in Germany with over 110,000
visitors per day. More than 1,000 visitors ran our crowdsourcing app to
collect active and passive measurements of the mobile network and the
user mobility. We show that there is signiﬁcant performance degradation
during the festival regarding DNS and HTTP failures as well as increased
load times. Furthermore, we evaluate the impact of the carrier, the access
...


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

Input:
title:Crowdsourcing Measurements of Mobile Network Performance and Mobility
During a Large Scale Event
author:Alexander Fr"ommgen and
Jens Heuschkel and
Patrick Jahnke and
Fabio Cuozzo and
Immanuel Schweizer and
Patrick Eugster and
Max M"uhlh"auser and
Alejandro P. Buchmann
Crowdsourcing Measurements of Mobile
Network Performance and Mobility During
a Large Scale Event
Alexander Fr¨ommgen1(B), Jens Heuschkel2, Patrick Jahnke3, Fabio Cuozzo1,
Immanuel Schweizer2, Patrick Eugster3, Max M¨uhlh¨auser2,
and Alejandro Buchmann1
1 Databases and Distributed Systems, TU Darmstadt, Darmstadt, Germany
{froemmgen,cuozzo,buchmann}@dvs.tu-darmstadt.de
2 Telecooperation Lab, TU Darmstadt, Darmstadt, Germany
{jens.heuschkel,schweizer,max}@tk.informatik.tu-darmstadt.de
3 Distributed Systems Programming, TU Darmstadt, Darmstadt, Germany
{jahnke,peugster}@dsp.tu-darmstadt.de
Abstract. Cellular infrastructure in urban areas is provisioned to easily
cope with the usual daily demands. When facing shockingly high loads,
e.g., due to large scale sport or music events, users complain about perfor-
mance degradations of the mobile network. Analyzing the impact of large
scale events on the mobile network infrastructure and how users perceive
overload situations is essential to improve user experience. Therefore, a
large data set is required to get a detailed understanding of the diﬀerences
between providers, mobile devices, mobile network access technologies,
and the mobility of people.
In this paper, we present experiences and results from a crowdsourc-
ing measurement during a music festival in Germany with over 110,000
visitors per day. More than 1,000 visitors ran our crowdsourcing app to
collect active and passive measurements of the mobile network and the
user mobility. We show that there is signiﬁcant performance degradation
during the festival regarding DNS and HTTP failures as well as increased
load times. Furthermore, we evaluate the impact of the carrier, the access
...

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


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

Output:
安全论文分析：

title:PHYS: Profiled-HYbrid Sampling for soft error reliability benchmarking
author:Jinho Suh and
Murali Annavaram and
Michel Dubois
PHYS: Profiled-HYbrid Sampling for Soft Error Reliability Benchmarking
Ming Hsieh Department of Electrical Engineering, University of Southern California
Jinho Suh, Murali Annavaram, and Michel Dubois
Los Angeles, CA, USA
{jinhosuh, annavara}@usc.edu, dubois@paris.usc.edu
a
sampling
for
framework
Abstract—In this paper, we introduce PHYS (Profiled-HYbrid
Sampling),
soft-error
benchmarking of caches. Reliability simulations of caches are
much  more  complex  than  performance  simulations  and
therefore  exhibit  large  simulation  slowdowns  (two  orders  of
magnitude)  over  performance  simulations.  The  major
problem is that the reliability lifetime of every accessed block
must  be  tracked  from  beginning  to  end,  on  top  of  simulating
the  benchmark,  in  order  to  track  the  total  number  of
vulnerability  cycles  (VCs)  between  two  accesses  to  the  block.
Because  of  the  need  to  track  SDCs  (silent  error  corruption)
and to distinguish between true and false DUEs (detected but
unrecoverable errors) vulnerability cycles cannot be truncated
when  data  is  written  back  from  cache  to  main  memory.
Vulnerability cycles must be maintained even during a block's
sojourn in main memory to track whether corrupted values in
a block are used by the processor, until program termination.
PHYS  solves  this  problem  by  sampling  intervals  between
accesses  to  each  memory  block,  instead  of  sampling  the
execution  of  the  processor  in  a  time  interval  as  is  classically
done in performance simulations. At first a statistical profiling
phase  captures  the  distribution  of  VCs  for  every  block.  This
profiling step provides a statistical guarantee of the minimum
sampling rate of access intervals needed to meet a desired FIT
error target with a given confidence interva...


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

Input:
title:PHYS: Profiled-HYbrid Sampling for soft error reliability benchmarking
author:Jinho Suh and
Murali Annavaram and
Michel Dubois
PHYS: Profiled-HYbrid Sampling for Soft Error Reliability Benchmarking
Ming Hsieh Department of Electrical Engineering, University of Southern California
Jinho Suh, Murali Annavaram, and Michel Dubois
Los Angeles, CA, USA
{jinhosuh, annavara}@usc.edu, dubois@paris.usc.edu
a
sampling
for
framework
Abstract—In this paper, we introduce PHYS (Profiled-HYbrid
Sampling),
soft-error
benchmarking of caches. Reliability simulations of caches are
much  more  complex  than  performance  simulations  and
therefore  exhibit  large  simulation  slowdowns  (two  orders  of
magnitude)  over  performance  simulations.  The  major
problem is that the reliability lifetime of every accessed block
must  be  tracked  from  beginning  to  end,  on  top  of  simulating
the  benchmark,  in  order  to  track  the  total  number  of
vulnerability  cycles  (VCs)  between  two  accesses  to  the  block.
Because  of  the  need  to  track  SDCs  (silent  error  corruption)
and to distinguish between true and false DUEs (detected but
unrecoverable errors) vulnerability cycles cannot be truncated
when  data  is  written  back  from  cache  to  main  memory.
Vulnerability cycles must be maintained even during a block's
sojourn in main memory to track whether corrupted values in
a block are used by the processor, until program termination.
PHYS  solves  this  problem  by  sampling  intervals  between
accesses  to  each  memory  block,  instead  of  sampling  the
execution  of  the  processor  in  a  time  interval  as  is  classically
done in performance simulations. At first a statistical profiling
phase  captures  the  distribution  of  VCs  for  every  block.  This
profiling step provides a statistical guarantee of the minimum
sampling rate of access intervals needed to meet a desired FIT
error target with a given confidence interva...

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


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

Output:
安全论文分析：

title:Hypnoguard: Protecting Secrets across Sleep-wake Cycles
author:Lianying Zhao and
Mohammad Mannan
Hypnoguard: Protecting Secrets across Sleep-wake Cycles
Lianying Zhao and Mohammad Mannan
Concordia Institute for Information Systems Engineering
Concordia University, Montreal, Canada
{z_lianyi, mmannan}@ciise.concordia.ca
ABSTRACT
Attackers can get physical control of a computer in sleep
(S3/suspend-to-RAM), if it is lost, stolen, or the owner is
being coerced. High-value memory-resident secrets, includ-
ing disk encryption keys, and private signature/encryption
keys for PGP, may be extracted (e.g., via cold-boot or DMA
attacks), by physically accessing such a computer. Our goal
is to alleviate threats of extracting secrets from a computer
in sleep, without relying on an Internet-facing service.
We propose Hypnoguard to protect all memory-resident
OS/user data across S3 suspensions, by ﬁrst performing an
in-place full memory encryption before entering sleep, and
then restoring the plaintext content at wakeup-time through
an environment-bound, password-based authentication pro-
cess. The memory encryption key is eﬀectively “sealed” in a
Trusted Platform Module (TPM) chip with the measure-
ment of the execution environment supported by CPU’s
trusted execution mode (e.g., Intel TXT, AMD-V/SVM).
Password guessing within Hypnoguard may cause the mem-
ory content to be permanently inaccessible, while guessing
without Hypnoguard is equivalent to brute-forcing a high-
entropy key (due to TPM protection). We achieved full
memory encryption/decryption in less than a second on a
mainstream computer (Intel i7-4771 CPU with 8GB RAM,
taking advantage of multi-core processing and AES-NI), an
apparently acceptable delay for sleep-wake transitions. To
the best of our knowledge, Hypnoguard provides the ﬁrst
wakeup-time secure environment for authentication and key
unlocking, without requiring per-application changes.
1.
INTRODUCTION
Most computers, especially laptops,
remain in sl...


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

Input:
title:Hypnoguard: Protecting Secrets across Sleep-wake Cycles
author:Lianying Zhao and
Mohammad Mannan
Hypnoguard: Protecting Secrets across Sleep-wake Cycles
Lianying Zhao and Mohammad Mannan
Concordia Institute for Information Systems Engineering
Concordia University, Montreal, Canada
{z_lianyi, mmannan}@ciise.concordia.ca
ABSTRACT
Attackers can get physical control of a computer in sleep
(S3/suspend-to-RAM), if it is lost, stolen, or the owner is
being coerced. High-value memory-resident secrets, includ-
ing disk encryption keys, and private signature/encryption
keys for PGP, may be extracted (e.g., via cold-boot or DMA
attacks), by physically accessing such a computer. Our goal
is to alleviate threats of extracting secrets from a computer
in sleep, without relying on an Internet-facing service.
We propose Hypnoguard to protect all memory-resident
OS/user data across S3 suspensions, by ﬁrst performing an
in-place full memory encryption before entering sleep, and
then restoring the plaintext content at wakeup-time through
an environment-bound, password-based authentication pro-
cess. The memory encryption key is eﬀectively “sealed” in a
Trusted Platform Module (TPM) chip with the measure-
ment of the execution environment supported by CPU’s
trusted execution mode (e.g., Intel TXT, AMD-V/SVM).
Password guessing within Hypnoguard may cause the mem-
ory content to be permanently inaccessible, while guessing
without Hypnoguard is equivalent to brute-forcing a high-
entropy key (due to TPM protection). We achieved full
memory encryption/decryption in less than a second on a
mainstream computer (Intel i7-4771 CPU with 8GB RAM,
taking advantage of multi-core processing and AES-NI), an
apparently acceptable delay for sleep-wake transitions. To
the best of our knowledge, Hypnoguard provides the ﬁrst
wakeup-time secure environment for authentication and key
unlocking, without requiring per-application changes.
1.
INTRODUCTION
Most computers, especially laptops,
remain in sl...

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


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

Output:
安全论文分析：

title:Analysis of Communities of Interest in Data Networks
author:William Aiello and
Charles R. Kalmanek and
Patrick D. McDaniel and
Subhabrata Sen and
Oliver Spatscheck and
Jacobus E. van der Merwe
Analysis of Communities of Interest in Data Networks(cid:1)
William Aiello , Charles Kalmanek , Patrick McDaniel ,
Subhabrata Sen , Oliver Spatscheck , and Jacobus Van der Merwe
 Department of Computer Science, University of British Columbia,
Vancouver, B.C. V6T 1Z4, Canada
aiello@cs.ubc.ca
 AT&T Labs (cid:150) Research, Florham Park, NJ 07932, U.S.A
 crk,sen,spatsch,kobus
@research.att.com
	 Department of Computer Science and Engineering, Penn State University,
University Park, PA 16802, U.S.A
mcdaniel@cse.psu.edu
Abstract. Communities of interest (COI) have been applied in a variety of envi-
ronments ranging from characterizing the online buying behavior of individuals
to detecting fraud in telephone networks. The common thread among these ap-
plications is that the historical COI of an individual can be used to predict future
behavior as well as the behavior of other members of the COI. It would clearly be
bene(cid:2)cial if COIs can be used in the same manner to characterize and predict the
behavior of hosts within a data network. In this paper, we introduce a methodol-
ogy for evaluating various aspects of COIs of hosts within an IP network. In the
context of this study, we broadly de(cid:2)ne a COI as a collection of interacting hosts.
We apply our methodology using data collected from a large enterprise network
over a eleven week period. First, we study the distributions and stability of the
size of COIs. Second, we evaluate multiple heuristics to determine a stable core
set of COIs and determine the stability of these sets over time. Third, we evaluate
how much of the communication is not captured by these core COI sets.
1 Introduction
Data networks are growing in size and complexity. A myriad of new services, mobil-
ity, and wireless communication make ...


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

Input:
title:Analysis of Communities of Interest in Data Networks
author:William Aiello and
Charles R. Kalmanek and
Patrick D. McDaniel and
Subhabrata Sen and
Oliver Spatscheck and
Jacobus E. van der Merwe
Analysis of Communities of Interest in Data Networks(cid:1)
William Aiello , Charles Kalmanek , Patrick McDaniel ,
Subhabrata Sen , Oliver Spatscheck , and Jacobus Van der Merwe
 Department of Computer Science, University of British Columbia,
Vancouver, B.C. V6T 1Z4, Canada
aiello@cs.ubc.ca
 AT&T Labs (cid:150) Research, Florham Park, NJ 07932, U.S.A
 crk,sen,spatsch,kobus
@research.att.com
	 Department of Computer Science and Engineering, Penn State University,
University Park, PA 16802, U.S.A
mcdaniel@cse.psu.edu
Abstract. Communities of interest (COI) have been applied in a variety of envi-
ronments ranging from characterizing the online buying behavior of individuals
to detecting fraud in telephone networks. The common thread among these ap-
plications is that the historical COI of an individual can be used to predict future
behavior as well as the behavior of other members of the COI. It would clearly be
bene(cid:2)cial if COIs can be used in the same manner to characterize and predict the
behavior of hosts within a data network. In this paper, we introduce a methodol-
ogy for evaluating various aspects of COIs of hosts within an IP network. In the
context of this study, we broadly de(cid:2)ne a COI as a collection of interacting hosts.
We apply our methodology using data collected from a large enterprise network
over a eleven week period. First, we study the distributions and stability of the
size of COIs. Second, we evaluate multiple heuristics to determine a stable core
set of COIs and determine the stability of these sets over time. Third, we evaluate
how much of the communication is not captured by these core COI sets.
1 Introduction
Data networks are growing in size and complexity. A myriad of new services, mobil-
ity, and wireless communication make ...

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


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

Output:
安全论文分析：

title:Bayesian Event Classification for Intrusion Detection
author:Christopher Kr"ugel and
Darren Mutz and
William K. Robertson and
Fredrik Valeur
Bayesian Event Classiﬁcation for Intrusion Detection
Christopher Kruegel Darren Mutz William Robertson
Fredrik Valeur
Reliable Software Group
University of California, Santa Barbara
{chris, dhm, wkr, fredrik}@cs.ucsb.edu
Abstract
Intrusion detection systems (IDSs) attempt to identify at-
tacks by comparing collected data to predeﬁned signatures
known to be malicious (misuse-based IDSs) or to a model
of legal behavior (anomaly-based IDSs). Anomaly-based
approaches have the advantage of being able to detect pre-
viously unknown attacks, but they suffer from the difﬁculty
of building robust models of acceptable behavior which may
result in a large number of false alarms. Almost all current
anomaly-based intrusion detection systems classify an in-
put event as normal or anomalous by analyzing its features,
utilizing a number of different models. A decision for an in-
put event is made by aggregating the results of all employed
models.
We have identiﬁed two reasons for the large number of
false alarms, caused by incorrect classiﬁcation of events in
current systems. One is the simplistic aggregation of model
outputs in the decision phase. Often, only the sum of the
model results is calculated and compared to a threshold.
The other reason is the lack of integration of additional
information into the decision process. This additional in-
formation can be related to the models, such as the conﬁ-
dence in a model’s output, or can be extracted from exter-
nal sources. To mitigate these shortcomings, we propose
an event classiﬁcation scheme that is based on Bayesian
networks. Bayesian networks improve the aggregation of
different model outputs and allow one to seamlessly incor-
porate additional information. Experimental results show
that the accuracy of the event classiﬁcation process is sig-
niﬁcantly improved using our propos...


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

Input:
title:Bayesian Event Classification for Intrusion Detection
author:Christopher Kr"ugel and
Darren Mutz and
William K. Robertson and
Fredrik Valeur
Bayesian Event Classiﬁcation for Intrusion Detection
Christopher Kruegel Darren Mutz William Robertson
Fredrik Valeur
Reliable Software Group
University of California, Santa Barbara
{chris, dhm, wkr, fredrik}@cs.ucsb.edu
Abstract
Intrusion detection systems (IDSs) attempt to identify at-
tacks by comparing collected data to predeﬁned signatures
known to be malicious (misuse-based IDSs) or to a model
of legal behavior (anomaly-based IDSs). Anomaly-based
approaches have the advantage of being able to detect pre-
viously unknown attacks, but they suffer from the difﬁculty
of building robust models of acceptable behavior which may
result in a large number of false alarms. Almost all current
anomaly-based intrusion detection systems classify an in-
put event as normal or anomalous by analyzing its features,
utilizing a number of different models. A decision for an in-
put event is made by aggregating the results of all employed
models.
We have identiﬁed two reasons for the large number of
false alarms, caused by incorrect classiﬁcation of events in
current systems. One is the simplistic aggregation of model
outputs in the decision phase. Often, only the sum of the
model results is calculated and compared to a threshold.
The other reason is the lack of integration of additional
information into the decision process. This additional in-
formation can be related to the models, such as the conﬁ-
dence in a model’s output, or can be extracted from exter-
nal sources. To mitigate these shortcomings, we propose
an event classiﬁcation scheme that is based on Bayesian
networks. Bayesian networks improve the aggregation of
different model outputs and allow one to seamlessly incor-
porate additional information. Experimental results show
that the accuracy of the event classiﬁcation process is sig-
niﬁcantly improved using our propos...

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


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

Output:
安全论文分析：

title:Differentially Private Publishing of High-dimensional Data Using Sensitivity
Control
author:Wei-Yen Day and
Ninghui Li
Differentially Private Publishing of High-dimensional Data
Using Sensitivity Control
Wei-Yen Day
Department of Computer Science
Purdue University
West Lafayette, IN USA
wday@purdue.edu
Ninghui Li
Department of Computer Science
Purdue University
West Lafayette, IN USA
ninghui@cs.purdue.edu
ABSTRACT
In this paper, we present DPSense, an approach to publish statis-
tical information from datasets under differential privacy via sensi-
tivity control. More speciﬁcally, we consider the problem of pub-
lishing column counts for high-dimensional datasets, such as query
logs or the Netﬂix dataset. The key challenge is that as the sen-
sitivity is high, high-magnitude noises need to be added to satisfy
differential privacy. We explore how to effectively performs sen-
sitivity control, i.e., limiting the contribution of each tuple in the
dataset. We introduce a novel low-sensitivity quality function that
enables one to effectively choose a contribution limit while satis-
fying differential privacy. Based on DPSense, we further pro-
pose an extension to correct the under-estimation bias, which we
call DPSense-S. Experimental results show that our proposed ap-
proaches advance the state of the art for publishing noisy column
counts and for ﬁnding the columns with the highest counts. Finally,
we give the analysis and discussion for the stability of DPSense
and DPSense-S, which beneﬁts from the high correlation between
quality function and error, as well as other insights of DPSense,
DPSense-S, and existing approaches.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Privacy
General Terms
Algorithms
Keywords
Differential privacy; Private data publishing; High-dimensional data
1.
INTRODUCTION
Private data publishing has enabled researchers to utilize the data
without personal privacy breach. The statistics from dataset of-
ten contain useful ...


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

Input:
title:Differentially Private Publishing of High-dimensional Data Using Sensitivity
Control
author:Wei-Yen Day and
Ninghui Li
Differentially Private Publishing of High-dimensional Data
Using Sensitivity Control
Wei-Yen Day
Department of Computer Science
Purdue University
West Lafayette, IN USA
wday@purdue.edu
Ninghui Li
Department of Computer Science
Purdue University
West Lafayette, IN USA
ninghui@cs.purdue.edu
ABSTRACT
In this paper, we present DPSense, an approach to publish statis-
tical information from datasets under differential privacy via sensi-
tivity control. More speciﬁcally, we consider the problem of pub-
lishing column counts for high-dimensional datasets, such as query
logs or the Netﬂix dataset. The key challenge is that as the sen-
sitivity is high, high-magnitude noises need to be added to satisfy
differential privacy. We explore how to effectively performs sen-
sitivity control, i.e., limiting the contribution of each tuple in the
dataset. We introduce a novel low-sensitivity quality function that
enables one to effectively choose a contribution limit while satis-
fying differential privacy. Based on DPSense, we further pro-
pose an extension to correct the under-estimation bias, which we
call DPSense-S. Experimental results show that our proposed ap-
proaches advance the state of the art for publishing noisy column
counts and for ﬁnding the columns with the highest counts. Finally,
we give the analysis and discussion for the stability of DPSense
and DPSense-S, which beneﬁts from the high correlation between
quality function and error, as well as other insights of DPSense,
DPSense-S, and existing approaches.
Categories and Subject Descriptors
K.4.1 [COMPUTERS AND SOCIETY]: Privacy
General Terms
Algorithms
Keywords
Differential privacy; Private data publishing; High-dimensional data
1.
INTRODUCTION
Private data publishing has enabled researchers to utilize the data
without personal privacy breach. The statistics from dataset of-
ten contain useful ...

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


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

Output:
安全论文分析：

title:Graphics Peeping Unit: Exploiting EM Side-Channel Information of
GPUs to Eavesdrop on Your Neighbors
author:Zihao Zhan and
Zhenkai Zhang and
Sisheng Liang and
Fan Yao and
Xenofon D. Koutsoukos
3
7
7
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
Graphics Peeping Unit: Exploiting EM Side-Channel
Information of GPUs to Eavesdrop on Your Neighbors
Zihao Zhan¶∗§, Zhenkai Zhang¶†, Sisheng Liang†, Fan Yao‡, Xenofon Koutsoukos§
∗University of Florida, †Clemson University, ‡University of Central Florida, §Vanderbilt University
¶(Co-First Authors with Equal Contribution)
Abstract—As the popularity of graphics processing units
(GPUs) grows rapidly in recent years, it becomes very critical
to study and understand the security implications imposed by
them. In this paper, we show that modern GPUs can “broadcast”
sensitive information over the air to make a number of attacks
practical. Speciﬁcally, we present a new electromagnetic (EM)
side-channel vulnerability that we have discovered in many GPUs
of both NVIDIA and AMD. We show that this vulnerability can
be exploited to mount realistic attacks through two case studies,
which are website ﬁngerprinting and keystroke timing inference
attacks. Our investigation recognizes the commonly used dynamic
voltage and frequency scaling (DVFS) feature in GPU as the
root cause of this vulnerability. Nevertheless, we also show that
simply disabling DVFS may not be an effective countermeasure
since it will introduce another highly exploitable EM side-channel
vulnerability. To the best of our knowledge, this is the ﬁrst work
that studies realistic physical side-channel attacks on non-shared
GPUs at a distance.
I. INTRODUCTION
Over the past few years, graphics processing units (GPUs)
have become an integral part of modern com...


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

Input:
title:Graphics Peeping Unit: Exploiting EM Side-Channel Information of
GPUs to Eavesdrop on Your Neighbors
author:Zihao Zhan and
Zhenkai Zhang and
Sisheng Liang and
Fan Yao and
Xenofon D. Koutsoukos
3
7
7
3
3
8
9
.
2
2
0
2
.
4
1
2
6
4
P
S
/
9
0
1
1
.
0
1
:
I
O
D
|
E
E
E
I
2
2
0
2
©
0
0
.
1
3
$
/
2
2
/
9
-
6
1
3
1
-
4
5
6
6
-
1
-
8
7
9
|
)
P
S
(
y
c
a
v
i
r
P
d
n
a
y
t
i
r
u
c
e
S
n
o
m
u
i
s
o
p
m
y
S
E
E
E
I
2
2
0
2
2022 IEEE Symposium on Security and Privacy (SP)
Graphics Peeping Unit: Exploiting EM Side-Channel
Information of GPUs to Eavesdrop on Your Neighbors
Zihao Zhan¶∗§, Zhenkai Zhang¶†, Sisheng Liang†, Fan Yao‡, Xenofon Koutsoukos§
∗University of Florida, †Clemson University, ‡University of Central Florida, §Vanderbilt University
¶(Co-First Authors with Equal Contribution)
Abstract—As the popularity of graphics processing units
(GPUs) grows rapidly in recent years, it becomes very critical
to study and understand the security implications imposed by
them. In this paper, we show that modern GPUs can “broadcast”
sensitive information over the air to make a number of attacks
practical. Speciﬁcally, we present a new electromagnetic (EM)
side-channel vulnerability that we have discovered in many GPUs
of both NVIDIA and AMD. We show that this vulnerability can
be exploited to mount realistic attacks through two case studies,
which are website ﬁngerprinting and keystroke timing inference
attacks. Our investigation recognizes the commonly used dynamic
voltage and frequency scaling (DVFS) feature in GPU as the
root cause of this vulnerability. Nevertheless, we also show that
simply disabling DVFS may not be an effective countermeasure
since it will introduce another highly exploitable EM side-channel
vulnerability. To the best of our knowledge, this is the ﬁrst work
that studies realistic physical side-channel attacks on non-shared
GPUs at a distance.
I. INTRODUCTION
Over the past few years, graphics processing units (GPUs)
have become an integral part of modern com...

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


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

Output:
安全论文分析：

title:Turbocharging ambient backscatter communication
author:Aaron N. Parks and
Angli Liu and
Shyamnath Gollakota and
Joshua R. Smith
Turbocharging Ambient Backscatter Communication
Aaron N. Parks†, Angli Liu†, Shyamnath Gollakota, Joshua R. Smith
University of Washington
{anparks, anglil, gshyam, jrsjrs}@uw.edu
†
Co-primary Student Authors
ABSTRACT
Communication primitives such as coding and multiple antenna
processing have provided signiﬁcant beneﬁts for traditional wire-
less systems. Existing designs, however, consume signiﬁcant power
and computational resources, and hence cannot be run on low com-
plexity, power constrained backscatter devices. This paper makes
two main contributions: (1) we introduce the ﬁrst multi-antenna
cancellation design that operates on backscatter devices while re-
taining a small form factor and power footprint, (2) we introduce a
novel coding mechanism that enables long range communication as
well as concurrent transmissions and can be decoded on backscat-
ter devices. We build hardware prototypes of the above designs that
can be powered solely using harvested energy from TV and solar
sources. The results show that our designs provide beneﬁts for both
RFID and ambient backscatter systems: they enable RFID tags to
communicate directly with each other at distances of tens of meters
and through multiple walls. They also increase the communication
rate and range achieved by ambient backscatter systems by 100X
and 40X respectively. We believe that this paper represents a sub-
stantial leap in the capabilities of backscatter communication.
CATEGORIES AND SUBJECT DESCRIPTORS
C.2.1 [Network Architecture and Design]: Wireless communi-
cation
KEYWORDS
Backscatter; Internet of Things; Energy harvesting; Wireless
1.
INTRODUCTION
The last decade has seen signiﬁcant advances in wireless com-
munication — Wi-Fi systems today can achieve bit rates as high
as 300 Mbps [2] and cellular networks can operate at ranges of
tens of kilometers [3]. These imp...


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

Input:
title:Turbocharging ambient backscatter communication
author:Aaron N. Parks and
Angli Liu and
Shyamnath Gollakota and
Joshua R. Smith
Turbocharging Ambient Backscatter Communication
Aaron N. Parks†, Angli Liu†, Shyamnath Gollakota, Joshua R. Smith
University of Washington
{anparks, anglil, gshyam, jrsjrs}@uw.edu
†
Co-primary Student Authors
ABSTRACT
Communication primitives such as coding and multiple antenna
processing have provided signiﬁcant beneﬁts for traditional wire-
less systems. Existing designs, however, consume signiﬁcant power
and computational resources, and hence cannot be run on low com-
plexity, power constrained backscatter devices. This paper makes
two main contributions: (1) we introduce the ﬁrst multi-antenna
cancellation design that operates on backscatter devices while re-
taining a small form factor and power footprint, (2) we introduce a
novel coding mechanism that enables long range communication as
well as concurrent transmissions and can be decoded on backscat-
ter devices. We build hardware prototypes of the above designs that
can be powered solely using harvested energy from TV and solar
sources. The results show that our designs provide beneﬁts for both
RFID and ambient backscatter systems: they enable RFID tags to
communicate directly with each other at distances of tens of meters
and through multiple walls. They also increase the communication
rate and range achieved by ambient backscatter systems by 100X
and 40X respectively. We believe that this paper represents a sub-
stantial leap in the capabilities of backscatter communication.
CATEGORIES AND SUBJECT DESCRIPTORS
C.2.1 [Network Architecture and Design]: Wireless communi-
cation
KEYWORDS
Backscatter; Internet of Things; Energy harvesting; Wireless
1.
INTRODUCTION
The last decade has seen signiﬁcant advances in wireless com-
munication — Wi-Fi systems today can achieve bit rates as high
as 300 Mbps [2] and cellular networks can operate at ranges of
tens of kilometers [3]. These imp...

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


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

Output:
安全论文分析：

title:Guarder: A Tunable Secure Allocator
author:Sam Silvestro and
Hongyu Liu and
Tianyi Liu and
Zhiqiang Lin and
Tongping Liu
Guarder: A Tunable Secure Allocator
Sam Silvestro, Hongyu Liu, and Tianyi Liu, University of Texas at San Antonio;
Zhiqiang Lin, Ohio State University; Tongping Liu, University of Texas at San Antonio
https://www.usenix.org/conference/usenixsecurity18/presentation/silvestro
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
ISBN 978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.GUARDER: A Tunable Secure Allocator
Sam Silvestro∗ Hongyu Liu∗
Tianyi Liu∗
∗University of Texas at San Antonio
†The Ohio State University
Zhiqiang Lin†
Tongping Liu∗
Abstract
Due to the on-going threats posed by heap vulnerabili-
ties, we design a novel secure allocator — GUARDER—
to defeat these vulnerabilities. GUARDER is different
from existing secure allocators in the following aspects.
Existing allocators either have low/zero randomization
entropy, or cannot provide stable security guarantees,
where their entropies vary by object size classes, exe-
cution phases, inputs, or applications. GUARDER en-
sures the desired randomization entropy, and provides an
unprecedented level of security guarantee by combining
all security features of existing allocators, with overhead
that is comparable to performance-oriented allocators.
Compared to the default Linux allocator, GUARDER’s
performance overhead is less than 3% on average. This
overhead is similar to the previous state-of-the-art, Free-
Guard, but comes with a much stronger security guaran-
tee. GUARDER also provides an additional feature that
allows users to customize security based on their perfor-
mance budget, without changing code or even recompil-
ing. The combination of high security and low overhead
makes GUARDER a practical solution for the deployed
environment.
1
Introductio...


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

Input:
title:Guarder: A Tunable Secure Allocator
author:Sam Silvestro and
Hongyu Liu and
Tianyi Liu and
Zhiqiang Lin and
Tongping Liu
Guarder: A Tunable Secure Allocator
Sam Silvestro, Hongyu Liu, and Tianyi Liu, University of Texas at San Antonio;
Zhiqiang Lin, Ohio State University; Tongping Liu, University of Texas at San Antonio
https://www.usenix.org/conference/usenixsecurity18/presentation/silvestro
This paper is included in the Proceedings of the
27th USENIX Security Symposium.
August 15–17, 2018 • Baltimore, MD, USA
ISBN 978-1-939133-04-5
Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX.GUARDER: A Tunable Secure Allocator
Sam Silvestro∗ Hongyu Liu∗
Tianyi Liu∗
∗University of Texas at San Antonio
†The Ohio State University
Zhiqiang Lin†
Tongping Liu∗
Abstract
Due to the on-going threats posed by heap vulnerabili-
ties, we design a novel secure allocator — GUARDER—
to defeat these vulnerabilities. GUARDER is different
from existing secure allocators in the following aspects.
Existing allocators either have low/zero randomization
entropy, or cannot provide stable security guarantees,
where their entropies vary by object size classes, exe-
cution phases, inputs, or applications. GUARDER en-
sures the desired randomization entropy, and provides an
unprecedented level of security guarantee by combining
all security features of existing allocators, with overhead
that is comparable to performance-oriented allocators.
Compared to the default Linux allocator, GUARDER’s
performance overhead is less than 3% on average. This
overhead is similar to the previous state-of-the-art, Free-
Guard, but comes with a much stronger security guaran-
tee. GUARDER also provides an additional feature that
allows users to customize security based on their perfor-
mance budget, without changing code or even recompil-
ing. The combination of high security and low overhead
makes GUARDER a practical solution for the deployed
environment.
1
Introductio...

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


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

Output:
安全论文分析：

title:MOPS: an infrastructure for examining security properties of software
author:Hao Chen and
David A. Wagner
MOPS∗: an Infrastructure for Examining Security Properties
of Software†
Hao Chen
University of California at Berkeley
hchen@cs.berkeley.edu
David Wagner
University of California at Berkeley
daw@cs.berkeley.edu
ABSTRACT
We describe a formal approach for ﬁnding bugs in security-
relevant software and verifying their absence. The idea is as
follows: we identify rules of safe programming practice, en-
code them as safety properties, and verify whether these
properties are obeyed. Because manual veriﬁcation is too
expensive, we have built a program analysis tool to auto-
mate this process. Our program analysis models the pro-
gram to be veriﬁed as a pushdown automaton, represents
the security property as a ﬁnite state automaton, and uses
model checking techniques to identify whether any state vi-
olating the desired security goal is reachable in the program.
The major advantages of this approach are that it is sound
in verifying the absence of certain classes of vulnerabilities,
that it is fully interprocedural, and that it is eﬃcient and
scalable. Experience suggests that this approach will be use-
ful in ﬁnding a wide range of security vulnerabilities in large
programs eﬃciently.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—
veriﬁcation; D.2.4 [Software Engineering]: Software/ Pro-
gram Veriﬁcation—formal methods, model checking
General Terms
Security, Languages, Veriﬁcation
Keywords
security, model checking, veriﬁcation, static analysis
INTRODUCTION
1.
∗MOPS: MOdel Checking Programs for Security properties
†This research was supported in part by DARPA contract
N66001-01-C-8040 and by an equipment grant from Intel.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for proﬁt or commercial advantage a...


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

Input:
title:MOPS: an infrastructure for examining security properties of software
author:Hao Chen and
David A. Wagner
MOPS∗: an Infrastructure for Examining Security Properties
of Software†
Hao Chen
University of California at Berkeley
hchen@cs.berkeley.edu
David Wagner
University of California at Berkeley
daw@cs.berkeley.edu
ABSTRACT
We describe a formal approach for ﬁnding bugs in security-
relevant software and verifying their absence. The idea is as
follows: we identify rules of safe programming practice, en-
code them as safety properties, and verify whether these
properties are obeyed. Because manual veriﬁcation is too
expensive, we have built a program analysis tool to auto-
mate this process. Our program analysis models the pro-
gram to be veriﬁed as a pushdown automaton, represents
the security property as a ﬁnite state automaton, and uses
model checking techniques to identify whether any state vi-
olating the desired security goal is reachable in the program.
The major advantages of this approach are that it is sound
in verifying the absence of certain classes of vulnerabilities,
that it is fully interprocedural, and that it is eﬃcient and
scalable. Experience suggests that this approach will be use-
ful in ﬁnding a wide range of security vulnerabilities in large
programs eﬃciently.
Categories and Subject Descriptors
D.4.6 [Operating Systems]: Security and Protection—
veriﬁcation; D.2.4 [Software Engineering]: Software/ Pro-
gram Veriﬁcation—formal methods, model checking
General Terms
Security, Languages, Veriﬁcation
Keywords
security, model checking, veriﬁcation, static analysis
INTRODUCTION
1.
∗MOPS: MOdel Checking Programs for Security properties
†This research was supported in part by DARPA contract
N66001-01-C-8040 and by an equipment grant from Intel.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for proﬁt or commercial advantage a...

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


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

Output:
安全论文分析：

title:A model and architecture for pseudo-random generation with applications
to /dev/random
author:Boaz Barak and
Shai Halevi
A Model and Architecture for Pseudo-Random Generation
and Applications to /dev/random
∗
Boaz Barak
Department of Computer Science
Princeton University
boaz@cs.princeton.edu
ABSTRACT
We present a formal model and a simple architecture for
robust pseudorandom generation that ensures resilience in
the face of an observer with partial knowledge/control of
the generator’s entropy source. Our model and architecture
have the following properties:
• Resilience. The generator’s output looks random to
an observer with no knowledge of the internal state.
This holds even if that observer has complete control
over data that is used to refresh the internal state.
• Forward security. Past output of the generator looks
random to an observer, even if the observer learns the
internal state at a later time.
• Backward security/Break-in recovery. Future output
of the generator looks random, even to an observer
with knowledge of the current state, provided that the
generator is refreshed with data of suﬃcient entropy.
Architectures such as above were suggested before. This
work diﬀers from previous attempts in that we present a
formal model for robust pseudo-random generation, and pro-
vide a formal proof within this model for the security of our
architecture. To our knowledge, this is the ﬁrst attempt at
a rigorous model for this problem.
Our formal modeling advocates the separation of the en-
tropy extraction phase from the output generation phase.
We argue that the former is information-theoretic in na-
ture, and could therefore rely on combinatorial and statisti-
cal tools rather than on cryptography. On the other hand,
we show that the latter can be implemented using any stan-
dard (non-robust) cryptographic PRG.
We also discuss the applicability of our architecture for
applications such as /dev/(u)random in Linux and pseudo-
random generation on smartcards...


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

Output:
安全论文分析：

title:Characterizing Application Memory Error Vulnerability to Optimize
Datacenter Cost via Heterogeneous-Reliability Memory
author:Yixin Luo and
Sriram Govindan and
Bikash Sharma and
Mark Santaniello and
Justin Meza and
Aman Kansal and
Jie Liu and
Badriddine Khessib and
Kushagra Vaid and
Onur Mutlu
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Characterizing Application Memory Error Vulnerability to
Optimize Datacenter Cost via Heterogeneous-Reliability Memory
Yixin Luo
Justin Meza
Bikash Sharma* Mark Santaniello*
Sriram Govindan*
Aman Kansal*
Carnegie Mellon University, yixinluo@cs.cmu.edu, {meza, onur}@cmu.edu
*Microsoft Corporation, {srgovin, bsharma, marksan, kansal, jie.liu, bkhessib, kvaid}@microsoft.com
Badriddine Khessib* Kushagra Vaid* Onur Mutlu
Jie Liu*
Abstract—Memory devices represent a key component of
datacenter total cost of ownership (TCO), and techniques used
to reduce errors that occur on these devices increase this
cost. Existing approaches to providing reliability for memory
devices pessimistically treat all data as equally vulnerable
to memory errors. Our key insight is that there exists a
diverse spectrum of
tolerance to memory errors in new
data-intensive applications, and that traditional one-size-ﬁts-all
memory reliability techniques are ineﬃcient in terms of cost.
For example, we found that while traditional error protection
increases memory system cost by 12.5%, some applications
can achieve 99.00% availability on a single server with a large
number of memory errors without any error protection. This
presents an opportunity to greatly reduce server hardware cost
by provisioning the right amount of memory reliability for
diﬀerent applications.
Toward this end, in this paper, we make three main con-
tributions to enable highly-reliable servers at low datacenter
cost. First, we develop a new methodology to quantify the
tolerance of applications to memory errors. Second, using our
methodology, we perf...


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

Input:
title:Characterizing Application Memory Error Vulnerability to Optimize
Datacenter Cost via Heterogeneous-Reliability Memory
author:Yixin Luo and
Sriram Govindan and
Bikash Sharma and
Mark Santaniello and
Justin Meza and
Aman Kansal and
Jie Liu and
Badriddine Khessib and
Kushagra Vaid and
Onur Mutlu
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Characterizing Application Memory Error Vulnerability to
Optimize Datacenter Cost via Heterogeneous-Reliability Memory
Yixin Luo
Justin Meza
Bikash Sharma* Mark Santaniello*
Sriram Govindan*
Aman Kansal*
Carnegie Mellon University, yixinluo@cs.cmu.edu, {meza, onur}@cmu.edu
*Microsoft Corporation, {srgovin, bsharma, marksan, kansal, jie.liu, bkhessib, kvaid}@microsoft.com
Badriddine Khessib* Kushagra Vaid* Onur Mutlu
Jie Liu*
Abstract—Memory devices represent a key component of
datacenter total cost of ownership (TCO), and techniques used
to reduce errors that occur on these devices increase this
cost. Existing approaches to providing reliability for memory
devices pessimistically treat all data as equally vulnerable
to memory errors. Our key insight is that there exists a
diverse spectrum of
tolerance to memory errors in new
data-intensive applications, and that traditional one-size-ﬁts-all
memory reliability techniques are ineﬃcient in terms of cost.
For example, we found that while traditional error protection
increases memory system cost by 12.5%, some applications
can achieve 99.00% availability on a single server with a large
number of memory errors without any error protection. This
presents an opportunity to greatly reduce server hardware cost
by provisioning the right amount of memory reliability for
diﬀerent applications.
Toward this end, in this paper, we make three main con-
tributions to enable highly-reliable servers at low datacenter
cost. First, we develop a new methodology to quantify the
tolerance of applications to memory errors. Second, using our
methodology, we perf...

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


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

Output:
安全论文分析：

title:Detecting organized eCommerce fraud using scalable categorical clustering
author:Samuel Marchal and
Sebastian Szyller
Detecting organized eCommerce fraud
using scalable categorical clustering
Samuel Marchal
Aalto University
samuel.marchal@aalto.fi
Sebastian Szyller
Aalto University
sebastian.szyller@aalto.fi
9
1
0
2
t
c
O
0
1
]
L
M
.
t
a
t
s
[
1
v
4
1
5
4
0
.
0
1
9
1
:
v
i
X
r
a
ABSTRACT
Online retail, eCommerce, frequently falls victim to fraud conducted
by malicious customers (fraudsters) who obtain goods or services
through deception. Fraud coordinated by groups of professional
fraudsters that place several fraudulent orders to maximize their
gain is referred to as organized fraud. Existing approaches to fraud
detection typically analyze orders in isolation and they are not
effective at identifying groups of fraudulent orders linked to orga-
nized fraud. These also wrongly identify many legitimate orders as
fraud, which hinders their usage for automated fraud cancellation.
We introduce a novel solution to detect organized fraud by analyz-
ing orders in bulk. Our approach is based on clustering and aims
to group together fraudulent orders placed by the same group of
fraudsters. It selectively uses two existing techniques, agglomera-
tive clustering and sampling to recursively group orders into small
clusters in a reasonable amount of time. We assess our clustering
technique on real-world orders placed on the Zalando website, the
largest online apparel retailer in Europe1. Our clustering processes
100,000s of orders in a few hours and groups 35-45% of fraudulent
orders together. We propose a simple technique built on top of our
clustering that detects 26.2% of fraud while raising false alarms for
only 0.1% of legitimate orders.
KEYWORDS
online fraud; fraud detection; eCommerce; categorical clustering
1 INTRODUCTION
Online retail, also known as eCommerce, represents an important
share of the retail business. About 17.5% of all sales made in the
United States c...


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

Input:
title:Detecting organized eCommerce fraud using scalable categorical clustering
author:Samuel Marchal and
Sebastian Szyller
Detecting organized eCommerce fraud
using scalable categorical clustering
Samuel Marchal
Aalto University
samuel.marchal@aalto.fi
Sebastian Szyller
Aalto University
sebastian.szyller@aalto.fi
9
1
0
2
t
c
O
0
1
]
L
M
.
t
a
t
s
[
1
v
4
1
5
4
0
.
0
1
9
1
:
v
i
X
r
a
ABSTRACT
Online retail, eCommerce, frequently falls victim to fraud conducted
by malicious customers (fraudsters) who obtain goods or services
through deception. Fraud coordinated by groups of professional
fraudsters that place several fraudulent orders to maximize their
gain is referred to as organized fraud. Existing approaches to fraud
detection typically analyze orders in isolation and they are not
effective at identifying groups of fraudulent orders linked to orga-
nized fraud. These also wrongly identify many legitimate orders as
fraud, which hinders their usage for automated fraud cancellation.
We introduce a novel solution to detect organized fraud by analyz-
ing orders in bulk. Our approach is based on clustering and aims
to group together fraudulent orders placed by the same group of
fraudsters. It selectively uses two existing techniques, agglomera-
tive clustering and sampling to recursively group orders into small
clusters in a reasonable amount of time. We assess our clustering
technique on real-world orders placed on the Zalando website, the
largest online apparel retailer in Europe1. Our clustering processes
100,000s of orders in a few hours and groups 35-45% of fraudulent
orders together. We propose a simple technique built on top of our
clustering that detects 26.2% of fraud while raising false alarms for
only 0.1% of legitimate orders.
KEYWORDS
online fraud; fraud detection; eCommerce; categorical clustering
1 INTRODUCTION
Online retail, also known as eCommerce, represents an important
share of the retail business. About 17.5% of all sales made in the
United States c...

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


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

Output:
安全论文分析：

title:LZR: Identifying Unexpected Internet Services
author:Liz Izhikevich and
Renata Teixeira and
Zakir Durumeric
LZR: Identifying Unexpected Internet Services
Liz Izhikevich, Stanford University; Renata Teixeira, Inria;
Zakir Durumeric, Stanford University
https://www.usenix.org/conference/usenixsecurity21/presentation/izhikevich
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.LZR: Identifying Unexpected Internet Services
Liz Izhikevich
Stanford University
Renata Teixeira
Inria, Paris∗
Zakir Durumeric
Stanford University
Abstract
Internet-wide scanning is a commonly used research tech-
nique that has helped uncover real-world attacks, ﬁnd crypto-
graphic weaknesses, and understand both operator and mis-
creant behavior. Studies that employ scanning have largely
assumed that services are hosted on their IANA-assigned
ports, overlooking the study of services on unusual ports. In
this work, we investigate where Internet services are deployed
in practice and evaluate the security posture of services on
unexpected ports. We show protocol deployment is more dif-
fuse than previously believed and that protocols run on many
additional ports beyond their primary IANA-assigned port.
For example, only 3% of HTTP and 6% of TLS services run
on ports 80 and 443, respectively. Services on non-standard
ports are more likely to be insecure, which results in studies
dramatically underestimating the security posture of Inter-
net hosts. Building on our observations, we introduce LZR
(“Laser”), a system that identiﬁes 99% of identiﬁable unex-
pected services in ﬁve handshakes and dramatically reduces
the time needed to perform application-layer scans on ports
with few responsive expected services (e.g., 5500% speedup
on 27017/MongoDB). We conclude with recommendations
for future studies.
1 Introduction
Internet-wide scanning—t...


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

Input:
title:LZR: Identifying Unexpected Internet Services
author:Liz Izhikevich and
Renata Teixeira and
Zakir Durumeric
LZR: Identifying Unexpected Internet Services
Liz Izhikevich, Stanford University; Renata Teixeira, Inria;
Zakir Durumeric, Stanford University
https://www.usenix.org/conference/usenixsecurity21/presentation/izhikevich
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.LZR: Identifying Unexpected Internet Services
Liz Izhikevich
Stanford University
Renata Teixeira
Inria, Paris∗
Zakir Durumeric
Stanford University
Abstract
Internet-wide scanning is a commonly used research tech-
nique that has helped uncover real-world attacks, ﬁnd crypto-
graphic weaknesses, and understand both operator and mis-
creant behavior. Studies that employ scanning have largely
assumed that services are hosted on their IANA-assigned
ports, overlooking the study of services on unusual ports. In
this work, we investigate where Internet services are deployed
in practice and evaluate the security posture of services on
unexpected ports. We show protocol deployment is more dif-
fuse than previously believed and that protocols run on many
additional ports beyond their primary IANA-assigned port.
For example, only 3% of HTTP and 6% of TLS services run
on ports 80 and 443, respectively. Services on non-standard
ports are more likely to be insecure, which results in studies
dramatically underestimating the security posture of Inter-
net hosts. Building on our observations, we introduce LZR
(“Laser”), a system that identiﬁes 99% of identiﬁable unex-
pected services in ﬁve handshakes and dramatically reduces
the time needed to perform application-layer scans on ports
with few responsive expected services (e.g., 5500% speedup
on 27017/MongoDB). We conclude with recommendations
for future studies.
1 Introduction
Internet-wide scanning—t...

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


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

Output:
安全论文分析：

title:Machine learning attacks against the Asirra CAPTCHA
author:Philippe Golle
Machine Learning Attacks
Against the Asirra CAPTCHA
Philippe Golle
Palo Alto Research Center
Palo Alto, CA 94304, USA
pgolle@parc.com
ABSTRACT
The Asirra CAPTCHA [7], proposed at ACM CCS 2007,
relies on the problem of distinguishing images of cats and
dogs (a task that humans are very good at). The security
of Asirra is based on the presumed diﬃculty of classifying
these images automatically.
In this paper, we describe a classiﬁer which is 82.7% ac-
curate in telling apart the images of cats and dogs used in
Asirra. This classiﬁer is a combination of support-vector
machine classiﬁers trained on color and texture features ex-
tracted from images. Our classiﬁer allows us to solve a
12-image Asirra challenge automatically with probability
10.3%. This probability of success is signiﬁcantly higher
than the estimate of 0.2% given in [7] for machine vision at-
tacks. Our results suggest caution against deploying Asirra
without safeguards.
We also investigate the impact of our attacks on the partial
credit and token bucket algorithms proposed in [7]. The
partial credit algorithm weakens Asirra considerably and we
recommend against its use. The token bucket algorithm
helps mitigate the impact of our attacks and allows Asirra
to be deployed in a way that maintains an appealing balance
between usability and security. One contribution of our work
is to inform the choice of safeguard parameters in Asirra
deployments.
Categories and Subject Descriptors
K.6.5 [Computing Milieux]: Management of Computing
and Information Systems—Security and Protection
General Terms
Security
Keywords
CAPTCHA, reverse Turing test, machine learning, support
vector machine, classiﬁer.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for proﬁt or commercial advantage and that copies
bear this notice and ...


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

Input:
title:Machine learning attacks against the Asirra CAPTCHA
author:Philippe Golle
Machine Learning Attacks
Against the Asirra CAPTCHA
Philippe Golle
Palo Alto Research Center
Palo Alto, CA 94304, USA
pgolle@parc.com
ABSTRACT
The Asirra CAPTCHA [7], proposed at ACM CCS 2007,
relies on the problem of distinguishing images of cats and
dogs (a task that humans are very good at). The security
of Asirra is based on the presumed diﬃculty of classifying
these images automatically.
In this paper, we describe a classiﬁer which is 82.7% ac-
curate in telling apart the images of cats and dogs used in
Asirra. This classiﬁer is a combination of support-vector
machine classiﬁers trained on color and texture features ex-
tracted from images. Our classiﬁer allows us to solve a
12-image Asirra challenge automatically with probability
10.3%. This probability of success is signiﬁcantly higher
than the estimate of 0.2% given in [7] for machine vision at-
tacks. Our results suggest caution against deploying Asirra
without safeguards.
We also investigate the impact of our attacks on the partial
credit and token bucket algorithms proposed in [7]. The
partial credit algorithm weakens Asirra considerably and we
recommend against its use. The token bucket algorithm
helps mitigate the impact of our attacks and allows Asirra
to be deployed in a way that maintains an appealing balance
between usability and security. One contribution of our work
is to inform the choice of safeguard parameters in Asirra
deployments.
Categories and Subject Descriptors
K.6.5 [Computing Milieux]: Management of Computing
and Information Systems—Security and Protection
General Terms
Security
Keywords
CAPTCHA, reverse Turing test, machine learning, support
vector machine, classiﬁer.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for proﬁt or commercial advantage and that copies
bear this notice and ...

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


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

Output:
安全论文分析：

title:Constrained Concealment Attacks against Reconstruction-based Anomaly
Detectors in Industrial Control Systems
author:Alessandro Erba and
Riccardo Taormina and
Stefano Galelli and
Marcello Pogliani and
Michele Carminati and
Stefano Zanero and
Nils Ole Tippenhauer
Constrained Concealment Attacks against
Reconstruction-based Anomaly Detectors in
Industrial Control Systems
0
2
0
2
t
c
O
2
1
]
R
C
.
s
c
[
3
v
7
8
4
7
0
.
7
0
9
1
:
v
i
X
r
a
Alessandro Erba∗†
alessandro.erba@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
Riccardo Taormina
r.taormina@tudelft.nl
Delft University of
Technology
Delft, Netherlands
Stefano Galelli
stefano_galelli@sutd.edu.sg
Singapore University of
Technology and Design
Singapore
Marcello Pogliani
marcello.pogliani@polimi.it
Politecnico di Milano
Milan, Italy
Michele Carminati
michele.carminati@polimi.it
Politecnico di Milano
Milan, Italy
Stefano Zanero
stefano.zanero@polimi.it
Politecnico di Milano
Milan, Italy
Nils Ole Tippenhauer
tippenhauer@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
ABSTRACT
Recently, reconstruction-based anomaly detection was proposed
as an effective technique to detect attacks in dynamic industrial
control networks. Unlike classical network anomaly detectors that
observe the network traffic, reconstruction-based detectors operate
on the measured sensor data, leveraging physical process models
learned a priori.
In this work, we investigate different approaches to evade prior-
work reconstruction-based anomaly detectors by manipulating sen-
sor data so that the attack is concealed. We find that replay attacks
(commonly assumed to be very strong) show bad performance (i.e.,
increasing the number of alarms) if the attacker is constrained to
manipulate less than 95% of all features in the system, as hidden
correlations between the features are not replicated well. To ad-
dress this, we propose two novel attacks that manipulate a subset
of the se...


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

Input:
title:Constrained Concealment Attacks against Reconstruction-based Anomaly
Detectors in Industrial Control Systems
author:Alessandro Erba and
Riccardo Taormina and
Stefano Galelli and
Marcello Pogliani and
Michele Carminati and
Stefano Zanero and
Nils Ole Tippenhauer
Constrained Concealment Attacks against
Reconstruction-based Anomaly Detectors in
Industrial Control Systems
0
2
0
2
t
c
O
2
1
]
R
C
.
s
c
[
3
v
7
8
4
7
0
.
7
0
9
1
:
v
i
X
r
a
Alessandro Erba∗†
alessandro.erba@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
Riccardo Taormina
r.taormina@tudelft.nl
Delft University of
Technology
Delft, Netherlands
Stefano Galelli
stefano_galelli@sutd.edu.sg
Singapore University of
Technology and Design
Singapore
Marcello Pogliani
marcello.pogliani@polimi.it
Politecnico di Milano
Milan, Italy
Michele Carminati
michele.carminati@polimi.it
Politecnico di Milano
Milan, Italy
Stefano Zanero
stefano.zanero@polimi.it
Politecnico di Milano
Milan, Italy
Nils Ole Tippenhauer
tippenhauer@cispa.saarland
CISPA Helmholtz Center
for Information Security
Saarbrücken, Germany
ABSTRACT
Recently, reconstruction-based anomaly detection was proposed
as an effective technique to detect attacks in dynamic industrial
control networks. Unlike classical network anomaly detectors that
observe the network traffic, reconstruction-based detectors operate
on the measured sensor data, leveraging physical process models
learned a priori.
In this work, we investigate different approaches to evade prior-
work reconstruction-based anomaly detectors by manipulating sen-
sor data so that the attack is concealed. We find that replay attacks
(commonly assumed to be very strong) show bad performance (i.e.,
increasing the number of alarms) if the attacker is constrained to
manipulate less than 95% of all features in the system, as hidden
correlations between the features are not replicated well. To ad-
dress this, we propose two novel attacks that manipulate a subset
of the se...

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


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

Output:
安全论文分析：

title:Preserving privacy in gps traces via uncertainty-aware path cloaking
author:Baik Hoh and
Marco Gruteser and
Hui Xiong and
Ansaf Alrabady
Preserving Privacy in GPS Traces via Uncertainty-Aware
Path Cloaking
Baik Hoh, Marco Gruteser
WINLAB / ECE Dept., Rutgers Univ.
Piscataway, NJ USA
baikhoh,gruteser@winlab.rutgers.edu
Hui Xiong
MSIS Dept., Rutgers Univ.
Newark, NJ USA
hui@rbs.rutgers.edu
Ansaf Alrabady
General Motors Corporation
Warren, MI USA
ansaf.alrabady@gm.com
ABSTRACT
Motivated by a probe-vehicle based automotive trafﬁc monitoring
system, this paper considers the problem of guaranteed anonymity
in a dataset of location traces while maintaining high data accuracy.
We ﬁnd through analysis of a set of GPS traces from 233 vehicles
that known privacy algorithms cannot meet accuracy requirements
or fail to provide privacy guarantees for drivers in low-density ar-
eas. To overcome these challenges, we develop a novel time-to-
confusion criterion to characterize privacy in a location dataset and
propose an uncertainty-aware path cloaking algorithm that hides
location samples in a dataset to provide a time-to-confusion guar-
antee for all vehicles. We show that this approach effectively guar-
antees worst case tracking bounds, while achieving signiﬁcant data
accuracy improvements.
Categories and Subject Descriptors
K.4.1 [Computers and Society]: Public Policy IssuesPrivacy; K.6
[Management of Computing and Information Systems]: Secu-
rity and Protection
General Terms
Algorithms, Measurements, Security
Keywords
Privacy, GPS, Trafﬁc
1.
INTRODUCTION
A new class of applications that mines aggregate location traces
from large numbers of users, spawned by the increasing ubiquity
of sensors and wireless communications, raises signiﬁcant privacy
concerns. One example and the motivation for this paper is automo-
tive trafﬁc monitoring through probe vehicles [20, 14, 30], which
infers trafﬁc congestion from position and speed information peri-
odically reported from GPS-eq...


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

Input:
title:Preserving privacy in gps traces via uncertainty-aware path cloaking
author:Baik Hoh and
Marco Gruteser and
Hui Xiong and
Ansaf Alrabady
Preserving Privacy in GPS Traces via Uncertainty-Aware
Path Cloaking
Baik Hoh, Marco Gruteser
WINLAB / ECE Dept., Rutgers Univ.
Piscataway, NJ USA
baikhoh,gruteser@winlab.rutgers.edu
Hui Xiong
MSIS Dept., Rutgers Univ.
Newark, NJ USA
hui@rbs.rutgers.edu
Ansaf Alrabady
General Motors Corporation
Warren, MI USA
ansaf.alrabady@gm.com
ABSTRACT
Motivated by a probe-vehicle based automotive trafﬁc monitoring
system, this paper considers the problem of guaranteed anonymity
in a dataset of location traces while maintaining high data accuracy.
We ﬁnd through analysis of a set of GPS traces from 233 vehicles
that known privacy algorithms cannot meet accuracy requirements
or fail to provide privacy guarantees for drivers in low-density ar-
eas. To overcome these challenges, we develop a novel time-to-
confusion criterion to characterize privacy in a location dataset and
propose an uncertainty-aware path cloaking algorithm that hides
location samples in a dataset to provide a time-to-confusion guar-
antee for all vehicles. We show that this approach effectively guar-
antees worst case tracking bounds, while achieving signiﬁcant data
accuracy improvements.
Categories and Subject Descriptors
K.4.1 [Computers and Society]: Public Policy IssuesPrivacy; K.6
[Management of Computing and Information Systems]: Secu-
rity and Protection
General Terms
Algorithms, Measurements, Security
Keywords
Privacy, GPS, Trafﬁc
1.
INTRODUCTION
A new class of applications that mines aggregate location traces
from large numbers of users, spawned by the increasing ubiquity
of sensors and wireless communications, raises signiﬁcant privacy
concerns. One example and the motivation for this paper is automo-
tive trafﬁc monitoring through probe vehicles [20, 14, 30], which
infers trafﬁc congestion from position and speed information peri-
odically reported from GPS-eq...

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


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

Output:
安全论文分析：

title:A general design towards secure ad-hoc collaboration
author:Masayuki Nakae and
Xinwen Zhang and
Ravi S. Sandhu
A  General  Design  towards  Secure  Ad-hoc  Collaboration
Masayuki Nakae
NEC Corporation
Kawasaki, Kanagawa, Japan
m-nakae@bp.jp.nec.com
Xinwen Zhang
George Mason University
Fairfax, Virginia, USA
xzhang6@gmu.edu
Ravi Sandhu
George Mason University
and TriCipher Inc., USA
sandhu@gmu.edu
ABSTRACT
We  propose  a  general  desgn  for  secure  collaboraton  systems,
whch  s  underpnned  wth  an  access  control  polcy  model,  an
admnstratve scheme, and an enforcement scheme, based on the
Typed Usage Control (TUCON) model. TUCON s a generalzed
form of the usage control model (UCON) proposed recently. By
utlzng mutable object attrbutes, UCON can reflect the dynamc
nature  of  ad-hoc  collaboratons  such  as  temporal  and/or  spatal
usages. In TUCON, every object has an object type as a persstent
attrbute,  whch  works  as  a  name  space  that  ndcates  an
organzaton  to  whch  the  object  belongs.  Wth  object  types,
TUCON  polces  can  dstnctly  control  ntra-organzaton  and
nter-organzaton nformaton flows. Ths approach acheves the
autonomy  of  collaboratve
the  mutual
confdentalty of collaboratng organzatons.
teams  as  well  as
Categories and Subject Descriptors
D..  [Operating  Systems]:  Securty  and  Protecton—Access
controls;  K..  [Management  of  Computing  and  Information
Systems]: Securty and Protecton—Unauthorized access
General Terms
Securty
Keywords
Access Control, Informaton flow, Usage Control, Collaboraton.
In order to ncrease the productvty and effcency of ntellectual
actvtes  such  as  scentfc  or  engneerng  research,
the
mportance of collaboratve work among concerned organzatons
s  well  understood.  To  date,  dstrbuted  computng  technologes
such as vrtual prvate networkng, peer-to-peer fle sharng, Web
s...


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

Input:
title:A general design towards secure ad-hoc collaboration
author:Masayuki Nakae and
Xinwen Zhang and
Ravi S. Sandhu
A  General  Design  towards  Secure  Ad-hoc  Collaboration
Masayuki Nakae
NEC Corporation
Kawasaki, Kanagawa, Japan
m-nakae@bp.jp.nec.com
Xinwen Zhang
George Mason University
Fairfax, Virginia, USA
xzhang6@gmu.edu
Ravi Sandhu
George Mason University
and TriCipher Inc., USA
sandhu@gmu.edu
ABSTRACT
We  propose  a  general  desgn  for  secure  collaboraton  systems,
whch  s  underpnned  wth  an  access  control  polcy  model,  an
admnstratve scheme, and an enforcement scheme, based on the
Typed Usage Control (TUCON) model. TUCON s a generalzed
form of the usage control model (UCON) proposed recently. By
utlzng mutable object attrbutes, UCON can reflect the dynamc
nature  of  ad-hoc  collaboratons  such  as  temporal  and/or  spatal
usages. In TUCON, every object has an object type as a persstent
attrbute,  whch  works  as  a  name  space  that  ndcates  an
organzaton  to  whch  the  object  belongs.  Wth  object  types,
TUCON  polces  can  dstnctly  control  ntra-organzaton  and
nter-organzaton nformaton flows. Ths approach acheves the
autonomy  of  collaboratve
the  mutual
confdentalty of collaboratng organzatons.
teams  as  well  as
Categories and Subject Descriptors
D..  [Operating  Systems]:  Securty  and  Protecton—Access
controls;  K..  [Management  of  Computing  and  Information
Systems]: Securty and Protecton—Unauthorized access
General Terms
Securty
Keywords
Access Control, Informaton flow, Usage Control, Collaboraton.
In order to ncrease the productvty and effcency of ntellectual
actvtes  such  as  scentfc  or  engneerng  research,
the
mportance of collaboratve work among concerned organzatons
s  well  understood.  To  date,  dstrbuted  computng  technologes
such as vrtual prvate networkng, peer-to-peer fle sharng, Web
s...

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


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

Output:
安全论文分析：

title:Privacy-Preserving Location Tracking of Lost or Stolen Devices: Cryptographic
Techniques and Replacing Trusted Third Parties with DHTs
author:Thomas Ristenpart and
Gabriel Maganis and
Arvind Krishnamurthy and
Tadayoshi Kohno
Privacy-Preserving Location Tracking of Lost or Stolen Devices:
Cryptographic Techniques and Replacing Trusted Third Parties with DHTs
Thomas Ristenpart∗
Gabriel Maganis†
∗University of California, San Diego
Arvind Krishnamurthy†
Tadayoshi Kohno†
†University of Washington
tristenp@cs.ucsd.edu
{gym,arvind,yoshi}@cs.washington.edu
Abstract
We tackle the problem of building privacy-preserving
device-tracking systems — or private methods to assist in
the recovery of lost or stolen Internet-connected mobile
devices. The main goals of such systems are seemingly
contradictory:
to hide the device’s legitimately-visited
locations from third-party services and other parties (lo-
cation privacy) while simultaneously using those same
services to help recover the device’s location(s) after it
goes missing (device-tracking). We propose a system,
named Adeona, that nevertheless meets both goals.
It
provides strong guarantees of location privacy while pre-
serving the ability to efﬁciently track missing devices.
We build a version of Adeona that uses OpenDHT as the
third party service, resulting in an immediately deploy-
able system that does not rely on any single trusted third
party. We describe numerous extensions for the basic de-
sign that increase Adeona’s suitability for particular de-
ployment environments.
1
Introduction
The growing ubiquity of mobile computing devices, and
our reliance upon them, means that losing them is simul-
taneously more likely and more damaging. For example,
the annual CSI/FBI Computer Crime and Security Sur-
vey ranks laptop and mobile device theft as a prevalent
and expensive problem for corporations [16]. To help
combat this growing problem, corporations and individ-
uals are deploying commercial device-tracking softwa...


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

Input:
title:Privacy-Preserving Location Tracking of Lost or Stolen Devices: Cryptographic
Techniques and Replacing Trusted Third Parties with DHTs
author:Thomas Ristenpart and
Gabriel Maganis and
Arvind Krishnamurthy and
Tadayoshi Kohno
Privacy-Preserving Location Tracking of Lost or Stolen Devices:
Cryptographic Techniques and Replacing Trusted Third Parties with DHTs
Thomas Ristenpart∗
Gabriel Maganis†
∗University of California, San Diego
Arvind Krishnamurthy†
Tadayoshi Kohno†
†University of Washington
tristenp@cs.ucsd.edu
{gym,arvind,yoshi}@cs.washington.edu
Abstract
We tackle the problem of building privacy-preserving
device-tracking systems — or private methods to assist in
the recovery of lost or stolen Internet-connected mobile
devices. The main goals of such systems are seemingly
contradictory:
to hide the device’s legitimately-visited
locations from third-party services and other parties (lo-
cation privacy) while simultaneously using those same
services to help recover the device’s location(s) after it
goes missing (device-tracking). We propose a system,
named Adeona, that nevertheless meets both goals.
It
provides strong guarantees of location privacy while pre-
serving the ability to efﬁciently track missing devices.
We build a version of Adeona that uses OpenDHT as the
third party service, resulting in an immediately deploy-
able system that does not rely on any single trusted third
party. We describe numerous extensions for the basic de-
sign that increase Adeona’s suitability for particular de-
ployment environments.
1
Introduction
The growing ubiquity of mobile computing devices, and
our reliance upon them, means that losing them is simul-
taneously more likely and more damaging. For example,
the annual CSI/FBI Computer Crime and Security Sur-
vey ranks laptop and mobile device theft as a prevalent
and expensive problem for corporations [16]. To help
combat this growing problem, corporations and individ-
uals are deploying commercial device-tracking softwa...

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


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

Output:
安全论文分析：

title:POSTER: RIA: an Audition-based Method to Protect the Runtime Integrity
of MapReduce Applications
author:Yongzhi Wang and
Yulong Shen
POSTER: RIA – an Audition-based Method to Protect the
Runtime Integrity of MapReduce Applications
Yongzhi Wang
School of Computer Science and Technology,
School of Computer Science and Technology
Xidian University, P.R. China
Key Laboratory of Grain Information Processing
and Control (Henan University of Technology),
Ministry of Education, P.R. China
yzwang@xidian.edu.cn
Yulong Shen
Xidian University, P.R. China
ylshen@mail.xidian.edu.cn
ABSTRACT
Public cloud vendors have been oﬀering varies big data com-
puting services. However, runtime integrity is one of the ma-
jor concerns that hinders the adoption of those services. In
this paper, we focus on MapReduce, a popular big data com-
puting framework, propose the runtime integrity audition
(RIA), a solution to verify the runtime integrity of MapRe-
duce applications. Based on the idea of RIA, we developed
a prototype system, called MR Auditor, and tested its ap-
plicability and the performance with multiple Hadoop appli-
cations. Our experimental results showed that MR Auditor
is an eﬃcient tool to detect runtime integrity violation and
incurs a moderate performance overhead.
Keywords
Computation Integrity, Remote Veriﬁcation, MapReduce
1.
INTRODUCTION
MapReduce, the fundamental framework supporting vari-
ous big data applications, has been delivered as a computa-
tion service by public cloud vendors. However, in this model,
since computations are performed remotely, security is be-
yond the control of customers. Security breach incidents
reported by mass media [1] and vulnerabilities discovered
by researchers [3] have obstructed the wide adoption of such
a service. Among varies security issues, runtime integrity
is one of the most critical ones that is closely related to the
MapReduce service. Existing works relying on speciﬁc hard-
ware environment [4], task redundancy [5], or ...


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

Input:
title:POSTER: RIA: an Audition-based Method to Protect the Runtime Integrity
of MapReduce Applications
author:Yongzhi Wang and
Yulong Shen
POSTER: RIA – an Audition-based Method to Protect the
Runtime Integrity of MapReduce Applications
Yongzhi Wang
School of Computer Science and Technology,
School of Computer Science and Technology
Xidian University, P.R. China
Key Laboratory of Grain Information Processing
and Control (Henan University of Technology),
Ministry of Education, P.R. China
yzwang@xidian.edu.cn
Yulong Shen
Xidian University, P.R. China
ylshen@mail.xidian.edu.cn
ABSTRACT
Public cloud vendors have been oﬀering varies big data com-
puting services. However, runtime integrity is one of the ma-
jor concerns that hinders the adoption of those services. In
this paper, we focus on MapReduce, a popular big data com-
puting framework, propose the runtime integrity audition
(RIA), a solution to verify the runtime integrity of MapRe-
duce applications. Based on the idea of RIA, we developed
a prototype system, called MR Auditor, and tested its ap-
plicability and the performance with multiple Hadoop appli-
cations. Our experimental results showed that MR Auditor
is an eﬃcient tool to detect runtime integrity violation and
incurs a moderate performance overhead.
Keywords
Computation Integrity, Remote Veriﬁcation, MapReduce
1.
INTRODUCTION
MapReduce, the fundamental framework supporting vari-
ous big data applications, has been delivered as a computa-
tion service by public cloud vendors. However, in this model,
since computations are performed remotely, security is be-
yond the control of customers. Security breach incidents
reported by mass media [1] and vulnerabilities discovered
by researchers [3] have obstructed the wide adoption of such
a service. Among varies security issues, runtime integrity
is one of the most critical ones that is closely related to the
MapReduce service. Existing works relying on speciﬁc hard-
ware environment [4], task redundancy [5], or ...

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


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

Output:
安全论文分析：

title:An empirical characterization of IFTTT: ecosystem, usage, and performance
author:Xianghang Mi and
Feng Qian and
Ying Zhang and
XiaoFeng Wang
An Empirical Characterization of IFTTT:
Ecosystem, Usage, and Performance
Feng Qian
Xianghang Mi
Indiana University Bloomington
xmi@indiana.edu
Ying Zhang
Facebook Inc.
zhangying@fb.com
Indiana University Bloomington
fengqian@indiana.edu
XiaoFeng Wang
Indiana University Bloomington
xw7@indiana.edu
ABSTRACT
IFTTT is a popular trigger-action programming platform whose
applets can automate more than 400 services of IoT devices and
web applications. We conduct an empirical study of IFTTT using
a combined approach of analyzing data collected for 6 months
and performing controlled experiments using a custom testbed.
We profile the interactions among different entities, measure
how applets are used by end users, and test the performance of
applet execution. Overall we observe the fast growth of the IFTTT
ecosystem and its increasing usage for automating IoT-related tasks,
which correspond to 52% of all services and 16% of the applet usage.
We also observe several performance inefficiencies and identify
their causes.
CCS CONCEPTS
• Networks → Home networks; Network performance evaluation;
• Computer systems organization → Embedded systems;
KEYWORDS
IFTTT, IoT, Measurement
ACM Reference Format:
Xianghang Mi, Feng Qian, Ying Zhang, and XiaoFeng Wang. 2017. An
Empirical Characterization of IFTTT: Ecosystem, Usage, and Performance.
In Proceedings of IMC ’17. ACM, New York, NY, USA, 7 pages. https://doi.
org/10.1145/3131365.3131369
1 INTRODUCTION
Consumer Internet of Things (IoT) devices such as smart home
gadgets are becoming increasingly popular. For example, Amazon
has sold more than 5 million Amazon Echo devices in just two
years since their debut in late 2014 [1]. Among many challenges
faced by today’s consumer IoT systems, policy management plays a
critical role in ensuring scalable, automated, secure, and resource-
efficient in...


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

Input:
title:An empirical characterization of IFTTT: ecosystem, usage, and performance
author:Xianghang Mi and
Feng Qian and
Ying Zhang and
XiaoFeng Wang
An Empirical Characterization of IFTTT:
Ecosystem, Usage, and Performance
Feng Qian
Xianghang Mi
Indiana University Bloomington
xmi@indiana.edu
Ying Zhang
Facebook Inc.
zhangying@fb.com
Indiana University Bloomington
fengqian@indiana.edu
XiaoFeng Wang
Indiana University Bloomington
xw7@indiana.edu
ABSTRACT
IFTTT is a popular trigger-action programming platform whose
applets can automate more than 400 services of IoT devices and
web applications. We conduct an empirical study of IFTTT using
a combined approach of analyzing data collected for 6 months
and performing controlled experiments using a custom testbed.
We profile the interactions among different entities, measure
how applets are used by end users, and test the performance of
applet execution. Overall we observe the fast growth of the IFTTT
ecosystem and its increasing usage for automating IoT-related tasks,
which correspond to 52% of all services and 16% of the applet usage.
We also observe several performance inefficiencies and identify
their causes.
CCS CONCEPTS
• Networks → Home networks; Network performance evaluation;
• Computer systems organization → Embedded systems;
KEYWORDS
IFTTT, IoT, Measurement
ACM Reference Format:
Xianghang Mi, Feng Qian, Ying Zhang, and XiaoFeng Wang. 2017. An
Empirical Characterization of IFTTT: Ecosystem, Usage, and Performance.
In Proceedings of IMC ’17. ACM, New York, NY, USA, 7 pages. https://doi.
org/10.1145/3131365.3131369
1 INTRODUCTION
Consumer Internet of Things (IoT) devices such as smart home
gadgets are becoming increasingly popular. For example, Amazon
has sold more than 5 million Amazon Echo devices in just two
years since their debut in late 2014 [1]. Among many challenges
faced by today’s consumer IoT systems, policy management plays a
critical role in ensuring scalable, automated, secure, and resource-
efficient in...

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


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

Output:
安全论文分析：

title:DEFTL: Implementing Plausibly Deniable Encryption in Flash Translation
Layer
author:Shijie Jia and
Luning Xia and
Bo Chen and
Peng Liu
DEFTL: Implementing Plausibly Deniable Encryption in Flash
Translation Layer
Shijie Jia†‡, Luning Xia†‡, Bo Chen§, Peng Liu¶
†Data Assurance and Communication Security Research Center, Chinese Academy of Sciences, Beijing, China
‡State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences,
Beijing, China
§Department of Computer Science, Michigan Technological University, USA
¶College of Information Sciences and Technology, The Pennsylvania State University, USA
{jiashijie,xialuning}@iie.ac.cn,bchen1@mtu.edu,pliu@ist.psu.edu
ABSTRACT
Mobile devices today have been increasingly used to store and
process sensitive information. To protect sensitive data, mobile
operating systems usually incorporate a certain level of encryption
to protect sensitive data. However, conventional encryption cannot
defend against a coercive attacker who can capture the device
owner, and force the owner to disclose keys used for decrypting
sensitive information. To defend against such a coercive adversary,
Plausibly Deniable Encryption (PDE) was introduced to allow the
device owner to deny the very existence of sensitive data stored
on his/her device. The existing PDE systems, built on (cid:30)ash storage
devices, are problematic, since they either neglect the special nature
of the underlying storage medium (which is usually NAND (cid:30)ash),
or su(cid:29)er from deniability compromises.
In this paper, we propose DEFTL, a Deniability Enabling Flash
Translation Layer for devices which use (cid:30)ash-based block devices
as storage media. DEFTL is the (cid:27)rst PDE design which incorporates
deniability to Flash Translation Layer (FTL), a pervasively deployed
“translation layer” which stays between NAND (cid:30)ash and the (cid:27)le
system in literally all the computing devices. A salient advantage
of ...