English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Ride-sharing allows multiple persons to share their trips together in onevehicle instead of using multiple vehicles. This can reduce the number ofvehicles in the street, which consequently can reduce air pollution, trafficcongestion and transportation cost. However, a ride-sharing organizationrequires passengers to report sensitive location information about their tripsto a trip organizing server (TOS) which creates a serious privacy issue. Inaddition, existing ride-sharing schemes are non-flexible, i.e., they require adriver and a rider to have exactly the same trip to share a ride. Moreover,they are non-scalable, i.e., inefficient if applied to large geographic areas.In this paper, we propose two efficient privacy-preserving ride-sharingorganization schemes for Non-transferable Ride-sharing Services (NRS) andTransferable Ride-sharing Services (TRS). In the NRS scheme, a rider can sharea ride from its source to destination with only one driver whereas, in TRSscheme, a rider can transfer between multiple drivers while en route until hereaches his destination. In both schemes, the ride-sharing area is divided intoa number of small geographic areas, called cells, and each cell has a uniqueidentifier. Each driver/rider should encrypt his trip's data and send anencrypted ride-sharing offer/request to the TOS. In NRS scheme, Bloom filtersare used to compactly represent the trip information before encryption. Then,the TOS can measure the similarity between the encrypted trips data to organizeshared rides without revealing either the users' identities or the locationinformation. In TRS scheme, drivers report their encrypted routes, an then theTOS builds an encrypted directed graph that is passed to a modified version ofDijkstra's shortest path algorithm to search for an optimal path of rides thatcan achieve a set of preferences defined by the riders.

Efficient and Privacy-Preserving Ride Sharing Organization for Transferable and Non-Transferable Services