Grecs

Meng, Xianrui; Kamara, Seny; Nissim, Kobbi; Kollios, George

doi:10.1145/2810103.2813672

Cited by 107 publications

(8 citation statements)

References 47 publications

(67 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing research on route planning privacy protection has primarily focused on anonymization techniques, which can be classified into three categories: clustering-based approaches [27,28], graph encryption approaches [29][30][31], and graph modification-based approaches [32]. However, these approaches are limited by their low graph utility or high search overheads, which can impact the service performance.…”

Section: Literature Reviewmentioning

confidence: 99%

A Federated Personal Mobility Service in Autonomous Transportation Systems

Jian,

Chen,

et al. 2023

Mathematics

View full text Add to dashboard Cite

A personal mobility service (PMS) is developed to support personalized travel options for users in autonomous transportation systems (ATS), based on a macro-system state and micro-user behavior. However, this functionality necessitates processing and transmitting vast amounts of data, raising concerns about user privacy protection during data processing and transmission within the PMS. Furthermore, the PMS must be maintained and perform well, while preserving privacy. Therefore, we propose a novel federated PMS, denoted as a FPMS. Specifically, the FPMS can serve users’ personal mobility needs by facilitating the collaboration between the physical and information domains. Then, a common framework for FPMS architectures, which captures the features of ATSs, is proposed and discussed from both physical and logical perspectives, which include both the logical architecture and physical architecture; and we present the key algorithms for the FPMS, in conjunction with a artificial neural network (ANN). Additionally, in static estimation scenarios, the FPMS demonstrated a similar accuracy for three different models compared to the traditional PMS, while reducing the computing time by approximately 60% and communication resource consumption by approximately 85%.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Federated Personal Mobility Service in Autonomous Transportation Systems

Jian,

Chen,

et al. 2023

Mathematics

View full text Add to dashboard Cite

show abstract

“…Graph encryption is a special case of structured encryption and there are several prominent works. Meng et al [13] proposed a graph encryption scheme GRECS to answer shortest distance queries approximately by computing encrypted distance oracles and using somewhat homomorphic encryption [14], Pseudo-Random Permutation (PRP), and Pseudo-Random Function (PRF). Wu et al [15] presented a multi-round navigation protocol on city streets to enable shortest path queries.…”

Section: B Related Workmentioning

confidence: 99%

“…First, how to design an appropriate oracle that lays the foundation of our shortest path queries under restricted conditions. Existing work either neglect the shortest path [13] or only consider the neighboring information [17]. Intuitively, a path-distance oracle is preferable.…”

Section: Technical Challenges and Proposed Solutionsmentioning

confidence: 99%

Graph Encryption for Shortest Path Queries with k Unsorted Nodes

Gao

Zhang

et al. 2022

2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

View full text Add to dashboard Cite

Shortest distance queries over large-scale graphs bring great benefits to various applications, i.e., save planning time and travelling expenses. To protect the sensitive nodes and edges in the graph, a user outsources an encrypted graph to an untrusted server without losing the query ability. However, no prior work has considered the user requirement of the shortest path with k unsorted nodes. In particular, we are concerned with how to securely find the shortest path by passing k nodes that do not have a fixed traverse order. To solve the problems, we propose Gespun (stands for Graph encryption for shortest path queries with k unordered nodes). It includes an oracle encryption scheme that is provably secure against the semi-honest server. Specifically, we compute the shortest paths and distances for all nodes locally to obtain path-distance oracles. We transform the shortest paths to a sequence of secure codes by using a pseudo-random permutation to protect the structure privacy. We encrypt the shortest distance by using additively homomorphic encryption. Second, we pack the oracles in link-list nodes and store them in an array-based dictionary after another permutation. Next, we construct a search graph to compute the shortest path while guaranteeing that the path passes the required k nodes. We formally prove that Gespun is adaptively semanticallysecure in the random oracle. We implement a prototype of Gespun and evaluate its performance. Experiments results demonstrate that Gespun is efficient, e.g., a query over 6301 nodes, 20777 edges, and 5 unsorted nodes only needs 483 ms to get queried results. We believe that our research problem span new research that soon promotes a new line of graph encryption schemes.

show abstract

“…With the help of cryptography, we can encrypt the original data before communicating it, rendering it unintelligible to outsiders until it is decrypted at the receiving end. Meng et al [9] developed graph encryption techniques that effectively allow approximative shortestdistance queries on huge encrypted graphs. By creating a number of indexes to store the data required to respond to queries, Liu et al [10] investigated a graph encryption approach for a crucial graph query type known as top-k Nearest Keyword (kNK) searches.…”

Section: Introductionmentioning

confidence: 99%

Graph Crypto‐Stego System for Securing Graph Data Using Association Schemes

Sabharwal,

Yadav,

Kumar

2024

Journal of Applied Mathematics

View full text Add to dashboard Cite

Cryptography has recently become a critical area to research and advance in order to transmit information safely and securely among various entities, especially when the transmitted data is classified as crucial or important. This is due to the increase in the use of the Internet and other novel communication technology. Many businesses now outsource sensitive data to a third party because of the rise of cloud computing and storage. Currently, the key problem is to encrypt the data such that it may be stored on an unreliable server without sacrificing the ability to use it effectively. In this paper, we propose a graph encryption scheme by using cryptography and steganography. Data is encrypted using association schemes over finite abelian groups and then hiding the encrypted data behind randomly chosen cover image. We implemented and evaluated the efficiency of our constructions experimentally. We provide experimental results, statistical analysis, error analysis, and key analysis that demonstrates the appropriateness and efficiency of the proposed technique.

show abstract

Grecs

Cited by 107 publications

References 47 publications

A Federated Personal Mobility Service in Autonomous Transportation Systems

A Federated Personal Mobility Service in Autonomous Transportation Systems

Graph Encryption for Shortest Path Queries with k Unsorted Nodes

Graph Crypto‐Stego System for Securing Graph Data Using Association Schemes

Contact Info

Product

Resources

About