CryptGraph: An Efficient Privacy-Enhancing Solution for Accurate Shortest Path Retrieval in Cloud Environments-Reference-Cited by-同舟云学术

CryptGraph: An Efficient Privacy-Enhancing Solution for Accurate Shortest Path Retrieval in Cloud Environments

Published:2024-07 Issue: Volume:34 Page:1660-1674
ISSN:
Container-title:Proceedings of the 19th ACM Asia Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Wang Fuyi¹^ORCID,Chen Zekai²^ORCID,Pan Lei³^ORCID,Zhang Leo Yu⁴^ORCID,Zhou Jianying⁵^ORCID

Affiliation:

1. Deakin University, Geelong, --- Select One ---, Australia

2. Fuzhou University, Fuzhou, China

3. Deakin University, Melbourne, Australia

4. Griffith University, Gold Coast, Australia

5. Singapore University of Technology and Design, Singapore, Singapore

Funder

Deakin University

Publisher

ACM

Reference37 articles.

1. Rosa Alarcon, Rodrigo Saffie, Nikolas Bravo, and Javiera Cabello. 2015. REST web service description for graph-based service discovery. In ICWE 2015, Rotterdam, The Netherlands, June 23-26, 2015, Proceedings 15. Springer, 461--478.

2. Abdelrahaman Aly and Sara Cleemput. 2022. A Fast, Practical and Simple Shortest Path Protocol for Multiparty Computation. In ESORICS. Springer, 749--755.

3. Mohammad Anagreh and Peeter Laud. 2022. A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem. In International Workshop on Data Privacy Management. Springer, 120--135.

4. Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology. Springer, Santa Barbara, United States, 420--432.

5. Henry Carter, Benjamin Mood, Patrick Traynor, and Kevin R. B. Butler. 2013. Secure Outsourced Garbled Circuit Evaluation for Mobile Devices. In USENIX Security Symposium. USENIX Association, 289--304.