Xueming Tang

Orcid: 0000-0003-0806-5100

According to our database1, Xueming Tang authored at least 19 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Multi-Modal Tensor Ring Decomposition for Communication-Efficient and Trustworthy Federated Learning for ITS in COVID-19 Scenario.
IEEE Trans. Intell. Transp. Syst., May, 2024

Tensor-Based Secure Truthful Incentive Mechanism for Mobile Crowdsourcing in IoT-Enabled Maritime Transportation Systems.
IEEE Trans. Intell. Transp. Syst., May, 2024

Robust and Verifiable Privacy Federated Learning.
IEEE Trans. Artif. Intell., April, 2024

Split Aggregation: Lightweight Privacy-Preserving Federated Learning Resistant to Byzantine Attacks.
IEEE Trans. Inf. Forensics Secur., 2024

MACCN: Multi-Modal Adaptive Co-Attention Fusion Contrastive Learning Networks for Fake News Detection.
Proceedings of the IEEE International Conference on Acoustics, 2024

Enhancing Text-to-SQL Capabilities of Large Language Models via Domain Database Knowledge Injection.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
Quantum-inspired Hash Function Based on Parity-dependent Quantum Walks with Memory.
CoRR, 2023

SMPC Task Decomposition: A Theory for Accelerating Secure Multi-party Computation Task.
CoRR, 2023

A PUF Based Audio Fingerprint Based for Device Authentication and Tamper Location.
Proceedings of the Digital Forensics and Cyber Crime - 14th EAI International Conference, 2023

2021
Joint Traffic Control and Multi-Channel Reassignment for Core Backbone Network in SDN-IoT: A Multi-Agent Deep Reinforcement Learning Approach.
IEEE Trans. Netw. Sci. Eng., 2021

2016
移动群智网中基于人群搜索优化和协作竞争的用户激励机制 (User Incentive Mechanism Based on Crowd Search Optimization and Cooperative Competition for Mobile Crowd Sensing Networks).
计算机科学, 2016

2013
An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree.
Int. J. Distributed Sens. Networks, 2013

2012
A Practical Framework for $t$-Out-of- $n$ Oblivious Transfer With Security Against Covert Adversaries.
IEEE Trans. Inf. Forensics Secur., 2012

2011
An ideal multi-secret sharing scheme based on MSP.
Inf. Sci., 2011

Practical Frameworks For h-Out-Of-n Oblivious Transfer With Security Against Covert and Malicious Adversaries.
IACR Cryptol. ePrint Arch., 2011

A Perfectly Binding Commitment Scheme Against Quantum Attacks.
IACR Cryptol. ePrint Arch., 2011

Hierarchical ID-Based Blind Signature from Lattices.
Proceedings of the Seventh International Conference on Computational Intelligence and Security, 2011

2010
A Framework For Fully-Simulatable h-Out-Of-n Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2010

A more efficient accountable authority IBE scheme under the DL assumption.
Sci. China Inf. Sci., 2010


  Loading...