4.7 Article

Machine learning based privacy-preserving fair data trading in big data market

期刊

INFORMATION SCIENCES
卷 478, 期 -, 页码 449-460

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.11.028

关键词

Data trading; Privacy-preserving; Machine learning; Fairness

资金

  1. National Key R&D Program of China [2017YFB0802000]
  2. National Natural Science Foundation of China [61872229]
  3. NSFC Research Fund for International Young Scientists [61750110528]
  4. National Cryptography Development Fund during the 13th Five-year Plan Period [MMJJ20170216]
  5. Fundamental Research Funds for the Central Universities [GK201702004, 2018CBLY006]

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

In the era of big data, the produced and collected data explode due to the emerging technologies and applications that pervade everywhere in our daily lives, including internet of things applications such as smart home, smart city, smart grid, e-commerce applications and social network. Big data market can carry out efficient data trading, which provides a way to share data and further enhances the utility of data. However, to realize effective data trading in big data market, several challenges need to be resolved. The first one is to verify the data availability for a data consumer. The second is privacy of a data provider who is unwilling to reveal his real identity to the data consumer. The third is the payment fairness between a data provider and a data consumer with atomic exchange. In this paper, we address these challenges by proposing a new blockchain-based fair data trading protocol in big data market. The proposed protocol integrates ring signature, double authentication-preventing signature and similarity learning to guarantee the availability of trading data, privacy of data providers and fairness between data providers and data consumers. We show the proposed protocol achieves the desirable security properties that a secure data trading protocol should have. The implementation results with Solidity smart contract demonstrate the validity of the proposed blockchain-based fair data trading protocol. (C) 2018 Elsevier Inc. All rights reserved.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

Article Computer Science, Information Systems

Attribute-Based Cloud Data Integrity Auditing for Secure Outsourced Storage

Yong Yu, Yannan Li, Bo Yang, Willy Susilo, Guomin Yang, Jian Bai

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING (2020)

Article Automation & Control Systems

Blockchain-Based Anonymous Authentication With Selective Revocation for Smart Industrial Applications

Yong Yu, Yanqi Zhao, Yannan Li, Xiaojiang Du, Lianhai Wang, Mohsen Guizani

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS (2020)

Article Computer Science, Information Systems

Blockchain-Based Dynamic Provable Data Possession for Smart Cities

Ruonan Chen, Yannan Li, Yong Yu, Huilin Li, Xiaofeng Chen, Willy Susilo

IEEE INTERNET OF THINGS JOURNAL (2020)

Article Engineering, Electrical & Electronic

IntegrityChain: Provable Data Possession for Decentralized Storage

Yannan Li, Yong Yu, Ruonan Chen, Xiaojiang Du, Mohsen Guizani

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2020)

Article Engineering, Electrical & Electronic

Key-Policy Attribute-Based Encryption With Keyword Search in Virtualized Environments

Yong Yu, Junbin Shi, Huilin Li, Yannan Li, Xiaojiang Du, Mohsen Guizani

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2020)

Article Computer Science, Hardware & Architecture

Traceable Monero: Anonymous Cryptocurrency with Enhanced Accountability

Yannan Li, Guomin Yang, Willy Susilo, Yong Yu, Man Ho Au, Dongxi Liu

Summary: Monero offers high anonymity for users and transactions, but lacks user accountability, which is crucial to combat criminal activities in cryptocurrency transactions. This paper introduces Traceable Monero, a new cryptocurrency that aims to strike a balance between user anonymity and accountability. By overlaying Monero with tracing mechanisms, Traceable Monero ensures security without significantly impacting transaction efficiency.

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING (2021)

Article Computer Science, Hardware & Architecture

SECURITY AND PRIVACY FOR EDGE INTELLIGENCE IN 5G AND BEYOND NETWORKS: CHALLENGES AND SOLUTIONS

Yannan Li, Yong Yu, Willy Susilo, Zhiyong Hong, Mohsen Guizani

Summary: 5G and beyond (B5G) networks are leading a digital revolution in both academia and industry, but still face challenges in terms of security and privacy. Blockchain, as a public database, with its advantages of decentralization, transparency, etc., is promising in solving security issues. This article investigates security and privacy issues in edge intelligence in B5G networks and proposes a framework integrating blockchain to provide guaranteed security and privacy.

IEEE WIRELESS COMMUNICATIONS (2021)

Article Computer Science, Hardware & Architecture

Toward Transparent and Accountable Privacy-Preserving Data Classification

Yanqi Zhao, Yong Yu, Ruonan Chen, Yannan Li, Aikui Tian

Summary: Machine learning is an effective approach for big data analysis, and classification is widely used in data processing. Balancing data utility and data privacy is a challenging issue in privacy-preserving data classification. The proposed transparent and accountable framework utilizes cryptography techniques and blockchain to balance data privacy and data utility.

IEEE NETWORK (2021)

Article Computer Science, Hardware & Architecture

A Blockchain-Based Self-Tallying Voting Protocol in Decentralized IoT

Yannan Li, Willy Susilo, Guomin Yang, Yong Yu, Dongxi Liu, Xiaojiang Du, Mohsen Guizani

Summary: The article introduces a framework of a self-tallying voting system in decentralized IoT based on blockchain, addressing the fairness issues inherent in self-tallying voting systems and proving the security of the system. The implementation results demonstrate the practicability of the system.

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING (2022)

Review Imaging Science & Photographic Technology

Visualization and Cybersecurity in the Metaverse: A Survey

Yang-Wai Chow, Willy Susilo, Yannan Li, Nan Li, Chau Nguyen

Summary: The popularity of the Metaverse has grown rapidly in recent years. However, before it can be adopted for serious applications, there are cybersecurity issues related to visualization technologies that need to be addressed. This survey investigates the cybersecurity threats faced by the Metaverse and discusses countermeasures against them. Its intention is to provide researchers in related areas with a background understanding of the field.

JOURNAL OF IMAGING (2023)

Article Telecommunications

Blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection

Yiting Huang, Yong Yu, Huilin Li, Yannan Li, Aikui Tian

Summary: The development and maturity of cloud computing technology have led to an increasing number of companies and individuals choosing to store their data in the cloud. However, issues such as cloud server downtime and data loss pose serious problems for applications that need to run continuously. Ensuring data privacy while ensuring data integrity is a pressing issue. Existing data integrity auditing schemes have security problems. To address these issues, a blockchain-based continuous data integrity checking protocol is proposed.

DIGITAL COMMUNICATIONS AND NETWORKS (2022)

Proceedings Paper Computer Science, Information Systems

Public Cloud Data Auditing Revisited: Removing the Tradeoff Between Proof Size and Storage Cost

Willy Susilo, Yannan Li, Fuchun Guo, Jianchang Lai, Ge Wu

Summary: Public cloud data auditing allows third parties to verify data integrity on untrusted servers without retrieving the data. Different schemes based on RSA and bilinear pairing have been proposed with trade-offs between proof size and storage cost. However, the balance between proof size and storage cost in cloud data auditing remains an open problem.

COMPUTER SECURITY - ESORICS 2022, PT II (2022)

Proceedings Paper Computer Science, Information Systems

Concise Mercurial Subvector Commitments: Definitions and Constructions

Yannan Li, Willy Susilo, Guomin Yang, Tran Viet Xuan Phuong, Yong Yu, Dongxi Liu

Summary: Research on vector commitment and its variants has led to the proposal of a new primitive called mercurial subvector commitments, which exhibits efficient updateability, mercurial hiding, position binding, and aggregatability. The study formalizes system and security models for the primitive, presenting a concrete construction with security proofs demonstrating satisfaction of desired properties. Applications of mercurial subvector commitments, such as zero-knowledge sets and blockchain with account-based models, are also illustrated.

INFORMATION SECURITY AND PRIVACY, ACISP 2021 (2021)

Article Engineering, Multidisciplinary

A Blockchain-Based Traceable Self-Tallying E-Voting Protocol in AI Era

Huilin Li, Yannan Li, Yong Yu, Baocang Wang, Kefei Chen

Summary: Artificial intelligence (AI) has shown great potential in various real-world applications, but faces challenges in trust-oriented applications such as e-voting. This paper aims to strengthen AI ecosystems by developing a blockchain-based traceable self-tallying e-voting system, which supports additional functions like multi-choice and self-tallying, and satisfies anonymity, time-bounded privacy, linkability, and full-traceability. The proposed e-voting protocol is practical and can be adopted in real-world applications, as evaluated by the time and gas costs of operations.

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING (2021)

Article Computer Science, Hardware & Architecture

Decentralized Public Key Infrastructures atop Blockchain

Yannan Li, Yong Yu, Chunwei Lou, Nadra Guizani, Lianhai Wang

IEEE NETWORK (2020)

Article Computer Science, Information Systems

A consensus model considers managing manipulative and overconfident behaviours in large-scale group decision-making

Xia Liang, Jie Guo, Peide Liu

Summary: This paper investigates a novel consensus model based on social networks to manage manipulative and overconfident behaviors in large-scale group decision-making. By proposing a novel clustering model and improved methods, the consensus reaching is effectively facilitated. The feedback mechanism and management approach are employed to handle decision makers' behaviors. Simulation experiments and comparative analysis demonstrate the effectiveness of the model.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

CGN: Class gradient network for the construction of adversarial samples

Xiang Li, Haiwang Guo, Xinyang Deng, Wen Jiang

Summary: This paper proposes a method based on class gradient networks for generating high-quality adversarial samples. By introducing a high-level class gradient matrix and combining classification loss and perturbation loss, the method demonstrates superiority in the transferability of adversarial samples on targeted attacks.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Distinguishing latent interaction types from implicit feedbacks for recommendation

Lingyun Lu, Bang Wang, Zizhuo Zhang, Shenghao Liu

Summary: Many recommendation algorithms only rely on implicit feedbacks due to privacy concerns. However, the encoding of interaction types is often ignored. This paper proposes a relation-aware neural model that classifies implicit feedbacks by encoding edges, thereby enhancing recommendation performance.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Proximity-based density description with regularized reconstruction algorithm for anomaly detection

Jaehong Yu, Hyungrok Do

Summary: This study discusses unsupervised anomaly detection using one-class classification, which determines whether a new instance belongs to the target class by constructing a decision boundary. The proposed method uses a proximity-based density description and a regularized reconstruction algorithm to overcome the limitations of existing one-class classification methods. Experimental results demonstrate the superior performance of the proposed algorithm.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Non-iterative border-peeling clustering algorithm based on swap strategy

Hui Tu, Shifei Ding, Xiao Xu, Haiwei Hou, Chao Li, Ling Ding

Summary: Border-Peeling algorithm is a density-based clustering algorithm, but its complexity and issues on unbalanced datasets restrict its application. This paper proposes a non-iterative border-peeling clustering algorithm, which improves the clustering performance by distinguishing and associating core points and border points.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A two-stage denoising framework for zero-shot learning with noisy labels

Long Tang, Pan Zhao, Zhigeng Pan, Xingxing Duan, Panos M. Pardalos

Summary: In this work, a two-stage denoising framework (TSDF) is proposed for zero-shot learning (ZSL) to address the issue of noisy labels. The framework includes a tailored loss function to remove suspected noisy-label instances and a ramp-style loss function to reduce the negative impact of remaining noisy labels. In addition, a dynamic screening strategy (DSS) is developed to efficiently handle the nonconvexity of the ramp-style loss.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Selection of a viable blockchain service provider for data management within the internet of medical things: An MCDM approach to Indian healthcare

Raghunathan Krishankumar, Sundararajan Dhruva, Kattur S. Ravichandran, Samarjit Kar

Summary: Health 4.0 is gaining global attention for better healthcare through digital technologies. This study proposes a new decision-making framework for selecting viable blockchain service providers in the Internet of Medical Things (IoMT). The framework addresses the limitations in previous studies and demonstrates its applicability in the Indian healthcare sector. The results show the top ranking BSPs, the importance of various criteria, and the effectiveness of the developed model.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Q-learning with heterogeneous update strategy

Tao Tan, Hong Xie, Liang Feng

Summary: This paper proposes a heterogeneous update idea and designs HetUp Q-learning algorithm to enlarge the normalized gap by overestimating the Q-value corresponding to the optimal action and underestimating the Q-value corresponding to the other actions. To address the limitation, a softmax strategy is applied to estimate the optimal action, resulting in HetUpSoft Q-learning and HetUpSoft DQN. Extensive experimental results show significant improvements over SOTA baselines.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Dyformer: A dynamic transformer-based architecture for multivariate time series classification

Chao Yang, Xianzhi Wang, Lina Yao, Guodong Long, Guandong Xu

Summary: This paper proposes a dynamic transformer-based architecture called Dyformer for multivariate time series classification. Dyformer captures multi-scale features through hierarchical pooling and adaptive learning strategies, and improves model performance by introducing feature-map-wise attention mechanisms and a joint loss function.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

ESSENT: an arithmetic optimization algorithm with enhanced scatter search strategy for automated test case generation

Xiguang Li, Baolu Feng, Yunhe Sun, Ammar Hawbani, Saeed Hammod Alsamhi, Liang Zhao

Summary: This paper proposes an enhanced scatter search strategy, using opposition-based learning, to solve the problem of automated test case generation based on path coverage (ATCG-PC). The proposed ESSENT algorithm selects the path with the lowest path entropy among the uncovered paths as the target path and generates new test cases to cover the target path by modifying the dimensions of existing test cases. Experimental results show that the ESSENT algorithm outperforms other state-of-the-art algorithms, achieving maximum path coverage with fewer test cases.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

An attention based approach for automated account linkage in federated identity management

Shirin Dabbaghi Varnosfaderani, Piotr Kasprzak, Aytaj Badirova, Ralph Krimmel, Christof Pohl, Ramin Yahyapour

Summary: Linking digital accounts belonging to the same user is crucial for security, user satisfaction, and next-generation service development. However, research on account linkage is mainly focused on social networks, and there is a lack of studies in other domains. To address this, we propose SmartSSO, a framework that automates the account linkage process by analyzing user routines and behavior during login processes. Our experiments on a large dataset show that SmartSSO achieves over 98% accuracy in hit-precision.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A memetic algorithm with fuzzy-based population control for the joint order batching and picker routing problem

Renchao Wu, Jianjun He, Xin Li, Zuguo Chen

Summary: This paper proposes a memetic algorithm with fuzzy-based population control (MA-FPC) to solve the joint order batching and picker routing problem (JOBPRP). The algorithm incorporates batch exchange crossover and a two-level local improvement procedure. Experimental results show that MA-FPC outperforms existing algorithms in terms of solution quality.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Refining one-class representation: A unified transformer for unsupervised time-series anomaly detection

Guoxiang Zhong, Fagui Liu, Jun Jiang, Bin Wang, C. L. Philip Chen

Summary: In this study, we propose the AMFormer framework to address the problem of mixed normal and anomaly samples in deep unsupervised time-series anomaly detection. By refining the one-class representation and introducing the masked operation mechanism and cost sensitive learning theory, our approach significantly improves anomaly detection performance.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A data-driven optimisation method for a class of problems with redundant variables and indefinite objective functions

Jin Zhou, Kang Zhou, Gexiang Zhang, Ferrante Neri, Wangyang Shen, Weiping Jin

Summary: In this paper, the authors focus on the issue of multi-objective optimisation problems with redundant variables and indefinite objective functions (MOPRVIF) in practical problem-solving. They propose a dual data-driven method for solving this problem, which consists of eliminating redundant variables, constructing objective functions, selecting evolution operators, and using a multi-objective evolutionary algorithm. The experiments conducted on two different problem domains demonstrate the effectiveness, practicality, and scalability of the proposed method.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A Monte Carlo fuzzy logistic regression framework against imbalance and separation

Georgios Charizanos, Haydar Demirhan, Duygu Icen

Summary: This article proposes a new fuzzy logistic regression framework that addresses the problems of separation and imbalance while maintaining the interpretability of classical logistic regression. By fuzzifying binary variables and classifying subjects based on a fuzzy threshold, the framework demonstrates superior performance on imbalanced datasets.

INFORMATION SCIENCES (2024)