Privacy Preserving Shortest Path Queries on Directed Graph
Trust relation in this work refers to permission that is given to a user at source-host to access another user at target-host through an authentication key with a unique fingerprint. We form a directed graph out of these trust relations, such that user-host pairs are considered as nodes and fingerpr...
Main Authors: | Sara Ramezanian, Tommi Meskanen, Valtteri Niemi |
---|---|
Format: | Article |
Language: | English |
Published: |
FRUCT
2018-05-01
|
Series: | Proceedings of the XXth Conference of Open Innovations Association FRUCT |
Subjects: | |
Online Access: | https://fruct.org/publications/fruct22/files/Ram.pdf
|
Similar Items
-
Private membership test protocol with low communication complexity
by: Sara Ramezanian, et al.
Published: (2020-08-01) -
Lightweight Privacy-Preserving Equality Query in Edge Computing
by: Qiyu Wu, et al.
Published: (2019-01-01) -
Privacy-friendly Discovery of Common Friends in P2P Networks
by: Tommi Meskanen, et al.
Published: (2022-04-01) -
Efficient Path Query Processing Through Cloud-Based Mapping Services
by: Detian Zhang, et al.
Published: (2017-01-01) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01)