oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Efficient Detection of Sybil attack Based on Cryptography in Vanet  [PDF]
Mina Rahbari,Mohammad Ali Jabreil Jamali
International Journal of Network Security & Its Applications , 2011,
Abstract: Vehicular communications play a substantial role in providing safety transportation by means of safetymessage exchange. Researchers have proposed several solutions for securing safety messages. Protocols based on a fixed key infrastructure are more efficient in implementation and maintain stronger security in comparison with dynamic structures. The purpose of this paper present a method based on a fixed keyinfrastructure for detection impersonation attack, in other words, Sybil attack, in the vehicular adhoc network. This attack, puts a great impact on performance of the network. The proposed method, using an cryptography mechanism to detection Sybil attack. Finally, using Mat lab simulator the results of this approach are reviewed, This method it has low delay for detection Sybil attack, because most operations are done in Certification Authority, so this proposed schema is a efficient method for detection Sybil attack.
Efficient Detection of Sybil Attack Based on Cryptography in Vanet  [PDF]
Mina Rahbari,Mohammad Ali Jabreil Jamali
Computer Science , 2011,
Abstract: Vehicular communications play a substantial role in providing safety transportation by means of safety message exchange. Researchers have proposed several solutions for securing safety messages. Protocols based on a fixed key infrastructure are more efficient in implementation and maintain stronger security in comparison with dynamic structures. The purpose of this paper present a method based on a fixed key infrastructure for detection impersonation attack, in other words, Sybil attack, in the vehicular ad hoc network. This attack, puts a great impact on performance of the network. The proposed method, using an cryptography mechanism to detection Sybil attack. Finally, using Mat lab simulator the results of this approach are reviewed, This method it has low delay for detection Sybil attack, because most operations are done in Certification Authority, so this proposed schema is a efficient method for detection Sybil attack.
On Sybil attack in wireless sensor networks
无线传感器网络中的Sybil攻击

WANG Xiang-dong,Lu Shao-he,SUN Yan-qiang,MENG Xiang-xu,
王晓东
,吕绍和,孙言强,孟祥旭

计算机应用 , 2008,
Abstract: A novel detection mechanism, called Cooperative RSS-based Sybil Detection (CRSD) used in static and resource-limited Wireless Sensor Networks (WSN) was proposed. CRSD took use of the Received Signal Strength (RSS) to induce the distance between two nodes and further determined the positions of the identities of interests by use of the RSS information from multiple neighbor nodes. A Sybil attack was detected when two or more different identities with almost the same position were got. The simulations and results show that, first, Sybil attack can certainly deteriorate the system performance significantly and furthermore, CRSD can detect such attack in most cases and thus facilitate the avoidance of using Sybil node to protect the overall performance effectively.
Detecting the Sybil Attack in Wireless Sensor Network :Survey  [cached]
A.V Pramod,Md. Abdul Azeem,M. Om Prakash
International Journal of Computers & Technology , 2012,
Abstract: Mobility is frequently a problem for providing security services in ad hoc networks. In this paper, we render that mobility can alsobe used to enhance security. Specifically, we render that nodes which are in passively monitor traffic in the network can able to detect a Sybil attacker which uses a number of network identities simultaneously. We can do through simulation that this detection can be done by a single node, or multiple trusted nodes can join to improve the accuracy of detection. We then show that although the detection mechanism will falsely identify groups of nodes traveling together as a Sybil attacker, we can extend the protocol to monitor collisions at the MAC level to differentiate between a single attacker spoofing many addresses and a group of nodes traveling in close proximity.
Survey of Sybil Attacks in Social Networks  [PDF]
Rupesh Gunturu
Computer Science , 2015,
Abstract: This paper reviews the Sybil attack in social networks, which has the potential to compromise the whole distributed network. In the Sybil attack, the malicious user claims multiple identities to compromise the network. Sybil attacks can be used to change the overall ranking in voting applications, bad-mouth an opinion, access resources or to break the trust mechanism behind a P2P network. In this paper, different defense mechanisms used to mitigate Sybil attacks are also reviewed.
Social Turing Tests: Crowdsourcing Sybil Detection  [PDF]
Gang Wang,Manish Mohanlal,Christo Wilson,Xiao Wang,Miriam Metzger,Haitao Zheng,Ben Y. Zhao
Computer Science , 2012,
Abstract: As popular tools for spreading spam and malware, Sybils (or fake accounts) pose a serious threat to online communities such as Online Social Networks (OSNs). Today, sophisticated attackers are creating realistic Sybils that effectively befriend legitimate users, rendering most automated Sybil detection techniques ineffective. In this paper, we explore the feasibility of a crowdsourced Sybil detection system for OSNs. We conduct a large user study on the ability of humans to detect today's Sybil accounts, using a large corpus of ground-truth Sybil accounts from the Facebook and Renren networks. We analyze detection accuracy by both "experts" and "turkers" under a variety of conditions, and find that while turkers vary significantly in their effectiveness, experts consistently produce near-optimal results. We use these results to drive the design of a multi-tier crowdsourcing Sybil detection system. Using our user study data, we show that this system is scalable, and can be highly effective either as a standalone system or as a complementary technique to current tools.
AOA based trust evaluation scheme for Sybil attack detection in WSN
一种基于AOA信任评估的无线传感器网络Sybil攻击检测新方法*

ZHANG Yan,FAN Ke-feng,ZHANG Su-bing,MO Wei,
张艳
,范科峰,张素兵,莫玮

计算机应用研究 , 2010,
Abstract: As wireless sensor networks (WSN) are widely applied in smart home networks and other new emerging areas, its security issues become increasingly prominent. Aiming at the typical Sybil attack in WSN,this paper proposed a new trust evaluation based on AOA (angle of arrival) detection scheme TEBA (trust evaluation based on AOA). According to the feature that Sybil node could create multi-identities but only with one physical position,beacon node identified Sybil identities whose signal phase difference below ...
Defending Mechanisms Against Sybil Attack in Next Generation Mobile Ad Hoc Networks
Pal Sarit,Mukhopadhyay Asish,Bhattacharya Partha
IETE Technical Review , 2008,
Abstract: This paper presents techniques adopted to defend against Sybil Attack in Mobile Ad Hoc Networks. Sybil attack and the existing defense mechanisms against this type of attack have been reviewed and their loopholes are indicated. Multifactor Authentication Scheme has been discussed pointing out its superiority over traditional Cryptography-based Authentication Schemes. Afterwards, Passive Ad Hoc Sybil Identity Detection techniques differentiating a Sybil attacker from a group of legitimate nodes moving together is also discussed. Merits and demerits of these methods are mentioned and also the scopes for future research to improve these detection schemes have been indicated.
Sybil Nodes Detection Based on Received Signal Strength Variations within VANET  [cached]
Mohamed Salah Bouassida,Gilles Guette,Mohamed Shawky,Bertrand Ducourthial
International Journal of Network Security , 2009,
Abstract: A Vehicular Ad hoc Network is a collection of mobile hosts forming a temporary network without the aid of any established infrastructure. This flexibility in space and time induces new challenges towards the security needed to support secure communications. Indeed, VANET are subject to attacks due to their vulnerabilities; one of the most compromising attacks is the Sybil nodes attack. We present in this context a Sybil detection approach, based on received signal strength variations, allowing a node to verify the authenticity of other communicating nodes, according to their localizations. In addition, we define an estimated metric of the distinguishability degree between two nodes, allowing to determine Sybil and malicious ones within VANET. The applicability of our contributions is validated through geometrical analysis, simulations and real measurements.
Sybil-proof Mechanisms in Query Incentive Networks  [PDF]
Wei Chen,Yajun Wang,Dongxiao Yu,Li Zhang
Computer Science , 2013,
Abstract: In this paper, we study incentive mechanisms for retrieving information from networked agents. Following the model in [Kleinberg and Raghavan 2005], the agents are represented as nodes in an infinite tree, which is generated by a random branching process. A query is issued by the root, and each node possesses an answer with an independent probability $p=1/n$. Further, each node in the tree acts strategically to maximize its own payoff. In order to encourage the agents to participate in the information acquisition process, an incentive mechanism is needed to reward agents who provide the information as well as agents who help to facilitate such acquisition. We focus on designing efficient sybil-proof incentive mechanisms, i.e., which are robust to fake identity attacks. %We consider incentive mechanisms which are sybil-proof, i.e., robust to fake identity attacks. We propose a family of mechanisms, called the direct referral (DR) mechanisms, which allocate most reward to the information holder as well as its direct parent (or direct referral). We show that, when designed properly, the direct referral mechanism is sybil-proof and efficient. In particular, we show that we may achieve an expected cost of $O(h^2)$ for propagating the query down $h$ levels for any branching factor $b>1$. This result exponentially improves on previous work when requiring to find an answer with high probability. When the underlying network is a deterministic chain, our mechanism is optimal under some mild assumptions. In addition, due to its simple reward structure, the DR mechanism might have good chance to be adopted in practice.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.