Showing 1,161 - 1,180 results of 3,648 for search '"Attacker"', query time: 0.08s Refine Results
  1. 1161

    Secure and transparent data aggregation for wireless sensor networks by Jiang-hong GUO, Jian-feng MA

    Published 2012-10-01
    “…A secure and transparent data aggregation scheme for wireless sensor networks was proposed.Using hash function and XOR operation,the aggregation node completed the data integrity checking,source identity authentication and data aggregation without decrypting the encrypted data,ensured the data privacy in the process of transmitting and aggregation.Compared with related data aggregation schemes,except providing high security of encrypt key,the proposed scheme had better performances in resilient against active attack,node compromise attack and DoS attack.Also,the proposed scheme provides the information of the global data distribution.…”
    Get full text
    Article
  2. 1162

    Discrete event simulation–based energy efficient path determination scheme for probabilistic voting–based filtering scheme in sensor networks by Su Man Nam, Tae Ho Cho

    Published 2020-08-01
    “…In wireless sensor networks, sensors are extremely vulnerable to false positive and false negative attacks due to their stringent energy and computational constraints. …”
    Get full text
    Article
  3. 1163

    Load-to-store: exploit the time leakage of store buffer transient window by Ming TANG, Yifan HU

    Published 2023-04-01
    “…To research the vulnerability of modern microarchitecture and consider the mitigation, memory order buffer which was responsible for managing the execution order of memory access instructions was analyzed and found that load forward would directly bypass the data of dependent store instructions to load instructions, and speculative load would execute independent load instructions in advance.While bring efficiency optimizations, it might also lead to errors and corresponding blocking.The existing optimization mechanisms on the Intel Coffee Lake microarchitecture, and the leak attack scheme by using them were analyzed.Using the four execution modes of MOB and the corresponding duration, a variety of attacks were constructed including transient attack, covert channel, and recovery of the private key of the cryptographic algorithm.The time difference caused by MOB was used to leak the address of memory instructions, and the implementation of AES T table was attacked.Key recovery experiments were conducted on AES-128 with OpenSSL 3.0.0 on an Intel i5-9400 processor.The experimental results show that 30 000 sets of samples can recover a key byte with a probability of 63.6%.Due to the characteristics of memory order buffer, the concealment of the exploit is better than traditional cache time leaks.…”
    Get full text
    Article
  4. 1164

    Fog-aided identity privacy protection scheme for sensing users in mobile crowd sensing by Hui LIU, Renwan BI, Jinbo XIONG, Mingfeng ZHAO, Biao JIN, Jie LIN

    Published 2019-12-01
    “…In mobile crowd sensing(MCS),attackers can reconstruct the social circle among sensing users,who use the social association information among sensing users and the correlation between the sensing user’s identity and sensing data to further attack a social alliance.In order to tackle this issue,a fog-aided identity privacy protection scheme is proposed.Firstly,two fog nodes are introduced which located at the edge of the sensing terminal.The one is task allocation center (TC) for handling the reasonable allocation of sensing tasks,and the other is data center (DC) for calculating sensing data.Furthermore,differential privacy is employed for preventing attackers from acquiring the specific social association weight of sensing users.Finally,in order to prevent attackers from obtaining the sensing users' identity information and sensing data at the same time,sensing users use different blind identities to communicate with TC and DC.Security analysis indicates that the proposed scheme can ensure the security of identity privacy information of sensing users in the process of completing sensing tasks.Experimental results show that the proposed scheme can protect the social association information between sensing users,and has a low delay.…”
    Get full text
    Article
  5. 1165

    Optimal Joint Defense and Monitoring for Networks Security under Uncertainty: A POMDP-Based Approach by Armita Kazeminajafabadi, Mahdi Imani

    Published 2024-01-01
    “…The increasing interconnectivity in our infrastructure poses a significant security challenge, with external threats having the potential to penetrate and propagate throughout the network. Bayesian attack graphs have proven to be effective in capturing the propagation of attacks in complex interconnected networks. …”
    Get full text
    Article
  6. 1166

    Security of differential phase shift QKD from relativistic principles by Martin Sandfuchs, Marcus Haberland, V. Vilasini, Ramona Wolf

    Published 2025-01-01
    “…In addition, we show that coherent attacks on the DPS protocol are, in fact, stronger than collective attacks. …”
    Get full text
    Article
  7. 1167

    Yoyo trick on type‐II generalised Feistel networks by Tao Hou, Ting Cui

    Published 2021-11-01
    “…Abstract This work presents a structural attack against the type‐II generalised Feistel network (GFN) with secret internal functions. …”
    Get full text
    Article
  8. 1168

    Secure RSSI-based node positioning mechanism for wireless sensor networks by EA-yong Y, Li XU, Hui LIN

    Published 2012-07-01
    “…For securing the RSSI-based ranging,a new protocol was proposed firstly,which achieved robustness by applying integrity coding and occupation of communication channel.The theoretical analysis showed the proposal was resilient to most conventional attacks including signal forgery and replay,also it can prevent adversary from attenuating the ranging signal,which reducing the measured distance.Furthermore,a new secure node positioning scheme for sensor networks was proposed by applying the proposed protocol above,in which,the distance enlargement attacks were further filtered out by verifiable multilateration.The detailed analysis was also given to shown it’s robustness under external attacks.…”
    Get full text
    Article
  9. 1169

    Provably secure social network privacy-preserving scheme by Jian-qiong HE, You-liang TIAN, Kai ZHOU

    Published 2016-08-01
    “…A provable secure social network privacy-preserving scheme was proposed to solve the problem of social network privacy-preserving scheme's security proof.Firstly,through analyzing the security requirements about the node's privacy (indistinguishable node structure and indistinguishable sending messages),the security model were established separately.Secondly,the bilinear mapping was used to construct the social network privacy-preserving scheme.Finally,it was proved that the scheme was provable secure,the security of the schemes were analyzed and compared.The analysis results show that the scheme not only has provable security,but also can resist re-identify attack,inference attack and information aggregation attack.…”
    Get full text
    Article
  10. 1170

    Hish speed deep packet inspection method with low power dissipation by ZHU Guo-sheng1, YU Shao-hua1

    Published 2011-01-01
    “…Hish speed deep packet inspection using TCAM faces the problem of high power dissipation.A 2-phase DPI method BF-TCAM was proposed.The first phase used parallel Bloom filters to exclude the normal packets not including attack signatures.The second phase used TCAM to inspect suspicious packets including real attack packets and false positive packets of the first phase.The Bloom filters’ false negative probability is zero and false positive probability is very low.Since most of the network data traffic does not include attack signatures,the method can get high speed deep packet inspection with low power dissipation.…”
    Get full text
    Article
  11. 1171

    Anonymous aggregator election protocol for wireless sensor networks by Shuai FU, Jian-feng MA, Hong-tao LI, GQi JIAN

    Published 2015-02-01
    “…An anonymous cluster head election protocol in clustered wireless sensor networks was proposed.The protocol detailed the decision rules and mode of cluster construction while an anonymous veto protocol based on bilinear pairings was adopted to verify election results,ensuring the successful election of cluster heads.A corresponding anonymous data aggregation scheme was designed,through which data aggregation can be accomplished without revealing the identities of aggregators.Extensive analysis and simulation results show that the proposed protocol achieves anonymity,energy efficiency and security of cluster heads election simultaneously and can resist eavesdropping attacks,node compromise attacks and collusion attacks effectively.…”
    Get full text
    Article
  12. 1172

    Geometrically synchronous watermarking algorithm based on the corner feature by LIU Quan1, ZHANG Le1, ZHANG Yong-gang2, Christian Bessiere3, FU Qi-ming1, WANG Xiao-yan1

    Published 2011-01-01
    “…Simple geometric attacks could destroy watermark or its position,causing the failure of most watermarking algorithm.A geometrically synchronous watermarking algorithm robust based on the corner feature was proposed.In this paper,the feature point was detected on the normalization of the image to resist geometric attack;the combination of Harris and MIC corner detected algorithm was utilized to extract steady corner based on analyzing the advantages and disadvantages of the two algorithm;the watermarking information was statistic embed in the shape of rings instead of changing the simply one pixel.Sufficient experiments demonstrate the robustness of this approach,especially in resisting geometry attack such as RST(rotation,scaling and translation).…”
    Get full text
    Article
  13. 1173

    Defense of hidden backdoor technology for Web by Liyue CHEN, Xin SUN, Tiansheng CHENG, Chunming WU, Shuangxi CHEN

    Published 2020-05-01
    “…Rootkit is a set of persistent and undetectable attack technologies,which can hide their attack behavior and backdoor trace by modifying software or kernel in operating system and changing execution path of instruction.Firstly,the basic definition and evolution of Rootkit were introduced,then the operating principle,current mainstream technology and detection methods of Rootkit were discussed.Then,through comparative experiments on performance and security,the application of mimic defense system was described for Web based on dynamic,heterogeneous,redundant structure under Trojan Horse attack.Experiments show that mimic defense system can effectively defend against Trojan Horse in tests in the premise of low overhead.At last,the opportunities and challenges of the DHR system were summarized.…”
    Get full text
    Article
  14. 1174

    Approach to early detection and defense against internet worms by CHEN Bo, FANG Bin-xing, YUN Xiao-chun

    Published 2007-01-01
    “…A distributed defense mechanism was proposed.The main task of defense mechanism was to quickly detect worm attacks and response to constrain their propagation.The defense mechanism was composed of two parts: a date processing centre(DPC) and distributed sensors for defending against worm attacks.DPC is responsible for receiving the result of each distributed sensor and computing the number of infected computer.These distributed sensors monitor the network and detect worm.Once a worm attack was detected,a dropping packet mechanism is used so that the worm propagation was con-strained,and the number of interference with normal activity is minimized.The experimental results prove the robustness and efficiency of the proposed defense mechanism.…”
    Get full text
    Article
  15. 1175

    Correcting the security definition of the Bellare-Rogaway 3PKD model by LIU Jun1, LIAO Jian-xin1, ZHU Feng2, WANG Chun1

    Published 2007-01-01
    “…A flaw lied in the security definition of the Bellare-Rogaway 3PKD model,which was proposed by Bellare and Rogaway for three-party key distribution in 1995,was discovered.To reveal it,a new three-party key distribution proto-col P-Flaw was proposed.The protocol was provably secure under the Bellare-Rogaway 3PKD model.However the pro-tocol was not secure enough to withstand the server spoofing attack,known session key attack,and replay attack.The absence of the origin recognition for the distributed session key accounts for the flaw.Accordingly,the security definition of the Bellare-Rogaway 3PKD model was corrected based on matching conversation.…”
    Get full text
    Article
  16. 1176

    Certificateless signature scheme without random oracles by Yan-qiong LI, Ji-guo LI, Yi-chen ZHANG

    Published 2015-04-01
    “…The security of certificateless signature schemes can be proved under the random oracle model.However,any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure against key replacement attack.In order to solve this problem,a new certificateless signature scheme in the standard model had constructed.Based on the NGBDH and Many-DH assumption,the scheme was proved secure against existentially unforgeable under adaptive chosen message attack.In addition,the proposed scheme enjoys less computation cost and lower communication bandwidth and can resist against key replacement attack.…”
    Get full text
    Article
  17. 1177

    Research on trust sensing based secure routing mechanism for wireless sensor network by Dan-yang QIN, Shuang JIA, Song-xiang YANG, Jing-ya MA, Yan ZHANG, Qun DING

    Published 2017-10-01
    “…Aiming at the serious impact of the typical network attacks caused by the limited energy and the poor deployment environment of wireless sensor network (WSN) on data transmission,a trust sensing based secure routing mechanism (TSSRM) with the lightweight characteristics and the ability to resist many common attacks simultaneously was proposed.Based on the analysis of the characteristics of network attack,the trust degree calculation model was constructed by combining node’s behavior with energy,at the same time the security route selection algorithm was also optimized by taking trust degree and QoS metrics into account.Performance analysis and simulation results show that TSSRM can improve the security and effectiveness of WSN.…”
    Get full text
    Article
  18. 1178
  19. 1179

    A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform by Srinivas Koppu, V. Madhu Viswanatham

    Published 2017-01-01
    “…Compared with existing methods, the proposed method had more robustness to various attacks: brute-force attack, known cipher plaintext, chosen-plaintext, security key space, key sensitivity, correlation analysis and information entropy, and differential attacks. …”
    Get full text
    Article
  20. 1180

    Mite Pests of Southern Highbush Blueberry in Florida by Oscar Liburd, Lorena Lopez, Doug Phillips

    Published 2020-09-01
    “…The southern red mite is the key mite pest attacking blueberry plants in the southeastern US (Lopez and Liburd 2020). …”
    Get full text
    Article