Luo Xiangyang

Prof. Luo Xiangyang


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 January 2018 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YMYuanyuan Ma
Yuanyuan Ma
LXLuo Xiangyang
Luo Xiangyang
XLXiaolong Li
Xiaolong Li
ZBZhenkun Bao
Zhenkun Bao
YZYi Zhang
Yi Zhang
Steganography detection based on Rich Model features is a hot research direction in steganalysis. However, Rich Model features usually result a large computation cost. To reduce the dimension of steganalysis features and improve the efficiency of steganalysis algorithm, differing from previous works normally proposed new feature extraction algorithm, this paper proposes a general steganalysis feature selection method based on decision rough set α-positive region reduction. First, it is pointed out that decision rough set α-positive region reduction is suitable for steganalysis feature selection. Second, a quantization method of attribute separability is proposed to measure the separability of steganalysis feature components. Third, steganalysis feature components selection algorithm based on decision rough set α-positive region reduction is given, thus stego images can be detected by the selected feature. The proposed method can significantly reduce the feature dimensions and maintain detection accuracy. Based on the BOSSbase-1.01 image database of 10000 images, a series of feature selection experiments are carried on two kinds of typical Rich Model features (35263-D J+SRM feature and 17000-D GFR feature). The results show that even though these two kinds of features are reduced to approximately 8000-D, the detection performance of steganalysis algorithms based on the selected features are also maintained with that of original features, which will remarkably improve the efficiency of feature extraction and stego image detection.

14 April 2020 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
LZLingchen Zhao
Lingchen Zhao
SHShengshan Hu
Shengshan Hu
QWQian Wang
Qian Wang
JJJianlin Jiang
Jianlin Jiang
SCShen Chao
Shen Chao
PHPengfei Hu
Pengfei Hu
Collaborative learning allows multiple clients to train a joint model without sharing their data with each other. Each client performs training locally and then submits the model updates to a central server for aggregation. Since the server has no visibility into the process of generating the updates, collaborative learning is vulnerable to poisoning attacks where a malicious client can generate a poisoned update to introduce backdoor functionality to the joint model. The existing solutions for detecting poisoned updates, however, fail to defend against the recently proposed attacks, especially in the non-IID setting. In this paper, we present a novel defense scheme to detect anomalous updates in both IID and non-IID settings. Our key idea is to realize client-side cross-validation, where each update is evaluated over other clients' local data. The server will adjust the weights of the updates based on the evaluation results when performing aggregation. During the detection process, we also protect the client-level privacy to prevent malicious clients from stealing the training data of other clients, by integrating differential privacy with our design without degrading the detection performance. Our experimental evaluations on two real-world datasets show that our scheme is significantly robust to two representative poisoning attacks.

26 November 2018 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
SWShuangke Wu
Shuangke Wu
YCYanjiao Chen
Yanjiao Chen
QWQian Wang
Qian Wang
MLMinghui Li
Minghui Li
CWCong Wang
Cong Wang
LXLuo Xiangyang
Luo Xiangyang
Auction is an effective way to allocate goods or services to bidders who value them the most. The rapid growth of e-auctions facilitates online transactions but poses new and distinctive challenges. It is difficult to establish trusts among sellers, buyers and auctioneers without the centralized auction websites or platforms (the auctioneer) that collect bids and derive the auction results. However, these third parties may be untrustworthy, and malicious sellers or buyers may refuse to deliver the goods or payment according to the protocol. Moreover, the open and anonymous online environment may stimulate auction participants to form collusion coalitions to rig the auction and reap unfair profit. Many auction designs have been proposed to address these concerns, but they fall short of simultaneously achieving decentralization (i.e., held without a trusted third utility), strong consensus (i.e., the establishment of trust), collusion-resistance and practical implementation. We present CReam, the first decentralized collusion-resistant e-auction system that is implemented with smart contract on the blockchain. With the carefully-designed smart auction contract, mutually distrustful and rational sellers and buyers are stimulated to operate properly hence transact safely without trusted third parties. The auction mechanism in the smart contract can effectively prevent bidder collusion and realize economic robustness, i.e., truthfulness. We implement a fully functional CReam on the Ethereum network. Extensive experimental results confirm that CReam can greatly reduce the probability of collusion and achieve an approximate optimal revenue at a low cost of contract execution.

25 January 2018 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
Zhenxing QianZhenxing Qian
Zhenxing Qian
HXHaisheng Xu
Haisheng Xu
LXLuo Xiangyang
Luo Xiangyang
XZXinpeng Zhang
Xinpeng Zhang
This paper proposes a novel framework of reversible data hiding in encrypted JPEG bitstream. We first provide a JPEG encryption algorithm to encipher a JPEG image to a smaller size and keep the format compliant to JPEG decoders. After an image owner uploads the encrypted JPEG bitstreams to cloud storage, the server embeds additional messages into the ciphertext to construct a marked encrypted JPEG bitstream. During data hiding, we propose a combined embedding algorithm including two stages, the Huffman code mapping and the ordered histogram shifting. The embedding procedure is reversible. When an authorized user requires a downloading operation, the server extracts additional messages from the marked encrypted JPEG bitstream and recovers the original encrypted bit-stream losslessly. After downloading, the user obtains the original JPEG bitstream by a direct decryption. The proposed framework out-performs previous works on RDH-EI. First, since the tasks of data embedding/extraction and bitstream recovery are all accomplished by the server, the image owner and the authorized user are required to implement no extra operations except JPEG encryption or decryption. Second, the embedding payload is larger than state-of-the-art works.

20 June 2019 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YZYi Zhang
Yi Zhang
LXLuo Xiangyang
Luo Xiangyang
YGYanqing Guo
Yanqing Guo
Chuan QinChuan Qin
Chuan Qin
FLFenlin Liu
Fenlin Liu
Considering that traditional image steganography technologies suffer from the potential risk of failure under lossy channels, an enhanced adaptive steganography with multiple robustness against image processing attacks is proposed, while maintaining good detection resistance. First, a robust domain constructing method is proposed utilizing robust element extraction and optimal element modification, which can be applied to both spatial and JPEG images. Then, a robust steganography is proposed based on “Robust Domain Constructing + RS-STC Codes„, combined with cover selection, robust cover extraction, message coding and embedding with minimized costs. In addition, to provide a theoretical basis for message extraction integrity, the fault tolerance of the proposed algorithm is deduced using error model based on burst errors and decoding damage. Finally, on the basis of parameter discussion about robust domain construction, performance experiments are conducted, and the recommended coding parameters are given for lossy channels with different attacks using the analytic results for fault tolerance. A series of experimental results demonstrate that the proposed algorithm can extract embedded messages with significantly higher accuracy after different attacks, such as compression, noising, scaling and other attacks, compared with state-of-theart adaptive steganography and robust watermarking algorithms, while maintaining good detection resistant performance.

20 August 2019 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
SXShengmin Xu
Shengmin Xu
YLYingjiu Li
Yingjiu Li
RDRobert H. Deng
Robert H. Deng
Yinghui ZhangYinghui Zhang
Yinghui Zhang
LXLuo Xiangyang
Luo Xiangyang
Ximeng LiuXimeng Liu
Ximeng Liu
Healthcare Internet-of-Things (IoT) is an emerging paradigm that enables embedded devices to monitor patients' vital signals and allows these data to be aggregated and outsourced to the cloud. The cloud enables authorized users to store and share data to enjoy on-demand services. Nevertheless, it also causes many security concerns because of the untrusted network environment, dishonest cloud service providers and resource-limited devices. To preserve patients' privacy, existing solutions usually apply cryptographic tools to offer access controls. However, fine-grained access control among authorized users is still a challenge, especially for lightweight and resource-limited end-devices. In this paper, we propose a novel healthcare IoT system fusing advantages of attribute-based encryption, cloud and edge computing, which provides an efficient, flexible, secure fine-grained access control mechanism with data verification in healthcare IoT network without any secure channel and enables data users to enjoy the lightweight decryption. We also define the formal security models and present security proofs for our proposed scheme. The extensive comparison and experimental simulation demonstrate that our scheme has better performance than existing solutions.