Secure Anonymous Routing in Trust and Clustered Wireless Ad Hoc Networks

Chen, Sisheng; Xu, Li; Chen, Zhide

doi:10.1109/chinacom.2007.4469552

Cited by 6 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the proposed protocol, location information is pre-distributed to the group of nodes with different level of trust. In [9], Sisheng Chen et al proposed a secure anonymous routing scheme for clustered wireless ad hoc networks to prevent the traffic monitoring. It provides sender, receiver, link anonymity and privacy through bloom filters to establish the trust.…”

Section: Related Workmentioning

confidence: 99%

Probabilistic Anonymous Routing in Mobile Ad-Hoc Networks

Moliya

Jain

Mohanty

et al. 2017

IJCCT

View full text Add to dashboard Cite

In this paper, we propose a routing protocol which ensures route anonymity, for the user. Amongst all suboptimal paths between source and destination, path for data transfer is chosen randomly at each intermediate node. Route anonymity becomes essential for preventing attacks like traffic monitoring. Bayesian approach has been employed for route discovery phase of the protocol. The protocol is simulated using NCTUNS network simulator. The robustness of our protocol is evaluated against known security attacks.

show abstract

Section: Related Workmentioning

confidence: 99%

Probabilistic Anonymous Routing in Mobile Ad-Hoc Networks

Moliya

Jain

Mohanty

et al. 2017

IJCCT

View full text Add to dashboard Cite

show abstract

“…In particular, several protocols use them to perform message authentication [41] and node authentication [37] efficiently. Anonymous data transmission and anonymous route discovery was proposed in [9], while in [32] the authors introduced a system that uses BFs to prevent user movements detection based on to the tracking of RFID (Radio Frequency Identification) tags. BFs have also be used to cope with several kinds of malicious network behavior.…”

Section: Bloom Filtersmentioning

confidence: 99%

Location privacy without mutual trust: The spatial Bloom filter

Calderoni

Palmieri

Maio

2015

Computer Communications

View full text Add to dashboard Cite

Access to the full text of the published version may require a subscription. Rights AbstractLocation-aware applications are one of the biggest innovations brought by the smartphone era, and are effectively changing our everyday lives. But we are only starting to grasp the privacy risks associated with constant tracking of our whereabouts. In order to continue using location-based services in the future without compromising our privacy and security, we need new, privacy-friendly applications and protocols. In this paper, we propose a new compact data structure based on Bloom filters, designed to store location information. The Spatial Bloom Filter (SBF), as we call it, is designed with privacy in mind, and we prove it by presenting two private positioning protocols based on the new primitive. The protocols keep the user's exact position private, but allow the provider of the service to learn when the user is close to specific points of interest, or inside predefined areas. At the same time, the points and areas of interest remain oblivious to the user. The two proposed protocols are aimed at different scenarios: a two-party setting, in which communication happens directly between the user and the service provider, and a three-party setting, in which the service provider outsources to a third party the communication with the user. A detailed evaluation of the efficiency and security of our solution shows that privacy can be achieved with minimal computational and communication overhead. The potential of spatial Bloom filters in terms of generality, security and compactness makes them ready for deployment, and may open the way for privacy preserving location-aware applications.

show abstract