Modeling the spreading behavior of passive worms in mobile social networks

Adu-Gyamfi, Daniel; Yong, Wang; Zhang, Fengli; Domenic, M. Kamenyi; Memon, Imran; Gustav, Yankson H.

doi:10.1109/iciii.2013.6702953

Cited by 10 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, in information loss evaluation, we only account for the generalization part, while the information loss caused by pre‐processing phase is not taken into consideration. In Memon et al and Adu‐Gyamfi et al, they adopt the reduction in the probability with which people can accurately determine the position of an object. In this paper, we measure the information loss by the ratio of the size of trajectory k‐anonymity region to the area size of the whole space, which is computed by .…”

Section: Resultsmentioning

confidence: 99%

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Memon

Chen

Arain

et al. 2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

SummaryIn road network, vehicles' location may be identified, and their transmissions may even tracked by eavesdrops (eg, safety messages) that contain sensitive personal information such as identity and location of the vehicle. This type of communication leads to breaking the users' trajectory privacy. Frequently changing pseudonyms are widely accepted as a solution that protects the trajectory privacy of users in road networks. However, this solution may become invalid if a vehicle changes its pseudonym at an improper occasion. To cope with this issue, we presented an efficient pseudonym change strategy with multiple mix zones scheme to provide trajectory privacy for road network. In addition, we protected vehicles against linkability attack by cheating mechanism. Henceforth, we constructed a cheating detection mechanism which allows the vehicles to verify whether the pseudonym change process is successful or not and also detect to malicious vehicles. In this way, users' trajectory privacy can be improved. Finally, by taking the anonymity set size (ASS) as the trajectory privacy metric, we exhibit by means of simulations that the proposed scheme is effective in multiple networks scenarios. KEYWORDS changing pseudonyms, cheating detection, cooperation, multiple mix-zones security, road networks, silent period, trajectory privacy | INTRODUCTIONRoad networks consist of vehicles and road-side units (RSUs) equipped with radio transceivers. Vehicles communicate with each other using vehicle-to-vehicle (V2V) communications, and with RSUs using vehicle-to-infrastructure (V2I) communications. 1 Road network promises safer driving conditions and more efficient traffic management. For safety applications, several initiatives have been launched to draw strong support in Europe 2,3 and also USA. 4 Road network offers a wide range of applications. We distinguish typically 2 classes of applications: (1) safety applications and (2) non-safety applications. Safety applications allow vehicles to exchange safety-related information in order to prevent accidents and hazardous situations. For example, such applications included cooperative driving, collision avoidance warnings, etc. Non-safety applications, such as Internet access, point of interest notification, and infotainment, focus on providing convenience and entertainment to drivers and passengers.In order to achieve road network applications, vehicles are required to broadcast periodic beacons into their direct neighborhood and occasionally event-based messages (eg, safety messages) as shown in Figure 1. These messages reported sensitive personal information about their senders such as the identity and location of the vehicle. 5 Due to

show abstract

Section: Resultsmentioning

confidence: 99%

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Memon

Chen

Arain

et al. 2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…Few approaches used in association rule hiding are heuristic‐based approaches [21], exact approaches [22], reconstruction‐based approaches [23], cryptography‐based approaches [24], and border‐based approaches [25]. Recently, for association rule mining with privacy preservation, heuristic approaches are used extensively.…”

Section: Introductionmentioning

confidence: 99%

Least lion optimisation algorithm (LLOA) based secret key generation for privacy preserving association rule hiding

Menaga

Revathi

2018

IET Information Security

View full text Add to dashboard Cite

“…[2][3][4][5] Hence, a secure authentication and key agreement scheme should be used to thwart security attacks. [2][3][4][5] Hence, a secure authentication and key agreement scheme should be used to thwart security attacks.…”

Section: Introductionmentioning

confidence: 99%

“…However, since wireless communications rely on open and public transmission media, the adversaries can launch various security attacks, including eavesdropping, masquerading, and tampering. [2][3][4][5] Hence, a secure authentication and key agreement scheme should be used to thwart security attacks. [6][7][8][9] It is obvious that the conventional authentication schemes are not suitable for GLOMONETs.…”

Section: Introductionmentioning

confidence: 99%

A secure authentication and key agreement scheme for roaming service with user anonymity

Arshad

Rasoolzadegan

2017

Int J Communication

View full text Add to dashboard Cite

Nowadays, with the advancement of wireless technologies, global mobility networks offer roaming services for mobile users. Since in global mobility networks the communication channel is public, adversaries can launch different security attacks to breach the security and privacy of data and mobile users. Hence, an authentication and key agreement scheme can be used to provide secure roaming services. It is well known that the conventional authentication schemes are not suitable for global mobility networks, because the authentication server of each network has the credentials of its registered users and thus cannot verify the authenticity of the other mobile users. Hence, for providing secure roaming services, another type of authentication called roaming authentication is required. Hitherto, a large number of authentication protocols have been proposed for global mobility networks. However, most of them have been proved to be insecure against various attacks. This paper proposes a secure and efficient authentication and key agreement scheme for global mobility networks. The proposed scheme is based on the elliptic curve cryptosystem. The correctness of the proposed scheme is verified using Burrows-Abadi-Needham logic.In addition, the security of the proposed scheme is proved using ProVerif. Detailed analyses demonstrate that the proposed scheme not only withstands various security attacks but also improves the efficiency by reducing the computational costs. KEYWORDS authentication, global mobility network (GLOMONET), key agreement, roaming service, security Int J Commun Syst. 2017;30:e3361.wileyonlinelibrary.com/journal/dac

show abstract

Modeling the spreading behavior of passive worms in mobile social networks

Cited by 10 publications

References 3 publications

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Least lion optimisation algorithm (LLOA) based secret key generation for privacy preserving association rule hiding

A secure authentication and key agreement scheme for roaming service with user anonymity

Contact Info

Product

Resources

About