PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries

DOI10.1016/j.ins.2019.07.082zbMath1456.68035OpenAlexW2965783709WikidataQ123341903 ScholiaQ123341903MaRDI QIDQ2656784

Yanyan Li

Publication date: 16 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/5908

zbMATH Keywords

cloud computinggraph encryptionconstrained shortest distance queryoutsourced computing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Uses Software

• GraphLab
• GRECS

Cites Work

• Unnamed Item
• Unnamed Item
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
• Expressive query over outsourced encrypted data
• Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing
• Finding the shortest path with vertex constraint over large graphs
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Efficient, Oblivious Data Structures for MPC
• Structured Encryption and Controlled Disclosure
• Fully Homomorphic Encryption over the Integers
• Approximation Schemes for the Restricted Shortest Path Problem
• Fully homomorphic encryption using ideal lattices
• Theory of Cryptography