Détail de l'auteur
Auteur Shuo Shang |
Documents disponibles écrits par cet auteur (2)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Efficient task assignment in spatial crowdsourcing with worker and task privacy protection / An Liu in Geoinformatica, vol 22 n° 2 (April 2018)
[article]
Titre : Efficient task assignment in spatial crowdsourcing with worker and task privacy protection Type de document : Article/Communication Auteurs : An Liu, Auteur ; Weiqi Wang, Auteur ; Shuo Shang, Auteur ; Qing Li, Auteur ; Xiangliang Zhang, Auteur Année de publication : 2018 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] cryptage
[Termes IGN] données localisées des bénévoles
[Termes IGN] géolocalisation
[Termes IGN] production participative
[Termes IGN] protection de la vie privéeRésumé : (Auteur) Spatial crowdsourcing (SC) outsources tasks to a set of workers who are required to physically move to specified locations and accomplish tasks. Recently, it is emerging as a promising tool for emergency management, as it enables efficient and cost-effective collection of critical information in emergency such as earthquakes, when search and rescue survivors in potential ares are required. However in current SC systems, task locations and worker locations are all exposed in public without any privacy protection. SC systems if attacked thus have penitential risk of privacy leakage. In this paper, we propose a protocol for protecting the privacy for both workers and task requesters while maintaining the functionality of SC systems. The proposed protocol is built on partially homomorphic encryption schemes, and can efficiently realize complex operations required during task assignment over encrypted data through a well-designed computation strategy. We prove that the proposed protocol is privacy-preserving against semi-honest adversaries. Simulation on two real-world datasets shows that the proposed protocol is more effective than existing solutions and can achieve mutual privacy-preserving with acceptable computation and communication cost. Numéro de notice : A2018-367 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-017-0305-2 En ligne : https://doi.org/10.1007/s10707-017-0305-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90732
in Geoinformatica > vol 22 n° 2 (April 2018)[article]Planning unobstructed paths in traffic-aware spatial networks / Shuo Shang in Geoinformatica, vol 19 n° 4 (October - December 2015)
[article]
Titre : Planning unobstructed paths in traffic-aware spatial networks Type de document : Article/Communication Auteurs : Shuo Shang, Auteur ; Jianjun Liu, Auteur ; Kai Zheng, Auteur ; et al., Auteur Année de publication : 2015 Article en page(s) : pp 723 - 746 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] accessibilité
[Termes IGN] calcul d'itinéraire
[Termes IGN] gestion des itinéraires
[Termes IGN] itinéraire
[Termes IGN] objet mobile
[Termes IGN] trafic routier
[Termes IGN] vitesseMots-clés libres : traffic-aware spatial network Résumé : (auteur) Route planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of planning unobstructed paths in traffic-aware spatial networks (TAUP queries) to avoid potential traffic congestions. We propose two probabilistic TAUP queries: (1) a time-threshold query like “what is the path from the check-in desk to the flight SK 1217 with the minimum congestion probability to take at most 45 minutes?”, and (2) a probability-threshold query like “what is the fastest path from the check-in desk to the flight SK 1217 whose congestion probability is less than 20 %?”. These queries are mainly motivated by indoor space applications, but are also applicable in outdoor spaces. We believe that these queries are useful in some popular applications, such as planning unobstructed paths for VIP bags in airports and planning convenient routes for travelers. The TAUP queries are challenged by two difficulties: (1) how to model the traffic awareness in spatial networks practically, and (2) how to compute the TAUP queries efficiently under different query settings. To overcome these challenges, we construct a traffic-aware spatial network G t a (V, E) by analyzing uncertain trajectories of moving objects. Based on G t a (V, E), two efficient algorithms are developed to compute the TAUP queries. The performances of TAUP queries are verified by extensive experiments on real and synthetic spatial data. Numéro de notice : A2015--035 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-015-0227-9 Date de publication en ligne : 10/04/2015 En ligne : http://dx.doi.org/10.1007/s10707-015-0227-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81121
in Geoinformatica > vol 19 n° 4 (October - December 2015) . - pp 723 - 746[article]