The rapid development of cloud computing promotes a wide deployment of data and
computation outsourcing to cloud service providers by resource-limited entities. Based on a …

Constrained shortest distance (CSD) querying is one of the fundamental graph query
primitives, which finds the shortest distance from an origin to a destination in a graph with a …

The proposed paper shows different tools adopted in an industry project oriented on
business intelligence (BI) improvement. The research outputs concern mainly data mining …

We propose graph encryption schemes that efficiently support approximate shortest distance
queries on large-scale encrypted graphs. Shortest distance queries are one of the most …

We present oblivious implementations of several data structures for secure multiparty
computation (MPC) such as arrays, dictionaries, and priority queues. The resulting oblivious …

Collaboration between financial institutions helps to improve detection of fraud. However,
exchange of relevant data between these institutions is often not possible due to privacy …

In the era of big data, graph databases have become increasingly important for NoSQL
technologies, and many systems can be modeled as graphs for semantic queries …

This work presents RPM, a scalable anonymous communication protocol suite using secure
multiparty computation (MPC) with the offline-online model. We generate random, unknown …

The increasing popularity of Online Ride-hailing (ORH) services has greatly facilitated our
daily travel. It enables a rider to easily request the nearest driver through mobile devices in a …

Protocols for securely comparing private values are among the most fundamental building
blocks of multiparty computation. introduced by Yao under the name millionaire's problem …