The application of graph analytics to various domains has yielded tremendous societal and economical benefits in recent years. However, the increasingly widespread adoption of graph analytics comes with a commensurate increase in the need to protect private information in graph data, especially in light of the many privacy breaches in real-world graph data that were supposed to preserve sensitive information. This article provides a comprehensive survey of private graph data release algorithms that seek to achieve the fine balance between privacy and utility, with a specific focus on provably private mechanisms. Many of these mechanisms are natural extensions of the Differential Privacy framework to graph data, but we also investigate more general privacy formulations like Pufferfish Privacy that address some of the limitations of Differential Privacy. We also provide a wide-ranging survey of the applications of private graph data release mechanisms to social networks, finance, supply chain, and health care. This article should benefit practitioners and researchers alike in the increasingly important area of private analytics and data release.
Hands-on laboratory experiences are essential critical for students to understand concepts and gain real-world insights in database security and auditing. We are developing a set of hands-on labs to integrate theories of database security into practices. Our designed labs do not require purchasing any commercial software or pre-configuration. Each lab includes objectives, results, and resources to help students to understand database security concepts including access control, virtual private database, and database auditing etc. We use two major database products (Microsoft SQL Server and Oracle 10g) to design and implement our labs.
5 December 2022 in IEEE Transactions on Computational Social Systems
A key step in cooperative decision-making is for all participants to achieve a consensus that avoids individual favoritism. To reach a consensus, a quantitative systematic mechanism is sometimes preferred. An example of such a mechanism is ranking aggregation, where the task is to rank elements in a certain order. While participating in ranking activities, it is also critical under certain circumstances to protect each decision maker’s preference. A promising privacy-preserving technique that is suitable for such a need is differential privacy (DP), which ensures plausible deniability of the protected information with rigorous mathematical guarantee and adjustable privacy level. A concern of the standard DP model is its assumption of letting a curator collect and analyze sensitive information, where in practical situations such a trusted independent curator may not exist. This article proposed a mechanism to solve the above issue using the distributed DP (DDP) framework. The proposed mechanism collects locally differential private rankings from individuals, and then randomly permutes pairwise rankings using a shuffle model to further amplify privacy protection. The final representative is produced by hierarchical rank aggregation (HRA). The mechanism was theoretically analyzed and experimentally compared against the existing methods and demonstrated competitive results in both output accuracy and privacy protection.
Music industry is one of the traditional industries that is deeply influenced by the new computing strategy for big data. This paper aims to discuss a new solution for the digital music dissemination in big data era. By analyzing the features of big data, the key points of digital music dissemination and the participants in this industry, we put forward a dissemination model for digital music and explain the running details of this model.