2018
DOI: 10.1109/tvt.2018.2870113
|View full text |Cite
|
Sign up to set email alerts
|

ePRIVO: An Enhanced PRIvacy-preserVing Opportunistic Routing Protocol for Vehicular Delay-Tolerant Networks

Abstract: Abstract-This article proposes an enhanced PRIvacy preserVing Opportunistic routing protocol (ePRIVO) for Vehicular Delay-Tolerant Networks (VDTN). ePRIVO models a VDTN as a time-varying neighboring graph where edges correspond to neighboring relationship between pairs of vehicles. It addresses the problem of vehicles taking routing decision meanwhile keeping their information private, i.e, vehicles compute their similarity and/or compare their routing metrics in a private manner using the Paillier homomorphic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 20 publications
(20 citation statements)
references
References 34 publications
0
20
0
Order By: Relevance
“…Centralized authority is used to generate secret keys, update the interests of drivers and revoke keys of interests [160] Fully homomorphic encryption Tendering mechanism Decide victorious vehicles and their rewards The cloud server and selected vehicles collaborate to implement announced tasks [161] Boneh's algorithm [25] Double auction scheme Solve the problem of maximizing social welfare This scheme can be executed whenever there exist both purchasers and sellers [162] Paillier Opportunistic routing protocol Generate and anonymize the neighborhood graph, routing algorithm Edges are regarded as the relationship of two neighboring vehicles…”
Section: Basic Operationsmentioning
confidence: 99%
“…Centralized authority is used to generate secret keys, update the interests of drivers and revoke keys of interests [160] Fully homomorphic encryption Tendering mechanism Decide victorious vehicles and their rewards The cloud server and selected vehicles collaborate to implement announced tasks [161] Boneh's algorithm [25] Double auction scheme Solve the problem of maximizing social welfare This scheme can be executed whenever there exist both purchasers and sellers [162] Paillier Opportunistic routing protocol Generate and anonymize the neighborhood graph, routing algorithm Edges are regarded as the relationship of two neighboring vehicles…”
Section: Basic Operationsmentioning
confidence: 99%
“…One of the critical ingredients in their approach is the amount of information that each node is willing to share, i.e., there is a trade off between the amount of shared information and the performance of the routing protocol. ePRIVO [32] proposes an enhanced and modified version of PRIVO, targeted towards the Vehicular Delay Tolerant Network (VDTN) domain. Its goal is to enable vehicles to take routing decisions while keeping their information private.…”
Section: Related Workmentioning
confidence: 99%
“…Performance of routing protocols is being compared in this paper [30] while considering different parameters like time to live, distance (long and short) and a number of hops. Taking the routing decisions while maintaining privacy is considered in this paper [31] routing protocol named ePRIVO. It ensures the link privacy, binary anonymization, and neighborhood randomization, and attribute privacy by means of the Paillier homomorphic encryption scheme.…”
Section: Literature Reviewmentioning
confidence: 99%