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

Input:
title:POSTER: Recovering Songs from a Hanging Light Bulb
author:Ben Nassi and
Yaron Pirutin and
Raz Swissa and
Adi Shamir and
Yuval Elovici and
Boris Zadov
Recovering Songs from a Hanging Light Bulb
Ben Nassi
Yaron Pirutin
Raz Swissa
nassib@post.bgu.ac.il
yaronpir@post.bgu.ac.il
Ben-Gurion University of the Negev
Ben-Gurion University of the Negev
Ben-Gurion University of the Negev
razsw@post.bgu.ac.il
Be’er Sheva, Israel
Boris Zadov
zadov@post.bgu.ac.il
Be’er Sheva, Israel
Be’er Sheva, Israel
Adi Shamir
adi.shamir@weizmann.ac.il
Weizmann Institute of Science
Rehovot, Israel
Be’er Sheva, Israel
Yuval Elovici
elovici@bgu.ac.il
Be’er Sheva, Israel
Ben-Gurion University of the Negev
Ben-Gurion University of the Negev
Abstract
In this paper, we introduce a novel side-channel attack for eaves-
dropping sound using an electro-optical sensor. We show how
small vibrations of a hanging bulb (in response to sound hitting its
surface), can be exploited by eavesdroppers to recover sound. We
evaluate our method’s performance in a realistic setup and show
that our method can be used by eavesdroppers to recover songs
from a target room containing the hanging light bulb.
CCS Concepts
• Security and privacy;
Keywords
Privacy, Sound Recovery, Side-Channel Attack
ACM Reference Format:
Ben Nassi, Yaron Pirutin, Raz Swissa, Adi Shamir, Yuval Elovici, and Boris
Zadov. 2021. POSTER: Recovering Songs from a Hanging Light Bulb. In
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Commu-
nications Security (CCS ’21), November 15–19, 2021, Virtual Event, Repub-
lic of Korea. ACM, New York, NY, USA, 3 pages. https://doi.org/10.1145/
3460120.3485336
1 Introduction
In recent years, several studies [2, 3, 5, 8] have shown that mea-
surements obtained from motion sensors located in proximity of
a victim can be used for the classification of words. These studies
variously demonstrated that the response of MEMS gyroscopes [5],
and accelerometers [2, 3, 8] to sound can be used to classify...

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


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

Output:
安全论文分析：

title:Automatic Generation of String Signatures for Malware Detection
author:Kent Griffin and
Scott Schneider and
Xin Hu and
Tzi-cker Chiueh
Automatic Generation of String Signatures for
Malware Detection
Kent Griﬃn, Scott Schneider, Xin Hu, and Tzi-cker Chiueh
Symantec Research Laboratories
Abstract. Scanning ﬁles for signatures is a proven technology, but ex-
ponential growth in unique malware programs has caused an explosion
in signature database sizes. One solution to this problem is to use string
signatures, each of which is a contiguous byte sequence that potentially
can match many variants of a malware family. However, it is not clear
how to automatically generate these string signatures with a suﬃciently
low false positive rate. Hancock is the ﬁrst string signature generation
system that takes on this challenge on a large scale.
To minimize the false positive rate, Hancock features a scalable model
that estimates the occurrence probability of arbitrary byte sequences in
goodware programs, a set of library code identiﬁcation techniques, and
diversity-based heuristics that ensure the contexts in which a signature
is embedded in containing malware ﬁles are similar to one another. With
these techniques combined, Hancock is able to automatically generate
string signatures with a false positive rate below 0.1%.
Keywords: malware signatures, signature generation, Markov model,
library function identiﬁcation, diversity-based heuristics.
1 Introduction
Symantec’s anti-malware response group receives malware samples submitted
by its customers and competitors, analyzes them, and creates signatures that
could be used to identify instances of them in the ﬁeld. The number of unique
malware samples that Symantec receives has grown exponentially in the recent
years, because malware programs are increasingly customized, targeted, and in-
tentionally restricted in distribution scope. The total number of distinct malware
samples that Symantec observed in 2008 exceeds 1 million...


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

Input:
title:Automatic Generation of String Signatures for Malware Detection
author:Kent Griffin and
Scott Schneider and
Xin Hu and
Tzi-cker Chiueh
Automatic Generation of String Signatures for
Malware Detection
Kent Griﬃn, Scott Schneider, Xin Hu, and Tzi-cker Chiueh
Symantec Research Laboratories
Abstract. Scanning ﬁles for signatures is a proven technology, but ex-
ponential growth in unique malware programs has caused an explosion
in signature database sizes. One solution to this problem is to use string
signatures, each of which is a contiguous byte sequence that potentially
can match many variants of a malware family. However, it is not clear
how to automatically generate these string signatures with a suﬃciently
low false positive rate. Hancock is the ﬁrst string signature generation
system that takes on this challenge on a large scale.
To minimize the false positive rate, Hancock features a scalable model
that estimates the occurrence probability of arbitrary byte sequences in
goodware programs, a set of library code identiﬁcation techniques, and
diversity-based heuristics that ensure the contexts in which a signature
is embedded in containing malware ﬁles are similar to one another. With
these techniques combined, Hancock is able to automatically generate
string signatures with a false positive rate below 0.1%.
Keywords: malware signatures, signature generation, Markov model,
library function identiﬁcation, diversity-based heuristics.
1 Introduction
Symantec’s anti-malware response group receives malware samples submitted
by its customers and competitors, analyzes them, and creates signatures that
could be used to identify instances of them in the ﬁeld. The number of unique
malware samples that Symantec receives has grown exponentially in the recent
years, because malware programs are increasingly customized, targeted, and in-
tentionally restricted in distribution scope. The total number of distinct malware
samples that Symantec observed in 2008 exceeds 1 million...

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


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

Output:
安全论文分析：

title:Anonymous Identification for Ad Hoc Group
author:Xingye Lu and
Man Ho Au
Anonymous Identiﬂcation in Ad Hoc Groups
Yevgeniy Dodis1, Aggelos Kiayias2, Antonio Nicolosi1, and Victor Shoup1
1 Courant Institute of Mathematical Sciences, New York University, NY, USA
2 Department of Computer Science and Eng., University of Connecticut, CT, USA
{dodis,nicolosi,shoup}@cs.nyu.edu
aggelos@cse.uconn.edu
Abstract. We introduce Ad hoc Anonymous Identiﬂcation schemes, a
new multi-user cryptographic primitive that allows participants from
a user population to form ad-hoc groups, and then prove membership
anonymously in such groups. Our schemes are based on the notion of
accumulator with one-way domain, a natural extension of cryptographic
accumulators we introduce in this work. We provide a formal model
for Ad hoc Anonymous Identiﬂcation schemes and design secure such
schemes both generically (based on any accumulator with one-way do-
main) and for a speciﬂc e–cient implementation of such an accumulator
based on the Strong RSA Assumption. A salient feature of our approach
is that all the identiﬂcation protocols take time independent of the size of
the ad-hoc group. All our schemes and notions can be generally and ef-
ﬂciently amended so that they allow the recovery of the signer’s identity
by an authority, if the latter is desired.
Using the Fiat-Shamir transform, we also obtain constant-size, signer-
ambiguous group and ring signatures (provably secure in the Random
Oracle Model). For ring signatures, this is the ﬂrst such constant-size
scheme, as all the previous proposals had signature size proportional to
the size of the ring. For group signatures, we obtain schemes comparable
in performance with state-of-the-art schemes, with the additional feature
that the role of the group manager during key registration is extremely
simple and essentially passive: all it does is accept the public key of the
new member (and update the constant-size public key of the group).
1
Introduct...


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

Input:
title:Anonymous Identification for Ad Hoc Group
author:Xingye Lu and
Man Ho Au
Anonymous Identiﬂcation in Ad Hoc Groups
Yevgeniy Dodis1, Aggelos Kiayias2, Antonio Nicolosi1, and Victor Shoup1
1 Courant Institute of Mathematical Sciences, New York University, NY, USA
2 Department of Computer Science and Eng., University of Connecticut, CT, USA
{dodis,nicolosi,shoup}@cs.nyu.edu
aggelos@cse.uconn.edu
Abstract. We introduce Ad hoc Anonymous Identiﬂcation schemes, a
new multi-user cryptographic primitive that allows participants from
a user population to form ad-hoc groups, and then prove membership
anonymously in such groups. Our schemes are based on the notion of
accumulator with one-way domain, a natural extension of cryptographic
accumulators we introduce in this work. We provide a formal model
for Ad hoc Anonymous Identiﬂcation schemes and design secure such
schemes both generically (based on any accumulator with one-way do-
main) and for a speciﬂc e–cient implementation of such an accumulator
based on the Strong RSA Assumption. A salient feature of our approach
is that all the identiﬂcation protocols take time independent of the size of
the ad-hoc group. All our schemes and notions can be generally and ef-
ﬂciently amended so that they allow the recovery of the signer’s identity
by an authority, if the latter is desired.
Using the Fiat-Shamir transform, we also obtain constant-size, signer-
ambiguous group and ring signatures (provably secure in the Random
Oracle Model). For ring signatures, this is the ﬂrst such constant-size
scheme, as all the previous proposals had signature size proportional to
the size of the ring. For group signatures, we obtain schemes comparable
in performance with state-of-the-art schemes, with the additional feature
that the role of the group manager during key registration is extremely
simple and essentially passive: all it does is accept the public key of the
new member (and update the constant-size public key of the group).
1
Introduct...

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


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

Output:
安全论文分析：

title:Your Online Interests: Pwned! A Pollution Attack Against Targeted
Advertising
author:Wei Meng and
Xinyu Xing and
Anmol Sheth and
Udi Weinsberg and
Wenke Lee
Your Online Interests – Pwned!
A Pollution Attack Against Targeted Advertising
Wei Meng
Georgia Institute of
Technology
wei@gatech.edu
Xinyu Xing
Georgia Institute of
Technology
xxing8@gatech.edu
Anmol Sheth
Technicolor
anmolsheth@gmail.com
Udi Weinsberg
Technicolor
udi.weinsberg@gmail.com
Wenke Lee
Georgia Institute of
Technology
wenke@cc.gatech.edu
ABSTRACT
We present a new ad fraud mechanism that enables publishers to
increase their ad revenue by deceiving the ad exchange and adver-
tisers to target higher paying ads at users visiting the publisher’s
site. Our attack is based on polluting users’ online interest proﬁle
by issuing requests to content not explicitly requested by the user,
such that it inﬂuences the ad selection process. We address sev-
eral challenges involved in setting up the attack for the two most
commonly used ad targeting mechanisms – re-marketing and be-
havioral targeting. We validate the attack for one of the largest ad
exchanges and empirically measure the monetary gains of the pub-
lisher by emulating the attack using web traces of 619 real users.
Our results show that the attack is effective in biasing ads towards
the desired higher-paying advertisers; the polluter can inﬂuence up
to 74% and 12% of the total ad impressions for re-marketing and
behavioral pollution, respectively. The attack is robust to diverse
browsing patterns and online interests of users. Finally, the attack
is lucrative and on average the attack can increase revenue of fraud-
ulent publishers by as much as 33%.
Categories and Subject Descriptors
J.0 [Computer Applications]: General
General Terms
Security
Keywords
Online Advertising; Ad Fraud; Proﬁle Pollution; Ad Measurement
1.
INTRODUCTION
Online targeted advertising is one of the primary approaches
used to monetize free online services and applications av...


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

Input:
title:Your Online Interests: Pwned! A Pollution Attack Against Targeted
Advertising
author:Wei Meng and
Xinyu Xing and
Anmol Sheth and
Udi Weinsberg and
Wenke Lee
Your Online Interests – Pwned!
A Pollution Attack Against Targeted Advertising
Wei Meng
Georgia Institute of
Technology
wei@gatech.edu
Xinyu Xing
Georgia Institute of
Technology
xxing8@gatech.edu
Anmol Sheth
Technicolor
anmolsheth@gmail.com
Udi Weinsberg
Technicolor
udi.weinsberg@gmail.com
Wenke Lee
Georgia Institute of
Technology
wenke@cc.gatech.edu
ABSTRACT
We present a new ad fraud mechanism that enables publishers to
increase their ad revenue by deceiving the ad exchange and adver-
tisers to target higher paying ads at users visiting the publisher’s
site. Our attack is based on polluting users’ online interest proﬁle
by issuing requests to content not explicitly requested by the user,
such that it inﬂuences the ad selection process. We address sev-
eral challenges involved in setting up the attack for the two most
commonly used ad targeting mechanisms – re-marketing and be-
havioral targeting. We validate the attack for one of the largest ad
exchanges and empirically measure the monetary gains of the pub-
lisher by emulating the attack using web traces of 619 real users.
Our results show that the attack is effective in biasing ads towards
the desired higher-paying advertisers; the polluter can inﬂuence up
to 74% and 12% of the total ad impressions for re-marketing and
behavioral pollution, respectively. The attack is robust to diverse
browsing patterns and online interests of users. Finally, the attack
is lucrative and on average the attack can increase revenue of fraud-
ulent publishers by as much as 33%.
Categories and Subject Descriptors
J.0 [Computer Applications]: General
General Terms
Security
Keywords
Online Advertising; Ad Fraud; Proﬁle Pollution; Ad Measurement
1.
INTRODUCTION
Online targeted advertising is one of the primary approaches
used to monetize free online services and applications av...

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


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

Output:
安全论文分析：

title:Detection of Interactive Stepping Stones: Algorithms and Confidence
Bounds
author:Avrim Blum and
Dawn Xiaodong Song and
Shobha Venkataraman
Detection of Interactive Stepping Stones:
Algorithms and Conﬁdence Bounds
Avrim Blum, Dawn Song, and Shobha Venkataraman
Carnegie Mellon University, Pittsburgh, PA 15213
{avrim,shobha}@cs.cmu.edu, dawnsong@cmu.edu
Abstract. Intruders on the Internet often prefer to launch network in-
trusions indirectly, i.e., using a chain of hosts on the Internet as relay
machines using protocols such as Telnet or SSH. This type of attack is
called a stepping-stone attack. In this paper, we propose and analyze al-
gorithms for stepping-stone detection using ideas from Computational
Learning Theory and the analysis of random walks. Our results are the
ﬁrst to achieve provable (polynomial) upper bounds on the number of
packets needed to conﬁdently detect and identify encrypted stepping-
stone streams with proven guarantees on the probability of falsely accus-
ing non-attacking pairs. Moreover, our methods and analysis rely on mild
assumptions, especially in comparison to previous work. We also examine
the consequences when the attacker inserts chaﬀ into the stepping-stone
traﬃc, and give bounds on the amount of chaﬀ that an attacker would
have to send to evade detection. Our results are based on a new approach
which can detect correlation of streams at a ﬁne-grained level. Our ap-
proach may also apply to more generalized traﬃc analysis domains, such
as anonymous communication.
Keywords: Network intrusion detection. Evasion. Stepping stones. In-
teractive sessions. Random walks.
1 Introduction
Intruders on the Internet often launch network intrusions indirectly, in order to
decrease their chances of being discovered. One of the most common methods
used to evade surveillance is the construction of stepping stones. In a stepping-
stone attack, an attacker uses a sequence of hosts on the Internet as relay ma-
chines and constructs a chain of ...


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

Input:
title:Detection of Interactive Stepping Stones: Algorithms and Confidence
Bounds
author:Avrim Blum and
Dawn Xiaodong Song and
Shobha Venkataraman
Detection of Interactive Stepping Stones:
Algorithms and Conﬁdence Bounds
Avrim Blum, Dawn Song, and Shobha Venkataraman
Carnegie Mellon University, Pittsburgh, PA 15213
{avrim,shobha}@cs.cmu.edu, dawnsong@cmu.edu
Abstract. Intruders on the Internet often prefer to launch network in-
trusions indirectly, i.e., using a chain of hosts on the Internet as relay
machines using protocols such as Telnet or SSH. This type of attack is
called a stepping-stone attack. In this paper, we propose and analyze al-
gorithms for stepping-stone detection using ideas from Computational
Learning Theory and the analysis of random walks. Our results are the
ﬁrst to achieve provable (polynomial) upper bounds on the number of
packets needed to conﬁdently detect and identify encrypted stepping-
stone streams with proven guarantees on the probability of falsely accus-
ing non-attacking pairs. Moreover, our methods and analysis rely on mild
assumptions, especially in comparison to previous work. We also examine
the consequences when the attacker inserts chaﬀ into the stepping-stone
traﬃc, and give bounds on the amount of chaﬀ that an attacker would
have to send to evade detection. Our results are based on a new approach
which can detect correlation of streams at a ﬁne-grained level. Our ap-
proach may also apply to more generalized traﬃc analysis domains, such
as anonymous communication.
Keywords: Network intrusion detection. Evasion. Stepping stones. In-
teractive sessions. Random walks.
1 Introduction
Intruders on the Internet often launch network intrusions indirectly, in order to
decrease their chances of being discovered. One of the most common methods
used to evade surveillance is the construction of stepping stones. In a stepping-
stone attack, an attacker uses a sequence of hosts on the Internet as relay ma-
chines and constructs a chain of ...

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


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

Output:
安全论文分析：

title:Usable Access Control for the World Wide Web
author:Dirk Balfanz
Usable Access Control for the World Wide Web
Dirk Balfanz
Palo Alto Research Center
3333 Coyote Hill Road, Palo Alto, CA 94304
balfanz@parc.com
Abstract
While publishing content on the World Wide Web has
moved within reach of the non-technical mainstream, con-
trolling access to published content still requires expertise
in Web server conﬁguration, public-key certiﬁcation, and a
variety of access control mechanisms. Lack of such exper-
tise can result in unnecessary exposure of content published
by non-experts, or can force cautious non-experts to leave
their content off-line. Recent research has focused on mak-
ing access control systems more ﬂexible and powerful, but
not on making them easier to use. In this paper, we propose
a usable access control systems for the World Wide Web, i.e.,
a system that is easy to use both for content providers (who
want to protect their content from unauthorized access) and
(authorized) content consumers (who want hassle-free ac-
cess to such protected content). Our system can be con-
structed with judicious use of conventional building blocks,
such as access control lists and public-key certiﬁcates. We
point out peculiarities in existing software that make it un-
necessarily hard to achieve our goal of usable access con-
trol, and assess the security provided by our usable system.
1. Introduction
On the World Wide Web, there are content providers
and content consumers. Content providers publish content
by making it available through Web servers. Content con-
sumers view or otherwise consume content by pointing their
Web browsers to the Web servers of the content providers.
In the early days of the World Wide Web, almost everybody
was, in addition to being a content consumer, also a con-
tent provider – if you were technical enough to connect to
the Web, you were probably technical enough to know how
to put up a home page. Then came a time when the bal-
ance shif...


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

Input:
title:Usable Access Control for the World Wide Web
author:Dirk Balfanz
Usable Access Control for the World Wide Web
Dirk Balfanz
Palo Alto Research Center
3333 Coyote Hill Road, Palo Alto, CA 94304
balfanz@parc.com
Abstract
While publishing content on the World Wide Web has
moved within reach of the non-technical mainstream, con-
trolling access to published content still requires expertise
in Web server conﬁguration, public-key certiﬁcation, and a
variety of access control mechanisms. Lack of such exper-
tise can result in unnecessary exposure of content published
by non-experts, or can force cautious non-experts to leave
their content off-line. Recent research has focused on mak-
ing access control systems more ﬂexible and powerful, but
not on making them easier to use. In this paper, we propose
a usable access control systems for the World Wide Web, i.e.,
a system that is easy to use both for content providers (who
want to protect their content from unauthorized access) and
(authorized) content consumers (who want hassle-free ac-
cess to such protected content). Our system can be con-
structed with judicious use of conventional building blocks,
such as access control lists and public-key certiﬁcates. We
point out peculiarities in existing software that make it un-
necessarily hard to achieve our goal of usable access con-
trol, and assess the security provided by our usable system.
1. Introduction
On the World Wide Web, there are content providers
and content consumers. Content providers publish content
by making it available through Web servers. Content con-
sumers view or otherwise consume content by pointing their
Web browsers to the Web servers of the content providers.
In the early days of the World Wide Web, almost everybody
was, in addition to being a content consumer, also a con-
tent provider – if you were technical enough to connect to
the Web, you were probably technical enough to know how
to put up a home page. Then came a time when the bal-
ance shif...

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


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

Output:
安全论文分析：

title:Designing New Operating Primitives to Improve Fuzzing Performance
author:Wen Xu and
Sanidhya Kashyap and
Changwoo Min and
Taesoo Kim
Designing New Operating Primitives to Improve
Fuzzing Performance
Wen Xu Sanidhya Kashyap Changwoo Min† Taesoo Kim
Georgia Institute of Technology Virginia Tech†
ABSTRACT
Fuzzing is a software testing technique that finds bugs by repeatedly
injecting mutated inputs to a target program. Known to be a highly
practical approach, fuzzing is gaining more popularity than ever
before. Current research on fuzzing has focused on producing an
input that is more likely to trigger a vulnerability.
In this paper, we tackle another way to improve the performance
of fuzzing, which is to shorten the execution time of each itera-
tion. We observe that AFL, a state-of-the-art fuzzer, slows down by
24× because of file system contention and the scalability of fork()
system call when it runs on 120 cores in parallel. Other fuzzers
are expected to suffer from the same scalability bottlenecks in that
they follow a similar design pattern. To improve the fuzzing perfor-
mance, we design and implement three new operating primitives
specialized for fuzzing that solve these performance bottlenecks
and achieve scalable performance on multi-core machines. Our
experiment shows that the proposed primitives speed up AFL and
LibFuzzer by 6.1 to 28.9× and 1.1 to 735.7×, respectively, on the
overall number of executions per second when targeting Google’s
fuzzer test suite with 120 cores. In addition, the primitives improve
AFL’s throughput up to 7.7× with 30 cores, which is a more common
setting in data centers. Our fuzzer-agnostic primitives can be easily
applied to any fuzzer with fundamental performance improvement
and directly benefit large-scale fuzzing and cloud-based fuzzing
services.
CCS CONCEPTS
• Security and privacy → Vulnerability scanners; • Software
and its engineering → Software testing and debugging;
KEYWORDS
fuzzing; scalability; operating system
1...


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

Input:
title:Designing New Operating Primitives to Improve Fuzzing Performance
author:Wen Xu and
Sanidhya Kashyap and
Changwoo Min and
Taesoo Kim
Designing New Operating Primitives to Improve
Fuzzing Performance
Wen Xu Sanidhya Kashyap Changwoo Min† Taesoo Kim
Georgia Institute of Technology Virginia Tech†
ABSTRACT
Fuzzing is a software testing technique that finds bugs by repeatedly
injecting mutated inputs to a target program. Known to be a highly
practical approach, fuzzing is gaining more popularity than ever
before. Current research on fuzzing has focused on producing an
input that is more likely to trigger a vulnerability.
In this paper, we tackle another way to improve the performance
of fuzzing, which is to shorten the execution time of each itera-
tion. We observe that AFL, a state-of-the-art fuzzer, slows down by
24× because of file system contention and the scalability of fork()
system call when it runs on 120 cores in parallel. Other fuzzers
are expected to suffer from the same scalability bottlenecks in that
they follow a similar design pattern. To improve the fuzzing perfor-
mance, we design and implement three new operating primitives
specialized for fuzzing that solve these performance bottlenecks
and achieve scalable performance on multi-core machines. Our
experiment shows that the proposed primitives speed up AFL and
LibFuzzer by 6.1 to 28.9× and 1.1 to 735.7×, respectively, on the
overall number of executions per second when targeting Google’s
fuzzer test suite with 120 cores. In addition, the primitives improve
AFL’s throughput up to 7.7× with 30 cores, which is a more common
setting in data centers. Our fuzzer-agnostic primitives can be easily
applied to any fuzzer with fundamental performance improvement
and directly benefit large-scale fuzzing and cloud-based fuzzing
services.
CCS CONCEPTS
• Security and privacy → Vulnerability scanners; • Software
and its engineering → Software testing and debugging;
KEYWORDS
fuzzing; scalability; operating system
1...

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


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

Output:
安全论文分析：

title:Scalable proximity estimation and link prediction in online social
networks
author:Han Hee Song and
Tae Won Cho and
Vacha Dave and
Yin Zhang and
Lili Qiu
Scalable Proximity Estimation and Link Prediction in
Online Social Networks
Han Hee Song Tae Won Cho Vacha Dave Yin Zhang
Lili Qiu
The University of Texas at Austin
{hhsong, khatz, vacha, yzhang, lili}@cs.utexas.edu
ABSTRACT
Proximity measures quantify the closeness or similarity between
nodes in a social network and form the basis of a range of appli-
cations in social sciences, business, information technology, com-
puter networks, and cyber security.
It is challenging to estimate
proximity measures in online social networks due to their massive
scale (with millions of users) and dynamic nature (with hundreds
of thousands of new nodes and millions of edges added daily). To
address this challenge, we develop two novel methods to efﬁciently
and accurately approximate a large family of proximity measures.
We also propose a novel incremental update algorithm to enable
near real-time proximity estimation in highly dynamic social net-
works. Evaluation based on a large amount of real data collected
in ﬁve popular online social networks shows that our methods are
accurate and can easily scale to networks with millions of nodes.
To demonstrate the practical values of our techniques, we con-
link pre-
sider a signiﬁcant application of proximity estimation:
diction, i.e., predicting which new edges will be added in the near
future based on past snapshots of a social network. Our results re-
veal that (i) the effectiveness of different proximity measures for
link prediction varies signiﬁcantly across different online social
networks and depends heavily on the fraction of edges contributed
by the highest degree nodes, and (ii) combining multiple proximity
measures consistently yields the best link prediction accuracy.
Categories and Subject Descriptors
H.3.5 [Information Storage and Retrieval]: Online Information
Servi...


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

Input:
title:Scalable proximity estimation and link prediction in online social
networks
author:Han Hee Song and
Tae Won Cho and
Vacha Dave and
Yin Zhang and
Lili Qiu
Scalable Proximity Estimation and Link Prediction in
Online Social Networks
Han Hee Song Tae Won Cho Vacha Dave Yin Zhang
Lili Qiu
The University of Texas at Austin
{hhsong, khatz, vacha, yzhang, lili}@cs.utexas.edu
ABSTRACT
Proximity measures quantify the closeness or similarity between
nodes in a social network and form the basis of a range of appli-
cations in social sciences, business, information technology, com-
puter networks, and cyber security.
It is challenging to estimate
proximity measures in online social networks due to their massive
scale (with millions of users) and dynamic nature (with hundreds
of thousands of new nodes and millions of edges added daily). To
address this challenge, we develop two novel methods to efﬁciently
and accurately approximate a large family of proximity measures.
We also propose a novel incremental update algorithm to enable
near real-time proximity estimation in highly dynamic social net-
works. Evaluation based on a large amount of real data collected
in ﬁve popular online social networks shows that our methods are
accurate and can easily scale to networks with millions of nodes.
To demonstrate the practical values of our techniques, we con-
link pre-
sider a signiﬁcant application of proximity estimation:
diction, i.e., predicting which new edges will be added in the near
future based on past snapshots of a social network. Our results re-
veal that (i) the effectiveness of different proximity measures for
link prediction varies signiﬁcantly across different online social
networks and depends heavily on the fraction of edges contributed
by the highest degree nodes, and (ii) combining multiple proximity
measures consistently yields the best link prediction accuracy.
Categories and Subject Descriptors
H.3.5 [Information Storage and Retrieval]: Online Information
Servi...

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


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

Output:
安全论文分析：

title:Be Selfish and Avoid Dilemmas: Fork After Withholding (FAW) Attacks
on Bitcoin
author:Yujin Kwon and
Dohyun Kim and
Yunmok Son and
Eugene Y. Vasserman and
Yongdae Kim
Be Selfish and Avoid Dilemmas:
Fork A(cid:129)er Withholding (FAW) A(cid:130)acks on Bitcoin
Yujin Kwon
Yunmok Son
Dohyun Kim
KAIST
dbwls8724@kaist.ac.kr
KAIST
dohyunjk@kaist.ac.kr
KAIST
yunmok00@kaist.ac.kr
7
1
0
2
g
u
A
1
3
]
R
C
.
s
c
[
1
v
0
9
7
9
0
.
8
0
7
1
:
v
i
X
r
a
Eugene Vasserman
Kansas State University
eyv@ksu.edu
ABSTRACT
In the Bitcoin system, participants are rewarded for solving cryp-
tographic puzzles. In order to receive more consistent rewards
over time, some participants organize mining pools and split the
rewards from the pool in proportion to each participant’s contribu-
tion. However, several a(cid:138)acks threaten the ability to participate in
pools. (cid:140)e block withholding (BWH) a(cid:138)ack makes the pool reward
system unfair by le(cid:138)ing malicious participants receive unearned
wages while only pretending to contribute work. When two pools
launch BWH a(cid:138)acks against each other, they encounter the miner’s
dilemma: in a Nash equilibrium, the revenue of both pools is di-
minished. In another a(cid:138)ack called sel(cid:128)sh mining, an a(cid:138)acker can
unfairly earn extra rewards by deliberately generating forks.
In this paper, we propose a novel a(cid:138)ack called a fork a(cid:135)er with-
holding (FAW) a(cid:138)ack. FAW is not just another a(cid:138)ack. (cid:140)e reward
for an FAW a(cid:138)acker is always equal to or greater than that for a BWH
a(cid:136)acker, and it is usable up to four times more o(cid:137)en per pool than
in BWH a(cid:138)ack. When considering multiple pools — the current
state of the Bitcoin network – the extra reward for an FAW a(cid:138)ack
is about 56% more than that for a BWH a(cid:138)ack. Furthermore, when
two pools execute FAW a(cid:138)acks on each other, the miner’s dilemma
may not hold: under certain circumsta...


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

Input:
title:Be Selfish and Avoid Dilemmas: Fork After Withholding (FAW) Attacks
on Bitcoin
author:Yujin Kwon and
Dohyun Kim and
Yunmok Son and
Eugene Y. Vasserman and
Yongdae Kim
Be Selfish and Avoid Dilemmas:
Fork A(cid:129)er Withholding (FAW) A(cid:130)acks on Bitcoin
Yujin Kwon
Yunmok Son
Dohyun Kim
KAIST
dbwls8724@kaist.ac.kr
KAIST
dohyunjk@kaist.ac.kr
KAIST
yunmok00@kaist.ac.kr
7
1
0
2
g
u
A
1
3
]
R
C
.
s
c
[
1
v
0
9
7
9
0
.
8
0
7
1
:
v
i
X
r
a
Eugene Vasserman
Kansas State University
eyv@ksu.edu
ABSTRACT
In the Bitcoin system, participants are rewarded for solving cryp-
tographic puzzles. In order to receive more consistent rewards
over time, some participants organize mining pools and split the
rewards from the pool in proportion to each participant’s contribu-
tion. However, several a(cid:138)acks threaten the ability to participate in
pools. (cid:140)e block withholding (BWH) a(cid:138)ack makes the pool reward
system unfair by le(cid:138)ing malicious participants receive unearned
wages while only pretending to contribute work. When two pools
launch BWH a(cid:138)acks against each other, they encounter the miner’s
dilemma: in a Nash equilibrium, the revenue of both pools is di-
minished. In another a(cid:138)ack called sel(cid:128)sh mining, an a(cid:138)acker can
unfairly earn extra rewards by deliberately generating forks.
In this paper, we propose a novel a(cid:138)ack called a fork a(cid:135)er with-
holding (FAW) a(cid:138)ack. FAW is not just another a(cid:138)ack. (cid:140)e reward
for an FAW a(cid:138)acker is always equal to or greater than that for a BWH
a(cid:136)acker, and it is usable up to four times more o(cid:137)en per pool than
in BWH a(cid:138)ack. When considering multiple pools — the current
state of the Bitcoin network – the extra reward for an FAW a(cid:138)ack
is about 56% more than that for a BWH a(cid:138)ack. Furthermore, when
two pools execute FAW a(cid:138)acks on each other, the miner’s dilemma
may not hold: under certain circumsta...

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


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

Output:
安全论文分析：

title:Taking a long look at QUIC: an approach for rigorous evaluation
of rapidly evolving transport protocols
author:Arash Molavi Kakhki and
Samuel Jero and
David R. Choffnes and
Cristina Nita-Rotaru and
Alan Mislove
Taking a Long Look at QUIC
An Approach for Rigorous Evaluation of Rapidly Evolving Transport Protocols
Arash Molavi Kakhki
Northeastern University
arash@ccs.neu.edu
Samuel Jero
Purdue University
sjero@purdue.edu
David Choffnes
Northeastern University
choffnes@ccs.neu.edu
Cristina Nita-Rotaru
Northeastern University
c.nitarotaru@neu.edu
Alan Mislove
Northeastern University
amislove@ccs.neu.edu
ABSTRACT
Google’s QUIC protocol, which implements TCP-like properties at
the application layer atop a UDP transport, is now used by the vast
majority of Chrome clients accessing Google properties but has
no formal state machine specification, limited analysis, and ad-hoc
evaluations based on snapshots of the protocol implementation in
a small number of environments. Further frustrating attempts to
evaluate QUIC is the fact that the protocol is under rapid develop-
ment, with extensive rewriting of the protocol occurring over the
scale of months, making individual studies of the protocol obsolete
before publication.
Given this unique scenario, there is a need for alternative tech-
niques for understanding and evaluating QUIC when compared
with previous transport-layer protocols. First, we develop an ap-
proach that allows us to conduct analysis across multiple versions
of QUIC to understand how code changes impact protocol effec-
tiveness. Next, we instrument the source code to infer QUIC’s state
machine from execution traces. With this model, we run QUIC in
a large number of environments that include desktop and mobile,
wired and wireless environments and use the state machine to
understand differences in transport- and application-layer perfor-
mance across multiple versions of QUIC and in different environ-
ments. QUIC generally outperforms TCP, but we also ident...


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

Input:
title:Taking a long look at QUIC: an approach for rigorous evaluation
of rapidly evolving transport protocols
author:Arash Molavi Kakhki and
Samuel Jero and
David R. Choffnes and
Cristina Nita-Rotaru and
Alan Mislove
Taking a Long Look at QUIC
An Approach for Rigorous Evaluation of Rapidly Evolving Transport Protocols
Arash Molavi Kakhki
Northeastern University
arash@ccs.neu.edu
Samuel Jero
Purdue University
sjero@purdue.edu
David Choffnes
Northeastern University
choffnes@ccs.neu.edu
Cristina Nita-Rotaru
Northeastern University
c.nitarotaru@neu.edu
Alan Mislove
Northeastern University
amislove@ccs.neu.edu
ABSTRACT
Google’s QUIC protocol, which implements TCP-like properties at
the application layer atop a UDP transport, is now used by the vast
majority of Chrome clients accessing Google properties but has
no formal state machine specification, limited analysis, and ad-hoc
evaluations based on snapshots of the protocol implementation in
a small number of environments. Further frustrating attempts to
evaluate QUIC is the fact that the protocol is under rapid develop-
ment, with extensive rewriting of the protocol occurring over the
scale of months, making individual studies of the protocol obsolete
before publication.
Given this unique scenario, there is a need for alternative tech-
niques for understanding and evaluating QUIC when compared
with previous transport-layer protocols. First, we develop an ap-
proach that allows us to conduct analysis across multiple versions
of QUIC to understand how code changes impact protocol effec-
tiveness. Next, we instrument the source code to infer QUIC’s state
machine from execution traces. With this model, we run QUIC in
a large number of environments that include desktop and mobile,
wired and wireless environments and use the state machine to
understand differences in transport- and application-layer perfor-
mance across multiple versions of QUIC and in different environ-
ments. QUIC generally outperforms TCP, but we also ident...

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


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

Output:
安全论文分析：

title:Exploring usability effects of increasing security in click-based
graphical passwords
author:Elizabeth Stobert and
Alain Forget and
Sonia Chiasson and
Paul C. van Oorschot and
Robert Biddle
Exploring Usability Effects of Increasing Security
in Click-based Graphical Passwords
Elizabeth Stobert, Alain Forget, Sonia Chiasson,
P.C. van Oorschot, Robert Biddle
Carleton University, Ottawa, Canada
estobert@connect.carleton.ca, aforget@scs.carleton.ca, chiasson@scs.carleton.ca,
paulv@scs.carleton.ca, robert_biddle@carleton.ca
ABSTRACT
Graphical passwords have been proposed to address known
problems with traditional text passwords. For example,
memorable user-chosen text passwords are predictable, but
random system-assigned passwords are diﬃcult to remem-
ber. We explore the usability eﬀects of modifying system
parameters to increase the security of a click-based graphi-
cal password system. Generally, usability tests for graphical
passwords have used conﬁgurations resulting in password
spaces smaller than that of common text passwords. Our
two-part lab study compares the eﬀects of varying the num-
ber of click-points and the image size, including when diﬀer-
ent conﬁgurations provide comparable password spaces. For
comparable spaces, no usability advantage was evident be-
tween more click-points, or a larger image. This is contrary
to our expectation that larger image size (with fewer click-
points) might oﬀer usability advantages over more click-
points (with correspondingly smaller images). The results
suggest promising opportunities for better matching graph-
ical password system conﬁgurations to device constraints,
or capabilities of individual users, without degrading usabil-
ity. For example, more click-points could be used on smart-
phone displays where larger image sizes are not possible.
1.
INTRODUCTION
The problems of knowledge-based authentication, typi-
cally text-based passwords, are well known. Users often
create memorable passwords that are easy for att...


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

Input:
title:Exploring usability effects of increasing security in click-based
graphical passwords
author:Elizabeth Stobert and
Alain Forget and
Sonia Chiasson and
Paul C. van Oorschot and
Robert Biddle
Exploring Usability Effects of Increasing Security
in Click-based Graphical Passwords
Elizabeth Stobert, Alain Forget, Sonia Chiasson,
P.C. van Oorschot, Robert Biddle
Carleton University, Ottawa, Canada
estobert@connect.carleton.ca, aforget@scs.carleton.ca, chiasson@scs.carleton.ca,
paulv@scs.carleton.ca, robert_biddle@carleton.ca
ABSTRACT
Graphical passwords have been proposed to address known
problems with traditional text passwords. For example,
memorable user-chosen text passwords are predictable, but
random system-assigned passwords are diﬃcult to remem-
ber. We explore the usability eﬀects of modifying system
parameters to increase the security of a click-based graphi-
cal password system. Generally, usability tests for graphical
passwords have used conﬁgurations resulting in password
spaces smaller than that of common text passwords. Our
two-part lab study compares the eﬀects of varying the num-
ber of click-points and the image size, including when diﬀer-
ent conﬁgurations provide comparable password spaces. For
comparable spaces, no usability advantage was evident be-
tween more click-points, or a larger image. This is contrary
to our expectation that larger image size (with fewer click-
points) might oﬀer usability advantages over more click-
points (with correspondingly smaller images). The results
suggest promising opportunities for better matching graph-
ical password system conﬁgurations to device constraints,
or capabilities of individual users, without degrading usabil-
ity. For example, more click-points could be used on smart-
phone displays where larger image sizes are not possible.
1.
INTRODUCTION
The problems of knowledge-based authentication, typi-
cally text-based passwords, are well known. Users often
create memorable passwords that are easy for att...

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


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

Output:
安全论文分析：

title:Second Workshop on Cyber-Physical Systems Security and PrivaCy (CPS-SPC'16)
author:Alvaro A. C'ardenas and
Rakesh B. Bobba
Second Workshop on Cyber-Physical Systems Security
and PrivaCy (CPS-SPC’16)
Alvaro A. Cárdenas
University of Texas at Dallas
alvaro.cardenas@utdallas.edu
ABSTRACT
The Second International Workshop on Cyber-Physical Sys-
tems Security and PrivaCy (CPS-SPC’16) is being held in
conjunction with the 23rd ACM CCS Conference. This sec-
ond edition follows a successful workshop held with ACM
CCS in 2015. The workshop was motivated by several ob-
servations. First, cyber-physical systems represent the new
frontier for cyber risk. The attack surface imposed by the
convergence of computing, communications and physical con-
trol represents unique challenges for security researchers and
practitioners. Second, majority of the published literature
addressing the security and privacy of CPS reﬂect a ﬁeld
still in its infancy. As such, the overall principles, mod-
els, and theories for securing CPS have not yet emerged.
Third, the organizers of this workshop strongly felt that a
premiere forum associated with a premiere conference was
needed for rapidly publishing diverse, multidisciplinary in-
progress work on the security and privacy of CPS and galva-
nizing the research community. The set of accepted papers
reﬂect this vision. We have organized an exciting program
for this workshop and look forward to active participation
in this and future workshops.
Keywords
Cyber-Physical Systems, Security, Privacy, Safety, Reliabil-
ity
1.
INTRODUCTION
Cyber-physical systems (CPS) integrate computing and
communication capabilities with monitoring and control of
entities in the physical world. These systems are usually
composed by a set of networked agents, including sensors,
actuators, control processing units, and communication de-
vices. While some forms of CPS are already in use, the
widespread growth of wireless embedded sensors and ac-
tuators is creating...


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

Input:
title:Second Workshop on Cyber-Physical Systems Security and PrivaCy (CPS-SPC'16)
author:Alvaro A. C'ardenas and
Rakesh B. Bobba
Second Workshop on Cyber-Physical Systems Security
and PrivaCy (CPS-SPC’16)
Alvaro A. Cárdenas
University of Texas at Dallas
alvaro.cardenas@utdallas.edu
ABSTRACT
The Second International Workshop on Cyber-Physical Sys-
tems Security and PrivaCy (CPS-SPC’16) is being held in
conjunction with the 23rd ACM CCS Conference. This sec-
ond edition follows a successful workshop held with ACM
CCS in 2015. The workshop was motivated by several ob-
servations. First, cyber-physical systems represent the new
frontier for cyber risk. The attack surface imposed by the
convergence of computing, communications and physical con-
trol represents unique challenges for security researchers and
practitioners. Second, majority of the published literature
addressing the security and privacy of CPS reﬂect a ﬁeld
still in its infancy. As such, the overall principles, mod-
els, and theories for securing CPS have not yet emerged.
Third, the organizers of this workshop strongly felt that a
premiere forum associated with a premiere conference was
needed for rapidly publishing diverse, multidisciplinary in-
progress work on the security and privacy of CPS and galva-
nizing the research community. The set of accepted papers
reﬂect this vision. We have organized an exciting program
for this workshop and look forward to active participation
in this and future workshops.
Keywords
Cyber-Physical Systems, Security, Privacy, Safety, Reliabil-
ity
1.
INTRODUCTION
Cyber-physical systems (CPS) integrate computing and
communication capabilities with monitoring and control of
entities in the physical world. These systems are usually
composed by a set of networked agents, including sensors,
actuators, control processing units, and communication de-
vices. While some forms of CPS are already in use, the
widespread growth of wireless embedded sensors and ac-
tuators is creating...

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


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

Output:
安全论文分析：

title:Obfuscation Revealed: Leveraging Electromagnetic Signals for Obfuscated
Malware Classification
author:Duy-Phuc Pham and
Damien Marion and
Matthieu Mastio and
Annelie Heuser
Obfuscation Revealed: Leveraging
Electromagnetic Signals for Obfuscated
Malware Classification
Duy-Phuc Pham
duy-phuc.pham@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
Mathieu Mastio
matthieu.mastio@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
Damien Marion
damien.marion@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
Annelie Heuser
annelie.heuser@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
ABSTRACT
The Internet of Things (IoT) is constituted of devices that are expo-
nentially growing in number and in complexity. They use numerous
customized firmware and hardware, without taking into considera-
tion security issues, which make them a target for cybercriminals,
especially malware authors.
We will present a novel approach of using side channel informa-
tion to identify the kinds of threats that are targeting the device.
Using our approach, a malware analyst is able to obtain precise
knowledge about malware type and identity, even in the presence
of obfuscation techniques which may prevent static or symbolic
binary analysis. We recorded 100,000 measurement traces from an
IoT device infected by various in-the-wild malware samples and
realistic benign activity. Our method does not require any modifi-
cation on the target device. Thus, it can be deployed independently
from the resources available without any overhead. Moreover, our
approach has the advantage that it can hardly be detected and
evaded by the malware authors. In our experiments, we were able
to predict three generic malware types (and one benign class) with
an accuracy of 99.82%. Even more, our results show that we are able
to classify altered malware samples with unseen obfuscation tech-
niques during the training phase, and to determine what kind of
obfuscations were applied to the binary...


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

Input:
title:Obfuscation Revealed: Leveraging Electromagnetic Signals for Obfuscated
Malware Classification
author:Duy-Phuc Pham and
Damien Marion and
Matthieu Mastio and
Annelie Heuser
Obfuscation Revealed: Leveraging
Electromagnetic Signals for Obfuscated
Malware Classification
Duy-Phuc Pham
duy-phuc.pham@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
Mathieu Mastio
matthieu.mastio@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
Damien Marion
damien.marion@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
Annelie Heuser
annelie.heuser@irisa.fr
Univ Rennes, CNRS, Inria, IRISA
Rennes, France
ABSTRACT
The Internet of Things (IoT) is constituted of devices that are expo-
nentially growing in number and in complexity. They use numerous
customized firmware and hardware, without taking into considera-
tion security issues, which make them a target for cybercriminals,
especially malware authors.
We will present a novel approach of using side channel informa-
tion to identify the kinds of threats that are targeting the device.
Using our approach, a malware analyst is able to obtain precise
knowledge about malware type and identity, even in the presence
of obfuscation techniques which may prevent static or symbolic
binary analysis. We recorded 100,000 measurement traces from an
IoT device infected by various in-the-wild malware samples and
realistic benign activity. Our method does not require any modifi-
cation on the target device. Thus, it can be deployed independently
from the resources available without any overhead. Moreover, our
approach has the advantage that it can hardly be detected and
evaded by the malware authors. In our experiments, we were able
to predict three generic malware types (and one benign class) with
an accuracy of 99.82%. Even more, our results show that we are able
to classify altered malware samples with unseen obfuscation tech-
niques during the training phase, and to determine what kind of
obfuscations were applied to the binary...

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


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

Output:
安全论文分析：

title:Secure Bilinear Pairing Outsourcing Made More Efficient and Flexible
author:Haibo Tian and
Fangguo Zhang and
Kui Ren
SCIENCE CHINA
Information Sciences
. LETTER .
March 2018, Vol. 61 039104:1–039104:3
doi: 10.1007/s11432-017-9161-2
Eﬃcient and secure outsourcing of bilinear pairings
with single server
Min DONG & Yanli REN*
School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China
Received 13 April 2017/Accepted 21 June 2017/Published online 13 September 2017
Citation
Dong M, Ren Y L. Eﬃcient and secure outsourcing of bilinear pairings with single server. Sci China
Inf Sci, 2018, 61(3): 039104, doi: 10.1007/s11432-017-9161-2
Dear editor,
Cloud computing is playing important role at the
era of big data, and its availability makes out-
sourcing computations possible [1]. By outsourc-
ing computations, mobile devices with weak com-
putational ability can outsource complex opera-
tions to powerful cloud servers so that the time
cost can be greatly reduced [2]. Despite of unique
advantages, there are also some security challenges
we need pay attention to.
• Secrecy. The data that resource-limited client
outsources may contain some sensitive informa-
tion, so it should be encrypted before outsourcing.
• Veriﬁability. The cloud servers are not fully
trusted and they may work maliciously, and there-
fore the outsourcer should have the ability of ver-
ifying the results returned from the servers.
• Eﬃciency. When we ensure the secrecy and
veriﬁability of outsourcing computation, we should
also make sure that the process of encrypting and
verifying is not involved in any expensive compu-
tation so that the outsourcing scheme is practical.
In the cryptographic community, there were
many researchers tried to outsource expensive
computation to untrusted cloud server [3–5].
Moreover, plenty of researches have been done
to enhance the eﬃciency of carrying out bilin-
ear pairing. Chevallier et al. [6] ﬁrst proposed
an algorithm for outsou...


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

Input:
title:Secure Bilinear Pairing Outsourcing Made More Efficient and Flexible
author:Haibo Tian and
Fangguo Zhang and
Kui Ren
SCIENCE CHINA
Information Sciences
. LETTER .
March 2018, Vol. 61 039104:1–039104:3
doi: 10.1007/s11432-017-9161-2
Eﬃcient and secure outsourcing of bilinear pairings
with single server
Min DONG & Yanli REN*
School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China
Received 13 April 2017/Accepted 21 June 2017/Published online 13 September 2017
Citation
Dong M, Ren Y L. Eﬃcient and secure outsourcing of bilinear pairings with single server. Sci China
Inf Sci, 2018, 61(3): 039104, doi: 10.1007/s11432-017-9161-2
Dear editor,
Cloud computing is playing important role at the
era of big data, and its availability makes out-
sourcing computations possible [1]. By outsourc-
ing computations, mobile devices with weak com-
putational ability can outsource complex opera-
tions to powerful cloud servers so that the time
cost can be greatly reduced [2]. Despite of unique
advantages, there are also some security challenges
we need pay attention to.
• Secrecy. The data that resource-limited client
outsources may contain some sensitive informa-
tion, so it should be encrypted before outsourcing.
• Veriﬁability. The cloud servers are not fully
trusted and they may work maliciously, and there-
fore the outsourcer should have the ability of ver-
ifying the results returned from the servers.
• Eﬃciency. When we ensure the secrecy and
veriﬁability of outsourcing computation, we should
also make sure that the process of encrypting and
verifying is not involved in any expensive compu-
tation so that the outsourcing scheme is practical.
In the cryptographic community, there were
many researchers tried to outsource expensive
computation to untrusted cloud server [3–5].
Moreover, plenty of researches have been done
to enhance the eﬃciency of carrying out bilin-
ear pairing. Chevallier et al. [6] ﬁrst proposed
an algorithm for outsou...

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


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

Output:
安全论文分析：

title:CT-GAN: Malicious Tampering of 3D Medical Imagery using Deep Learning
author:Yisroel Mirsky and
Tom Mahler and
Ilan Shelef and
Yuval Elovici
CT-GAN: Malicious Tampering of
3D Medical Imagery using Deep Learning
Yisroel Mirsky and Tom Mahler, Ben-Gurion University; Ilan Shelef,
Soroka University Medical Center; Yuval Elovici, Ben-Gurion University
https://www.usenix.org/conference/usenixsecurity19/presentation/mirsky
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.CT-GAN: Malicious Tampering of 3D Medical Imagery using Deep Learning
Yisroel Mirsky1, Tom Mahler1, Ilan Shelef2, and Yuval Elovici1
1Department of Information Systems Engineering, Ben-Gurion University, Israel
2Soroka University Medical Center, Beer-Sheva, Israel
yisroel@post.bgu.ac.il, mahlert@post.bgu.ac.il, shelef@bgu.ac.il, and elovici@bgu.ac.il
Abstract
In 2018, clinics and hospitals were hit with numerous attacks
leading to signiﬁcant data breaches and interruptions in
medical services. An attacker with access to medical records
can do much more than hold the data for ransom or sell it on
the black market.
In this paper, we show how an attacker can use deep-
learning to add or remove evidence of medical conditions
from volumetric (3D) medical scans. An attacker may perform
this act in order to stop a political candidate, sabotage research,
commit insurance fraud, perform an act of terrorism, or
even commit murder. We implement the attack using a 3D
conditional GAN and show how the framework (CT-GAN)
can be automated. Although the body is complex and 3D
medical scans are very large, CT-GAN achieves realistic
results which can be executed in milliseconds.
To evaluate the attack, we focused on injecting and
removing lung cancer from CT scans. We show how three
expert radiologists and a state-of-the-art deep learning...


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

Input:
title:CT-GAN: Malicious Tampering of 3D Medical Imagery using Deep Learning
author:Yisroel Mirsky and
Tom Mahler and
Ilan Shelef and
Yuval Elovici
CT-GAN: Malicious Tampering of
3D Medical Imagery using Deep Learning
Yisroel Mirsky and Tom Mahler, Ben-Gurion University; Ilan Shelef,
Soroka University Medical Center; Yuval Elovici, Ben-Gurion University
https://www.usenix.org/conference/usenixsecurity19/presentation/mirsky
This paper is included in the Proceedings of the 28th USENIX Security Symposium.August 14–16, 2019 • Santa Clara, CA, USA978-1-939133-06-9Open access to the Proceedings of the 28th USENIX Security Symposium is sponsored by USENIX.CT-GAN: Malicious Tampering of 3D Medical Imagery using Deep Learning
Yisroel Mirsky1, Tom Mahler1, Ilan Shelef2, and Yuval Elovici1
1Department of Information Systems Engineering, Ben-Gurion University, Israel
2Soroka University Medical Center, Beer-Sheva, Israel
yisroel@post.bgu.ac.il, mahlert@post.bgu.ac.il, shelef@bgu.ac.il, and elovici@bgu.ac.il
Abstract
In 2018, clinics and hospitals were hit with numerous attacks
leading to signiﬁcant data breaches and interruptions in
medical services. An attacker with access to medical records
can do much more than hold the data for ransom or sell it on
the black market.
In this paper, we show how an attacker can use deep-
learning to add or remove evidence of medical conditions
from volumetric (3D) medical scans. An attacker may perform
this act in order to stop a political candidate, sabotage research,
commit insurance fraud, perform an act of terrorism, or
even commit murder. We implement the attack using a 3D
conditional GAN and show how the framework (CT-GAN)
can be automated. Although the body is complex and 3D
medical scans are very large, CT-GAN achieves realistic
results which can be executed in milliseconds.
To evaluate the attack, we focused on injecting and
removing lung cancer from CT scans. We show how three
expert radiologists and a state-of-the-art deep learning...

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


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

Output:
安全论文分析：

title:Blacksheep: detecting compromised hosts in homogeneous crowds
author:Antonio Bianchi and
Yan Shoshitaishvili and
Christopher Kruegel and
Giovanni Vigna
Blacksheep: Detecting Compromised Hosts in
Homogeneous Crowds
Antonio Bianchi, Yan Shoshitaishvili, Christopher Kruegel, Giovanni Vigna
{antoniob,yans,chris,vigna}@cs.ucsb.edu
UC Santa Barbara
Santa Barbara, CA, USA
ABSTRACT
The lucrative rewards of security penetrations into large organi-
zations have motivated the development and use of many sophis-
ticated rootkit techniques to maintain an attacker’s presence on a
compromised system. Due to the evasive nature of such infections,
detecting these rootkit infestations is a problem facing modern or-
ganizations. While many approaches to this problem have been
proposed, various drawbacks that range from signature generation
issues, to coverage, to performance, prevent these approaches from
being ideal solutions.
In this paper, we present Blacksheep, a distributed system for
detecting a rootkit infestation among groups of similar machines.
This approach was motivated by the homogenous natures of many
corporate networks. Taking advantage of the similarity amongst
the machines that it analyses, Blacksheep is able to efﬁciently and
effectively detect both existing and new infestations by comparing
the memory dumps collected from each host.
We evaluate Blacksheep on two sets of memory dumps. One
set is taken from virtual machines using virtual machine introspec-
tion, mimicking the deployment of Blacksheep on a cloud comput-
ing provider’s network. The other set is taken from Windows XP
machines via a memory acquisition driver, demonstrating Black-
sheep’s usage under more challenging image acquisition condi-
tions. The results of the evaluation show that by leveraging the
homogeneous nature of groups of computers, it is possible to de-
tect rootkit infestations.
Categories and Subject Descriptors
K.6.5 [Security and Protection]: Invasive software
Keywords
computer se...


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

Input:
title:Blacksheep: detecting compromised hosts in homogeneous crowds
author:Antonio Bianchi and
Yan Shoshitaishvili and
Christopher Kruegel and
Giovanni Vigna
Blacksheep: Detecting Compromised Hosts in
Homogeneous Crowds
Antonio Bianchi, Yan Shoshitaishvili, Christopher Kruegel, Giovanni Vigna
{antoniob,yans,chris,vigna}@cs.ucsb.edu
UC Santa Barbara
Santa Barbara, CA, USA
ABSTRACT
The lucrative rewards of security penetrations into large organi-
zations have motivated the development and use of many sophis-
ticated rootkit techniques to maintain an attacker’s presence on a
compromised system. Due to the evasive nature of such infections,
detecting these rootkit infestations is a problem facing modern or-
ganizations. While many approaches to this problem have been
proposed, various drawbacks that range from signature generation
issues, to coverage, to performance, prevent these approaches from
being ideal solutions.
In this paper, we present Blacksheep, a distributed system for
detecting a rootkit infestation among groups of similar machines.
This approach was motivated by the homogenous natures of many
corporate networks. Taking advantage of the similarity amongst
the machines that it analyses, Blacksheep is able to efﬁciently and
effectively detect both existing and new infestations by comparing
the memory dumps collected from each host.
We evaluate Blacksheep on two sets of memory dumps. One
set is taken from virtual machines using virtual machine introspec-
tion, mimicking the deployment of Blacksheep on a cloud comput-
ing provider’s network. The other set is taken from Windows XP
machines via a memory acquisition driver, demonstrating Black-
sheep’s usage under more challenging image acquisition condi-
tions. The results of the evaluation show that by leveraging the
homogeneous nature of groups of computers, it is possible to de-
tect rootkit infestations.
Categories and Subject Descriptors
K.6.5 [Security and Protection]: Invasive software
Keywords
computer se...

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


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

Output:
安全论文分析：

title:Measurement of loss pairs in network paths
author:Edmond W. W. Chan and
Xiapu Luo and
Weichao Li and
Waiting W. T. Fok and
Rocky K. C. Chang
Measurement of Loss Pairs in Network Paths
Edmond W. W. Chan‡, Xiapu Luo§, Weichao Li‡, Waiting W. T. Fok‡, and Rocky K. C. Chang‡
Department of Computing‡
The Hong Kong Polytechnic University
College of Computing§
Georgia Institute of Technology
{cswwchan|csweicli|cswtfok|csrchang}@comp.polyu.edu.hk
csxpluo@cc.gatech.edu
ABSTRACT
Loss-pair measurement was proposed a decade ago for dis-
covering network path properties, such as a router’s buﬀer
size. A packet pair is regarded as a loss pair if exactly one
packet is lost. Therefore, the residual packet’s delay can be
used to infer the lost packet’s delay. Despite this unique
advantage shared by no other methods, no loss-pair mea-
surement in actual networks has ever been reported. In this
paper, we further develop the loss-pair measurement and
make the following contributions. First, we characterize the
residual packet’s delay by including other important factors
(such as the impact of the ﬁrst packet in the pair) which
were ignored before. Second, we employ a novel TCP-based
probing method to measure from a single endpoint all four
possible loss pairs for a round-trip network path. Third,
we conducted loss-pair measurement for 88 round-trip paths
continuously for almost three weeks. Being the ﬁrst set of
loss-pair measurement, we obtained a number of original
results, such as prevalence of loss pairs, distribution of dif-
ferent types of loss pairs, and eﬀect of route change on the
paths’ congestion state.
Categories and Subject Descriptors
C.2.3 [Computer-Communication Networks]: Network
Operations; C.4 [Performance of Systems]: Measure-
ment Techniques
General Terms
Experimentation, Measurement, Performance
Keywords
Loss pair, Packet pair, Non-cooperative, Delay
1.
INTRODUCTION
Packet loss behavior in network paths has been exten-
sively studied for the last twenty year...


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

Input:
title:Measurement of loss pairs in network paths
author:Edmond W. W. Chan and
Xiapu Luo and
Weichao Li and
Waiting W. T. Fok and
Rocky K. C. Chang
Measurement of Loss Pairs in Network Paths
Edmond W. W. Chan‡, Xiapu Luo§, Weichao Li‡, Waiting W. T. Fok‡, and Rocky K. C. Chang‡
Department of Computing‡
The Hong Kong Polytechnic University
College of Computing§
Georgia Institute of Technology
{cswwchan|csweicli|cswtfok|csrchang}@comp.polyu.edu.hk
csxpluo@cc.gatech.edu
ABSTRACT
Loss-pair measurement was proposed a decade ago for dis-
covering network path properties, such as a router’s buﬀer
size. A packet pair is regarded as a loss pair if exactly one
packet is lost. Therefore, the residual packet’s delay can be
used to infer the lost packet’s delay. Despite this unique
advantage shared by no other methods, no loss-pair mea-
surement in actual networks has ever been reported. In this
paper, we further develop the loss-pair measurement and
make the following contributions. First, we characterize the
residual packet’s delay by including other important factors
(such as the impact of the ﬁrst packet in the pair) which
were ignored before. Second, we employ a novel TCP-based
probing method to measure from a single endpoint all four
possible loss pairs for a round-trip network path. Third,
we conducted loss-pair measurement for 88 round-trip paths
continuously for almost three weeks. Being the ﬁrst set of
loss-pair measurement, we obtained a number of original
results, such as prevalence of loss pairs, distribution of dif-
ferent types of loss pairs, and eﬀect of route change on the
paths’ congestion state.
Categories and Subject Descriptors
C.2.3 [Computer-Communication Networks]: Network
Operations; C.4 [Performance of Systems]: Measure-
ment Techniques
General Terms
Experimentation, Measurement, Performance
Keywords
Loss pair, Packet pair, Non-cooperative, Delay
1.
INTRODUCTION
Packet loss behavior in network paths has been exten-
sively studied for the last twenty year...

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


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

Output:
安全论文分析：

title:Reliability and Security Monitoring of Virtual Machines Using Hardware
Architectural Invariants
author:Cuong Manh Pham and
Zachary Estrada and
Phuong Cao and
Zbigniew T. Kalbarczyk and
Ravishankar K. Iyer
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Reliability and Security Monitoring of Virtual
Machines Using Hardware Architectural Invariants
Cuong Pham, Zachary Estrada, Phuong Cao, Zbigniew Kalbarczyk, Ravishankar Iyer
University of Illinois at Urbana-Champaign
{pham9, zestrad2, pcao3, kalbarcz, rkiyer}@illinois.edu
Abstract—This paper presents a solution that simultaneously
addresses both reliability and security (RnS) in a monitoring
framework. We identify the commonalities between reliability
and security to guide the design of HyperTap, a hypervisor-level
framework that efﬁciently supports both types of monitoring in
virtualization environments. In HyperTap, the logging of system
events and states is common across monitors and constitutes
the core of the framework. The audit phase of each monitor is
implemented and operated independently. In addition, HyperTap
relies on hardware invariants to provide a strongly isolated root
of trust. HyperTap uses active monitoring, which can be adapted
to enforce a wide spectrum of RnS policies. We validate Hy-
perTap by introducing three example monitors: Guest OS Hang
Detection (GOSHD), Hidden RootKit Detection (HRKD), and
Privilege Escalation Detection (PED). Our experiments with fault
injection and real rootkits/exploits demonstrate that HyperTap
provides robust monitoring with low performance overhead.
I. INTRODUCTION
Reliability and security (RnS) are two essential aspects of
modern highly connected computing system...


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

Input:
title:Reliability and Security Monitoring of Virtual Machines Using Hardware
Architectural Invariants
author:Cuong Manh Pham and
Zachary Estrada and
Phuong Cao and
Zbigniew T. Kalbarczyk and
Ravishankar K. Iyer
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Reliability and Security Monitoring of Virtual
Machines Using Hardware Architectural Invariants
Cuong Pham, Zachary Estrada, Phuong Cao, Zbigniew Kalbarczyk, Ravishankar Iyer
University of Illinois at Urbana-Champaign
{pham9, zestrad2, pcao3, kalbarcz, rkiyer}@illinois.edu
Abstract—This paper presents a solution that simultaneously
addresses both reliability and security (RnS) in a monitoring
framework. We identify the commonalities between reliability
and security to guide the design of HyperTap, a hypervisor-level
framework that efﬁciently supports both types of monitoring in
virtualization environments. In HyperTap, the logging of system
events and states is common across monitors and constitutes
the core of the framework. The audit phase of each monitor is
implemented and operated independently. In addition, HyperTap
relies on hardware invariants to provide a strongly isolated root
of trust. HyperTap uses active monitoring, which can be adapted
to enforce a wide spectrum of RnS policies. We validate Hy-
perTap by introducing three example monitors: Guest OS Hang
Detection (GOSHD), Hidden RootKit Detection (HRKD), and
Privilege Escalation Detection (PED). Our experiments with fault
injection and real rootkits/exploits demonstrate that HyperTap
provides robust monitoring with low performance overhead.
I. INTRODUCTION
Reliability and security (RnS) are two essential aspects of
modern highly connected computing system...

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


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

Output:
安全论文分析：

title:A short anonymously revocable group signature scheme from decision
linear assumption
author:Toru Nakanishi and
Nobuo Funabiki
A Short Anonymously Revocable Group Signature Scheme
from Decision Linear Assumption
Toru Nakanishi
Nobuo Funabiki
Dept. of Communication Network Engineering
Dept. of Communication Network Engineering
Okayama University
Okayama, 700-8530 Japan
nakanisi@cne.okayama-u.ac.jp
Okayama University
Okayama, 700-8530 Japan
funabiki@cne.okayama-u.ac.jp
ABSTRACT
In group signature schemes, a signature is anonymous for
a veriﬁer, while only a designated Privacy Manager (P M )
can identify the signer. This identiﬁcation is used for tracing
a dishonest anonymous signer in case of an illegal act using
the signature. However, P M can violate signers’ anonymity.
Recently, Brickell and Li propose a novel countermeasure
for the anonymous dishonest signer without P M in the set-
ting of the direct anonymous attestation. Here, we call the
generalized group signature version anonymously revocable
group signature scheme. In this scheme, after an illegal act
using a group signature was found, the membership of the
dishonest signer can be anonymously revoked for excluding
the signer without the help of any P M . However, since
the Brickell-Li scheme is based on the RSA assumption and
the DDH assumption, the signature is long. In this paper,
we propose a short anonymously revocable group signature
scheme from supersingular curves, where we adopt the de-
cision linear (DLIN) assumption. Compared to the simple
adoption of the Brickell-Li DDH-based revoking approach to
supersingular curves, the length of our signature is reduced
to about from 30% to 60%.
Categories and Subject Descriptors
D.4.6 [Software]: Security and Protection—Authentication
General Terms
Security, Algorithms
Keywords
Group signature, Anonymity, Revocation
1.
INTRODUCTION
Group signature scheme [5] allows a group member to
anonymously sign a message on behalf of a group, where
the membership of ...


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

Input:
title:A short anonymously revocable group signature scheme from decision
linear assumption
author:Toru Nakanishi and
Nobuo Funabiki
A Short Anonymously Revocable Group Signature Scheme
from Decision Linear Assumption
Toru Nakanishi
Nobuo Funabiki
Dept. of Communication Network Engineering
Dept. of Communication Network Engineering
Okayama University
Okayama, 700-8530 Japan
nakanisi@cne.okayama-u.ac.jp
Okayama University
Okayama, 700-8530 Japan
funabiki@cne.okayama-u.ac.jp
ABSTRACT
In group signature schemes, a signature is anonymous for
a veriﬁer, while only a designated Privacy Manager (P M )
can identify the signer. This identiﬁcation is used for tracing
a dishonest anonymous signer in case of an illegal act using
the signature. However, P M can violate signers’ anonymity.
Recently, Brickell and Li propose a novel countermeasure
for the anonymous dishonest signer without P M in the set-
ting of the direct anonymous attestation. Here, we call the
generalized group signature version anonymously revocable
group signature scheme. In this scheme, after an illegal act
using a group signature was found, the membership of the
dishonest signer can be anonymously revoked for excluding
the signer without the help of any P M . However, since
the Brickell-Li scheme is based on the RSA assumption and
the DDH assumption, the signature is long. In this paper,
we propose a short anonymously revocable group signature
scheme from supersingular curves, where we adopt the de-
cision linear (DLIN) assumption. Compared to the simple
adoption of the Brickell-Li DDH-based revoking approach to
supersingular curves, the length of our signature is reduced
to about from 30% to 60%.
Categories and Subject Descriptors
D.4.6 [Software]: Security and Protection—Authentication
General Terms
Security, Algorithms
Keywords
Group signature, Anonymity, Revocation
1.
INTRODUCTION
Group signature scheme [5] allows a group member to
anonymously sign a message on behalf of a group, where
the membership of ...

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


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

Output:
安全论文分析：

title:Identity-Set-based Broadcast Encryption supporting "Cut-or-Select"
with Short Ciphertext
author:Yan Zhu and
Xin Wang and
Di Ma and
Ruiqi Guo
Identity-Set-based Broadcast Encryption supporting
“Cut-or-Select” with Short Ciphertext
Yan Zhu, Xin Wang
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
zhuyan@ustb.edu.cn
Di Ma
Science,
University of
Computer and Information
Michigan-Dearborn,
Dearborn, MI 48128
dmadma@umich.edu
RuiQi Guo
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
guoruiqi7@163.com
ABSTRACT
In this paper we present an identity-set-based broadcast en-
cryption scheme with three working modes: positive mem-
bership (Select-mode), all member (All-mode), and negative
membership (Cut-mode) over the user identity set, simulta-
neously. The core of our scheme is the implementation of
cryptographic representation of subset by using two aggre-
gation functions: Zeros-based aggregation and Poles-based
aggregation. These two aggregation functions are capable of
compressing any subset into one element in a bilinear map
group for determining the membership between an element
and a subset. Our scheme achieves the optimal bound of
O(1)-size for either ciphertext (consisting of just two ele-
ments) or decryption key (one element) for an identity set
of large size. We prove that our scheme is secure under the
General Diﬃe-Hellman Exponent (GDHE) assumption.
Categories and Subject Descriptors
E.3 [Data Encryption]: Public key cryptosystems; C.2.0
[Computer-Communication Networks]: General—Se-
curity and protection; D.4.6 [Operating Systems]: Secu-
rity and Protection—Cryptographic controls
General Terms
Security, Design, Algorithms, Performance
Keywords
Group-oriented Encryption, Cryptographic Representation
of Subset, Negative Membership, Set Membership, Identity-
Set-based Encryption
1.
INTRODUCTION
Broadcast encryption (BE) ...


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

Input:
title:Identity-Set-based Broadcast Encryption supporting "Cut-or-Select"
with Short Ciphertext
author:Yan Zhu and
Xin Wang and
Di Ma and
Ruiqi Guo
Identity-Set-based Broadcast Encryption supporting
“Cut-or-Select” with Short Ciphertext
Yan Zhu, Xin Wang
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
zhuyan@ustb.edu.cn
Di Ma
Science,
University of
Computer and Information
Michigan-Dearborn,
Dearborn, MI 48128
dmadma@umich.edu
RuiQi Guo
School of Computer and
Communication Engineering,
University of Science and
Technology Beijing,
Beijing 100083, China
guoruiqi7@163.com
ABSTRACT
In this paper we present an identity-set-based broadcast en-
cryption scheme with three working modes: positive mem-
bership (Select-mode), all member (All-mode), and negative
membership (Cut-mode) over the user identity set, simulta-
neously. The core of our scheme is the implementation of
cryptographic representation of subset by using two aggre-
gation functions: Zeros-based aggregation and Poles-based
aggregation. These two aggregation functions are capable of
compressing any subset into one element in a bilinear map
group for determining the membership between an element
and a subset. Our scheme achieves the optimal bound of
O(1)-size for either ciphertext (consisting of just two ele-
ments) or decryption key (one element) for an identity set
of large size. We prove that our scheme is secure under the
General Diﬃe-Hellman Exponent (GDHE) assumption.
Categories and Subject Descriptors
E.3 [Data Encryption]: Public key cryptosystems; C.2.0
[Computer-Communication Networks]: General—Se-
curity and protection; D.4.6 [Operating Systems]: Secu-
rity and Protection—Cryptographic controls
General Terms
Security, Design, Algorithms, Performance
Keywords
Group-oriented Encryption, Cryptographic Representation
of Subset, Negative Membership, Set Membership, Identity-
Set-based Encryption
1.
INTRODUCTION
Broadcast encryption (BE) ...

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


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

Output:
安全论文分析：

title:QuantumHammer: A Practical Hybrid Attack on the LUOV Signature
Scheme
author:Koksal Mus and
Saad Islam and
Berk Sunar
QuantumHammer: A Practical Hybrid Attack on the LUOV
Signature Scheme
Koksal Mus†∗
Saad Islam∗
{kmus,sislam}@wpi.edu
∗ Worcester Polytechnic Institute, MA, USA
† Istanbul Aydin University, Istanbul, Turkey
ABSTRACT
Post-quantum schemes are expected to replace existing public-key
schemes within a decade in billions of devices. To facilitate the
transition, the US National Institute for Standards and Technology
(NIST) is running a standardization process. Multivariate signatures
is one of the main categories in NIST’s post-quantum cryptogra-
phy competition. Among the four candidates in this category, the
LUOV and Rainbow schemes are based on the Oil and Vinegar
scheme, first introduced in 1997 which has withstood over two
decades of cryptanalysis. Beyond mathematical security and effi-
ciency, security against side-channel attacks is a major concern
in the competition. The current sentiment is that post-quantum
schemes may be more resistant to fault-injection attacks due to
their large key sizes and the lack of algebraic structure. We show
that this is not true.
We introduce a novel hybrid attack, QuantumHammer, and
demonstrate it on the constant-time implementation of LUOV cur-
rently in Round 2 of the NIST post-quantum competition. The
QuantumHammer attack is a combination of two attacks, a bit-
tracing attack enabled via Rowhammer fault injection and a divide
and conquer attack that uses bit-tracing as an oracle. Using bit-
tracing, an attacker with access to faulty signatures collected using
Rowhammer attack, can recover secret key bits albeit slowly. We
employ a divide and conquer attack which exploits the structure in
the key generation part of LUOV and solves the system of equations
for the secret key more efficiently with few key bits recovered via
bit-tracing.
We have demonstrated the first successful in-the-wild attack
on LUOV recoveri...


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

Input:
title:QuantumHammer: A Practical Hybrid Attack on the LUOV Signature
Scheme
author:Koksal Mus and
Saad Islam and
Berk Sunar
QuantumHammer: A Practical Hybrid Attack on the LUOV
Signature Scheme
Koksal Mus†∗
Saad Islam∗
{kmus,sislam}@wpi.edu
∗ Worcester Polytechnic Institute, MA, USA
† Istanbul Aydin University, Istanbul, Turkey
ABSTRACT
Post-quantum schemes are expected to replace existing public-key
schemes within a decade in billions of devices. To facilitate the
transition, the US National Institute for Standards and Technology
(NIST) is running a standardization process. Multivariate signatures
is one of the main categories in NIST’s post-quantum cryptogra-
phy competition. Among the four candidates in this category, the
LUOV and Rainbow schemes are based on the Oil and Vinegar
scheme, first introduced in 1997 which has withstood over two
decades of cryptanalysis. Beyond mathematical security and effi-
ciency, security against side-channel attacks is a major concern
in the competition. The current sentiment is that post-quantum
schemes may be more resistant to fault-injection attacks due to
their large key sizes and the lack of algebraic structure. We show
that this is not true.
We introduce a novel hybrid attack, QuantumHammer, and
demonstrate it on the constant-time implementation of LUOV cur-
rently in Round 2 of the NIST post-quantum competition. The
QuantumHammer attack is a combination of two attacks, a bit-
tracing attack enabled via Rowhammer fault injection and a divide
and conquer attack that uses bit-tracing as an oracle. Using bit-
tracing, an attacker with access to faulty signatures collected using
Rowhammer attack, can recover secret key bits albeit slowly. We
employ a divide and conquer attack which exploits the structure in
the key generation part of LUOV and solves the system of equations
for the secret key more efficiently with few key bits recovered via
bit-tracing.
We have demonstrated the first successful in-the-wild attack
on LUOV recoveri...

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


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

Output:
安全论文分析：

title:Every microsecond counts: tracking fine-grain latencies with a lossy
difference aggregator
author:Ramana Rao Kompella and
Kirill Levchenko and
Alex C. Snoeren and
George Varghese
Every Microsecond Counts: Tracking
Fine-Grain Latencies with a Lossy Difference Aggregator
Ramana Rao Kompella†, Kirill Levchenko, Alex C. Snoeren, and George Varghese
†Purdue University and University of California, San Diego
ABSTRACT
Many network applications have stringent end-to-end latency re-
quirements, including VoIP and interactive video conferencing, au-
tomated trading, and high-performance computing—where even
microsecond variations may be intolerable. The resulting ﬁne-grain
measurement demands cannot be met effectively by existing tech-
nologies, such as SNMP, NetFlow, or active probing. We propose
instrumenting routers with a hash-based primitive that we call a
Lossy Difference Aggregator (LDA) to measure latencies down to
tens of microseconds and losses as infrequent as one in a million.
Such measurement can be viewed abstractly as what we refer to
as a coordinated streaming problem, which is fundamentally harder
than standard streaming problems due to the need to coordinate
values between nodes. We describe a compact data structure that
efﬁciently computes the average and standard deviation of latency
and loss rate in a coordinated streaming environment. Our theoret-
ical results translate to an efﬁcient hardware implementation at 40
Gbps using less than 1% of a typical 65-nm 400-MHz networking
ASIC. When compared to Poisson-spaced active probing with sim-
ilar overheads, our LDA mechanism delivers orders of magnitude
smaller relative error; active probing requires 50–60 times as much
bandwidth to deliver similar levels of accuracy.
Categories and Subject Descriptors
C.2.3 [Computer Communication Networks]: Network manage-
ment
General Terms
Measurement, algorithms
Keywords
Passive measurement, packet sampling
1.
INTRODUCTION
An increasing number of Internet-based app...


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

Input:
title:Every microsecond counts: tracking fine-grain latencies with a lossy
difference aggregator
author:Ramana Rao Kompella and
Kirill Levchenko and
Alex C. Snoeren and
George Varghese
Every Microsecond Counts: Tracking
Fine-Grain Latencies with a Lossy Difference Aggregator
Ramana Rao Kompella†, Kirill Levchenko, Alex C. Snoeren, and George Varghese
†Purdue University and University of California, San Diego
ABSTRACT
Many network applications have stringent end-to-end latency re-
quirements, including VoIP and interactive video conferencing, au-
tomated trading, and high-performance computing—where even
microsecond variations may be intolerable. The resulting ﬁne-grain
measurement demands cannot be met effectively by existing tech-
nologies, such as SNMP, NetFlow, or active probing. We propose
instrumenting routers with a hash-based primitive that we call a
Lossy Difference Aggregator (LDA) to measure latencies down to
tens of microseconds and losses as infrequent as one in a million.
Such measurement can be viewed abstractly as what we refer to
as a coordinated streaming problem, which is fundamentally harder
than standard streaming problems due to the need to coordinate
values between nodes. We describe a compact data structure that
efﬁciently computes the average and standard deviation of latency
and loss rate in a coordinated streaming environment. Our theoret-
ical results translate to an efﬁcient hardware implementation at 40
Gbps using less than 1% of a typical 65-nm 400-MHz networking
ASIC. When compared to Poisson-spaced active probing with sim-
ilar overheads, our LDA mechanism delivers orders of magnitude
smaller relative error; active probing requires 50–60 times as much
bandwidth to deliver similar levels of accuracy.
Categories and Subject Descriptors
C.2.3 [Computer Communication Networks]: Network manage-
ment
General Terms
Measurement, algorithms
Keywords
Passive measurement, packet sampling
1.
INTRODUCTION
An increasing number of Internet-based app...

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


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

Output:
安全论文分析：

title:Efficient Distribution of Key Chain Commitments for Broadcast Authentication
in Distributed Sensor Networks
author:Donggang Liu and
Peng Ning
E(cid:14)cient Distribution of Key Chain Commitments for Broadcast
Authentication in Distributed Sensor Networks(cid:3)
Donggang Liu
Peng Ning
Department of Computer Science
North Carolina State University
Raleigh, NC 27695-7534
Emails: dliu@unity.ncsu.edu, ning@csc.ncsu.edu
Abstract
Broadcast authentication is a fundamental security
service in distributed sensor networks. A scheme
named (cid:22)TESLA has been proposed for e(cid:14)cient broad-
cast authentication in such networks. However,
(cid:22)TESLA requires initial distribution of certain in-
formation based on unicast between the base sta-
tion and each sensor node before the actual authen-
tication of broadcast messages. Due to the limited
bandwidth in wireless sensor networks, this initial
unicast-based distribution severely limits the applica-
tion of (cid:22)TESLA in large sensor networks. This paper
presents a novel technique to replace the unicast-based
initialization with a broadcast-based one. As a result,
(cid:22)TESLA can be used in a sensor network with a large
amount of sensors, as long as the message from the
base station can reach these sensor nodes. This pa-
per further explores several techniques that improve
the performance, the robustness, as well as the secu-
rity of the proposed method. The resulting protocol
satis(cid:12)es several nice properties, including low over-
head, tolerance of message loss, scalability to large
networks, and resistance to replay attacks as well as
some known Denial of Service (DOS) attacks.
1. Introduction
A distributed sensor network usually consists of one
or several computationally powerful nodes called base
stations and a large amount of inexpensive, low capac-
ity nodes called sensors (or sensor nodes). The nodes
in a distributed sensor network communicate through
wireless communication, which is usually limited...


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

Input:
title:Efficient Distribution of Key Chain Commitments for Broadcast Authentication
in Distributed Sensor Networks
author:Donggang Liu and
Peng Ning
E(cid:14)cient Distribution of Key Chain Commitments for Broadcast
Authentication in Distributed Sensor Networks(cid:3)
Donggang Liu
Peng Ning
Department of Computer Science
North Carolina State University
Raleigh, NC 27695-7534
Emails: dliu@unity.ncsu.edu, ning@csc.ncsu.edu
Abstract
Broadcast authentication is a fundamental security
service in distributed sensor networks. A scheme
named (cid:22)TESLA has been proposed for e(cid:14)cient broad-
cast authentication in such networks. However,
(cid:22)TESLA requires initial distribution of certain in-
formation based on unicast between the base sta-
tion and each sensor node before the actual authen-
tication of broadcast messages. Due to the limited
bandwidth in wireless sensor networks, this initial
unicast-based distribution severely limits the applica-
tion of (cid:22)TESLA in large sensor networks. This paper
presents a novel technique to replace the unicast-based
initialization with a broadcast-based one. As a result,
(cid:22)TESLA can be used in a sensor network with a large
amount of sensors, as long as the message from the
base station can reach these sensor nodes. This pa-
per further explores several techniques that improve
the performance, the robustness, as well as the secu-
rity of the proposed method. The resulting protocol
satis(cid:12)es several nice properties, including low over-
head, tolerance of message loss, scalability to large
networks, and resistance to replay attacks as well as
some known Denial of Service (DOS) attacks.
1. Introduction
A distributed sensor network usually consists of one
or several computationally powerful nodes called base
stations and a large amount of inexpensive, low capac-
ity nodes called sensors (or sensor nodes). The nodes
in a distributed sensor network communicate through
wireless communication, which is usually limited...

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


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

Output:
安全论文分析：

title:SecTEE: A Software-based Approach to Secure Enclave Architecture
Using TEE
author:Shijun Zhao and
Qianying Zhang and
Yu Qin and
Wei Feng and
Dengguo Feng
SecTEE: A Software-based Approach to Secure Enclave
Architecture Using TEE
Shijun Zhao
Institute of Software Chinese
Academy of Sciences
Beijing, China
Qianying Zhang∗
College of Information Engineering,
Capital Normal University
Beijing, China
Yu Qin
Institute of Software Chinese
Academy of Sciences
Beijing, China
Wei Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
Dengguo Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
ABSTRACT
Secure enclaves provide a practical solution to secure computation,
and current approaches to secure enclaves are implemented by
extending hardware security mechanisms to the CPU architecture.
Therefore, it is hard for a platform to offer secure computation if its
CPU architecture is not equipped with any secure enclave features.
Unfortunately, ARM CPUs, dominating mobile devices and having
increasing momentum in cloud markets, do not provide any security
mechanisms achieving the security equivalent to modern secure
enclave architectures. In this paper, we propose SecTEE, a software-
based secure enclave architecture which is based on the CPU’s
isolation mechanism and does not require specialized security
hardware of the CPU architecture such as memory encryption
engines. SecTEE achieves a high level of security even compared
with hardware-based secure enclave architectures: resistance to
privileged host software attacks, lightweight physical attacks,
and memory access based side-channel attacks. Besides, SecTEE
provides rich trusted computing primitives for enclaves: integrity
measurement, remote attestation, data sealing, secrets provisioning,
and life cycle management. We implement a SecTEE prototype
based on the ARM TrustZone technology, but our approach can
be applied to other CPU architectures with isolation mechanisms.
The evaluation...


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

Input:
title:SecTEE: A Software-based Approach to Secure Enclave Architecture
Using TEE
author:Shijun Zhao and
Qianying Zhang and
Yu Qin and
Wei Feng and
Dengguo Feng
SecTEE: A Software-based Approach to Secure Enclave
Architecture Using TEE
Shijun Zhao
Institute of Software Chinese
Academy of Sciences
Beijing, China
Qianying Zhang∗
College of Information Engineering,
Capital Normal University
Beijing, China
Yu Qin
Institute of Software Chinese
Academy of Sciences
Beijing, China
Wei Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
Dengguo Feng
Institute of Software Chinese
Academy of Sciences
Beijing, China
ABSTRACT
Secure enclaves provide a practical solution to secure computation,
and current approaches to secure enclaves are implemented by
extending hardware security mechanisms to the CPU architecture.
Therefore, it is hard for a platform to offer secure computation if its
CPU architecture is not equipped with any secure enclave features.
Unfortunately, ARM CPUs, dominating mobile devices and having
increasing momentum in cloud markets, do not provide any security
mechanisms achieving the security equivalent to modern secure
enclave architectures. In this paper, we propose SecTEE, a software-
based secure enclave architecture which is based on the CPU’s
isolation mechanism and does not require specialized security
hardware of the CPU architecture such as memory encryption
engines. SecTEE achieves a high level of security even compared
with hardware-based secure enclave architectures: resistance to
privileged host software attacks, lightweight physical attacks,
and memory access based side-channel attacks. Besides, SecTEE
provides rich trusted computing primitives for enclaves: integrity
measurement, remote attestation, data sealing, secrets provisioning,
and life cycle management. We implement a SecTEE prototype
based on the ARM TrustZone technology, but our approach can
be applied to other CPU architectures with isolation mechanisms.
The evaluation...

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


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

Output:
安全论文分析：

title:Krace: Data Race Fuzzing for Kernel File Systems
author:Meng Xu and
Sanidhya Kashyap and
Hanqing Zhao and
Taesoo Kim
KRACE: Data Race Fuzzing for Kernel File Systems
Meng Xu Sanidhya Kashyap Hanqing Zhao Taesoo Kim
Georgia Institute of Technology
Abstract—Data races occur when two threads fail to use
proper synchronization when accessing shared data. In kernel file
systems, which are highly concurrent by design, data races are
common mistakes and often wreak havoc on the users, causing
inconsistent states or data losses. Prior fuzzing practices on file
systems have been effective in uncovering hundreds of bugs, but
they mostly focus on the sequential aspect of file system execution
and do not comprehensively explore the concurrency dimension
and hence, forgo the opportunity to catch data races.
In this paper, we bring coverage-guided fuzzing to the concur-
rency dimension with three new constructs: 1) a new coverage
tracking metric, alias coverage, specially designed to capture
the exploration progress in the concurrency dimension; 2) an
evolution algorithm for generating, mutating, and merging multi-
threaded syscall sequences as inputs for concurrency fuzzing;
and 3) a comprehensive lockset and happens-before modeling for
kernel synchronization primitives for precise data race detection.
These components are integrated into KRACE, an end-to-end
fuzzing framework that has discovered 23 data races in ext4,
btrfs, and the VFS layer so far, and 9 are confirmed to be harmful.
I. INTRODUCTION
In the current multi-core era, concurrency has been a major
thrust for performance improvements, especially for system
software. As is evident in kernel and file system evolutions [1–
4], a whole zoo of programming paradigms is introduced
to exploit multi-core computation, including but not limited
to asynchronous work queues, read-copy-update (RCU), and
optimistic locking such as sequence locks. However, alongside
performance improvements, concurrency bugs also find their
wa...