With the development of network security research, network attack modeling and analysis techniques have been paid more and more attention. A generalized stochastic colored Petri Net (GSCPN) Model is proposed. To each ...
详细信息
Emotion is a fundamental object of human existence and determined by a complex set of factors. With the rapid development of online social networks (OSNs), more and more people would like to express their emotion in O...
详细信息
Emotion is a fundamental object of human existence and determined by a complex set of factors. With the rapid development of online social networks (OSNs), more and more people would like to express their emotion in OSNs, which provides wonderful opportunities to gain insight into how and why individual emotion is evolved in social network. In this paper, we focus on emotion dynamics in OSNs, and try to recognize the evolving process of collective emotions. As a basis of this research, we first construct a corpus and build an emotion classifier based on Bayes theory, and some effective strategies (entropy and salience) are introduced to improve the performance of our classifier, with which we can classify any Chinese tweet into a particular emotion with an accuracy as high as 82%. By analyzing the collective emotions in our sample networks in detail, we get some interesting findings, including a phenomenon of emotion synchronization between friends in OSNs, which offers good evidence for that human emotion can be spread from one person to another. Furthermore, we find that the number of friends has strong correlation with individual emotion. Based on those useful findings, we present a dynamic evolution model of collective emotions, in which both self-evolving process and mutual-evolving process are considered. To this end, extensive simulations on both real and artificial networks have been done to estimate the parameters of our emotion dynamic model, and we find that mutual-evolution plays a more important role than self-evolution in the distribution of collective emotions. As an application of our emotion dynamic model, we design an efficient strategy to control the collective emotions of the whole network by selecting seed users according to k-core rather than degree.
Dear editor,In recent years, steganalysis researchers have tried their best to extract the hidden messages. For example, under the condition of a known embedding position generator, Liu et al.[1] proposed a collision ...
详细信息
Dear editor,In recent years, steganalysis researchers have tried their best to extract the hidden messages. For example, under the condition of a known embedding position generator, Liu et al.[1] proposed a collision attack algorithm to recover the stego key of least significant bit (LSB) steganography. Fridrich et al.[2] proposed a chi-squared-test-based method to recover the stego key of LSB steganography for the case of an unknown carrier. Under the condition of multiple stego images embedded into the same positions, Ker [3] first proposed locating the
According to OWASP selected web application Top 10 vulnerabilities in 2013 and 2017,structured query language(SQL)injection is consistently ranked the 1 ***,the protection of SQL injection,which is one of the most pre...
详细信息
ISBN:
(纸本)9781538605349;9781538605332
According to OWASP selected web application Top 10 vulnerabilities in 2013 and 2017,structured query language(SQL)injection is consistently ranked the 1 ***,the protection of SQL injection,which is one of the most prevalent and pernicious security issues,requires ***,there are numerous unknown vulnerabilities and potential threats in *** this case,the active defense based on structural diversity can play an effective role to prevent the hacker from exploiting known or unknown *** on the basis of structural diversity,we propose a modified method,heterogeneous language,combined with heterogeneous database in data storage layer,to establish an active defense model for data *** empirically assess the impact of the vulnerability and conclude by testing the accuracy and performance,showing that our security model can not suffer from the same vulnerability as the unprotected ***,the future work and research direction are discussed.
Reconfigurable cipher chip has become a research hotspot because of its flexibility, security and good resource utilization. At present, research of reconfigurable cipher chip usually focuses on the s
ISBN:
(纸本)9781467389808
Reconfigurable cipher chip has become a research hotspot because of its flexibility, security and good resource utilization. At present, research of reconfigurable cipher chip usually focuses on the s
With the development of machine learning and computer vision, we combined the image classification and malware detection in this work. Based on the technology of image classification, we achieved the detection of malw...
详细信息
ISBN:
(纸本)9781538605349;9781538605332
With the development of machine learning and computer vision, we combined the image classification and malware detection in this work. Based on the technology of image classification, we achieved the detection of malware, using machine learning. In our work, we visualized the malware as a grayscale image and extracted texture features by Gabor filter. Depend on machine learning, we used extremely randomized trees as the classification and 10-fold cross validation to value it. Compared with GBDT, KNN and RF, experimental results are quite impressive with the accuracy rate of 96.19% and the recall rate of 97.51% on a malware database of 15,781 samples.
With the assistance of an authentication server, a gateway-oriented password-authenticated key exchange(GPAKE) protocol can establish a common session key shared between a client and a gateway. Unfortunately, a GPAKE ...
详细信息
With the assistance of an authentication server, a gateway-oriented password-authenticated key exchange(GPAKE) protocol can establish a common session key shared between a client and a gateway. Unfortunately, a GPAKE protocol becomes totally insecure if an adversary can compromise the authentication server and steal the passwords of the clients. In order to provide resilience against adversaries who can hack into the authentication server, we propose a threshold GPAKE protocol and then present its security proof in the standard model based on the hardness of the decisional Diffie-Hellman(DDH) problem. In our proposal,the password is shared among n authentication servers and is secure unless the adversary corrupts more than t + 1 servers. Our protocol requires n > 3t servers to work. Compared with existing threshold PAKE protocols,our protocol maintains both stronger security and greater efficiency.
Taking the schemes based on different formulas of secure key rate as examples, we give a fair comparison between typical protocols under Universal composable(UC) security frame. Through analyzing the relationship of s...
详细信息
Taking the schemes based on different formulas of secure key rate as examples, we give a fair comparison between typical protocols under Universal composable(UC) security frame. Through analyzing the relationship of security parameters in post-processing stage and final secure key rate, we achieve the unified quantification between protocols based on Gottesman-Lo-L¨utkenhausPreskill(GLLP) formula and the ones under UC *** on the above research, the impact of different sending lengths and secure parameters on secure key rate is investigated. Besides, we analyze the conditions of fair comparison, and for the first time we give a fair comparison between the protocols based on GLLP formula and smooth entropy. By typical efficiency comparisons, we summarize the way for improving secure key rate in the light intensity choice and the single bit error rate estimation method.
For nonlinear feedback shift registers(NFSRs), their greatest common subfamily may be not unique. Given two NFSRs, the authors only consider the case that their greatest common subfamily exists and is unique. If the g...
详细信息
For nonlinear feedback shift registers(NFSRs), their greatest common subfamily may be not unique. Given two NFSRs, the authors only consider the case that their greatest common subfamily exists and is unique. If the greatest common subfamily is exactly the set of all sequences which can be generated by both of them, the authors can determine it by Grbner basis theory. Otherwise, the authors can determine it under some conditions and partly solve the problem.
Anonymous password authenticated key exchange(APAKE) is an important cryptographic primitive, through which a client holding a password can establish a session key with a server both authentically and anonymously. Alt...
详细信息
Anonymous password authenticated key exchange(APAKE) is an important cryptographic primitive, through which a client holding a password can establish a session key with a server both authentically and anonymously. Although the server is guaranteed that the client in communication is from a pre-determined group, but the client’s actual identity is protected. Because of their convenience, APAKE protocols have been widely studied and applied to the privacy protection research. However, all existing APAKE protocols are handled in stand-alone models and do not adequately settle the problem of protocol composition, which is a practical issue for protocol implementation. In this paper, we overcome this issue by formulating and realizing an ideal functionality for APAKE within the well-known universal composability(UC) framework, which thus guarantees security under the protocol composition operations. Our formulation captures the essential security requirements of APAKE such as off-line dictionary attack resistance, client anonymity and explicit mutual authentication. Moreover, it addresses the arbitrary probabilistic distribution of passwords. The construction of our protocol, which utilizes SPHF-friendly commitments and CCA2-secure encryption schemes, can be instantiated and proven secure in the standard model, i.e., without random oracle heuristics.
暂无评论