نتایج جستجو برای: malicious but passive key generation center attack

تعداد نتایج: 3071153  

2011
Ahmad Heidari

Wormhole attack is a Routing-Disruption Attack in ad hoc networks, those malicious nodes in these networks can bear wormhole attacks to make up a false scenario on neighbor discovery relations among mobile nodes. The attackers endanger the safety of ad hoc routing protocols with making a direct link, referred to as a wormhole tunnel, between malicious nodes. After building a wormhole tunnel, on...

2011
Zuqing Zhu

Security is always a major concern and a topic of hot discussion to users of Wireless Mesh Networks (WMNs). The open architecture of WMNs makes it very easy for malicious attackers to exploit the loopholes in the routing protocol. Cooperative Black-hole attack is a type of denial-of-service attack that sabotages the routing functions of the network layer in WMNs. In this paper we have focused o...

2011
Shree Om Mohammad Talib

Security is always a major concern and a topic of hot discussion to users of Wireless Mesh Networks (WMNs). The open architecture of WMNs makes it very easy for malicious attackers to exploit the loopholes in the routing protocol. Cooperative Black-hole attack is a type of denial-of-service attack that sabotages the routing functions of the network layer in WMNs. In this paper we have focused o...

Journal: :Molecules 2008
Luis R Domingo Salvador Gil Margarita Parra José Segura

Addition of carboxylic acid dianions appears to be a potential alternative to the use of aluminium enolates for nucleophilic ring opening of epoxides. These conditions require the use of a sub-stoichiometric amount of amine (10% mol) for dianion generation and the previous activation of the epoxide with LiCl. Yields are good, with high regioselectivity, but the use of styrene oxide led, unexpec...

Journal: :IACR Cryptology ePrint Archive 2014
Mehmet Sabir Kiraz Ziya Alper Genç Süleyman Kardas

In Financial Cryptography 2013, Bringer, Chabanne and Patey proposed two cryptographic protocols for the computation of Hamming distance in the two-party setting. Their first scheme uses Oblivious Transfer and provides security in the semi-honest model. The other scheme uses Committed Oblivious Transfer (COT) and is claimed to provide full security in the malicious case. The proposed protocols ...

Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...

2015
Zhongmei Wan

305 Abstract— A mediated certificateless encryption (mCL-PKE) scheme which solves the certificate revocation problem and the key escrow problem and preserves the data confidentiality in the cloud. Since most of the CL-PKE schemes are based on bilinear pairing and computationally expensive. mCL-PKE scheme does not utilize pairing operation problem. The security mediator supports instantaneous re...

2009
Wei-Hung Lin Yuh-Rau Wang Shi-Jinn Horng Tzong-Wann Kao

In this paper, a copyright protection method for digital image with 1/T rate forward error correction (FEC) is proposed. In the proposed method, the original image is lossless and the watermark is robust to malicious attacks. The watermark logo is fused with noise bits to improve the security, and later XORed with the feature value of the image by 1/T rate FEC. During extraction, the watermark ...

1999
Paul Ammann Sushil Jajodia Peng Liu

Attacks on computer systems have received a great deal of press attention; however, most of the focus has been on how an attacker can disrupt an organization’s operations. Although attack prevention is clearly preferred, preventive measures do fail, and some attacks inevitably succeed in compromising some or all of particular systems. We adopt a fault tolerance approach that addresses all phase...

2009
Paruj Ratanaworabhan Benjamin Livshits Benjamin G. Zorn

Heap spraying is a security attack that increases the exploitability of memory corruption errors in type-unsafe applications. In a heap-spraying attack, an attacker coerces an application to allocate many objects containing malicious code in the heap, increasing the success rate of an exploit that jumps to a location within the heap. Because heap layout randomization necessitates new forms of a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید