4.2 Article

A hybrid approach for scalable sub-tree anonymization over big data using Map Reduce on cloud

期刊

JOURNAL OF COMPUTER AND SYSTEM SCIENCES
卷 80, 期 5, 页码 1008-1020

出版社

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcss.2014.02.007

关键词

Big data; Cloud computing; Data anonymization; Privacy preservation; MapReduce

向作者/读者索取更多资源

In big data applications, data privacy is one of the most concerned issues because processing large-scale privacy-sensitive data sets often requires computation resources provisioned by public cloud services. Sub-tree data anonymization is a widely adopted scheme to anonymize data sets for privacy preservation. Top-Down Specialization (TDS) and Bottom-Up Generalization (BUG) are two ways to fulfill sub-tree anonymization. However, existing approaches for sub-tree anonymization fall short of parallelization capability, thereby lacking scalability in handling big data in cloud. Still, either TDS or BUG individually suffers from poor performance for certain valuing of k-anonymity parameter. In this paper, we propose a hybrid approach that combines TDS and BUG together for efficient sub-tree anonymization over big data. Further, we design MapReduce algorithms for the two components (TDS and BUG) to gain high scalability. Experiment evaluation demonstrates that the hybrid approach significantly improves the scalability and efficiency of sub-tree anonymization scheme over existing approaches. (c) 2014 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Software Engineering

Differentially private locality sensitive hashing based federated recommender system

Hongsheng Hu, Gillian Dobbie, Zoran Salcic, Meng Liu, Jianbing Zhang, Lingjuan Lyu, Xuyun Zhang

Summary: Recommender systems are important in big data analytics for their potential to bring high profit. However, privacy concerns and regulations make it difficult to integrate scattered data. Existing privacy-preserving recommender system models based on cryptography lack flexibility. This paper proposes a differentially private LSH approach that guarantees privacy preservation while offering efficient and accurate recommendations.

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2023)

Article Computer Science, Artificial Intelligence

ShieldDB: An Encrypted Document Database With Padding Countermeasures

Viet Vo, Xingliang Yuan, Shi-Feng Sun, Joseph K. K. Liu, Surya Nepal, Cong Wang

Summary: The increasing adoption of cloud storage systems is driven by the need for cost-effective and easy-to-access solutions as businesses and governments move away from in-house data servers. However, the lack of security in cloud storage has led to numerous large-scale data breaches. To address this issue, this paper introduces ShieldDB, an encrypted document database that incorporates searchable encryption technique while maintaining scalability. A tailored padding countermeasure is implemented to protect against real-world threats and ensure continuous obfuscation of the access pattern to the database. The authors present a comprehensive implementation of ShieldDB and conduct extensive evaluations on Azure Cloud.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Computer Science, Information Systems

A Numerical Splitting and Adaptive Privacy Budget-Allocation-Based LDP Mechanism for Privacy Preservation in Blockchain-Powered IoT

Kai Zhang, Jiao Tian, Hongwang Xiao, Ying Zhao, Wenyu Zhao, Jinjun Chen

Summary: Blockchain has attracted attention from the IoT research community due to its decentralization and consistency. However, the accessibility of all nodes to the chain data raises privacy concerns. To address this issue, we propose a novel LDP mechanism that splits and perturbs input numerical data using digital bits, without requiring a fixed input range and large data volume. Our adaptive privacy budget allocation model significantly reduces the deviation of the perturbation function and provides high data utility while maintaining privacy.

IEEE INTERNET OF THINGS JOURNAL (2023)

Article Computer Science, Information Systems

SAM: Multi-turn Response Selection Based on Semantic Awareness Matching

Rongjunchen Zhang, Tingmin Wu, Sheng Wen, Surya Nepal, Cecile Paris, Yang Xiang

Summary: This article presents a novel chatbot model called SAM, which is based on Semantic Awareness Matching. SAM utilizes a two-layer matching network to capture similarity and semantic features in the context, and selects appropriate responses based on the matching probability of the two feature types.

ACM TRANSACTIONS ON INTERNET TECHNOLOGY (2023)

Article Computer Science, Information Systems

Auditory Receptive Field Net Based Automatic Snore Detection for Wearable Devices

Xiyuan Hu, Jingpeng Sun, Jinping Dong, Xuyun Zhang

Summary: We proposed a deep learning-based accurate snore detection model for long-term home monitoring of snoring during sleep. The model outperformed other traditional approaches and deep learning models in terms of snore detection. It predicted candidate boxes and confidence scores based on the feature maps derived by the feature extraction network.

IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS (2023)

Article Engineering, Electrical & Electronic

Digital-Twin-Enabled 6G Mobile Network Video Streaming Using Mobile Crowdsourcing

Lianyong Qi, Xiaolong Xu, Xiaotong Wu, Qiang Ni, Yuan Yuan, Xuyun Zhang

Summary: This paper investigates the opportunities and challenges of mobile video streaming services in the sixth generation (6G) network using digital twin technology and cloud-centric architecture. The authors propose a solution using crowdsourcing to attract mobile users to follow a specified path and share network resources, alleviating the problem of increasing traffic demands. They present algorithms for user recruitment optimization and evaluate the system performance through extensive experiments.

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2023)

Article Computer Science, Hardware & Architecture

Preserving Privacy for Distributed Genome-Wide Analysis Against Identity Tracing Attacks

Yanjun Zhang, Guangdong Bai, Xue Li, Surya Nepal, Marthie Grobler, Chen Chen, Ryan K. L. Ko

Summary: Genome-wide analysis has health and social benefits, but sharing such data may risk revealing sensitive information. Identity tracing attack exploits correlations among genomic data to reveal the identity of DNA samples. This paper proposes a framework called "F-RAG" to enable privacy-preserving data sharing and computation in genome-wide analysis, mitigating privacy risks without compromising utility.

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING (2023)

Article Computer Science, Hardware & Architecture

Optimizing Secure Decision Tree Inference Outsourcing

Yifeng Zheng, Cong Wang, Ruochen Wang, Huayi Duan, Surya Nepal

Summary: In this paper, a new system is designed, implemented and evaluated to enable efficient outsourcing of decision tree inference to the cloud, improving the online end-to-end secure inference latency at the cloud and the local-side performance of the model provider. The paper presents a scheme that securely shifts most of the processing of the model provider to the cloud, reducing the model provider's performance complexities. Additionally, a scheme is devised to optimize the performance of secure decision tree inference at the cloud, specifically the communication round complexities. The new system achieves up to 8x better online end-to-end secure inference latency at the cloud side and brings the model provider up to 19x savings in communication and 18x savings in computation.

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING (2023)

Editorial Material Environmental Sciences

Deep Learning for Remote Sensing-Based Earth and Environment Resources Management

Carlos Enrique Montenegro Marin, Xuyun Zhang, Nallappan Gunasekaran

JOURNAL OF THE INDIAN SOCIETY OF REMOTE SENSING (2023)

Article Computer Science, Artificial Intelligence

Generating Semantic Adversarial Examples via Feature Manipulation in Latent Space

Shuo Wang, Shangyu Chen, Tianle Chen, Surya Nepal, Carsten Rudolph, Marthie Grobler

Summary: This study proposes an adversarial attack strategy that implements fine-granularity, semantic-meaning-oriented structural perturbations on images. The method manipulates the semantic attributes of images through the use of disentangled latent codes to construct adversarial perturbations. The empirical evaluations demonstrate the strong attack capability of this method against black-box classifiers and establish the existence of a universal semantic adversarial example.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Cybernetics

A Knowledge Graph-Based Many-Objective Model for Explainable Social Recommendation

Xingjuan Cai, Wanwan Guo, Mengkai Zhao, Zhihua Cui, Jinjun Chen

Summary: This article proposes a knowledge graph-based many-objective model for explainable social recommendation (KGMESR), which considers the explainability, accuracy, novelty, and content quality of social recommendation results. The model utilizes social behavior information to calculate user similarity and quantifies the explainability of results using entity vectors and embedding vectors. A many-objective recommendation algorithm based on the partition deletion strategy is designed for efficiency. Experimental results demonstrate preferable recommendation results and two case studies affirm the explainability of the proposed model.

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS (2023)

Article Computer Science, Hardware & Architecture

NACA: A Joint Distortion-Based Non-Additive Cost Assignment Method for Video Steganography

Yi Chen, Zoran Salcic, Hongxia Wang, Kim-Kwang Raymond Choo, Xuyun Zhang

Summary: This article proposes a joint distortion-based non-additive cost assignment method to reduce distortion drift and improve security in video steganography. Extensive experiments show that the proposed method achieves enhanced security and visual stego video quality.

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING (2023)

Article Computer Science, Artificial Intelligence

A Correlation Graph Based Approach for Personalized and Compatible Web APIs Recommendation in Mobile APP Development

Lianyong Qi, Wenmin Lin, Xuyun Zhang, Wanchun Dou, Xiaolong Xu, Jinjun Chen

Summary: Using Web APIs registered in service sharing communities for mobile APP development can reduce development period and cost. However, the large number and differences of available APIs make it difficult for selection. To address this challenge, a correlation graph-based approach is proposed for personalized and compatible Web APIs recommendation in mobile APP development. Extensive experiments on a real dataset prove the feasibility of the proposed recommendation approach.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Computer Science, Hardware & Architecture

Authenticated Data Sharing With Privacy Protection and Batch Verification for Healthcare IoT

Fei Zhu, Xun Yi, Alsharif Abuadbba, Ibrahim Khalil, Surya Nepal, Xinyi Huang

Summary: The healthcare IoT is a valuable tool in the healthcare industry. However, sharing data raises security and privacy concerns. Redactable signature schemes (RSSs) offer a solution by allowing the deletion of privacy-sensitive data without invalidating the signature. However, existing RSSs have issues with key management and computation overheads. To address these challenges, this work proposes certificateless RSS and provides an efficient scheme with enhanced security and batch verification.

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING (2023)

Article Computer Science, Information Systems

Fast and private multi-dimensional range search over encrypted data

Shabnam Kasra Kermanshahi, Ron Steinfeld, Xun Yi, Joseph K. Liu, Surya Nepal, Junwei Lou

Summary: This paper introduces MDRSSE, a novel symmetric searchable encryption scheme specifically tailored for multi-dimensional range search. It efficiently supports multi-dimensional range search without incurring undetermined additional communication or computation costs, and achieves semantic security.

INFORMATION SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Solving problems on generalized convex graphs via mim-width

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniel Paulusma

Summary: This article discusses the convexity and mim-width of bipartite graphs, and it proves that for certain families of graphs 7-t, the 7-t-convex graphs can be solved in polynomial time for NP-complete problems. It also explores the bounded and unbounded mim-width of 7-t-convex graphs for different sets 7-t.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Performance modeling and analysis for randomly walking mobile users with Markov chains

Keqin Li

Summary: In this paper, we propose a computation offloading strategy to satisfy all UEs served by an MEC and develop an efficient method to find such a strategy. By using Markov chains to characterize UE mobility and calculating the joint probability distribution of UE locations, we can obtain the average response time of UEs and predict the overall average response time of tasks. Additionally, we solve the power constrained MEC speed setting problem.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Correction Computer Science, Hardware & Architecture

Prediction, learning, uniform convergence, and scale-sensitive dimensions (vol 56, pg 174, 1998)

Peter L. Bartlett, Philip M. Long

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Fast and succinct population protocols for Presburger arithmetic

Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza

Summary: This paper presents a construction method that produces population protocols with a small number of states, while achieving near-optimal expected number of interactions, for deciding Presburger predicates.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Orienting undirected phylogenetic networks

Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple

Summary: This paper investigates the relationship between undirected and directed phylogenetic networks, and provides corresponding algorithms. The study reveals that the directed phylogenetic network is unique under specific conditions. Additionally, an algorithm for directing undirected binary networks is described, applicable to certain classes of directed phylogenetic networks.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs

Francesco Betti Sorbelli, Alfredo Navarra, Lorenzo Palazzetti, Cristina M. Pinotti, Giuseppe Prencipe

Summary: This study discusses the deployment of IoT sensors in an area that needs to be monitored. Drones are used to collect data from the sensors, but they have energy and storage constraints. To maximize the overall reward from the collected data and ensure compliance with energy and storage limits, an optimization problem called Multiple-drone Data-collection Maximization Problem (MDMP) is proposed and solved using an Integer Linear Programming algorithm.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

On the complexity of the storyplan problem

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nollenburg, Antonios Symvonis

Summary: In this study, we investigate the problem of representing a graph as a storyplan, which is a model for dynamic graph visualization. We prove the NP-completeness of this problem and propose two parameterized algorithms as solutions. We also demonstrate that partial 3-trees always admit a storyplan and can be computed in linear time. Additionally, we show that even if the vertex appearance order is given, the problem of choosing how to draw the frames remains NP-complete.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Perpetual maintenance of machines with different urgency requirements

Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik

Summary: This passage describes the Bamboo Garden Trimming Problem and presents approximation algorithms for both Discrete BGT and Continuous BGT.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)