The Experts below are selected from a list of 19536 Experts worldwide ranked by ideXlab platform
Qun Li - One of the best experts on this subject based on the ideXlab platform.
-
MobiShare: Flexible privacy-preserving Location sharing in mobile online social networks
Proceedings - IEEE INFOCOM, 2012Co-Authors: Wei Wei, Fengyuan Xu, Qun LiAbstract:Location sharing is a fundamental component of mobile online social networks (mOSNs), which also raises significant privacy concerns. The mOSNs collect a large amount of Location information over time, and the users’ Location privacy is compromised if their Location information is abused by adversaries controlling the mOSNs. In this paper, we present MobiShare, a system that provides flexible privacy-preserving Location sharing in mOSNs. MobiShare is flexible to support a variety of Location-based applications, in that it enables Location sharing between both trusted social relations and untrusted strangers, and it supports range query and user-defined access control. In MobiShare, neither the social network Server nor the Location Server has a complete knowledge of the users’ identities and Locations. The users’ Location privacy is protected even if either of the entities colludes with malicious users.
Duncan S. Wong - One of the best experts on this subject based on the ideXlab platform.
-
Location-Sharing Systems With Enhanced Privacy in Mobile Online Social Networks
IEEE Systems Journal, 2017Co-Authors: Hongyang Yan, Zheli Liu, Xiaofeng Chen, Xinyi Huang, Duncan S. WongAbstract:Location sharing is one of the critical components in mobile online social networks (mOSNs), which has attracted much attention recently. With the advent of mOSNs, more and more users' Location information will be collected by the service providers in mOSN. However, the users' privacy, including Location privacy and social network privacy, cannot be guaranteed in the previous work without the trust assumption on the service providers. In this paper, aiming at achieving enhanced privacy against the insider attack launched by the service providers in mOSNs, we introduce a new architecture with multiple Location Servers for the first time and propose a secure solution supporting Location sharing among friends and strangers in Location-based applications. In our construction, the user's friend set in each friends' query submitted to the Location Servers is divided into multiple subsets by the social network Server randomly. Each Location Server can only get a subset of friends, instead of the whole friends' set of the user as the previous work. In addition, for the first time, we propose a Location-sharing construction which provides checkability of the searching results returned from Location Servers in an efficient way. We also prove that the new construction is secure under the stronger security model with enhanced privacy. Finally, we provide extensive experimental results to demonstrate the efficiency of our proposed construction.
Antonio Caruso - One of the best experts on this subject based on the ideXlab platform.
-
"Direction" forwarding for highly mobile, large scale ad hoc networks
2020Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Biao Zhou, Antonio CarusoAbstract:Abstract-- １ In this paper, we present a novel packet forwarding scheme for wireless ad hoc networks ---"Direction" Forwarding (DFR). Popular routing protocols such as DSDV and AODV use "predecessor" based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from destination, as advertised during the last update. Predecessor forwarding may fail in large scale networks where the routing update rate must be reduced by the need to maintain link O/H below reasonable levels. If nodes are mobile, the routing table entries may become "stale" very rapidly. In other words, the "predecessor" listed in the routing table may have moved away and predecessor based packet forwarding fails! DFR is designed to overcome the "stale" routing table entry problem. Suppose our ad hoc network is equipped with a geo coordinate system, either global (e.g., GPS) or local (e.g., virtual coordinates locally computed via trilateration). When the routing update arrives, the node remembers not only the predecessor delivering the update, but also the update "direction" of arrival. When a packet must be forwarded to destination, it is first forwarded to the node ID found in the routing table. If the node has moved and ID forwarding fails, the packet is "direction" forwarded to the "most promising" node in the indicated direction. If the network is sufficiently dense, direction forwarding will recover from most "predecessor" ID forwarding failures. At first glance, DFR seems to combine the features of table based routing and geo-routing. However, direction forwarding differs from geo-routing in that the direction is learned from the routing updates, instead of being computed from the destination coordinates. Thus, DFR does not require destination coordinates, global coordinate system, or Geo Location Server. In the paper we show the application of DFR to a scalable routing scheme, LANMAR. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARDING FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Mario Gerla, Yeng-zhong Lee, Jason Chen, Biao Zhou, Antonio CarusoAbstract:Abstract: ± In this paper, we present a novel packet forwarding scheme for wireless ad hoc networks--- “Direction ” Forwarding (DFR). Popular routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from the destination, as advertised during the last update. Predecessor forwarding may fail in large scale networks where the routing update rate must be reduced by the need to maintain link O/H below reasonable levels. However, if nodes are mobile, routing table entries may become “stale ” very rapidly. DFR is designed to overcome the “stale ” routing table entry problem. When the routing update arrives, the node remembers not only the predecessor delivering the update, but also the update “direction ” of arrival. When a packet must be forwarded to destination, it is first forwarded to the node ID found in the routing table. If the node has moved and ID forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. At first glance, DFR seems to combine the features of table based routing and geo-routing. However, direction forwarding differs from geo-routing in that the direction is learned from the routing updates, instead of being computed from the destination coordinates. Thus, DFR does not require destination coordinates, a global coordinate system, or a Geo Location Server. In the paper we show the application of DFR to a scalable routing scheme, LANMAR. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
Xiaofen Wang - One of the best experts on this subject based on the ideXlab platform.
-
one round secure fair meeting Location determination based on homomorphic encryption
Information Sciences, 2016Co-Authors: Xiaofen WangAbstract:Determination of optimal meeting Location without revealing the Locations of participants to the Location Server is an interesting research problem. A major concern for a Location based service is Location privacy. However, adding privacy protection to a Location service will inevitably introduce computational complexity. To provide Location privacy with low computational cost is a challenging task. In this paper, we propose a one-round meeting Location determination protocol, where the Location service provider makes a decision with a semi-trusted cloud Server which works as a computation center and conducts most of computation. The user Location privacy is preserved against the outside and internal attackers including the computation center, the meeting Location determination Server and participants. In order to study the performance of the protocol, we test its computational efficiency on smartphones. The simulation results and the performance comparison of our protocol with another protocol of the same functionalities demonstrate that our solution is more efficient and practical.
Robert Morris - One of the best experts on this subject based on the ideXlab platform.
-
a scalable Location service for geographic ad hoc routing
ACM IEEE International Conference on Mobile Computing and Networking, 2000Co-Authors: Jinyang Li, John Jannotti, Douglas S J De Couto, David R Karger, Robert MorrisAbstract:GLS is a new distributed Location service which tracks mobile node Locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile nodes themselves, requiring no fixed infrastructure. Each mobile node periodically updates a small set of other nodes (its Location Servers) with its current Location. A node sends its position updates to its Location Servers without knowing their actual identities, assisted by a predefined ordering of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's Location also use the predefined identifier ordering and spatial hierarchy to find a Location Server for that node. Experiments using the ns simulator for up to 600 mobile nodes show that the storage and bandwidth requirements of GLS grow slowly with the size of the network. Furthermore, GLS tolerates node failures well: each failure has only a limited effect and query performance degrades gracefully as nodes fail and restart. The query performance of GLS is also relatively insensitive to node speeds. Simple geographic forwarding combined with GLS compares favorably with Dynamic Source Routing (DSR): in larger networks (over 200 nodes) our approach delivers more packets, but consumes fewer network resources.
